Searching for "The Ubiquitous B-Tree." – sorted by Relevance.
-
The ubiquitous B-tree
- The Ubiquitous B-Tree DOUGLAS COMER Computer Sctence Department, Purdue Untverstty, West Lafayette
- Cited by 448 (0 self) – Add To MetaCart
-
R-Trees Have Grown Everywhere
- of the era of the ‘ubiquitous R-tree’ in an analogous manner as B-trees were considered 25 years ago
- Cited by 5 (0 self) – Add To MetaCart
-
Improving Pointer-Based Codes Through Cache-Conscious Data Placement
- ] Douglas Comer. “The ubiquitous B-tree.” ACM Computing Surveys, 11(2):121–137, 1979. [16] R. Courts
- Cited by 13 (1 self) – Add To MetaCart
-
DBMS Architecture—Still an Open Problem. in
- , the “ubiquitous” B-trees or B*-trees [9] which grant rapid direct and, equally important, sorted sequential access
- Cited by 2 (2 self) – Add To MetaCart
-
Theo Härder DBMS Architecture – the Layer Model and its Evolution
- of access paths. The most prominent ones are, of course, the »ubiquitous« B-trees or B*-trees [Comer 1979
- Add To MetaCart
-
Cache-Oblivious R-Trees
- . For example, the ubiquitous B-tree [18, 10] is such a tree; a search (traversal of a root-leaf path) in the B-tree
- Cited by 7 (2 self) – Add To MetaCart
-
Dynamic Inverted Indexes for a Distributed Full-Text Retrieval System
- inverted indexes generally adopt an append-only model of update. Tries, hashing and the ubiquitous B-Tree
- Cited by 15 (2 self) – Add To MetaCart
-
Efficient Query Processing on Unstructured Tetrahedral
- in a simple and efficient fashion, using standard access methods (the ubiquitous B-Tree). In addition
- Cited by 5 (1 self) – Add To MetaCart
-
Effect of Node Size on the Performance of Cache-Conscious B+-Trees
- ABSTRACT Effect of Node Size on the Performance of Cache-Conscious B+-trees Richard A. Hankins
- Cited by 5 (1 self) – Add To MetaCart
-
Adaptive Query Processing in Point-Transformation Schemes
- this paper. 2 Point-Transformation Schemes Most point-transformation schemes (PTSs) use the ubiquitous B+-tree
- Cited by 1 (1 self) – Add To MetaCart

