TOP-K projection queries for probabilistic business processes
Proceedings of the 12th International Conference on Database Theory
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
A structural/temporal query language for Business Processes
Journal of Computer and System Sciences
On the aggregation problem for synthesized Web services
Journal of Computer and System Sciences
Top-k queries over web applications
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.01 |
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 as they allow to optimize the BP, identify potential problems, and reduce operational costs. In particular, given a BP specification, identifying the top-k execution flows that are most likely to occur in practice out of those satisfying the query criteria, is crucial for various applications. To address this need, we introduce in this paper the notion of {\em likelihood} for BP execution flows, and study top-k query evaluation (finding the $k$ most likely matches) for queries over BP specifications. We analyze the complexity of query evaluation in this context and present novel algorithms for computing top-k query results. To our knowledge, this is the first paper that studies such top-k query evaluation for BP specifications.