Download:
|
by Roberto Grossi
In Proc. of the 26th International Colloquium (ICALP-99), LNCS
http://www.info.uniroma2.it/~italiano/Papers/ICALP99final.ps.gz
Add To MetaCart
Abstract:
Abstract. We describe a general paradigm for maintaining multidimensional keys in linked data structures. In particular, we show how to augment data structures dened on one-dimensional keys so as to store, access and update e��ciently k-dimensional keys under the lexicographic order. While simple approaches produce an O(k) slowdown as a multiplicative factor in the running times of the original data structure, our method achieves a better O(k) additive term at the price of adding just few integers and pointers. As a result, we improve existing bounds and achieve new results in a simple way, without giving up the structural and topological properties of the underlying data structures. This is particularly important, as it allows us to exploit many properties of one-dimensional searching, and makes our approach amenable to practical implementations. 1
Citations
|
1449
|
The Art of Computer Programming
– Knuth
|
|
388
|
Suffix arrays: A new method for on-line string searches
– Manber, Myers
- 1990
|
|
295
|
Self-adjusting binary search trees
– Sleator, Tarjan
- 1985
|
|
211
|
Making data structures persistent
– Driscoll, Sarnak, et al.
- 1989
|
|
196
|
A dichromatic framework for balanced trees
– Guibas, Sedgewick
- 1978
|
|
137
|
An algorithm for the organization of information
– Adelson-Velsky, Landis
- 1962
|
|
125
|
Two algorithms for maintaining order in a list
– Dietz, Sleator
- 1987
|
|
100
|
Fast algorithms for sorting and searching strings
– Bentley, Sedgewick
- 1997
|
|
98
|
A new data structure for representing sorted lists
– Huddleston, Mehlhorn
- 1982
|
|
84
|
Symmetric binary B-trees: Data structure and maintenance algorithms
– Bayer
- 1972
|
|
72
|
The String B-tree: a new data structure for string search in external memory and its applications
– Ferragina, Grossi
- 1999
|
|
64
|
Binary search trees of bounded balance
– Nievergelt, Reingold
- 1973
|
|
43
|
Biased search trees
– Bent, Sleator, et al.
- 1985
|
|
42
|
lists: A probabilistic alternative to balanced trees. Communications of the ACM,33(6):668-676
– Skip
- 1990
|
|
40
|
Design and analysis of a data structure for representing sorted lists
– Brown, Tarjan
- 1980
|
|
20
|
A balanced search tree with O(1) worstcase update time. Acta Informatica
– Levcopoulos, Overmars
- 1996
|
|
16
|
A simple balanced search tree with O(1) worst-case update time. International Journal of Foundations of Computer Science 7
– Fleischer
- 1996
|
|
15
|
Suffix binary search trees
– Irving
- 1995
|
|
12
|
Randomized binary searching with tree structures
– Clampett
- 1964
|
|
10
|
Data Structures and Network Algorithms, CBMS 44
– Tarjan
- 1983
|
|
9
|
Two new kinds of biased search trees
– Feigenbaum, Tarjan
- 1983
|
|
9
|
Dynamic binary search
– Mehlhorn
- 1979
|
|
5
|
Randomized search trees. Algorithmica 16
– Seidel, Aragon
- 1996
|
|
4
|
Multidimensional Height-Balanced Trees
– Vaishnavi
- 1984
|
|
3
|
Data Structures and Algorithms: 1. Searching and Sorting
– Mehlhorn
- 1984
|
|
2
|
The On--Line D--Dimensional Dictionary Problem
– Gonzalez
- 1992
|
|
2
|
Multidimensional Balanced Binary Trees
– Vaishnavi
- 1989
|
|
1
|
Stlting Brodal. Finger search trees with constant insertion time
– Gerth
- 1998
|
|
1
|
Gueting and Hans-Peter Kriegel. Multidimensional B-tree: An e��cient dynamic le structure for exact match queries
– Ralf
- 1980
|
