Implicit B-trees: a new data structure for the dictionary problem

@article{Franceschini2004ImplicitBA,
  title={Implicit B-trees: a new data structure for the dictionary problem},
  author={Gianni Franceschini and Roberto Grossi and J. Ian Munro and Linda Pagli},
  journal={J. Comput. Syst. Sci.},
  year={2004},
  volume={68},
  pages={788-807}
}
An implicit data structure for the dictionary problem maintains n data values in the first n locations of an array in such a way that it efficiently supports the operations insert, delete and search. No information other than that in O(1) memory cells and in the input data is to be retained; and the only operations performed on the data values (other than reads and writes) are comparisons. This paper describes the Implicit B-tree, a new data structure supporting these operations in O(log B n… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Self-Organizing Heuristics for Implicit Data Structures

SIAM J. Comput. • 1984
View 4 Excerpts
Highly Influenced

Konheim , and Michael Rodeh . A sparse table implementation of priority queues

Alon Itai, G. Alan
Shimon Even and Oded Kariv , editors , Automata , Languages and Programming , 8 th Colloquium , volume 115 of Lecture Notes in Computer Science • 2003

Studio sperimentale di una nuova struttura dei dati implicita per B-alberi

Andrea Bello, Francesco Fantoni
Master thesis (in Italian), • 2003
View 1 Excerpt

Compression from the database perspective

Zhiyuan Chen
In DIMACS Working Group Meeting on Data Compression in Networks and Applications, • 2002
View 1 Excerpt

Similar Papers

Loading similar papers…