Master-detail clustering using merged indexes

Informatik - Forschung und Entwicklung

Volumn 21, Issue 3-4, 2007, Pages 127-145

  Graefe, Goetz ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

B tree index; Concurrency control; Index utilities; Master detail clustering; Query processing; Relational database

Indexed keywords

EID: 34547478353     PISSN: 01783564     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00450-007-0022-4     Document Type: Article

References (48)

1. Abadi DJ (2007) Column, stores for wide and sparse data. CIDR 2007
2. Agarwal S, Blakeley JA, Casey T, Delaney K, Galindo-Legaria CA, Graefe G, Rys M, Zwilling MJ (2001.) Microsoft SQL Server. Chapter 27, p 969-1006. In: Silberschatz A, Korth HF, Sudarshan S (eds) Database System Concepts 4th Edn. McGraw-Hill Higher Education
3. Bayer R. Unterauer K (1977) Prefix B-Trees. ACM. TODS 2(1):11-26
4. Fernandez PM (1994) Red Brick Warehouse: A Read-Mostly RDBMS for Open SMP Platforms. SIGMOD 1994, p 492
5. Graefe G (2003) Sorting and Indexing with Partitioned B-Trees. CIDR 2003
6. Graefe G (2003) Executing Nested Queries. BTW Conf. 2003, pp 58-77
7. Graefe G (2006) B-tree indexes, interpolation search, and skew. DaMoN 2006, p 5
8. Graefe G (2007) Hierarchical locking in B-tree Indexes. BTW Conf. 2007
9. Graefe G (2007) Algorithms for merged indexes. BTW Conf. 2007
10. Graefe G: Surrogate compression for columnar storage. To appear in ACM SIGMOD Record
11. Graefe G, Bunker R, Cooper S (1998) Hash joins and hash teams in Microsoft SQL Server. VLDB 1998, pp 86-97
12. Gray J, Graefe G (1997) The Five-Minute Rule ten years later, and other computer storage rules of thumb. SIGMOD Record 26(4):63-68
13. Gottemukkala V, Lehman TJ (1992) Locking and Latching in a Memory-Resident Database System. VLDB 1992, pp 533-544
14. .1.4. Graefe G, Larson P (2001) B-tree indexes and CPU caches. ICDE 200.1, pp 349-358
15. Gray J, Lorie RA, Putzolu GR, Traiger IL (1975) Granularity of Locks in a Large Shared Data Base. VLDB 1975, pp 428-451
16. Gassner P, Lohman GM, Schiefer KB, Wang Y (1993) Query Optimization in. the IBM DB2 Family. IEEE Data Eng Bull 16(4):4-18
17. Gray J, Reuter A (1993) Transaction Processing: Concepts and Techniques. Morgan-Kaufman, San Mateo, CA
18. Graefe G, Shapiro LD (1991.) Data compression and database performance. ACM/IEEE-CS Symp. on Applied Computing
19. Galindo-Legaria CA, Stefani S, Waas F (2004) Query Processing for SQL Updates. SIGMOD 2004:844-849
20. Graefe G, Zwilling MJ (2004) Transaction support for indexed views. SIGMOD 2004:323-334
21. Härder T (1978) Implementing a Generalized Access Path Structure for a Relational Database System. ACM TODS 3(3): 285-298
22. Hamilton. J (2007) An architecture for modular data centers. CIDR 2007
23. Harizopoulos S, Liang V, Abadi DJ, Madden S (2006) Performance Tradeoffs in Read-Optimized Databases. VLDB 2006, pp 487-498
24. Härder T, Reuter A (1983) Principles of Transaction-Oriented Database Recovery. ACM Comput Surv 15(4):287-317
25. Härder T, Reinert J (1996) Access Path Support for Referential Integrity in SQL2. VLDB J 5(3): 196-214
26. Hsu WW, Smith AJ (2004) The performance impact of I/O optimizations and disk, improvements. IBM J Res Dev 48(2): 255-289
27. Joshi AM (1991) Adaptive Locking Strategies in a Multi-node Data Sharing Environment. VLDB 1991, pp 181-191
28. Korth HF (1983) Locking Primitives in a Database System. J ACM 30(1):55-79
29. Lomet DB (1993) Key Range Locking Strategies for Improved Concurrency. VLDB 1993, pp 655-664
30. Lomet DB (2001) The Evolution of Effective B-tree: Page Organization and Techniques: A Personal Account. SIGMOD Record 30(3):64-69
31. Lehman TJ, Carey MJ (1989) A Concurrency Control Algorithm for Memory-Resident Database Systems. FODO 1989, pp 490-504
32. Leslie H, Jain R, Birdsall D, Yaghmai H (1995) Efficient Search of Multi-Dimensional B-Trees. VLDB 1995, pp 710-719
33. Lomet DB, Turtle MR (1995) Redo Recovery after System Crashes. VLDB 1995, pp 457-468
34. Mohan C, ARIES/KVL: A. Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes. VLDB 1990, pp 392-405
35. McJones PR (1997) The 1995 SQL Reunion: People, Project, and Politics, May 29, 1995. Digital System Research Center Report SRC1997-018
36. Mohan C, Levine F (1992) ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging. SIGMOD 1992, pp 371-380
37. Mohan C, Narang I (1992) Algorithms for Creating Indexes for Very Large Tables without Quiescing Updates. SIGMOD Conf. 1992, pp 361-370
38. O'Neil PE (1986) The Escrow Transactional Method. ACM TODS 11(4):405-430
39. O'Neil PE, Graefe G (1995) Multi-table joins through bitmapped join indices. SIGMOD Record 24(3):8-11
40. Orenstein JA, Merrett TH (1984) A Class of Data Structures for Associative Searching. PODS 1984, pp 181-190
41. Pöss M, Potapov D (2003) Data Compression in Oracle. VLDB 2003, pp 937-947
42. Ramsak F, Markl V, Fenk R, Zirkel M, Elhardt K, Bayer R (2000) Integrating the UB-Tree into a Database System Kernel. VLDB 2000, pp 263-272
43. Short-stroking. Storage magazine. http://storagemagazine.techtarget.com., July 2005
44. Stonebraker M, Abadi DJ, Batkin A, Chen X, Cherniack M, Ferreira M, Lau E, Lin A, Madden S, O'Neil EJ, O'Neil PE, Rasin A, Tran N, Zdonik SB (2005) C-Store: A Column-oriented DBMS. VLDB 2005, pp 553-564
45. Severance DG, Lohman. GM (1976) Differential Files: Their Application, to the Maintenance of Large Databases. ACM TODS 1(3):256-267
46. Tsatalos OG, Solomon MH, Ioannidis YE (1996) VLDB J 5(2):101-118
47. Valduriez P (1987) Join Indices. ACM TODS 12(2):218-246
48. Wu K, Otoo EJ, Shoshani A (2006) Optimizing bitmap indices with efficient compression. ACM TODS 31(1):1-38