The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
The G+/GraphLog Visual Query System
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Learning Probabilistic Relational Models
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Information and Computation
VLDB '06 Proceedings of the 32nd 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
Monitoring business processes with queries
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
Type inference and type checking for queries on execution traces
Proceedings of the VLDB Endowment
Evaluating TOP-K Queries over Business Processes
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Querying structural and behavioral properties of business processes
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
On the decidability of temporal properties of probabilistic pushdown automata
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Algorithmic verification of recursive probabilistic state machines
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Mining workflow recovery from event based logs
BPM'05 Proceedings of the 3rd international conference on Business Process Management
On models and query languages for probabilistic processes
ACM SIGMOD Record
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
A quest for beauty and wealth (or, business processes for database researchers)
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Top-k queries over web applications
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specifications are extremely valuable for companies. In particular, given a BP specification, identifying the top-k flows that are most likely to occur in practice, out of those satisfying a given query criteria, is crucial for various applications such as personalized advertizement and BP web-site design. This paper studies, for the first time, top-k query evaluation for queries with projection in this context. We analyze the complexity of the problem for different classes of distribution functions for the flows likelihood, and provide efficient (PTIME) algorithms whenever possible. Furthermore, we show an interesting application of our algorithms to the analysis of BP execution traces (logs), for recovering missing information about the run-time process behavior, that has not been recorded in the logs.