Representing and querying XML with incomplete information

被引:39
作者
Abiteboul, Serge
Segoufin, Luc
Vianu, Victor
机构
[1] INRIA Futurs, Orsay, France
[2] Univ Calif San Diego, San Diego, CA 92103 USA
来源
ACM TRANSACTIONS ON DATABASE SYSTEMS | 2006年 / 31卷 / 01期
关键词
design; theory; incomplete information; XML;
D O I
10.1145/1132863.1132869
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:208 / 254
页数:47
相关论文
共 42 条
[1]   ON THE REPRESENTATION AND QUERYING OF SETS OF POSSIBLE WORLDS [J].
ABITEBOUL, S ;
KANELLAKIS, P ;
GRAHNE, G .
THEORETICAL COMPUTER SCIENCE, 1991, 78 (01) :159-187
[2]  
ABITEBOUL S., 2004, P ACM SIGMOD INT C M, P227
[3]  
ABITEBOUL S, 1998, P ACM SIGMOD SIGACT
[4]  
Abiteboul S., 1995, Foundations of databases, V1st
[5]  
ABITEBOUL S, 2001, P ACM SIGMOD SIGACT
[6]  
AMERYAHIA S, 2001, P ACM SIGMOD S MAN D
[7]  
[Anonymous], P INT ACM SPEC INT G
[8]  
BALMIN A., 2004, P INT C VER LARG DAT
[9]  
BEERI C, 1999, P INT C DAT THEOR IC
[10]  
BOSE S, 2005, P WEBDB