DBScholar

Back to papers

EFFICIENT PROCESSING OF RELATIONAL CALCULUS EXPRESSIONS USING RANGE QUERY THEORY (Extended Abstract)

Summary: Defines a relational-calculus subset and evaluates all expressions by range-query theory in space O(N) and time O(N log^d N). With d small per predicate, ~95% of commercial requests on standard RAM run in O(N log N) time and O(N) space. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hfc3b7c9241017b75
Venue
SIGMOD
Year
1984
Pagerank
5.050482e-05
Overall Rank
10,264 | 31.00%
DOI
10.1145/602259.602281

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{willard_sigmod84,
        title = {{EFFICIENT PROCESSING OF RELATIONAL CALCULUS EXPRESSIONS USING RANGE QUERY THEORY (Extended Abstract)}},
        author = {Willard, Dan E.},
        series = {{SIGMOD} '84},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/602259.602281},
        url = {https://dl.acm.org/doi/10.1145/602259.602281},
        year = {1984}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers