research-article

Efficient query evaluation over probabilistic XML with long-distance dependencies

Authors:

Pierre SenellartAuthors Info & Claims

PhD '11: Proceedings of the 2011 Joint EDBT/ICDT Ph.D. Workshop

Pages 32 - 37

https://doi.org/10.1145/1966874.1966880

Published: 25 March 2011 Publication History

Abstract

We address the problem of querying probabilistic semistructured databases in view of the tradeoff between the efficiency of evaluation and the ability to model probabilistic dependencies between elements of the tree. We introduce, through a discussion of several challenges, the ProApproX query processor over probabilistic XML as a first step towards building a full-fletched probabilistic semistructured data management system. ProApproX aims at efficient data querying of a comparatively larger subset of the XPath query language than was processed by related systems, through techniques of exact calculations or efficient approximations of the result probability. This paper describes PhD work carried out at Telecom ParisTech under the guidance of Pierre Senellart.

References

[1]

T. Abdessalem, M. L. Ba, and P. Senellart. A probabilistic XML merging tool. In Proc. EDBT, 2011. Demonstration.

Digital Library

[2]

S. Abiteboul, T.-H. H. Chan, E. Kharlamov, W. Nutt, and P. Senellart. Aggregate queries for discrete and continuous probabilistic XML. In Proc. ICDT, 2010.

Digital Library

[3]

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

Digital Library

[4]

L. Antova, C. Koch, and D. Olteanu. Query language support for incomplete information in the MayBMS system. In Proc. VLDB, 2007.

Digital Library

[5]

M. Benedikt, E. Kharlamov, D. Olteanu, and P. Senellart. Probabilistic XML via Markov chains. Proc. VLDB Endowment, 3(1):770--781, 2010.

Digital Library

[6]

J. Boulos, N. N. Dalvi, B. Mandhani, S. Mathur, C. R&#233;, and D. Suciu. MYSTIQ: a system for finding more answers by using probabilities. In Proc. SIGMOD, 2005.

Digital Library

[7]

R. Cheng, D. V. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In Proc. SIGMOD, 2003.

Digital Library

[8]

S. Cohen, B. Kimelfeld, and Y. Sagiv. Incorporating constraints in probabilistic XML. ACM Trans. Database Syst., 34(3), 2009.

Digital Library

[9]

A. Deshpande, C. Guestrin, S. Madden, J. M. Hellerstein, and W. Hong. Model-driven data acquisition in sensor networks. In Proc. VLDB, 2004.

Digital Library

[10]

W. Hoeffding. Probability inequalities for sums of bounded random variables. J. American Statistical Association, 58(301):13--30, 1963.

[11]

E. Hollander and M. van Keulen. Storing and querying probabilistic XML using a probabilistic relational DBMS. In Proc. MUD, 2010.

[12]

J. Huang. Design and implementation of the SPROUT query engine for probabilistic databases. Master's thesis, University of Oxford, 2009.

[13]

J. Huang, L. Antova, C. Koch, and D. Olteanu. MayBMS: a probabilistic database management system. In Proc. SIGMOD, 2009.

Digital Library

[14]

R. M. Karp, M. Luby, and N. Madras. Monte-Carlo approximation algorithms for enumeration problems. J. Algorithms, 10(3):429--448, 1989.

Digital Library

[15]

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

Digital Library

[16]

B. Kimelfeld and Y. Sagiv. Matching twigs in probabilistic XML. In Proc. VLDB, 2007.

Digital Library

[17]

T. Li, Q. Shao, and Y. Chen. PEPX: a query-friendly probabilistic XML database. In Proc. CIKM, 2006.

Digital Library

[18]

M. Mutsuzaki, M. Theobald, A. de Keijzer, J. Widom, P. Agrawal, O. Benjelloun, A. D. Sarma, R. Murthy, and T. Sugihara. Trio-One: Layering uncertainty and lineage on a conventional dbms. In Proc. CIDR, 2007. Demonstration.

[19]

P. Senellart and S. Abiteboul. On the complexity of managing probabilistic XML data. In Proc. PODS, 2007.

Digital Library

[20]

P. Senellart and A. Souihli. Un syst&#232;me de gestion de donn&#233;es XML probabilistes. In Proc. BDA, 2010. Conference without formal proceedings (demonstration).

[21]

S. Singh, C. Mayfield, S. Mittal, S. Prabhakar, S. E. Hambrusch, and R. Shah. Orion 2.0: native support for uncertain data. In Proc. SIGMOD, 2008.

Digital Library

[22]

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

Digital Library

Cited By

Boulaares SSassi SBenSlimane DFaiz S(2022)A probabilistic approach: Uncertain navigation of the uncertain webConcurrency and Computation: Practice and Experience10.1002/cpe.719434:23Online publication date: 28-Jul-2022
https://doi.org/10.1002/cpe.7194
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

Index Terms

Efficient query evaluation over probabilistic XML with long-distance dependencies

Recommendations

Query ranking in probabilistic XML data
EDBT '09: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology

Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXML-RANK query, (Q, k), which is to rank top-k probabilities of the answers of a twig query Q in probabilistic XML (PXML) data. A ...
Query evaluation over probabilistic XML

Query evaluation over probabilistic XML is explored. The queries are twig patterns with projection, and the data is represented in terms of three models of probabilistic XML (that extend existing ones in the literature). The first model makes an ...
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 ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

PhD '11: Proceedings of the 2011 Joint EDBT/ICDT Ph.D. Workshop

March 2011

55 pages

ISBN:9781450306966

DOI:10.1145/1966874

Editors:
Sascha Müller-Feuerstein
Ansbach University of Applied Sciences, Germany
,
Bernhard Volz
University of Bayreuth, Germany
,
Kjell Orsborn
Uppsala University, Sweden
,
Silvia Stefanova
Uppsala University, Sweden

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 March 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

EDBT/ICDT '11

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

March 25, 2011

Uppsala, Sweden

Acceptance Rates

PhD '11 Paper Acceptance Rate 8 of 14 submissions, 57%;

Overall Acceptance Rate 8 of 14 submissions, 57%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
62
Total Downloads

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

Reflects downloads up to 06 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Boulaares SSassi SBenSlimane DFaiz S(2022)A probabilistic approach: Uncertain navigation of the uncertain webConcurrency and Computation: Practice and Experience10.1002/cpe.719434:23Online publication date: 28-Jul-2022
https://doi.org/10.1002/cpe.7194
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

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.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten