Sorting And Indexing With Partitioned B-Trees
Cached
Download Links
- [www-db.cs.wisc.edu]
- [www-db.cs.wisc.edu]
- CiteULike
- DBLP
Other Repositories/Bibliography
by
Goetz Graefe
| Citations: | 19 - 5 self |
BibTeX
@MISC{Graefe_sortingand,
author = {Goetz Graefe},
title = {Sorting And Indexing With Partitioned B-Trees},
year = {}
}
Years of Citing Articles
OpenURL
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.







