On the public citation graph
An Algorithm for Handling Many Relational Calculus Queries Efficiently
0 signed · 78 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcss.1996.0012openalex-snapshot
Applications of Range Query Theory to Relational Data Base Join and Selection Operations
inferredcites →https://doi.org/10.1006/jcss.1999.1626openalex-snapshot
On the Complexity of Database Queries
inferredcites →https://doi.org/10.1007/3-540-46439-5_11openalex-snapshot
Aggregate Aware Caching for Multi-dimensional Queries
inferredcites →https://doi.org/10.1007/978-0-387-35264-0openalex-snapshot
Algorithmic Languages and Calculi
inferredcites →https://doi.org/10.1007/978-1-4615-9385-0_7openalex-snapshot
Applications of Finite Differencing to Database Integrity Control and Query/Transaction Optimization
inferredcites →https://doi.org/10.1007/bf00263763openalex-snapshot
Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
inferredcites →https://doi.org/10.1007/bf00263991openalex-snapshot
Efficient worst-case data structures for range searching
inferredcites →https://doi.org/10.1007/bf01840440openalex-snapshot
Fractional cascading: I. A data structuring technique
inferredcites →https://doi.org/10.1007/bf02241781openalex-snapshot
Two general methods for dynamizing decomposable searching problems
inferredcites →https://doi.org/10.1007/bfb0014927openalex-snapshot
The Design of Dynamic Data Structures
inferredcites →https://doi.org/10.1016/0020-0190(82)90119-3openalex-snapshot
A data structure for dynamic range queries
inferredcites →https://doi.org/10.1016/0022-0000(93)90040-4openalex-snapshot
Surpassing the information theoretic bound with fusion trees
inferredcites →https://doi.org/10.1016/0196-6774(80)90015-2openalex-snapshot
Decomposable searching problems I. Static-to-dynamic transformation
inferredcites →https://doi.org/10.1016/0890-5401(89)90064-3openalex-snapshot
Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems
inferredcites →https://doi.org/10.1016/s0747-7171(87)80066-4openalex-snapshot
Mechanical translation of set theoretic problem specifications into efficient RAM code-A case study
inferredcites →https://doi.org/10.1038/scientificamerican0984-60openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferredcites →https://doi.org/10.1137/0210001openalex-snapshot
Lower Bounds on the Complexity of Some Optimal Data Structures
inferredcites →https://doi.org/10.1137/0214019openalex-snapshot
New Data Structures for Orthogonal Range Queries
inferredcites →https://doi.org/10.1137/0214022openalex-snapshot
On the Complexity of Maintaining Partial Sums
inferredcites →https://doi.org/10.1137/0215051openalex-snapshot
Filtering Search: A New Approach to Query-Answering
inferredcites →https://doi.org/10.1137/0217026openalex-snapshot
A Functional Approach to Data Structures and Its Use in Multidimensional Searching
inferredcites →https://doi.org/10.1137/s0097539797322425openalex-snapshot
Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
inferredcites →https://doi.org/10.1145/102782.102786openalex-snapshot
Optimal sample cost residues for differential database batch query problems
inferredcites →https://doi.org/10.1145/10515.10524openalex-snapshot
On the application of shared retrieval to orthogonal range queries
inferredcites →https://doi.org/10.1145/155271.155277openalex-snapshot
Solving queries by tree projections
inferredcites →https://doi.org/10.1145/2157.322405openalex-snapshot
Syntactic Characterization of Tree Database Schemas
inferredcites →https://doi.org/10.1145/22145.22164openalex-snapshot
Space-time tradeoffs for orthogonal range queries
inferredcites →https://doi.org/10.1145/233269.233333openalex-snapshot
Implementing data cubes efficiently
inferredcites →https://doi.org/10.1145/233269.233334openalex-snapshot
Providing better support for a class of decision support queries
inferredcites →https://doi.org/10.1145/2402.322389openalex-snapshot
On the Desirability of Acyclic Database Schemes
inferredcites →https://doi.org/10.1145/2402.322390openalex-snapshot
Degrees of acyclicity for hypergraphs and relational database schemes
inferredcites →https://doi.org/10.1145/253260.253274openalex-snapshot
Range queries in OLAP data cubes
inferredcites →https://doi.org/10.1145/253260.253277openalex-snapshot
Maintenance of data cubes and summary tables in a warehouse
inferredcites →https://doi.org/10.1145/253260.253288openalex-snapshot
An array-based algorithm for simultaneous multidimensional aggregates
inferredcites →https://doi.org/10.1145/253262.253274openalex-snapshot
Range queries in OLAP data cubes
inferredcites →https://doi.org/10.1145/276304.276328openalex-snapshot
Caching multidimensional queries using chunks
inferredcites →https://doi.org/10.1145/276305.276328openalex-snapshot
Caching multidimensional queries using chunks
inferredcites →https://doi.org/10.1145/304182.304214openalex-snapshot
Bottom-up computation of sparse and Iceberg CUBE
inferredcites →https://doi.org/10.1145/306101.306137openalex-snapshot
The Asilomar report on database research
inferredcites →https://doi.org/10.1145/31846.42228openalex-snapshot
Multidimensional search trees that provide new types of memory reductions
inferredcites →https://doi.org/10.1145/322234.322238openalex-snapshot
Using Semi-Joins to Solve Relational Queries
inferredcites →https://doi.org/10.1145/322276.322281openalex-snapshot
A Lower Bound on the Complexity of Orthogonal Range Queries
inferredcites →https://doi.org/10.1145/322307.322311openalex-snapshot
On the Equivalence of Database Models
inferredcites →https://doi.org/10.1145/335191.335390openalex-snapshot
Answering complex SQL queries using automatic summary tables
inferredcites →https://doi.org/10.1145/342009.335390openalex-snapshot
Answering complex SQL queries using automatic summary tables
inferredcites →https://doi.org/10.1145/358841.358850openalex-snapshot
Multidimensional divide-and-conquer
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/3828.3839openalex-snapshot
Adding range restriction capability to dynamic data structures
inferredcites →https://doi.org/10.1145/41625.41633openalex-snapshot
Binding performance at language design time
inferredcites →https://doi.org/10.1145/602259.602281openalex-snapshot
Efficient processing of relational calculus expressions using range query theory
inferredcites →https://doi.org/10.1145/77600.77614openalex-snapshot
Lower bounds for orthogonal range searching: I. The reporting case
inferredcites →https://doi.org/10.1145/800076.802489openalex-snapshot
Properties of acyclic database schemes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10990-011-9078-8openalex-snapshot
Generic multiset programming with discrimination-based joins and symbolic Cartesian products
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.09.004openalex-snapshot
Intersection joins under updates
inferred← citeshttps://doi.org/10.1017/s1079898600004066openalex-snapshot
2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
inferred← citeshttps://doi.org/10.1109/focs.2014.53openalex-snapshot
Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems
inferred← citeshttps://doi.org/10.1145/1142351.1142384openalex-snapshot
Scalable computation of acyclic joins
inferred← citeshttps://doi.org/10.1145/1706356.1706372openalex-snapshot
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
inferred← citeshttps://doi.org/10.1145/1863495.1863503openalex-snapshot
Generic multiset programming for language-integrated querying
inferred← citeshttps://doi.org/10.1145/2213556.2213565openalex-snapshot
Worst-Case Optimal Join Algorithms
inferred← citeshttps://doi.org/10.1145/2384616.2384645openalex-snapshot
From clarity to efficiency for distributed algorithms
inferred← citeshttps://doi.org/10.1145/2398857.2384645openalex-snapshot
From clarity to efficiency for distributed algorithms
inferred← citeshttps://doi.org/10.1145/2594538.2594547openalex-snapshot
Beyond worst-case analysis for joins with minesweeper
inferred← citeshttps://doi.org/10.1145/2994595openalex-snapshot
From Clarity to Efficiency for Distributed Algorithms
inferred← citeshttps://doi.org/10.1145/3514221.3517830openalex-snapshot
Conjunctive Queries with Comparisons
inferred← citeshttps://doi.org/10.1145/3604437.3604450openalex-snapshot
Conjunctive Queries with Comparisons
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.