Computer Science – Data Structures and Algorithms
Scientific paper
2002-10-09
Computer Science
Data Structures and Algorithms
Revision corrects some typoes and state things better for applications in subsequent papers
Scientific paper
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structures. This leads to an optimal bound of O(sqrt(log n/loglog n)) for searching and updating a dynamic set of n integer keys in linear space. Here searching an integer y means finding the maximum key in the set which is smaller than or equal to y. This problem is equivalent to the standard text book problem of maintaining an ordered set (see, e.g., Cormen, Leiserson, Rivest, and Stein: Introduction to Algorithms, 2nd ed., MIT Press, 2001). The best previous deterministic linear space bound was O(log n/loglog n) due Fredman and Willard from STOC 1990. No better deterministic search bound was known using polynomial space. We also get the following worst-case linear space trade-offs between the number n, the word length w, and the maximal key U < 2^w: O(min{loglog n+log n/log w, (loglog n)(loglog U)/(logloglog U)}). These trade-offs are, however, not likely to be optimal. Our results are generalized to finger searching and string searching, providing optimal results for both in terms of n.
Andersson Arne
Thorup Mikkel
No associations
LandOfFree
Dynamic Ordered Sets with Exponential Search Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Dynamic Ordered Sets with Exponential Search Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Ordered Sets with Exponential Search Trees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-204593