Dynamic interpolation search revisited

Authors:
Alexis Kaporis;Christos Makris;Spyros Sioutas;Athanasios Tsakalidis;Kostas Tsichlas;Christos Zaroliagis
Affiliations:
Dept of Computer Eng and Informatics, University of Patras, Patras, Greece;Dept of Computer Eng and Informatics, University of Patras, Patras, Greece;Dept of Computer Eng and Informatics, University of Patras, Patras, Greece;Dept of Computer Eng and Informatics, University of Patras, Patras, Greece;Dept of Computer Eng and Informatics, University of Patras, Patras, Greece;Dept of Computer Eng and Informatics, University of Patras, Patras, Greece
Venue:
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Year:
2006

Citing 13
Cited 5

Arithmetic Interpolation Search for Alphabet Tables

IEEE Transactions on Computers
Dynamic interpolation search

Journal of the ACM (JACM)
Implicit Data Structures for the Dictionary Problem

Journal of the ACM (JACM)
Advanced database indexing

Advanced database indexing
Tight(er) worst-case bounds on dynamic searching and priority queues

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree

SIAM Journal on Computing
Interpolation search—a log logN search

Communications of the ACM
Optimal bounds for the predecessor problem and related problems

Journal of Computer and System Sciences - STOC 1999
A Sparse Table Implementation of Priority Queues

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Dynamic Interpolation Search in o(log log n) Time

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Interpolation search for non-independent data

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of searching an ordered random table

SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Addressing for random-access storage

IBM Journal of Research and Development

Dynamic Web Service discovery architecture based on a novel peer based overlay network

Journal of Systems and Software
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Digital watermarking in peer to peer networks

DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
Efficient processing of 3-sided range queries with probabilistic guarantees

Proceedings of the 13th International Conference on Database Theory
A peer to peer network environment for optimized digital rights management of digital cultural heritage

VAST'08 Proceedings of the 9th International conference on Virtual Reality, Archaeology and Cultural Heritage

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new dynamic Interpolation Search (IS) data structure is presented that achieves O(loglogn) search time with high probability on unknown continuous or even discrete input distributions with measurable probability of key collisions, including power law and Binomial distributions. No such previous result holds for IS when the probability of key collisions is measurable. Moreover, our data structure exhibits O(1) expected search time with high probability for a wide class of input distributions that contains all those for which o(loglogn) expected search time was previously known.