Self-selecting, self-tuning, incrementally optimized indexes

Advances in Database Technology - EDBT 2010 - 13th International Conference on Extending Database Technology, Proceedings

Volumn , Issue , 2010, Pages 371-381

  Graefe, Goetz ^a   Kuno, Harumi ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Adaptive; Autonomic; Database index; Query execution

Indexed keywords

ACCESS DEVICES; AUTONOMIC DATABASE; INDEX CREATION; INDEX TUNING; PHYSICAL DATABASE; QUERY EXECUTION; QUERY PATTERNS; QUERY PERFORMANCE; QUERY PREDICATES; RELATIONAL DATA; SELFTUNING;

AUTOMATIC INDEXING; CRACKING (CHEMICAL); DATA WAREHOUSES; TECHNOLOGY; TUNING;

OPTIMIZATION;

EID: 77952279358     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1739041.1739087     Document Type: Conference Paper

References (23)

1. Rudolf Bayer: The Universal B-tree for multidimensional indexing: general concepts. WWCA 1997: 198-209.
2. Bruno, N. and Chaudhuri, S. 2007. Physical design refinement: The 'merge-reduce' approach. ACM Trans. Database Syst. 32, 4 (Nov. 2007), 28.
3. Rudolf Bayer, Edward M. McCreight: Organization and maintenance of large ordered indices. Acta Inf. 1: 173-189 (1972).
4. Jon Louis Bentley, M. Douglas McIlroy: Engineering a sort function. Softw., Pract. Exper. 23(11): 1249-1265 (1993).
5. Rudolf Bayer, Karl Unterauer: Prefix B-trees. ACM TODS 2(1): 11-26 (1977).
6. Surajit Chaudhuri, Vivek R. Narasayya: Selftuning database systems: A decade of progress. VLDB 2007: 3-14.
7. Sheldon J. Finkelstein, Mario Schkolnick, Paolo Tiberio: Physical database design for relational databases. ACM TODS 13(1): 91-128 (1988).
8. Goetz Graefe: Sorting and indexing with partitioned B-trees. CIDR 2003.
9. Goetz Graefe: Implementing sorting in database systems. ACM Comput. Surv. 38(3): (2006).
10. Goetz Graefe: Hierarchical locking in B-tree indexes. BTW 2007: 18-42.
11. Goetz Graefe: The five-minute rule twenty years later, and how flash memory changes the rules. DaMoN 2007: 6.
12. C. A. R. Hoare: Algorithm 64: Quicksort. Comm. ACM 4(7): 321 (1961).
13. Theo Härder: Selecting an optimal set of secondary indices. ECI 1976: 146-160.
14. Stratos Idreos, Martin L. Kersten, Stefan Manegold: Database cracking. CIDR 2007: 68-78
15. Stratos Idreos, Martin L. Kersten, Stefan Manegold: Updating a cracked database. SIGMOD 2007: 413-424.
16. Milena Ivanova, Martin L. Kersten, Niels Nes: Self-organizing strategies for a column-store database. EDBT 2008: 157-168.
17. Milena Ivanova, Martin L. Kersten, Niels Nes: Adaptive segmentation for scientific databases. ICDE 2008: 1412-1414.
18. Martin L. Kersten, Stefan Manegold: Cracking the database store. CIDR 2005.
19. Harry Leslie, Rohit Jain, Dave Birdsall, Hedieh Yaghmai: Efficient search of multi-dimensional B-trees. VLDB 1995: 710-719.
20. Chris Nyberg, Tom Barclay, Zarka Cvetanovic, Jim Gray, David B. Lomet: AlphaSort: A Cache-Sensitive Parallel External Sort VLDB J. 4(4): 603-627 (1995).
21. Michael Stonebraker: The choice of partial inversions and combined indices. International Journal of Computer and Information Sciences, 3(2), June 1974.
22. Michael Stonebraker: The case for partial indexes. SIGMOD Record 18(4): 4-11 (1989).
23. Praveen Seshadri, Arun N. Swami: Generalized partial indexes. ICDE 1995: 420-427.