TY - JOUR
T1 - Optimal top-k query evaluation for weighted business processes
AU - Deutch, Daniel
AU - Milo, Tova
AU - Polyzotis, Neoklis
AU - Yam, Tom
PY - 2010/9
Y1 - 2010/9
N2 - A Business Process (BP for short) consists of a set of ac- tivities that achieve some business goal when combined in a flow. Among all the (maybe infinitely many) possible execu- tion 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 ex- ecution 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 algo- rithm for identifying the top-k weighted flows of a given BP, and use it for efficient top-k query evaluation.
AB - A Business Process (BP for short) consists of a set of ac- tivities that achieve some business goal when combined in a flow. Among all the (maybe infinitely many) possible execu- tion 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 ex- ecution 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 algo- rithm for identifying the top-k weighted flows of a given BP, and use it for efficient top-k query evaluation.
UR - https://www.scopus.com/pages/publications/84859227009
U2 - 10.14778/1920841.1920960
DO - 10.14778/1920841.1920960
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84859227009
SN - 2150-8097
VL - 3
SP - 940
EP - 951
JO - Proceedings of the VLDB Endowment
JF - Proceedings of the VLDB Endowment
IS - 1
ER -