On the public citation graph
Weighted hypertree decompositions and optimal query plans
0 signed · 60 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.1999.1626openalex-snapshot
On the Complexity of Database Queries
inferredcites →https://doi.org/10.1006/jcss.2000.1713openalex-snapshot
Conjunctive-Query Containment and Constraint Satisfaction
inferredcites →https://doi.org/10.1006/jcss.2001.1809openalex-snapshot
Hypertree Decompositions and Tractable Queries
inferredcites →https://doi.org/10.1007/11604686_1openalex-snapshot
Hypertree Decompositions: Structure, Algorithms, and Applications
inferredcites →https://doi.org/10.1007/3-540-08353-7_172openalex-snapshot
Time and tape bounded auxiliary pushdown automata
inferredcites →https://doi.org/10.1007/978-3-540-24741-8_26openalex-snapshot
Projection Pushing Revisited
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/0022-0000(80)90036-7openalex-snapshot
Tree-size bounded alternation
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/0898-1221(95)90258-9openalex-snapshot
Foundations of databases
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot
A Catalog of Complexity Classes
inferredcites →https://doi.org/10.1016/c2013-0-07691-8openalex-snapshot
The Handbook of Artificial Intelligence
inferredcites →https://doi.org/10.1016/s0004-3702(00)00078-3openalex-snapshot
A comparison of structural CSP decomposition methods
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(01)00108-6openalex-snapshot
Computing LOGCFL certificates
inferredcites →https://doi.org/10.1016/s0304-3975(99)00220-0openalex-snapshot
Conjunctive query containment revisited
inferredcites →https://doi.org/10.1109/icde.2007.367849openalex-snapshot
Hypertree Decompositions for Query Optimization
inferredcites →https://doi.org/10.1109/sfcs.2003.1238228openalex-snapshot
The complexity of homomorphism and constraint satisfaction problems seen from the other side
inferredcites →https://doi.org/10.1109/tai.2003.1250227openalex-snapshot
Reducing redundancy in the hypertree decomposition scheme
inferredcites →https://doi.org/10.1145/2402.322389openalex-snapshot
On the Desirability of Acyclic Database Schemes
inferredcites →https://doi.org/10.1145/263661.263664openalex-snapshot
On the complexity of database queries (extended abstract)
inferredcites →https://doi.org/10.1145/275487.275511openalex-snapshot
Conjunctive-query containment and constraint satisfaction
inferredcites →https://doi.org/10.1145/275487.275516openalex-snapshot
Complexity of answering queries using materialized views
inferredcites →https://doi.org/10.1145/3149.3158openalex-snapshot
A complexity theory based on Boolean algebra
inferredcites →https://doi.org/10.1145/335168.335209openalex-snapshot
Constraint satisfaction and database theory
inferredcites →https://doi.org/10.1145/380752.380867openalex-snapshot
When is the evaluation of conjunctive queries tractable?
inferredcites →https://doi.org/10.1145/382780.382783openalex-snapshot
The complexity of acyclic conjunctive queries
inferredcites →https://doi.org/10.1145/4221.4225openalex-snapshot
A sufficient condition for backtrack-bounded search
inferredcites →https://doi.org/10.1145/602220.602222openalex-snapshot
Query evaluation via tree-decompositions
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.1145/800105.803397openalex-snapshot
Optimal implementation of conjunctive queries in relational data bases
inferredcites →https://doi.org/10.5860/choice.26-5107openalex-snapshot
Principles of database and knowledge-base systems
inferredcites →https://doi.org/10.5860/choice.35-2165openalex-snapshot
The Computer science and engineering handbook
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-319-61893-7_15openalex-snapshot
Structural Decomposition Methods: Key Notions and Database Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_22openalex-snapshot
Optimizing the Distributed Evaluation of Stratified Programs via Structural Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-32741-4_27openalex-snapshot
Optimizing the Resource Allocation for Approximate Query Processing
inferred← citeshttps://doi.org/10.1007/978-3-642-33203-6_15openalex-snapshot
Distributed Ontology Based Data Access via Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-40564-8_17openalex-snapshot
Towards Query Answering in Relational Multi-Context Systems
inferred← citeshttps://doi.org/10.1016/j.ins.2026.124270openalex-snapshot
Conflict hypergraphs for distinguishing feature selection: Structural limits and exact optimization
inferred← citeshttps://doi.org/10.1137/16m1090272openalex-snapshot
The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1145/1412228.1412229openalex-snapshot
A backtracking-based algorithm for hypertree decomposition
inferred← citeshttps://doi.org/10.1145/1804669.1804692openalex-snapshot
A greedy algorithm for constructing a low-width generalized hypertree decomposition
inferred← citeshttps://doi.org/10.1145/2508028.2505987openalex-snapshot
Decomposing combinatorial auctions and set packing problems
inferred← citeshttps://doi.org/10.13126/unical.it/dottorati/1364openalex-snapshot
Constraint satisfaction: algorithms, complexity results, and applications
inferred← citeshttps://doi.org/10.1613/jair.1.13661openalex-snapshot
Threshold Treewidth and Hypertree Width
inferred← citeshttps://doi.org/10.2298/csis120825063yopenalex-snapshot
Optimizing resource allocation for approximate real-time query processing
inferred← citeshttps://doi.org/10.24963/ijcai.2020/263openalex-snapshot
Threshold Treewidth and Hypertree Width
inferred← citeshttps://doi.org/10.24963/ijcai.2023/377openalex-snapshot
Enhancing Datalog Reasoning with Hypertree Decompositions
inferred← citeshttps://doi.org/10.48550/arxiv.1611.01090openalex-snapshot
General and Fractional Hypertree Decompositions: Hard and Easy Cases
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.