Top-k projection queries for probabilistic business processes

ACM International Conference Proceeding Series

Volumn 361, Issue , 2009, Pages 239-251

  Deutcn, Daniel ^a   Milo, Tova ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ADVERTIZEMENTS; BUSINESS ACTIVITIES; BUSINESS GOALS; BUSINESS PROCESS; EXECUTION TRACE; MISSING INFORMATION; PROCESS BEHAVIOR; RUNTIMES; TOP-K QUERY;

DISTRIBUTION FUNCTIONS; SPECIFICATIONS;

BACKPROPAGATION ALGORITHMS;

EID: 70349155035     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1514894.1514923     Document Type: Conference Paper

References (26)

1. S. Abiteboul and P. Senellart. Querying and updating probabilistic information in xml. In Proc, of EDBT, 2006.
2. C. Beeri, A. Eyal, S. Kamenkovich, and T. Milo. Querying business processes. In Proc, of VLDB, 2006.
3. C. Beeri, A. Eyal, T. Milo, and A. Pilberg. Monitoring business processes with queries. In Proc, of VLDB, 2007.
4. S. Bhiri, W. Gaaloul, and C. Godart. Mining and improving composite web services recovery mechanisms. Int. J. Web Service Res., 5(2), 2008.
5. Business Process Execution Language for Web Services. http://www.ibm.com/developerworks/library/ws-bpel/.
6. Oracle bpel process manager administrator's guide - configuring and viewing bpel process logs. http://download.oracle.com/docs/cd/E11036-01/ integrate.l013/b28982/logging.htm.
7. T. Brazdil, A. Kucera, and O. Strazovsky. On the decidability of temporal properties of probabilistic pushdown automata. In Proc, of STAGS, 2005.
8. S. Cohen, B. Kimelfeld, and Y. Sagiv. Incorporating constraints in probabilistic xml. In Proc, of PODS, 2008.
9. M. Consens and A. Mendelzon. The g+/graphlog visual query system. In Proc, of SIGMOD, 1990.
10. B. Courcelle. The monadic second-order logic of graphs. Inf. Comput, 85(1), 1990.
11. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In Proc, of VLDB, 2004.
12. D. Deutch and T. Milo. Querying structural and behavioral properties of business processes. In Proc, of DBPL, 2007.
13. D. Deutch and T. Milo. Type inference and type checking for queries on execution traces. In Proc, of VLDB, 2008.
14. D. Deutch and T. Milo. Evaluating top-k queries over business processes. In Proc, of ICDE, 2009.
15. K. Etessami and M. Yannakakis. Algorithmic verification of recursive probabilistic state machines. In Proc, of TACAS, 2005.
16. N. Friedman, L. Getoor, D. Koller, and A. Pfeffer. Learning probabilistic relational models. In Proc, of IJCAI, 1999.
17. W. Gaaloul and C. Godart. Mining workflow recovery from event based logs. In Business Process Management, 2005.
18. J. G. Kemeny and J. L. Snell. Finite Markov Chains. Springer, 1976.
19. B. Kimelfeld, Y. Kosharovsky, and Y. Sagiv. Query efficiency in probabilistic xml models. In Proc, of SIGMOD, 2008.
20. B. Kimelfeld and Y. Sagiv. Matching twigs in probabilistic xml. In Proc, of VLDB, 2007.
21. Z. Manna and A. Pnueli. The temporal logic of reactive and concurrent systems. Springer-Verlag, 1992.
22. S. P. Meyn and R. L. Tweedie. Markov Chains and Stochastic Stability. Springer-Verlag, 1993.
23. T. Oates, S. Doshi, and F. Huang. Estimating maximum likelihood parameters for stochastic context-free graph grammars. In Proc, of ILP, 2003.
24. C. Re, N. N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probabilistic data. In Proc, of ICDE, 2007.
25. M. Reynolds. An axiomatization of pctl. Inf. Comput., 201(1), 2005.
26. P. Sen and A. Deshpande. Representing and querying correlated tuples in probabilistic databases. In Proc, of ICDE, 2007.