On the complexity of query answering over incomplete XML documents

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 169-181

  Gheerbrant, Amélie ^a   Libkin, Leonid ^a   Tan, Tony ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Certain answers; Closed world semantics; Incomplete information; Open world semantics; Query answering; XML

Indexed keywords

BOOLEAN COMBINATIONS; CERTAIN ANSWERS; CLOSED WORLD ASSUMPTION; COMBINED COMPLEXITY; CONJUNCTIVE QUERIES; DATA COMPLEXITY; DATA VALUES; EFFICIENT COMPUTATION; EVALUATION ALGORITHM; HIERARCHICAL STRUCTURES; INCOMPLETE INFORMATION; OPEN WORLD ASSUMPTION; QUERY ANSWERING; RELATIONAL CALCULUS; STRUCTURAL INFORMATION; TRACTABLE CLASS;

QUERY LANGUAGES; SEMANTICS;

XML;

EID: 84863902592     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2274576.2274595     Document Type: Conference Paper

References (28)

1. S. Abiteboul, P. Buneman, D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kauffman, 1999.
2. S. Abiteboul, O. Duschka. Complexity of answering queries using materialized views. In PODS 1998, pages 254-263.
3. S. Abiteboul, P Kanellakis, and G. Grahne. On the representation and querying of sets of possible worlds. TCS, 78(1):158-187, 1991.
4. S. Abiteboul, L. Segoufin, and V. Vianu. Representing and querying XML with incomplete information. ACM TODS, 31(1):208-254, 2006.
5. A. V. Aho, M. Corasick. Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6):333-340 (1975).
6. L. Antova, T. Jansen, C. Koch, D. Olteanu. Fast and simple relational processing of uncertain data. In ICDE'08, pages 983-992.
7. M. Arenas, P. Barceló, L. Libkin, F. Murlak. Relational and XML Data Exchange. Morgan & Claypool, 2010.
8. M. Arenas and L. Libkin. XML data exchange: consistency and query answering. J. ACM, 55 (2), 2008.
9. P. Barceló, L. Libkin, A. Poggi, C. Sirangelo. XML with incomplete information. J. ACM, 58:1 (2010).
10. H. Björklund, W. Martens, and T. Schwentick. Conjunctive query containment over trees. J. Comput. Syst. Sci. 77(3): 450-472 (2011).
11. A. Calì, D. Lembo, and R. Rosati. On the decidability and complexity of query answering over inconsistent and incomplete databases. In PODS'03, pages 260-271.
12. D. Calvanese, G. De Giacomo, M. Lenzerini. Semi-structured data with constraints and incomplete information. In Description Logics, 1998.
13. D. Calvanese, G. De Giacomo, M. Lenzerini. Representing and reasoning on XML documents: a description logic approach. J. Log. Comput. 9 (1999), 295-318.
14. M. Crochemore, W. Rytter. Jewels of Stringology: Text Algorithms. World Scientific 2002.
15. C. David, L. Libkin, F. Murlak. Certain answers for XML queries. In PODS 2010, pages 191-202.
16. T. Eiter, G. Gottlob, H. Mannila. Disjunctive datalog. ACM Trans. Database Syst. 22(3):364-418 (1997).
17. G. Gottlob, C. Koch, and K. Schulz. Conjunctive queries over trees. J. ACM 53(2):238-272, 2006.
18. G. Grahne. The Problem of Incomplete Information in Relational Databases. Springer, 1991.
19. T. Imieliński and W. Lipski. Incomplete information in relational databases. J. ACM, 31(4):761-791, 1984.
20. B. Kimelfeld, Y. Sagiv. Modeling and querying probabilistic XML data. SIGMOD Record 37(4): 69-77 (2008).
21. M. Lenzerini. Data integration: a theoretical perspective. In PODS'02, pages 233-246.
22. L. Libkin. Incomplete information and certain answers in general data models. In PODS'11, pages 59-70.
23. R. Pinter. Efficient string matching with don't-care patterns. In Combinatorial ALgorithms on Words, NATO ASI Series, 1985.
24. R. Reiter. On closed world databases. In "Logic and Databases", H. Gallaire and J. Minker eds, Plenum Press, 1978, pages 55-76.
25. R. Rosati. On the finite controllability of conjunctive query answering in databases under open-world assumption. J. Comput. Syst. Sci. 77(3):572-594 (2011).
26. P. Silvasti, S. Sippu, E. Soisalon-Soininen. Evaluating linear XPath expressions by pattern-matching automata. J. UCS 16(5):833-851 (2010).
27. D. Suciu, D. Olteanu, C. Re, C. Koch. Probabilistic Databases. Morgan & Claypool, 2011.
28. R. van der Meyden. The complexity of querying indefinite data about linearly ordered domains. J. Comput. Syst. Sci. 54(1): 113-135 (1997).