Quasilinear Algorithms for Processing Relational Calculus Expressions (Preliminary Report)
Summary: Define RCS, a large subset of relational calculus, and show every RCS query is executable in quasi-linear time O(U + I log^d I) and space O(1+U). The in-memory algorithm builds transient data structures on the fly (no complex indexes), with exponent d typically 0 or 1. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Dan E. Willard (State University of New York at Albany)
BibTeX Citation
@inproceedings{willard_pods90,
address = {New York, NY, USA},
series = {{PODS} '90},
title = {{Quasilinear Algorithms for Processing Relational Calculus Expressions (Preliminary Report)}},
url = {https://dl.acm.org/doi/10.1145/298514.298570},
doi = {10.1145/298514.298570},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Willard, Dan E.},
year = {1990}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 14,482 | EFFICIENT PROCESSING OF RELATIONAL CALCULUS EXPRESSIONS USING RANGE QUERY THEORY (Extended Abstract) | 1984 | SIGMOD | - |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,860 | Querying Multiple Features of Groups in Relational Databases | 1996 | VLDB |
| 2 | 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS |
| 3 | 11,453 | Asymptotically Better Query Optimization Using Indexed Algebra | 2023 | VLDB |
| 4 | 2,198 | A Recursive Algebra and Query Optimization for Nested Relations | 1989 | SIGMOD |
| 5 | 7,120 | An Algorithm For Servicing Multi-Relational Queries | 1977 | SIGMOD |
| 6 | 13,055 | Interpreting a Reconstructed Relational Calculus: Extended Abstract | 1993 | SIGMOD |
| 7 | 7,161 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD |
| 8 | 97 | Efficient Optimization of a Class of Relational Expressions | 1978 | SIGMOD |
| 9 | 1,467 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 10 | 14,482 | EFFICIENT PROCESSING OF RELATIONAL CALCULUS EXPRESSIONS USING RANGE QUERY THEORY (Extended Abstract) | 1984 | SIGMOD |