On the public citation graph
Joins via Geometric Resolutions
0 signed · 105 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.2000.1713openalex-snapshot
Conjunctive-Query Containment and Constraint Satisfaction
inferredcites →https://doi.org/10.1007/3-540-52753-2_37openalex-snapshot
Davis-Putnam resolution versus unrestricted resolution
inferredcites →https://doi.org/10.1007/3-540-63104-6_28openalex-snapshot
SATO: An efficient propositional prover
inferredcites →https://doi.org/10.1007/978-1-4615-9385-0_4openalex-snapshot
A Decomposition Methodology for Cyclic Databases
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/978-3-642-41660-6_17openalex-snapshot
Bounds and Algorithms for Joins via Fractional Edge Covers
inferredcites →https://doi.org/10.1007/bf00396270openalex-snapshot
Maximum antichains in the product of chains
inferredcites →https://doi.org/10.1007/bf01531027openalex-snapshot
Davis-Putnam resolution versus unrestricted resolution
inferredcites →https://doi.org/10.1007/bf02761855openalex-snapshot
On the number of subgraphs of prescribed type of graphs with a given number of edges
inferredcites →https://doi.org/10.1007/bf02780332openalex-snapshot
On the number of copies of one hypergraph in another
inferredcites →https://doi.org/10.1007/s00224-009-9248-9openalex-snapshot
Tractable Structures for Constraint Satisfaction with Truth Tables
inferredcites →https://doi.org/10.1016/0004-3702(89)90037-4openalex-snapshot
Tree clustering for constraint networks
inferredcites →https://doi.org/10.1016/0004-3702(90)90046-3openalex-snapshot
Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
inferredcites →https://doi.org/10.1016/0004-3702(94)90003-5openalex-snapshot
Decomposing constraint satisfaction problems using database techniques
inferredcites →https://doi.org/10.1016/0166-218x(89)90031-0openalex-snapshot
Linear time algorithms for NP-hard problems restricted to partial k-trees
inferredcites →https://doi.org/10.1016/0167-6423(84)90013-3openalex-snapshot
The theory of relational databases
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/0306-4573(85)90108-6openalex-snapshot
Storage and retrieval considerations of binary data bases
inferredcites →https://doi.org/10.1016/b978-0-12-799957-9.00002-xopenalex-snapshot
Database Management Systems
inferredcites →https://doi.org/10.1016/b978-1-4832-1452-8.50109-3openalex-snapshot
Directional Resolution: The Davis-Putnam Procedure, Revisited **This work was partially supported by NSF grant IRI-9157636, by Air Force Office of Scientific Research grant AFOSR 900136, by Toshiba of America, and by a Xerox grant.
inferredcites →https://doi.org/10.1016/s0022-0000(03)00030-8openalex-snapshot
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
inferredcites →https://doi.org/10.1016/s0304-3975(99)00220-0openalex-snapshot
Conjunctive query containment revisited
inferredcites →https://doi.org/10.1093/bioinformatics/bth436openalex-snapshot
Modeling interactome: scale-free or geometric?
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1109/ccc.2006.27openalex-snapshot
Minimizing DNF Formulas and AC^0_d Circuits Given a Truth Table
inferredcites →https://doi.org/10.1109/focs.2008.43openalex-snapshot
Size Bounds and Query Plans for Relational Joins
inferredcites →https://doi.org/10.1109/focs.2009.34openalex-snapshot
Instance-Optimal Geometric Algorithms
inferredcites →https://doi.org/10.1109/focs.2013.51openalex-snapshot
Klee's Measure Problem Made Easy
inferredcites →https://doi.org/10.1109/icdm.2008.72openalex-snapshot
Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws
inferredcites →https://doi.org/10.1126/science.298.5594.824openalex-snapshot
Network Motifs: Simple Building Blocks of Complex Networks
inferredcites →https://doi.org/10.1137/0220065openalex-snapshot
New Upper Bounds in Klee’s Measure Problem
inferredcites →https://doi.org/10.1145/1084805.1084827openalex-snapshot
Query answering exploiting structural properties
inferredcites →https://doi.org/10.1145/1109557.1109590openalex-snapshot
Constraint solving via fractional edge covers
inferredcites →https://doi.org/10.1145/1328911.1328915openalex-snapshot
Alternation and redundancy analysis of the intersection problem
inferredcites →https://doi.org/10.1145/152610.152611openalex-snapshot
Query evaluation techniques for large databases
inferredcites →https://doi.org/10.1145/1721837.1721845openalex-snapshot
Approximating fractional hypertree width
inferredcites →https://doi.org/10.1145/1806689.1806772openalex-snapshot
Towards polynomial lower bounds for dynamic problems
inferredcites →https://doi.org/10.1145/1806689.1806790openalex-snapshot
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
inferredcites →https://doi.org/10.1145/1963405.1963491openalex-snapshot
Counting triangles and the curse of the last reducer
inferredcites →https://doi.org/10.1145/1989323.1989328openalex-snapshot
Design and evaluation of main memory hash join algorithms for multi-core CPUs
inferredcites →https://doi.org/10.1145/211990.212001openalex-snapshot
Multi-table joins through bitmapped join indices
inferredcites →https://doi.org/10.1145/2213556.2213565openalex-snapshot
Worst-Case Optimal Join Algorithms
inferredcites →https://doi.org/10.1145/2402.322390openalex-snapshot
Degrees of acyclicity for hypergraphs and relational database schemes
inferredcites →https://doi.org/10.1145/2499937.2499941openalex-snapshot
Parameterized Complexity of DPLL Search Procedures
inferredcites →https://doi.org/10.1145/253260.253268openalex-snapshot
Improved query performance with variant indexes
inferredcites →https://doi.org/10.1145/2535926openalex-snapshot
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
inferredcites →https://doi.org/10.1145/2594538.2594547openalex-snapshot
Beyond worst-case analysis for joins with minesweeper
inferredcites →https://doi.org/10.1145/263661.263664openalex-snapshot
On the complexity of database queries (extended abstract)
inferredcites →https://doi.org/10.1145/2656335openalex-snapshot
Size Bounds for Factorised Representations of Query Results
inferredcites →https://doi.org/10.1145/2745754.2745771openalex-snapshot
Querying Big Data by Accessing Small Data
inferredcites →https://doi.org/10.1145/2745754.2745776openalex-snapshot
Joins via Geometric Resolutions
inferredcites →https://doi.org/10.1145/275487.275492openalex-snapshot
An overview of query optimization in relational systems
inferredcites →https://doi.org/10.1145/275487.275511openalex-snapshot
Conjunctive-query containment and constraint satisfaction
inferredcites →https://doi.org/10.1145/2764947.2764948openalex-snapshot
Join Processing for Graph Patterns
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/375551.375567openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-131openalex-snapshot
Conflict-Driven Clause Learning SAT Solvers
inferredcites →https://doi.org/10.5441/002/icdt.2014.13openalex-snapshot
Triejoin: A Simple, Worst-Case Optimal Join Algorithm
inferredcites →https://doi.org/10.5555/1109557.1109590openalex-snapshot
Constraint solving via fractional edge covers
inferredcites →https://doi.org/10.5555/1283383.1283415openalex-snapshot
Improved algorithms for path, matching, and packing problems
inferredcites →https://doi.org/10.5555/338219.338634openalex-snapshot
Adaptive set intersections, unions, and differences
inferredcites →https://doi.org/10.5555/545381.545432openalex-snapshot
Adaptive intersection and t-threshold problems
inferredcites →https://doi.org/10.5860/choice.26-5107openalex-snapshot
Principles of database and knowledge-base systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-30793-6_15openalex-snapshot
A Worst-Case Optimal Join Algorithm for SPARQL
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_9openalex-snapshot
Parameterized Aspects of Triangle Enumeration
inferred← citeshttps://doi.org/10.1007/s00778-021-00725-xopenalex-snapshot
A design space for RDF data representations
inferred← citeshttps://doi.org/10.1007/s00778-025-00945-5openalex-snapshot
CompactLTJ: Space & Time Efficient Leapfrog Triejoin on Graph Databases
inferred← citeshttps://doi.org/10.1016/j.is.2025.102647openalex-snapshot
New compressed indices for multijoins on graph databases
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.02.004openalex-snapshot
Parameterized aspects of triangle enumeration
inferred← citeshttps://doi.org/10.1016/j.procs.2021.11.019openalex-snapshot
Instance Optimal Join Size Estimation
inferred← citeshttps://doi.org/10.1109/tkde.2021.3093200openalex-snapshot
A Dual-Store Structure for Knowledge Graphs
inferred← citeshttps://doi.org/10.1145/2213556.2213565openalex-snapshot
Worst-Case Optimal Join Algorithms
inferred← citeshttps://doi.org/10.1145/3196959.3196960openalex-snapshot
In-Database Learning with Sparse Tensors
inferred← citeshttps://doi.org/10.1145/3318464.3383132openalex-snapshot
Optimal Join Algorithms Meet Top-k
inferred← citeshttps://doi.org/10.1145/3448016.3457256openalex-snapshot
Worst-Case Optimal Graph Joins in Almost No Space
inferred← citeshttps://doi.org/10.1145/3517804.3524156openalex-snapshot
The Complexity of Boolean Conjunctive Queries with Intersection Joins
inferred← citeshttps://doi.org/10.1145/3633512openalex-snapshot
Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation
inferred← citeshttps://doi.org/10.1145/3644824openalex-snapshot
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space
inferred← citeshttps://doi.org/10.1145/3653314openalex-snapshot
Tackling Challenges in Implementing Large-Scale Graph Databases
inferred← citeshttps://doi.org/10.1145/3661304.3661898openalex-snapshot
Space & Time Efficient Leapfrog Triejoin
inferred← citeshttps://doi.org/10.1145/3709665openalex-snapshot
BⓈ X : Subgraph Matching with Batch Backtracking Search
inferred← citeshttps://doi.org/10.1145/3734517openalex-snapshot
Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/3788852.3805595openalex-snapshot
Query Optimization and Evaluation via Information Theory
inferred← citeshttps://doi.org/10.1145/3810460.3812779openalex-snapshot
Boosting Graph Joins and Matrix Multiplications in Little Space
inferred← citeshttps://doi.org/10.14778/3407790.3407797openalex-snapshot
Adopting worst-case optimal joins in relational database systems
inferred← citeshttps://doi.org/10.14778/3579075.3579090openalex-snapshot
High-Performance Row Pattern Recognition Using Joins
inferred← citeshttps://doi.org/10.14778/3659437.3659454openalex-snapshot
Rapidash: Efficient Detection of Constraint Violations
inferred← citeshttps://doi.org/10.14778/3742728.3742756openalex-snapshot
Is Integer Linear Programming All You Need for Deletion Propagation? A Unified and Practical Approach for Generalized Deletion Propagation
inferred← citeshttps://doi.org/10.17760/d20316246openalex-snapshot
Any-k evaluation of conjunctive queries and its application to graph pattern matching
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.97openalex-snapshot
Relational Algorithms for k-Means Clustering
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2020.21openalex-snapshot
Optimal Joins Using Compact Data Structures
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2021.3openalex-snapshot
Box Covers and Domain Orderings for Beyond Worst-Case Join Processing
inferred← citeshttps://doi.org/10.48550/arxiv.1803.09930openalex-snapshot
Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1811.08181openalex-snapshot
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
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.