On the public citation graph
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration
0 signed · 58 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.1007/978-3-540-74915-8_18openalex-snapshot
On Acyclic Conjunctive Queries and Constant Delay Enumeration
inferredcites →https://doi.org/10.1007/bf02523189openalex-snapshot
Finding and counting given length cycles
inferredcites →https://doi.org/10.1007/s00224-019-09937-9openalex-snapshot
Enumeration Complexity of Conjunctive Queries with Functional Dependencies
inferredcites →https://doi.org/10.1016/0020-0190(77)90031-xopenalex-snapshot
Preserving order in a forest in less than logarithmic time and linear space
inferredcites →https://doi.org/10.1016/0196-6774(89)90038-2openalex-snapshot
Monte-Carlo approximation algorithms for enumeration problems
inferredcites →https://doi.org/10.1016/j.dam.2018.06.038openalex-snapshot
Incremental delay enumeration: Space and time
inferredcites →https://doi.org/10.1016/j.jcss.2013.01.012openalex-snapshot
Tractable counting of the answers to conjunctive queries
inferredcites →https://doi.org/10.1109/focs.2014.53openalex-snapshot
Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems
inferredcites →https://doi.org/10.1137/1.9781611975031.80openalex-snapshot
Tight Hardness for Shortest Cycles and Paths in Sparse Graphs
inferredcites →https://doi.org/10.1137/110859440openalex-snapshot
Size Bounds and Query Plans for Relational Joins
inferredcites →https://doi.org/10.1145/1077464.1077466openalex-snapshot
Fast sparse matrix multiplication
inferredcites →https://doi.org/10.1145/1376616.1376708openalex-snapshot
Keyword proximity search in complex data graphs
inferredcites →https://doi.org/10.1145/1514894.1514909openalex-snapshot
Faster join-projects and sparse matrix multiplications
inferredcites →https://doi.org/10.1145/2213977.2214056openalex-snapshot
Multiplying matrices faster than coppersmith-winograd
inferredcites →https://doi.org/10.1145/2402.322390openalex-snapshot
Degrees of acyclicity for hypergraphs and relational database schemes
inferredcites →https://doi.org/10.1145/2608628.2608664openalex-snapshot
Powers of tensors and fast matrix multiplication
inferredcites →https://doi.org/10.1145/2656335openalex-snapshot
Size Bounds for Factorised Representations of Query Results
inferredcites →https://doi.org/10.1145/3035918.3064027openalex-snapshot
The Dynamic Yannakakis Algorithm
inferredcites →https://doi.org/10.1145/304181.304207openalex-snapshot
Join synopses for approximate query answering
inferredcites →https://doi.org/10.1145/304181.304208openalex-snapshot
Ripple joins for online aggregation
inferredcites →https://doi.org/10.1145/304182.304207openalex-snapshot
Join synopses for approximate query answering
inferredcites →https://doi.org/10.1145/304182.304208openalex-snapshot
Ripple joins for online aggregation
inferredcites →https://doi.org/10.1145/3183713.3183739openalex-snapshot
Random Sampling over Joins Revisited
inferredcites →https://doi.org/10.1145/3277006.3277009openalex-snapshot
A Relational Framework for Classifier Engineering
inferredcites →https://doi.org/10.1145/3294052.3319700openalex-snapshot
On the Enumeration Complexity of Unions of Conjunctive Queries
inferredcites →https://doi.org/10.1145/3318464.3380607openalex-snapshot
Fast Join Project Query Evaluation using Matrix Multiplication
inferredcites →https://doi.org/10.1145/3375661openalex-snapshot
Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies
inferredcites →https://doi.org/10.1145/3385634.3385636openalex-snapshot
Constant delay enumeration for conjunctive queries
inferredcites →https://doi.org/10.1145/3452021.3458331openalex-snapshot
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries
inferredcites →https://doi.org/10.1145/364520.364540openalex-snapshot
Algorithm 235: Random permutation
inferredcites →https://doi.org/10.1145/502512.502568openalex-snapshot
A streaming ensemble algorithm (SEA) for large-scale classification
inferredcites →https://doi.org/10.1145/602220.602222openalex-snapshot
Query evaluation via tree-decompositions
inferredcites →https://doi.org/10.14778/3397230.3397250openalex-snapshot
Optimal algorithms for ranked enumeration of answers to full conjunctive queries
inferredcites →https://doi.org/10.4230/lipics.csl.2011.189openalex-snapshot
Enumeration Complexity of Logical Query Problems with Second-order Variables
inferredcites →https://doi.org/10.4230/lipics.icdt.2018.8openalex-snapshot
Answering UCQs under Updates and in the Presence of Integrity Constraints
inferredcites →https://doi.org/10.4230/lipics.icdt.2020.7openalex-snapshot
Random Sampling and Size Estimation Over Cyclic Joins
inferredcites →https://doi.org/10.46298/lmcs-21(2:14)2025openalex-snapshot
Ranked Enumeration of Conjunctive Query Results
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00778-025-00916-wopenalex-snapshot
Threshold queries in theory and in the wild
inferred← citeshttps://doi.org/10.1007/s00778-026-00997-1openalex-snapshot
Static and streaming algorithms for random sampling over spatial range joins
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00158openalex-snapshot
Random Sampling Over Spatial Range Joins
inferred← citeshttps://doi.org/10.1145/3375395.3389130openalex-snapshot
Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration
inferred← citeshttps://doi.org/10.1145/3584372.3588666openalex-snapshot
On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms
inferred← citeshttps://doi.org/10.1145/3584372.3588670openalex-snapshot
Efficient Computation of Quantiles over Joins
inferred← citeshttps://doi.org/10.1145/3651614openalex-snapshot
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity
inferred← citeshttps://doi.org/10.1145/3685980.3685982openalex-snapshot
Tractable Circuits in Database Theory
inferred← citeshttps://doi.org/10.1145/3717823.3718141openalex-snapshot
A Fine-Grained Classification of Subquadratic Patterns for Subgraph Listing and Friends
inferred← citeshttps://doi.org/10.1145/3725242openalex-snapshot
Output-Sensitive Evaluation of Regular Path Queries
inferred← citeshttps://doi.org/10.1145/3725252openalex-snapshot
The Complexity of Maximal Common Subsequence Enumeration
inferred← citeshttps://doi.org/10.1145/3771726openalex-snapshot
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity
inferred← citeshttps://doi.org/10.14778/3611540.3611602openalex-snapshot
Approximate Queries over Concurrent Updates
inferred← citeshttps://doi.org/10.1609/icaps.v34i1.31500openalex-snapshot
Incremental Ordering for Scheduling Problems
inferred← citeshttps://doi.org/10.46298/lmcs-21(3:9)2025openalex-snapshot
Learning Concepts Definable in First-Order Logic with Counting
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.