Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
Verification of communicating data-driven web services
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Estimating Software Costs
Data stream query processing: a tutorial
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Matching twigs in probabilistic XML
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Type inference and type checking for queries on execution traces
Proceedings of the VLDB Endowment
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
QoX-driven ETL design: reducing the cost of ETL consulting engagements
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Querying and updating probabilistic information in XML
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
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
On models and query languages for probabilistic processes
ACM SIGMOD Record
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
Search and result presentation in scientific workflow repositories
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
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.00 |
A Business Process (BP for short) consists of a set of activities that achieve some business goal when combined in a flow. Among all the (maybe infinitely many) possible execution flows of a BP, analysts are often interested in identifying flows that are "most important", according to some weight metric. This paper studies the following problem: given a specification of such a BP, a weighting function over BP execution flows, a query, and a number k, identify the k flows with the highest weight among those satisfying the query. We provide here, for the first time, a provably optimal algorithm for identifying the top-k weighted flows of a given BP, and use it for efficient top-k query evaluation.