|
|
Deletion Without Rebalancing in Multiway Search Trees
– Siddhartha Sen, Robert E. Tarjan
|
|
2
|
An Algorithm for Full Text Indexing
– Tatu Ylönen
- 1992
|
|
1
|
Data Structures
– Roberto Tamassia
- 1996
|
|
65
|
A Locality-Preserving Cache-Oblivious Dynamic Dictionary
– Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu
- 2002
|
|
5
|
Efficient Bulk Deletes in Relational Databases
– A. Gärtner, A. Kemper, D. Kossmann, B. Zeller, Universität Passau
- 2001
|
|
13
|
The Performance of Concurrent Data Structure Algorithms
– Theodore Johnson, E. Shasha
- 1994
|
|
5
|
On-line Reorganization of Sparsely-populated B+-trees
– Chendong Zou, Betty Salzberg
- 1996
|
|
2
|
Dynamic Hierarchical Data Clustering And Efficient On-Line Database Reorganization
– Chendong Zou, Chendong Zou
- 1996
|
|
2
|
Memory Reference Locality in Binary Search Trees
– Kenneth Oksanen, Instructor Lecturer, Lauri Malmi
- 1995
|
|
1
|
Quick Decoding and Encoding of Prüfer Strings: Exercises in Data Structures
– Bryant A. Julstrom
|
|
592
|
Query evaluation techniques for large databases
– Goetz Graefe
- 1993
|
|
4
|
Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing
– Hanan Samet
|
|
11
|
Transaction Synchronization in Knowledge Bases: Concepts, Realization and Quantitative Evaluation
– Vinay K. Chaudhri
- 1995
|
|
13
|
The Application of Space-filling Curves to the Storage and Retrieval of Multi-dimensional Data
– Jonathan Lawder
- 2000
|
|
|
B-Trees with Lazy Parent Split
– unknown authors
|
|
35
|
Worst-Case Efficient External-Memory Priority Queues
– Gerth Stølting Brodal, Jyrki Katajainen
- 1998
|
|
|
Red-Black Balanced Trie Hashing
– E. J. Otoo, S. Effah
- 1995
|
|
4
|
Red-Black Trie Hashing
– E.J. Otoo, S. Effah
- 1995
|
|
|
High Level Efficiency in Database Languages
– Kim S. Larsen
- 1993
|
