Avoiding version redundancy for high performance reads in temporal databases

Proceedings of the 4th International Workshop on Data Management on New Hardware, DaMoN'08 - In conjuction with ACM SIGMOD/PODS Conference

Volumn , Issue , 2008, Pages 41-46

  Jouini, Khaled ^a   Jomier, Geneviève ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE-CONSCIOUS; L2 CACHE; MEMORY HIERARCHY; MEMORY HIERARCHY PERFORMANCE; PAGE LAYOUTS; PERFORMANCE BOTTLENECKS; STORAGE MODEL; TEMPORAL DATA; TEMPORAL DATABASE;

DIGITAL STORAGE; DISKS (STRUCTURAL COMPONENTS);

DATABASE SYSTEMS;

EID: 70349232451     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1457150.1457159     Document Type: Conference Paper

References (21)

1. D. Abadi. Column Stores for Wide and Sparse Data. In CIDR, pages 292-297, 2007.
2. A. Ailamaki, D. DeWitt, M. Hill, and M. Skounakis. Weaving Relations for Cache Performance. In VLDB, pages 169-180, 2001.
3. A. Ailamaki, D. DeWitt, M. Hill, and D. Wood. DBMSs on a Modern Processor: Where Does Time Go? In VLDB, pages 266-277, 1999.
4. E. Baykan. Recent Research on Database System Performance. Technical report, LBD-Ecole Polytechnique Fédérale de Lausanne, 2005.
5. P. A. Boncz, M. Zukowski, and N. Nes. MonetDB/X100: Hyper-Pipelining Query Execution. In CIDR, pages 225-237, 2005.
6. G. P. Copeland and S. Khoshafian. A Decomposition Storage Model. In S. B. Navathe, editor, SIGMOD,pages 268-279. ACM, 1985.
7. Z. Donghui, V. Tsotras, and B. Seeger. Efficient Temporal Join Processing Using Indices. In ICDE, page 103. IEEE Computer Society, 2002.
8. D. Gao, S. Jensen, T. Snodgrass, and D. Soo. Join Operations in Temporal Databases. The VLDB Journal, 14(1):2-29, 2005.
9. R. A. Hankins and J. M. Patel. Data Morphing: An Adaptive, Cache-Conscious Storage Technique. In VLDB, pages 417-428, 2003.
10. S. Harizopoulos, V. Liang, D. Abadi, and S. Madden. Performance Tradeoffs in Read-Optimized DataBases. In VLDB, pages 487-498, 2006.
11. K. Jouini and G. Jomier. Indexing Multiversion DataBases. In CIKM, pages 915-918. ACM, 2007.
12. D. B. Lomet and B. Salzberg. The Performance of a Multiversion Access Method. In SIGMOD, pages 353-363. ACM, May 1990.
13. R. Ramakrishnan and J. Gehrke. Database Management Systems, chapter 3 Data Storage and Indexing. McGraw-Hill, 2000.
14. R. Ramamurthy, D. J. DeWitt, and Q. Su. A Case for Fractured Mirrors. The VLDB J., 12(2):89-101, 2003.
15. M. Shao, J. Schindler, S. W. Schlosser, and Al. Clotho: Decoupling Memory Page Layout from Storage Organization. In VLDB, pages 696-707, 2004.
16. M. Stonebraker, D. J. Abadi, A. Batkin, and Al. C-store: A Column-Oriented DBMS. In VLDB, pages 553-564, 2005.
17. M. Stonebraker, S. Madden, D. Abadi, and Al. The End of an Architectural Era: (it's Time for a Complete Rewrite). In VLDB, pages 1150-1160, 2007.
18. Y. Tao, D. Papadias, and J. Zhang. Cost Models for Overlapping and Multiversion structures. TODS, 27(3):299-342, 2002.
19. www.sensage.com/.
20. www.sybase.com/products/datawarehousing/sybaseiq.
21. www.vertica.com/v zone/product-documentation.