On generating all maximal independent sets
Information Processing Letters
Probabilistic quantifiers and games
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Monte-Carlo approximation algorithms for enumeration problems
Journal of Algorithms
Counting classes are at least as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Communications of the ACM
The complexity of query reliability
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
ICDT '03 Proceedings of the 9th International Conference on Database Theory
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
On the minimization of Xpath queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
Revisiting redundancy and minimization in an XPath fragment
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Incorporating constraints in probabilistic XML
Proceedings of the twenty-seventh 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
Incorporating constraints in probabilistic XML
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
TOP-K projection queries for probabilistic business processes
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
Incorporating constraints in probabilistic XML
ACM Transactions on Database Systems (TODS)
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
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Information Sciences: an International Journal
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
Edit distance between XML and probabilistic XML documents
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
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
Bayesian network-based probabilistic XML keywords filtering
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
Efficient management of uncertainty in XML schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Information Processing and Management: an International Journal
ELCA evaluation for keyword search on probabilistic XML data
World Wide Web
Querying and ranking incomplete twigs in probabilistic XML
World Wide Web
Efficient processing of twig query with compound predicates in fuzzy XML
Fuzzy Sets and Systems
Dynamically querying possibilistic XML data
Information Sciences: an International Journal
Hi-index | 0.00 |
Various known models of probabilistic XML can be represented as instantiations of abstract p-documents. Such documents have, in addition to ordinary nodes, distributional nodes that specify the probabilistic process of generating a random document. Within this abstraction, families of pdocuments, which are natural extensions and combinations of previous models, are considered. The focus is on efficiency of applying twig queries (with projection) to p-documents. A closely related issue is the ability to (efficiently) translate a given document of one family into another family. Furthermore, both of these tasks have two variants that correspond to the value-based and object-based semantics. The translation relationships among different families of p-documents are studied. An efficient algorithm for evaluating twig queries over one specific family is given. This algorithm generalizes a known algorithm and significantly improves its running time, both analytically and experimentally. It is shown that this family is the maximal, among the ones considered, for which query evaluation is tractable. For the rest, efficient approximate algorithms for query evaluation are presented.