Conjunctive queries over trees
From MaRDI portal
Publication:3546316
DOI10.1145/1131342.1131345zbMATH Open1326.68110OpenAlexW2063039776WikidataQ59259658 ScholiaQ59259658MaRDI QIDQ3546316FDOQ3546316
Authors: Georg Gottlob, Christoph Koch, K. U. Schulz 
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://infoscience.epfl.ch/record/166880/files/56-pods2004_159.pdf
Recommendations
- Conjunctive query containment over trees
- Between tree patterns and conjunctive queries: is there tractability beyond acyclicity?
- Optimizing Conjunctive Queries over Trees Using Schema Information
- Conjunctive query containment over trees using schema information
- When is the evaluation of conjunctive queries tractable?
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Database theory (68P15) Logic in computer science (03B70)
Cited In (33)
- Many Facets of Dualities
- When is the evaluation of conjunctive queries tractable?
- Certain answers over incomplete XML documents: extending tractability boundary
- Highly expressive query languages for unordered data trees
- Compact Representation for Answer Sets of n-ary Regular Queries
- Conjunctive query evaluation by search-tree revisited
- Dominance constraints in stratified context unification
- Conjunctive query containment over trees
- Tractable XML data exchange via relations
- Title not available (Why is that?)
- Automata for XML -- a survey
- Data complexity of query answering in expressive description logics via tableaux
- Title not available (Why is that?)
- Finding tree patterns consistent with positive and negative examples using queries
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
- Characterizing tractability of simple well-designed pattern trees with projection
- Efficient enumeration for conjunctive queries over X-underbar structures
- Querying linguistic trees
- Querying regular graph patterns
- Conjunctive query containment over trees using schema information
- Forward node-selecting queries over trees
- Complexity of Data Tree Patterns over XML Documents
- Optimizing Conjunctive Queries over Trees Using Schema Information
- Static analysis and query answering for incomplete data trees with constraints
- An analysis of fixed-point queries on binary trees
- Dynamic LCA Queries on Trees
- Characterizing XML twig queries with examples
- XML schema mappings, data exchange and metadata management
- Compact representation for answer sets of \(n\)-ary regular queries
- Interpreting Tree-to-Tree Queries
- Some modal aspects of XPath
- Between tree patterns and conjunctive queries: is there tractability beyond acyclicity?
- Solutions in XML data exchange
This page was built for publication: Conjunctive queries over trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546316)
