The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
ACM Transactions on Database Systems (TODS)
Height-balanced trees of order (β, γ, δ)
ACM Transactions on Database Systems (TODS)
A compendium of key search references
ACM SIGIR Forum
Trie Hashing with Controlled Load
IEEE Transactions on Software Engineering
Algorithms for loading parallel grid files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
P-trees: storage efficient multiway trees
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
Improved bulk-loading algorithms for quadtrees
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
An efficient model for representing and analyzing B-trees
ACM '85 Proceedings of the 1985 ACM annual conference on The range of computing : mid-80's perspective: mid-80's perspective
Self-organizing scheme for file storage
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Low latency photon mapping using block hashing
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
A New Indexing Scheme for Content-Based Image Retrieval
Multimedia Tools and Applications
An empirical comparison of B-trees, compact B-trees and multiway trees
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Out-of-Core Streamline Visualization on Large Unstructured Meshes
IEEE Transactions on Visualization and Computer Graphics
Efficient Bulk-Loading of Gridfiles
IEEE Transactions on Knowledge and Data Engineering
The Effect of Buffering on the Performance of R-Trees
IEEE Transactions on Knowledge and Data Engineering
Speeding up construction of PMR quadtree-based spatial indexes
The VLDB Journal — The International Journal on Very Large Data Bases
IEEE Transactions on Knowledge and Data Engineering
Comments on optimality of B-trees
ACM SIGMOD Record
Concurrency control and integrity preservation for the `RIM' DBMS
ACM SIGMIS Database
Zoned-partitioning of tree-like access methods
Information Systems
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
A B-Tree index extension to enhance response time and the life cycle of flash memory
Information Sciences: an International Journal
Performance guarantees for B-trees with different-sized atomic keys
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Massive concurrent deletion of keys in b*-tree
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
An efficient zoning technique for multi-dimensional access methods
TEAA'05 Proceedings of the 31st VLDB conference on Trends in Enterprise Application Architecture
| Hi-index | 0.00 |
A B-tree is compact if it is minimal in number of nodes, hence has optimal space utilization, among equally capacious B-trees of the same order. The space utilization of compact B-trees is analyzed and compared with that of noncompact B-trees and with (node)-visit-optimal B-trees, which minimize the expected number of nodes visited per key access. Compact B-trees can be as much as a factor of 2.5 more space efficient than visit-optimal B-trees; and the node-visit cost of a compact tree is never more than 1 + the node-visit cost of an optimal tree. The utility of initializing a B-tree to be compact (which initialization can be done in time linear in the number of keys if the keys are presorted) is demonstrated by comparing the space utilization of a compact tree that has been augmented by random insertions with that of a tree that has been grown entirely by random insertions. Even after increasing the number of keys by a modest amount, the effects of compact initialization are still felt. Once the tree has grown so large that these effects are no longer discernible, the tree can be expeditiously compacted in place using an algorithm presented here; and the benefits of compactness resume.