On generating all maximal independent sets
Information Processing Letters
Counting classes are at least as hard as the polynomial-time hierarchy
SIAM Journal on Computing
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
A probabilistic relational model and algebra
ACM Transactions on Database Systems (TODS)
Integrating information by outerjoins and full disjunctions (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of query reliability
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Management of Probabilistic Data
IEEE Transactions on Knowledge and Data Engineering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
The Theory of Probabilistic Databases
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An incremental algorithm for computing ranked full disjunctions
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Full disjunctions: polynomial-delay iterators in action
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
An incremental algorithm for computing ranked full disjunctions
Journal of Computer and System Sciences
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
Query evaluation on a database given by a random graph
ICDT'07 Proceedings of the 11th international conference on Database Theory
Combining incompleteness and ranking in tree queries
ICDT'07 Proceedings of the 11th international conference on Database Theory
Querying and updating probabilistic information in XML
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Asymptotic conditional probabilities for conjunctive queries
ICDT'05 Proceedings of the 10th international conference on Database Theory
MCDB: a monte carlo approach to managing uncertain data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
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
TOP-K projection queries for probabilistic business processes
Proceedings of the 12th International Conference on Database Theory
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
Certain answers for XML queries
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Discover hierarchical subgraphs with network-topology based ranking score
Proceedings of the Third C* Conference on Computer Science and Software Engineering
Information Sciences: an International Journal
On models and query languages for probabilistic processes
ACM SIGMOD Record
Navigating in complex mashed-up applications
Proceedings of the VLDB Endowment
Probabilistic XML via Markov Chains
Proceedings of the VLDB Endowment
Optimal top-k query evaluation for weighted business processes
Proceedings of the VLDB Endowment
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
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)
Retrieving keyworded subgraphs with graph ranking score
Expert Systems with Applications: An International Journal
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
Bayesian network-based probabilistic XML keywords filtering
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
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
Top-k queries over web applications
The VLDB Journal — The International Journal on Very Large Data Bases
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 |
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of probabilistic XML, the evaluation of twigs with projection is tractable under data complexity (whereas in other probabilistic data models, projection is intractable). Under query-and-data complexity, the problem becomes intractable even without projection (and for rather simple twigs and data). In earlier work on probabilistic XML, answers are always complete. However, there is often a need to produce partial answers because XML data may have missing sub-elements and, furthermore, complete answers may be deemed irrelevant if their probabilities are too low. It is shown how to define a semantics that provides partial answers that are maximal with respect to a probability threshold, which is specified by the user. For this semantics, it is shown how to efficiently evaluate twigs, even under query-and-data complexity if there is no projection.