ACM Home Page
Please provide us with feedback. Feedback
Representing and querying XML with incomplete information
Full text PdfPdf (686 KB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 31 ,  Issue 1  (March 2006) table of contents
Pages: 208 - 254  
Year of Publication: 2006
ISSN:0362-5915
Authors
Serge Abiteboul  INRIA-Futurs, Orsay, Orsay Cedex, France
Luc Segoufin  INRIA-Futurs, Orsay, Orsay Cedex, France
Victor Vianu  University of California, San Diego
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 89,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1132863.1132869
What is a DOI?

ABSTRACT

We study the representation and querying of XML with incomplete information. We consider a simple model for XML data and their DTDs, a very simple query language, and a representation system for incomplete information in the spirit of the representations systems developed by Imielinski and Lipski [1984] for relational databases. In the scenario we consider, the incomplete information about an XML document is continuously enriched by successive queries to the document. We show that our representation system can represent partial information about the source document acquired by successive queries, and that it can be used to intelligently answer new queries. We also consider the impact on complexity of enriching our representation system or query language with additional features. The results suggest that our approach achieves a practically appealing balance between expressiveness and tractability.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
 
4
5
6
 
7
Balmin, A., Ozcan, F., Beyer, K., Cochrane, R., and Pirahesh, H. 2004. A framework for using materialized XPath views in XML query processing. In Proceedings of the International Conference on Very Large Data Bases (VLDB).
 
8
 
9
Bose, S. and Fegaras, L. 2005. XFrag: A query processing framework for fragmented XML data. In Proceedings of the WebDB.
 
10
Bruggemann-Klein, M.Murata, A., and Wood, D. 1998. Regular tree languages over non-ranked alphabets. Unpublished manuscript.
 
11
Calvanese, D., De Giacomo, G., and Lenzerini, M. 1998. Semi-structured data with constraints and incomplete information. In Proceedings of the Description Logic Workshop (DL'98). 11--20.
12
 
13
14
15
 
16
17
 
18
Codd, T. 1975. Understanding relations (installment #7). FDT Bull. of ACM Sigmod 7. 23--28.
 
19
 
20
Flesca, S., Furfaro1, F., Greco, S., and Zumpano, E. 2003. Repairs and consistent answers for xml data with functional dependencies. In Proceedings of the International XML Database Symposium. 238--253.
 
21
 
22
23
 
24
Honeyman, P., Ladner, R., and Yannakakis, M. 1980. Testing the universal instance assumption. Information Processing Letters 10, 1, 14--19.
 
25
26
27
28
29
30
 
31
32
33
34
 
35
36
37
38
 
39
Schwentick, T. 2000. Personal communication.
 
40
Stockmeier, L. 1974. The complexity of decision problems in automata theory and logic. Ph.D. thesis. Report MAC TR-133, Project MAC. Massachusetts Institute of Technology.
41
42
 
43
Zaniolo, C. 1984. Database relations with null values. J. Comput. Syst. Sci. 28, 1, 142--166.

CITED BY  8

Collaborative Colleagues:
Serge Abiteboul: colleagues
Luc Segoufin: colleagues
Victor Vianu: colleagues