The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
HYRISE: a main memory hybrid storage engine
Abstract
In this paper, we describe a main memory hybrid database system called HYRISE, which automatically partitions tables into vertical partitions of varying widths depending on how the columns of the table are accessed. For columns accessed as a part of analytical queries (e.g., via sequential scans), narrow partitions perform better, because, when scanning a single column, cache locality is improved if the values of that column are stored contiguously. In contrast, for columns accessed as a part of OLTP-style queries, wider partitions perform better, because such transactions frequently insert, delete, update, or access many of the fields of a row, and co-locating those fields leads to better cache locality. Using a highly accurate model of cache misses, HYRISE is able to predict the performance of different partitionings, and to automatically select the best partitioning using an automated database design algorithm. We show that, on a realistic workload derived from customer applications, HYRISE can achieve a 20% to 400% performance improvement over pure all-column or all-row designs, and that it is both more scalable and produces better designs than previous vertical partitioning approaches for main memory systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Multilevelk-way Partitioning Scheme for Irregular Graphs
Karypis, G., & Kumar, V. (1998) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1997.1404 · Cited by 1,675
The end of an architectural era: (it's time for a complete rewrite)
Stonebraker, M. R., Madden, S. R., Abadi, D. J., Harizopoulos, S., Hachem, N. I., & Helland, P. (2007) · Cited by 558
Self-citationMonetDB/X100: Hyper-Pipelining Query Execution
Boncz, P. A., Żukowski, M., & Nes, N. J. (2005) · Data Archiving and Networked Services (DANS) · Cited by 484
Vertical partitioning algorithms for database design
Navathe, S., Ceri, S., Wiederhold, G., & Dou, J. (1984) · ACM Transactions on Database Systems · doi:10.1145/1994.2209 · Cited by 420
Integrating vertical and horizontal partitioning into automated physical database design
Agrawal, S., Narasayya, V., & Yang, B. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007609 · Cited by 411
Making B+- trees cache conscious in main memory
Rao, J., & Ross, K. A. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335449 · Cited by 373
A common database approach for OLTP and OLAP using an in-memory column database
Plattner, H. (2009) · Proceedings of the 2009 ACM SIGMOD International Conference on Management of data · doi:10.1145/1559845.1559846 · Cited by 342
Self-citationDatabase Architecture Optimized for the New Bottleneck: Memory Access
Boncz, P. A., Manegold, S., & Kersten, M. L. (1999) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 339
A Hybrid Row-Column OLTP Database Architecture for Operational Reporting
Schäffner, J., Bog, A., Krüger, J., et al. (2009) · Lecture notes in business information processing · doi:10.1007/978-3-642-03422-0_5 · Cited by 41
Self-citation
Cited by
(2015) · KTH Publication Database DiVA (KTH Royal Institute of Technology) · Cited by 1,144
In-Memory Big Data Management and Processing: A Survey
Zhang, H., Chen, G., Ooi, B. C., Tan, K.-L., & Zhang, M. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2427795 · Cited by 414
Size Bounds for Factorised Representations of Query Results
Olteanu, D., & Závodný, J. (2015) · ACM Transactions on Database Systems · doi:10.1145/2656335 · Cited by 116
Parallel online spatial and temporal aggregations on multi-core CPUs and many-core GPUs
Zhang, J., You, S., & Gruenwald, L. (2014) · Information Systems · doi:10.1016/j.is.2014.01.005 · Cited by 27
Metadata
- Authors
- Grund, M., Krüger, J., Plattner, H., Zeier, A., Cudre-Mauroux, P., & Madden, S.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2010-11
- Volume
- 4
- Issue
- 2
- Pages
- 105-116
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2039910065
- Cited by
- 256
- References
- 9
- FWCI
- 26.25
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: HYRISE: a main memory hybrid storage engine. https://app.cochat.ai/papers/10.14778/1921071.1921077
- The paper
- Grund, M., Krüger, J., Plattner, H., Zeier, A., Cudre-Mauroux, P., & Madden, S. (2010). HYRISE: a main memory hybrid storage engine. Proceedings of the VLDB Endowment. https://doi.org/10.14778/1921071.1921077
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.