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
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,281 | 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 | Pagerank |
|---|---|---|---|---|
| 1,754 | Querying Multiple Features of Groups in Relational Databases | 1996 | VLDB | 0.00010670609 |
| 431 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00023370207 |
| 11,254 | Asymptotically Better Query Optimization Using Indexed Algebra | 2023 | VLDB | 4.1945683e-05 |
| 2,110 | A Recursive Algebra and Query Optimization for Nested Relations | 1989 | SIGMOD | 9.5315487e-05 |
| 6,686 | An Algorithm For Servicing Multi-Relational Queries | 1977 | SIGMOD | 4.9624102e-05 |
| 12,861 | Interpreting a Reconstructed Relational Calculus: Extended Abstract | 1993 | SIGMOD | 4.1945683e-05 |
| 7,162 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD | 4.8132423e-05 |
| 58 | Efficient Optimization of a Class of Relational Expressions | 1978 | SIGMOD | 0.00064826446 |
| 915 | The Complexity of Evaluating Relational Queries | 1983 | PODS | 0.0001538509 |
| 14,281 | EFFICIENT PROCESSING OF RELATIONAL CALCULUS EXPRESSIONS USING RANGE QUERY THEORY (Extended Abstract) | 1984 | SIGMOD | - |