Download:
|
by Chendong Zou, Betty Salzberg
In Proceedings of ACM/SIGMOD Annual Conference on Management of Data
ftp://ftp.ccs.neu.edu/pub/people/zou/sigmod96.ps
Add To MetaCart
Abstract:
In this paper, we present an efficient method to do online reorganization of sparsely-populated B
Citations
|
1137
|
Transaction Processing: Concepts and Techniques
– Gray, Reuter
- 1993
|
|
90
|
Concurrency of Operations on B-Trees
– Bayer, Schkolnick
- 1977
|
|
68
|
Aries/kvl: A key-value locking method for concurrencty control of multiaction transactions operating on btree indexes
– Mohan
- 1990
|
|
37
|
Access method concurrency with recovery
– LOMET, SALZBERG
- 1992
|
|
27
|
File Structures: an analytic approach
– Salzberg
- 1988
|
|
24
|
Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates
– Mohan, Narang
- 1992
|
|
21
|
Redo Recovery after System Crashes
– Lomet, Tuttle
- 1995
|
|
16
|
Performance of on-line index construction algorithms
– Srinivasan, Carey
- 1992
|
|
15
|
B-trees with inserts and deletes: why free-at-empty is better than merge-at-half
– Johnson, Shasha
- 1993
|
|
13
|
Principles of transaction-based on-line reorganization
– Salzberg, Dimock
- 1992
|
|
11
|
On the Selection of Access Paths in a Data Base System
– Wedekind
- 1974
|
|
10
|
Concurrent file reorganization for record clustering: A performance study
– Omiecinski, Lee, et al.
- 1992
|
|
6
|
Concurrent storage structure conversion: From B+Tree to linear hash file
– Omiecinski
- 1988
|
|
5
|
Online reorganization of key-sequenced tables and files
– Smith
- 1990
|
