Algorithms for Generating XML Documents from Probabilistic XML

Article Preview

Abstract:

Uncertain relational data management has been investigated for a few years, but few works on uncertain XML. The natural structures with high flexibility make XML more appropriate for representing uncertain information. Based on the semantic of possible world and probabilistic models with independent distribution and mutual exclusive distribution nodes, the problem of how to generate instance from a probabilistic XML and calculate its probability was studied, which is one of the key problems of uncertain XML management. Moreover, an algorithm for a generating XML document from a probabilistic XML and calculating its probability are also proposed, which has linear time complexity. Finally, experiment results are made to show up the correct and efficiency of the algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1578-1583

Citation:

Online since:

December 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Andrew Nierman and H. V. Jagadish. Protdb: probabilistic data in xml. In VLDB '02, 2002, pages 646–657.

DOI: 10.1016/b978-155860869-6/50063-9

Google Scholar

[2] Maurice van Keulen, Ander de Keijzer, and Wouter Alink. A probabilistic xml approach to data integration. In ICDE'05, 2005, pages 459–470.

DOI: 10.1109/icde.2005.11

Google Scholar

[3] Serge Abiteboul, Benny Kimelfeld, Yehoshua Sagiv, and Pierre Senellart. On the Expressiveness of Probabilistic XML Models. The VLDB Journal, 2009, 18:1041–1064.

DOI: 10.1007/s00778-009-0146-1

Google Scholar

[4] Benny Kimelfeld, Yuri Kosharovsky, and Yehoshua Sagiv. Query Evaluation over Probabilistic XML. The VLDB Journal, 18:1117–1140, October 2009.

DOI: 10.1007/s00778-009-0150-5

Google Scholar

[5] Pierre Senellart and Serge Abiteboul. On the complexity of managing probabilistic xml data. In PODS '07, 2007, pages 283–292.

Google Scholar

[6] Abiteboul S, Kanellakis P, Grahne G. On the representation and querying of sets of possible worlds. ACM SIGMOD Record, 1987, 16(3):34-48.

DOI: 10.1145/38714.38724

Google Scholar

[7] http://web.mit.edu/course/6/6.863/share/data/corpora/shakespeare/

Google Scholar

[8] http://www.dbis.informatik.uni-goettingen.de/Mondial/

Google Scholar