Incorporating constraints in probabilistic XML

Authors:
Sara Cohen;Benny Kimelfeld;Yehoshua Sagiv
Affiliations:
The Hebrew University of Jerusalem, Jerusalem, Israel;IBM Almaden Research Center, San Jose, CA;The Hebrew University of Jerusalem, Jerusalem, Israel
Venue:
ACM Transactions on Database Systems (TODS)
Year:
2009

Citing 25
Cited 4

The computational complexity of probabilistic inference using Bayesian belief networks (research note)

Artificial Intelligence
Counting classes are at least as hard as the polynomial-time hierarchy

SIAM Journal on Computing
Memoing for logic programs

Communications of the ACM
Approximating probabilistic inference in Bayesian belief networks is NP-hard

Artificial Intelligence
Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
On XML integrity constraints in the presence of DTDs

Journal of the ACM (JACM)
Query automata over finite trees

Theoretical Computer Science
OLD Resolution with Tabulation

Proceedings of the Third International Conference on Logic Programming
Probabilistic Interval XML

ICDT '03 Proceedings of the 9th International Conference on Database Theory
The Complexity of First-Order and Monadic Second-Order Logic Revisited

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Integrity constraints for XML

Journal of Computer and System Sciences - Special issue on PODS 2000
A Probabilistic XML Approach to Data Integration

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
PEPX: a query-friendly probabilistic XML database

CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Testing XML constraint satisfiability

Electronic Notes in Theoretical Computer Science (ENTCS)
On the complexity of managing probabilistic XML data

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The dichotomy of conjunctive queries on probabilistic structures

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Maximally joining probabilistic data

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ProTDB: probabilistic data in XML

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient query evaluation on probabilistic databases

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Matching twigs in probabilistic XML

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Query efficiency in probabilistic XML models

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Incorporating constraints in probabilistic XML

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Running tree automata on probabilistic XML

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient evaluation of HAVING queries on a probabilistic database

DBPL'07 Proceedings of the 11th international conference on Database programming languages
Querying and updating probabilistic information in XML

EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology

Generating, sampling and counting subclasses of regular tree languages

Proceedings of the 14th International Conference on Database Theory
Efficient query evaluation over probabilistic XML with long-distance dependencies

Proceedings of the 2011 Joint EDBT/ICDT Ph.D. Workshop
Efficient probabilistic XML query processing using an extended labeling scheme and a lightweight index

Information Processing and Management: an International Journal
ELCA evaluation for keyword search on probabilistic XML data

World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraints are important, not only for maintaining data integrity, but also because they capture natural probabilistic dependencies among data items. A probabilistic XML database (PXDB) is the probability subspace comprising the instances of a p-document that satisfy a set of constraints. In contrast to existing models that can express probabilistic dependencies, it is shown that query evaluation is tractable in PXDBs. The problems of sampling and determining well-definedness (i.e., whether the aforesaid subspace is nonempty) are also tractable. Furthermore, queries and constraints can include the aggregate functions count, max, min, and ratio. Finally, this approach can be easily extended to allow a probabilistic interpretation of constraints.