Space-time tradeoffs for orthogonal range queries

Authors:
P M Vaidya
Affiliations:
Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Year:
1985

Citing 3
Cited 5

A Lower Bound on the Complexity of Orthogonal Range Queries

Journal of the ACM (JACM)
Space-time tradeoff for answering range queries (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Scaling and related techniques for geometry problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

On the application of sheared retrieval to orthogonal range queries

SCG '86 Proceedings of the second annual symposium on Computational geometry
Quasi-Valid range querying and its implications for nearest neighbor problems

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Computing partial sums in multidimensional arrays

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Lower bounds for orthogonal range searching: part II. The arithmetic model

Journal of the ACM (JACM)
Range queries in OLAP data cubes

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the question of (storage) space - (retrieval) time tradeoff for orthogonal range queries on a static database. Lower bounds on the product of retrieval time and storage space are obtained in the arithmetic and tree models.