Abstract

Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read-ahead and dynamic resource allocation, during index creation for a reduced delay until the first query can search the new index, during data loading for streaming integration of new data into a fully indexed database, and for miscellaneous other operations.

Citations

277	Aries: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging - Mohan, Haderle, et al. - 1992
159	Dataflow query execution in a parallel mainmemory environment - WILSCHUT, APERS - 1991
127	Organization and maintenance of large ordered indices - Bayer, McCreight - 1972
105	The Art of Computer Programming, Volume III: Sorting and Searching - Knuth - 1973
81	Prefix B-Trees - Bayer, Unterauer - 1977
64	Differential files: their application to the maintenance of large databases - Severance, Lohman - 1976
40	The log-structured merge-tree (LSM-tree - ONeil - 1996
31	The case for partial indexes - Stonebraker - 1989
28	A performance study of three high availability data replication strategies - Hsiao, DeWitt - 1991
20	Progressive Merge Join: a Generic and Non-Blocking Sort-Based Join Algorithm - Dittrich, Seeger, et al. - 2002
20	A novel index supporting high volume data waresshouse insertion - Jermaine, Datta, et al. - 1999
17	Merging sorted runs using large main memory - Salzberg - 1989
17	personal communication - Shapiro - 1998
15	On-line Index Construction Algorithms - Srinivasan, Carey - 1991
9	Andreas Reuter: Principles of Transaction-Oriented Database Recovery - Härder - 1983
5	Narasayya: Automated Selection - Agrawal, Chaudhuri, et al.
5	Inderpal Narang: Algorithms for Creating Indexes for Very Large - Mohan
4	O'Neil: The Escrow Transactional Method - Patrick - 1986
3	Per-Åke Larson: B-Tree Indexes and CPU Caches - Graefe
3	Masaru Kitsuregawa, Beng Chin Ooi, Kian-Lee Tan, and Anirban Mondal. Towards self-tuning data placement in parallel database systems - Lee - 2000
3	Elhardt, Rudolf Bayer: Integrating the UB-Tree into a Database System Kernel - Ramsak, Markl, et al. - 2000
2	Rundersteiner: B+ Retake: Sustaining High Volume Inserts into Large - Deschler, Elke - 2001
2	Härder: A Scan-Driven Sort Facility for a Relational Database System - Theo - 1977
2	A cost model for the internal organization of B+-tree nodes - HANSEN - 1981
2	Omiecinski, Wai-Gen Yee: Out From Under the Trees - Jermaine, Edward - 2002
2	Goetz Graefe: Memory Management during Run Generation - Larson - 1998
2	Per-Åke Larson: Dynamic Memory Adjustment for External Mergesort - Zhang - 1997
2	Per-Åke Larson: Buffering and Read-Ahead Strategies for External Mergesort - Zhang - 1998
1	Arge: The Buffer Tree: A New Technique for Optimal I/O-Algorithms - Lars - 1995
1	Omiecinski, Shamkant B. Navathe: Two Techniques for On-line Index Modification - Achyutuni, Edward - 1996
1	SQL Server 7.0, product documentation - Corp - 1998
1	Omiecinski: An analytical comparison of two secondary index schemes: physical versus logical addresses - Edward - 1993
1	Vitter: External memory algorithms and data structures - Scott - 2001
1	Alan Skelley: DB2 Advisor: An Optimizer Smart Enough to Recommend Its Own Indexes - Valentin, Zuliani, et al.