Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Complexity and real computation
Complexity and real computation
Model Checking of Unrestricted Hierarchical State Machines
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Some NP-complete geometric problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Tools for composite web services: a short overview
ACM SIGMOD Record
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
On the complexity of managing probabilistic XML data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Matching twigs in probabilistic XML
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Static analysis of active XML systems
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
Type inference and type checking for queries on execution traces
Proceedings of the VLDB Endowment
Generating XML structure using examples and constraints
Proceedings of the VLDB Endowment
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
TOP-K projection queries for probabilistic business processes
Proceedings of the 12th International Conference on Database Theory
Evaluating TOP-K Queries over Business Processes
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Running tree automata on probabilistic XML
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Probabilistic XML via Markov Chains
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
This paper studies top-k query evaluation for an important class of probabilistic semi-structured data: nested DAGs (Directed Acyclic Graphs) that describe possible execution flows of Business Processes (BPs for short). We consider queries with projection, that select portions (sub-flows) of the execution flows that interest the user and are most likely to occur at run-time. Retrieving common sub-flows is crucial for various applications such as targeted advertisement and BP optimization. Sub-flows are ranked here by the sum of likelihood of EX-flows in which they appear, in contrast to the max-of-likelihood semantics studied in previous work; we show that while sum semantics is more natural, it makes query evaluation much more challenging. We study the problem for BPs and queries of varying classes and present efficient query evaluation algorithms whenever possible.