Database Paper Browser

Back to papers

Efficient Searching with Linear Constraints (Extended Abstract)

Summary: External-memory data structures for reporting points satisfying a linear constraint a·x ∈ [α,β] in R^d, with focus on I/O cost. For d=2: first near-linear-space structure with optimal I/Os, plus a linear-size worst-case-efficient structure, space/query tradeoffs, and extensions to higher dimensions. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1142
Venue
PODS
Year
1998
Pagerank
0.00011643406
Overall Rank
1,502 | 89.56%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 15 of 15 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers