Incomplete Information in Relational Databases
Journal of the ACM (JACM)
On the representation and querying of sets of possible worlds
Selected papers of the workshop on Deductive database theory
The reliability of queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A probabilistic relational algebra for the integration of information retrieval and database systems
ACM Transactions on Information Systems (TOIS)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Management of Probabilistic Data
IEEE Transactions on Knowledge and Data Engineering
The Theory of Probabilistic Databases
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Semistructured Probabilistic Databases
SSDBM '01 Proceedings of the 13th International Conference on Scientific and Statistical Database Management
A Probabilistic XML Approach to Data Integration
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
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
Querying and updating probabilistic information in XML
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
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
Annotated XML: queries and provenance
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Containment of conjunctive queries on annotated relations
Proceedings of the 12th International Conference on Database Theory
Query ranking in probabilistic XML data
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Modeling and querying probabilistic XML data
ACM SIGMOD Record
Running tree automata on probabilistic XML
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML with incomplete information: models, properties, and query answering
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incorporating constraints in probabilistic XML
ACM Transactions on Database Systems (TODS)
Information integration with uncertainty
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
On the expressiveness of probabilistic XML models
The VLDB Journal — The International Journal on Very Large Data Bases
Query evaluation over probabilistic XML
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient processing of twig pattern matching in fuzzy XML
Proceedings of the 18th ACM conference on Information and knowledge management
Proceedings of the 2010 EDBT/ICDT Workshops
Aggregate queries for discrete and continuous probabilistic XML
Proceedings of the 13th International Conference on Database Theory
Querying parse trees of stochastic context-free grammars
Proceedings of the 13th International Conference on Database Theory
Proceedings of the 13th International Conference on Database Theory
XML with incomplete information
Journal of the ACM (JACM)
Information Sciences: an International Journal
On models and query languages for probabilistic processes
ACM SIGMOD Record
Querying probabilistic business processes for sub-flows
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
ProApproX: a lightweight approximation query processor over probabilistic trees
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Journal of the ACM (JACM)
A hybrid algorithm for finding top-k twig answers in probabilistic XML
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Boosting twig joins in probabilistic XML
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Capturing continuous data and answering aggregate queries in probabilistic XML
ACM Transactions on Database Systems (TODS)
Matching top-k answers of twig patterns in probabilistic XML
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Keywords filtering over probabilistic XML data
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Answering queries using views over probabilistic XML: complexity and tractability
Proceedings of the VLDB Endowment
ELCA evaluation for keyword search on probabilistic XML data
World Wide Web
Construction of fuzzy ontologies from fuzzy XML models
Knowledge-Based Systems
Querying and ranking incomplete twigs in probabilistic XML
World Wide Web
Storing and querying fuzzy XML data in relational databases
Applied Intelligence
Formal translation from fuzzy EER model to fuzzy XML model
Expert Systems with Applications: An International Journal
Integrated Computer-Aided Engineering
Hi-index | 0.01 |
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees where nodes are annotated with conjunctions of probabilistic event variables. We briefly described an implementation and scenarios of usage. We develop here a mathematical foundation for this model. In particular, we present complexity results. We identify a very large class of queries for which simple variations of querying and updating algorithms from [3] compute the correct answer. A main contribution is a full complexity analysis of queries and updates. We also exhibit a decision procedure for the equivalence of probabilistic trees and prove it is in co-RP. Furthermore, we study the issue of removing less probable possible worlds, and that of validating a probabilistic tree against a DTD. We show that these two problems are intractable in the most general case.