Top-k projection queries for probabilistic business processes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 12th International Conference on Database Theory, ICDT'09
Pages239-251
Number of pages13
DOIs
StatePublished - 2009
Event12th International Conference on Database Theory, ICDT'09 - Saint Petersburg, Russian Federation
Duration: 23 Mar 200925 Mar 2009

Publication series

NameACM International Conference Proceeding Series
Volume361

Conference

Conference12th International Conference on Database Theory, ICDT'09
Country/TerritoryRussian Federation
CitySaint Petersburg
Period23/03/0925/03/09

Fingerprint

Dive into the research topics of 'Top-k projection queries for probabilistic business processes'. Together they form a unique fingerprint.

Cite this