Algorithms for merged indexes

Datenbanksysteme in Business, Technologie und Web, BTW 2007 - 12th Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS), Proceedings

Volumn , Issue , 2007, Pages 112-131

  Graefe, Goetz ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

B TREES; BENEFICIAL EFFECTS; COMPLEX OBJECTS; DATA DEFINITION; INTEGRITY CONSTRAINTS; KEY CONSTRAINTS; LOGICAL LEVELS; OBJECT ORIENTED; PHYSICAL LEVEL; QUERY EXECUTION PLAN; RELATIONAL DATABASE; RELATIONAL QUERIES; SORT ORDERS;

ALGORITHMS; CONCURRENCY CONTROL; DATABASE SYSTEMS; ITERATIVE METHODS;

MERGERS AND ACQUISITIONS;

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

References (34)

1. Sameet Agarwal, José A. Blakeley, Thomas Casey, Kalen Delaney, César A. Galindo-Legaria, Goetz Graefe, Michael Rys, Michael J. Zwilling: Microsoft SQL Server. Chapter 27, p. 969-1006 in: A. Silberschatz, H. F. Korth, S. Sudarshan: Database System Concepts, 4th Edition. McGraw-Hill 2001.
2. Rudolf Bayer, Karl Unterauer: Prefix B-Trees. ACM TODS 2(1): 11-26 (1977).
3. Phillip M. Fernandez: Red Brick Warehouse: A Read-Mostly RDBMS for Open SMP Platforms. SIGMOD 1994: 492.
4. Goetz Graefe: Sorting and Indexing with Partitioned B-Trees. CIDR 2003.
5. Goetz Graefe: Executing Nested Queries. BTW Conf. 2003: 58-77.
6. Goetz Graefe: B-tree indexes, interpolation search, and skew. DaMoN 2006: 5.
7. Goetz Graefe: Hierarchical Locking in B-tree Indexes. BTW Conf. 2007.
8. Jim Gray, Goetz Graefe: The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb. SIGMOD Record 26(4): 63-68 (1997).
9. Vibby Gottemukkala, Tobin J. Lehman: Locking and Latching in a Memory-Resident Database System. VLDB 1992: 533-544.
10. Goetz Graefe, Per-Åke Larson: B-Tree Indexes and CPU Caches. ICDE 2001: 349-358.
11. Jim Gray, Raymond A. Lorie, Gianfranco R. Putzolu, Irving L. Traiger: Granularity of Locks in a Large Shared Data Base. VLDB 1975: 428-451.
12. Peter Gassner, Guy M. Lohman, K. Bernhard Schiefer, Yun Wang: Query Optimization in the IBM DB2 Family. IEEE Data Eng. Bull. 16(4): 4-18 (1993).
13. Jim Gray, Andreas Reuter: Transaction Processing: Concepts and Techniques. Morgan-Kaufman, San Mateo, CA, 1993.
14. Goetz Graefe, Michael J. Zwilling: Transaction support for indexed views. SIGMOD 2004.
15. Theo Härder: Implementing a Generalized Access Path Structure for a Relational Database System. ACM TODS 3(3): 285-298 (1978).
16. Theo Härder, Andreas Reuter: Principles of Transaction-Oriented Database Recovery. ACM Comput. Surv. 15(4): 287-317 (1983).
17. Theo Härder, Joachim Reinert: Access Path Support for Referential Integrity in SQL2. VLDB J. 5(3): 196-214 (1996).
18. Windsor W. Hsu, Alan Jay Smith: The performance impact of I/O optimizations and disk improvements. IBM J. of Research and Development 48(2): 255-289 (2004).
19. Ashok M. Joshi: Adaptive Locking Strategies in a Multi-node Data Sharing Environment. VLDB 1991: 181-191.
20. Henry F. Korth: Locking Primitives in a Database System J. ACM 30(1): 55-79 (1983).
21. David B. Lomet: Key Range Locking Strategies for Improved Concurrency. VLDB 1993: 655-664.
22. David B. Lomet: The Evolution of Effective B-tree: Page Organization and Techniques: A Personal Account. SIGMOD Record 30(3): 64-69 (2001).
23. Tobin J. Lehman, Michael J. Carey: A Concurrency Control Algorithm for Memory-Resident Database Systems. FODO 1989: 490-504.
24. Harry Leslie, Rohit Jain, Dave Birdsall, Hedieh Yaghmai: Efficient Search of Multi-Dimensional B-Trees. VLDB 1995: 710-719.
25. David B. Lomet, Mark R. Tuttle: Redo Recovery after System Crashes. VLDB 1995: 457-468.
26. C. Mohan: ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes. VLDB 1990: 392-405.
27. Paul R. McJones: The 1995 SQL Reunion: People, Project, and Politics, May 29, 1995. Digital System Research Center Report SRC1997-018: (1997).
28. C. Mohan, Frank Levine: ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging. SIGMOD 1992: 371-380.
29. C. Mohan, Inderpal Narang: Algorithms for Creating Indexes for Very Large Tables without Quiescing Updates. SIGMOD Conf. 1992: 361-370.
30. Patrick E. O'Neil: The Escrow Transactional Method. ACM TODS 11(4): 405-430 (1986).
31. Meikel Pöss, Dmitry Potapov: Data Compression in Oracle. VLDB 2003: 937-947.
32. Short-stroking. Storage magazine. http://storagemagazine.techtarget.com, July 2005.
33. Odysseas G. Tsatalos, Marvin H. Solomon, Yannis E. Ioannidis: The GMAP: A Versatile Tool for Physical Data Independence VLDB J. 5(2): 101-118 (1996).
34. Patrick Valduriez: Join Indices. ACM TODS 12(2): 218-246 (1987).