research-article

A probabilistic XML merging tool

Authors:

Talel Abdessalem,

M. Lamine Ba,

Pierre SenellartAuthors Info & Claims

EDBT/ICDT '11: Proceedings of the 14th International Conference on Extending Database Technology

Pages 538 - 541

https://doi.org/10.1145/1951365.1951435

Published: 21 March 2011 Publication History

Get Access

Abstract

This demonstration paper presents a probabilistic XML data merging tool, that represents the outcome of semi-structured document integration as a probabilistic tree. The system is fully automated and integrates methods to evaluate the uncertainty (modeled as probability values) of the result of the merge. It is based on the two-way tree-merge technique and an uncertain data model defined using probabilistic event variables. The resulting probabilistic repository can be queried using a subset of the XPath query language. The demonstration application is based on revisions of the Wikipedia encyclopedia: a Wikipedia article is no longer considered as the latest valid revision but as the merge of all possible revisions, some of which are uncertain.

References

[1]

S. Abiteboul, B. Kimelfeld, Y. Sagiv, and P. Senellart. On the expressiveness of probabilistic XML models. VLDB Journal, 18(5):1041--1064, 2009.

Digital Library

Google Scholar

[2]

B. T. Adler and L. de Alfaro. A content-driven reputation system for the wikipedia. In Proc. WWW, Banff, Canada, May 2007.

Digital Library

Google Scholar

[3]

M. Benedikt, E. Kharlamov, D. Olteanu, and P. Senellart. Probabilistic XML via Markov chains. Proceedings of the VLDB Endowment, 3(1), Aug. 2010. Presented at the VLDB 2010 conference, Singapore.

Digital Library

Google Scholar

[4]

E. Kharlamov, W. Nutt, and P. Senellart. Updating probabilistic XML. In Proc. Updates in XML, Lausanne, Switzerland, Mar. 2010.

Digital Library

Google Scholar

[5]

B. Kimelfeld, Y. Kosharovsky, and Y. Sagiv. Query evaluation over probabilistic XML. VLDB Journal, 18(5):1117--1140, 2009.

Digital Library

Google Scholar

[6]

R. La Fontaine. Merging XML files: A new approach providing intelligent merge of XML data sets. In Proc. XML Europe, Barcelona, Spain, May 2002.

Google Scholar

[7]

T. Lindholm. A three-way merge for XML documents. In Proc. DocEng, Milwaukee, WI, USA, Oct. 2004.

Digital Library

Google Scholar

[8]

M. van Keulen, A. de Keijzer, and W. Alink. A probabilistic XML approach to data integration. In Proc. ICDE, Tokyo, Japan, Apr. 2005.

Digital Library

Google Scholar

Cited By

View all

Fouquet FHartmann TMosser SCordy MHaddad HWainwright RChbeir R(2018)Enabling lock-free concurrent workers over temporal graphs composed of multiple time-seriesProceedings of the 33rd Annual ACM Symposium on Applied Computing10.1145/3167132.3167255(1054-1061)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.1145/3167132.3167255
Thao CMunson E(2014)Using versioned trees, change detection and node identity for three-way XML mergingComputer Science - Research and Development10.1007/s00450-013-0253-5Online publication date: 29-Nov-2014
https://doi.org/10.1007/s00450-013-0253-5
Ba MAbdessalem TSenellart PMarinai SMarriott K(2013)Uncertain version control in open collaborative editing of tree-structured documentsProceedings of the 2013 ACM symposium on Document engineering10.1145/2494266.2494277(27-36)Online publication date: 10-Sep-2013
https://dl.acm.org/doi/10.1145/2494266.2494277
Show More Cited By

Index Terms

A probabilistic XML merging tool
1. Information systems
  1. Information systems applications

Recommendations

Efficient processing of top-k twig queries over probabilistic XML data

