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)
Incoming Non-self Citations Over Time
Authors
- 1. Dan E. Willard (Bell Communications Research; State University of New York at Albany)
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.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,788 | Subgraph Enumeration: Beyond Tree Decomposition | 2026 | VLDB | 4.9793485e-05 |
| 14,721 | Quasilinear Algorithms for Processing Relational Calculus Expressions (Preliminary Report) | 1990 | PODS | - |
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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 13,345 | Interpreting a Reconstructed Relational Calculus: Extended Abstract | 1993 | SIGMOD |
| 2 | 12,580 | Efficient Implementation of Generalized Quantification in Relational Query Languages | 2013 | VLDB |
| 3 | 13,933 | A Dichotomy in the Intensional Expressive Power of Nested Relational Calculi augmented with Aggregate Functions and a Powerset Operator | 2013 | PODS |
| 4 | 9,152 | An Effective Syntax for Bounded Relational Queries | 2016 | SIGMOD |
| 5 | 1,898 | Querying Multiple Features of Groups in Relational Databases | 1996 | VLDB |
| 6 | 102 | Efficient Optimization of a Class of Relational Expressions | 1978 | SIGMOD |
| 7 | 421 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS |
| 8 | 1,503 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 9 | 7,292 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD |
| 10 | 14,721 | Quasilinear Algorithms for Processing Relational Calculus Expressions (Preliminary Report) | 1990 | PODS |