Efficient searching with linear constraints

Journal Article

We show how to preprocess a set S of points in Rd into an external memory data structure that efficiently supports linear-constraint queries. Each query is in the form of a linear constraint a·x≤b; the data structure must report all the points of S that satisfy the constraint. Our goal is to minimize the number of disk blocks required to store the data structure and the number of disk accesses (I/Os) required to answer a query. For d = 2, we present the first near-linear size data structure that can answer linear-constraint queries using an optimal number of I/Os. We also present a linear-size data structure that can answer queries efficiently in the worst case. We combine these two approaches to obtain tradeoffs between space and query time. Finally, we show that some of our techniques extend to higher dimensions.

Full Text

Duke Authors

Cited Authors

  • Agarwal, PK; Arge, L; Erickson, J; Franciosa, PG; Vitter, JS

Published Date

  • January 1, 1998

Published In

  • Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems

Start / End Page

  • 169 - 178

Digital Object Identifier (DOI)

  • 10.1145/275487.275506

Citation Source

  • Scopus