DBScholar

Back to papers

Processing Queries By Linear Constraints

Summary: Introduces QBLC: a processing framework for selection queries defined by linear inequalities over multidimensional data, realized atop R-tree/k-d-B and related indexes to enable aggressive pruning. Key novelty: numerically safe pruning that guarantees no false negatives, with theoretical analysis and experiments showing dramatic cost reductions for OLAP/GIS/scientific workloads. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1122
Venue
PODS
Year
1997
Pagerank
0.00011620957
Overall Rank
1,219 | 91.64%
DOI
10.1145/263661.263689

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{goldstein_pods97,
        address = {New York, NY, USA},
        series = {{PODS} '97},
        title = {{Processing Queries By Linear Constraints}},
        url = {https://dl.acm.org/doi/10.1145/263661.263689},
        doi = {10.1145/263661.263689},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Goldstein, Jonathan and Ramakrishnan, Raghu and Shaft, Uri and Yu, Jie-Bing},
        year = {1997}
}

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 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