Efficient Approximations of Conjunctive Queries

DOI10.1137/130911731zbMath1308.68052OpenAlexW1969276117MaRDI QIDQ3190694

Miguel Romero, Pablo Barceló, Leonid O. Libkin

Publication date: 18 September 2014

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/135310

zbMATH Keywords

approximationhomomorphismsgraphshypergraphsconjunctive queries

Mathematics Subject Classification ID

Database theory (68P15) Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

Semantic Acyclicity on Graph Databases ⋮ A More General Theory of Static Approximations for Conjunctive Queries ⋮ Answer Counting under Guarded TGDs ⋮ Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints ⋮ A more general theory of static approximations for conjunctive queries

This page was built for publication: Efficient Approximations of Conjunctive Queries