Certain answers over incomplete XML documents: extending tractability boundary

DOI10.1007/s00224-014-9596-yzbMath1352.68081OpenAlexW2169083729MaRDI QIDQ269320

Amélie Gheerbrant, Leonid O. Libkin

Publication date: 18 April 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/19964150/tocs.pdf

zbMATH Keywords

XMLcomplexityincomplete informationquery answering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Related Items (2)

Certain answers as objects and knowledge ⋮ Negative Knowledge for Certain Query Answers

Uses Software

• Datalog

Cites Work

• Conjunctive query containment over trees
• On the finite controllability of conjunctive query answering in databases under open-world assumption
• The complexity of querying indefinite data about linearly ordered domains
• On the representation and querying of sets of possible worlds
• The problem of incomplete information in relational databases
• XML with incomplete information
• Conjunctive queries over trees
• XML data exchange
• Incomplete Information in Relational Databases
• Equivalences Among Relational Expressions with the Union and Difference Operators
• Representing and reasoning on XML documents: a description logic approach

This page was built for publication: Certain answers over incomplete XML documents: extending tractability boundary