The performance of a multiversion access method
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Database Management Systems
Cost models for overlapping and multiversion structures
ACM Transactions on Database Systems (TODS)
DBMSs on a Modern Processor: Where Does Time Go?
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Weaving Relations for Cache Performance
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient Temporal Join Processing Using Indices
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
The VLDB Journal — The International Journal on Very Large Data Bases
Join operations in temporal databases
The VLDB Journal — The International Journal on Very Large Data Bases
C-store: a column-oriented DBMS
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Performance tradeoffs in read-optimized databases
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Data morphing: an adaptive, cache-conscious storage technique
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Clotho: decoupling memory page layout from storage organization
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Indexing multiversion databases
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
The end of an architectural era: (it's time for a complete rewrite)
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
| Hi-index | 0.00 |
A major performance bottleneck for database systems is the memory hierarchy. The performance of the memory hierarchy is directly related to how the content of disk pages maps to the L2 cache lines, i.e. to the organization of data within a disk page, called the page layout. The prevalent page layout in database systems is the N-ary Storage Model (NSM). As demonstrated in this paper, using NSM for temporal data deteriorates memory hierarchy performance for query-intensive workloads. This paper proposes two cacheconscious, read-optimized, page layouts for temporal data. Experiments show that the proposed page layouts are substantially faster than NSM.