Data morphing: An adaptive, cache-conscious storage technique

Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003

Volumn , Issue , 2003, Pages 417-428

  Hankins, Richard A ^a   Patel, Jignesh M ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; QUERY PROCESSING;

CACHE UTILIZATION; CACHE-CONSCIOUS; COMMON OPERATIONS; DYNAMIC REORGANIZATION; HETEROGENOUS DATABASE; MORPHING TECHNIQUES; SCAN OPERATIONS; STORAGE TECHNIQUE;

DIGITAL STORAGE;

EID: 85012187226     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. The IA-32 Intel Architecture Software Developer's Manual, Volume 3: System Programming Guide. Intel Corporation, 2002.
2. A. Ailamaki, D. J. DeWitt, M. D. Hill, and M. Skounakis. Weaving Relations for Cache Performance. In Proceedings of the 27th International Conference on Very Large Databases (VLDB), pages 169-180, Sept. 2001.
3. A. Ailamaki, D. J. DeWitt, M. D. Hill, and D. A. Wood. DBMSs on a Modern Processor: Where Does Time Go? In Proceedings of the 25th International Conference on Very Large Databases (VLDB), pages 266-277, Sept. 1999.
4. E. T. Bell. Exponential Numbers. American Mathematical Monthly, 41(7):411-419, Aug. - Sept. 1934.
5. P. A. Bernstein, M. L. Brodie, S. Ceri, D. J. DeWitt, M. J. Franklin, H. Garcia-Molina, J. Gray, G. Held, J. M. Hellerstein, H. V. Jagadish, M. Lesk, D. Maier, J. F. Naughton, H. Pirahesh, M. Stonebraker, and J. D. Ullman. The Asilomar Report on Database Research. SIGMOD Record, 27(4):74-80, Dec. 1998.
6. P. Boncz and M. Kersten. Monet: An Impressionist Sketch of an Advanced Database System. In In Proceedings of Basque Int. Workshop on Information Technology (BIWIT), San Sebastian, Spain, July 1995.
7. P. A. Boncz, S. Manegold, and M. L. Kersten. Database Architecture Optimized for the New Bottleneck: Memory Access. In Proceedings of the 25th International Conference on Very Large Databases (VLDB), pages 54-65, Sept. 1999.
8. S. Browne, J. Dongarra, N. Garner, G. Ho, and P. Mucci. A Portable Programming Interface for Performance Evaluation on Modern Processors. The Int'l Journal of High Performance Computing Applications, 14(3):189-204, Fall 2000.
9. B. Calder, K. Chandra, S. John, and T. Austin. Cacheconscious data placement. In Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 139-149, Oct. 1998.
10. A. Cardenas. Analysis and Performance of Inverted Data Base Structures. Communications of the ACM, 18(5):253-263, May 1975.
11. T. Chilimbi, M. D. Hill, and J. R. Larus. Cache-Conscious Structure Layout. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 1-12, May 1999.
12. G. P. Copeland and S. F. Khoshafian. A Decomposition Storage Model. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 268-279, May 1985.
13. N. de Bruijn. Asymptotic Methods in Analysis. Dover, 1981.
14. D. J. DeWitt. The Wisconsin Benchmark: Past, Present, and Future. In J. Gray, editor, The Benchmark Handbook for Database and Transaction Systems (2nd Edition). Morgan Kaufmann, 1993.
15. R. A. Hankins and J. M. Patel. Data Morphing: An Adaptive, Cache-Conscious Storage Technique. Technical Report, http://www.eecs.umich.edu/quickstep/publ/dm.pdf.
16. C.-C. Kanne and G. Moerkotte. Efficient storage of XML data. In Proceedings of the International Conference On Data Engineering (ICDE), page 198, 2000.
17. S.-W. Kim, W. Choi, and B.-H. Kim. Design and Implementation of the Concurrency Control Manager in the Main-Memory DBMS Tachyon. In 26th Annual International Computer Software and Applications Conference, pages 635-644, Aug. 2002.
18. S. B. Navathe, S. Ceri, G. Wiederhold, and J. Dou. Vertical partitioning algorithms for database design. ACM Transactions on Database Systems (TODS), 9(4):680-710, 1984.
19. A. M. Odlyzko. Asymptotic Enumeration Methods. In R. L. Graham, M. Grotschel, and L. Lovsz, editors, Handbook of Combinatorics, volume 2, pages 1063-1229. North-Holland, Amsterdam, 1995.
20. R. Ramakrishnan and J. Gehrke. Database Management Systems. WCB/McGraw-Hill, second edition, 2000.
21. G.-C. Rota. The Number of Partitions of a Set. American Mathematical Monthly, 71(5):498-504, May 1964.
22. A. Shatdal, C. Kant, and J. F. Naughton. Cache Conscious Algorithms for Relational Query Processing. In Proceedings of 20th International Conference on Very Large Data Bases (VLDB), pages 510-521, Sept. 1994.
23. S. Yao. An Attribute Based Model for Database Access Cost Analysis. Communications of the ACM, 20(4):260-261, Apr. 1977.