Space-Time Tradeoff for Answering Range Queries (Extended Abstract)

@inproceedings{Yao1982SpaceTimeTF,
  title={Space-Time Tradeoff for Answering Range Queries (Extended Abstract)},
  author={Andrew Chi-Chih Yao},
  booktitle={STOC},
  year={1982}
}
In this paper, we raise and investigate the question of (storage) space- (retrieval) time tradeoff for a static database, in the general framework of Fredman's. As will be seen, such tradeoff results also lead to lower bounds on the complexity of processing a sequence of m INSERT and QUERY instructions. The latter results are incomparable to Fredman's, since the presence of DELETE instructions was crucial for his proof technique. We will present our results in detail in the next few sections… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.
63 Citations
1 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 63 extracted citations

References

Publications referenced by this paper.

Mauer, "A note on Euclidean near neighbor searching in the plane,

  • H.A.J.L. Bentley
  • Information Processin 9 Letters
  • 1979
Highly Influential
8 Excerpts

Similar Papers

Loading similar papers…