The flexibility of XML data model allows a more natural representation of uncertain data compared with the relational model. Matching twig pattern against XML data is a fundamental problem in querying information from XML documents. For a probabilistic ...
On the expressiveness of probabilistic XML models

Various known models of probabilistic XML can be represented as instantiations of the abstract notion of p-documents. In addition to ordinary nodes, p-documents have distributional nodes that specify the possible worlds and their probabilistic ...
Keywords filtering over probabilistic XML data
APWeb'12: Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications

Probabilistic XML data is widely used in many web applications. Recent work has been mostly focused on structured query over probabilistic XML data. A few of work has been done about keyword query. However only the independent and the mutually-exclusive ...

Comments

Information & Contributors

Information

Published In

EDBT/ICDT '11: Proceedings of the 14th International Conference on Extending Database Technology

March 2011

587 pages

ISBN:9781450305280

DOI:10.1145/1951365

Editors:
Anastasia Ailamaki
EPFL, Switzerland
,
Sihem Amer-Yahia
Yahoo! Research
,
Jignesh Pate
University of Wisconsin-Madison
,
Tore Risch
Uppsala University, Sweden
,
Pierre Senellart
Télécom ParisTech, France
,
Julia Stoyanovich
University of Pennsylvania

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 March 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

EDBT/ICDT '11

Sponsor:

Microsoft Research

EDBT/ICDT '11: EDBT/ICDT '11 joint conference

March 21 - 24, 2011

Uppsala, Sweden

Acceptance Rates

Overall Acceptance Rate 7 of 10 submissions, 70%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
172
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Fouquet FHartmann TMosser SCordy MHaddad HWainwright RChbeir R(2018)Enabling lock-free concurrent workers over temporal graphs composed of multiple time-seriesProceedings of the 33rd Annual ACM Symposium on Applied Computing10.1145/3167132.3167255(1054-1061)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.1145/3167132.3167255
Thao CMunson E(2014)Using versioned trees, change detection and node identity for three-way XML mergingComputer Science - Research and Development10.1007/s00450-013-0253-5Online publication date: 29-Nov-2014
https://doi.org/10.1007/s00450-013-0253-5
Ba MAbdessalem TSenellart PMarinai SMarriott K(2013)Uncertain version control in open collaborative editing of tree-structured documentsProceedings of the 2013 ACM symposium on Document engineering10.1145/2494266.2494277(27-36)Online publication date: 10-Sep-2013
https://dl.acm.org/doi/10.1145/2494266.2494277
Senellart PSouihli A(2013)Optimizing approximations of DNF query lineage in probabilistic XMLProceedings of the 2013 IEEE International Conference on Data Engineering (ICDE 2013)10.1109/ICDE.2013.6544869(721-732)Online publication date: 8-Apr-2013
https://dl.acm.org/doi/10.1109/ICDE.2013.6544869
Kimelfeld BSenellart P(2013)Probabilistic XML: Models and ComplexityAdvances in Probabilistic Databases for Uncertain Information Management10.1007/978-3-642-37509-5_3(39-66)Online publication date: 2013
https://doi.org/10.1007/978-3-642-37509-5_3
Ba MAbdessalem TSenellart PNica ASuchanek F(2011)Towards a version control model with uncertain dataProceedings of the 4th workshop on Workshop for Ph.D. students in information & knowledge management10.1145/2065003.2065013(43-50)Online publication date: 28-Oct-2011
https://dl.acm.org/doi/10.1145/2065003.2065013
Souihli ASenellart P(2011)Efficient query evaluation over probabilistic XML with long-distance dependenciesProceedings of the 2011 Joint EDBT/ICDT Ph.D. Workshop10.1145/1966874.1966880(32-37)Online publication date: 25-Mar-2011
https://dl.acm.org/doi/10.1145/1966874.1966880

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Efficient processing of top-k twig queries over probabilistic XML data

On the expressiveness of probabilistic XML models

Keywords filtering over probabilistic XML data

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations