Optimal top-k query evaluation for weighted business processes

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 940-951

  Deutch, Daniel ^a   Milo, Tova ^a   Polyzotis, Neoklis ^b   Yam, Tom ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

A-WEIGHTING; BUSINESS GOALS; BUSINESS PROCESS; FOLLOWING PROBLEM; TOP-K QUERY;

INFORMATION RETRIEVAL;

EID: 84859227009     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920960     Document Type: Article

References (20)

1. S. Abiteboul and P. Senellart. Querying and updating probabilistic information in xml. In Proc. of EDBT, 2006.
2. Active XML. http://activexml.net/.
3. Business Process Execution Language for Web Services. http://www.ibm.com/developerworks/library/ws-bpel/.
4. B. Courcelle. The monadic second-order logic of graphs. Inf. Comput., 85(1), 1990.
5. R. Dechter and J. Pearl. Generalized best-first search strategies and the optimality of A*. JACM, 32(3), 1985.
6. D. Deutch and T. Milo. Type inference and type checking for queries on execution traces. In Proc. of VLDB, 2008.
7. D. Deutch and T. Milo. Evaluating top-k queries over business processes (short paper). In Proc. of ICDE, 2009.
8. D. Deutch and T. Milo. Top-k projection queries for probabilistic business processes. In Proc. of ICDT, 2009.
9. A. Deutsch, L. Sui, V. Vianu, and D. Zhou. Verification of communicating data-driven web services. In PODS, 2006.
10. K. Etessami and M. Yannakakis. Algorithmic verification of recursive probabilistic state machines. In TACAS, 2005.
11. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. JCSS, 66(4), 2003.
12. I. F. Ilyas, G. Beskales, and M. A. Soliman. A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv., 40(4), 2008.
13. T. Jones. Estimating Software Costs. McGraw-Hill, 2007.
14. J. Kemeny and J. Snell. Finite Markov Chains. Springer, 1976.
15. B. Kimelfeld and Y. Sagiv. Matching twigs in probabilistic xml. In Proc. of VLDB, 2007.
16. N. Koudas and D. Srivastava. Data stream query processing: A tutorial. In Proc. of VLDB, 2003.
17. P. L. T. Pirolli and J. E. Pitkow. Distributions of surfers' paths through the world wide web: Empirical characterizations. World Wide Web, 2(1-2), 1999.
18. P. Sen and A. Deshpande. Representing and querying correlated tuples in probabilistic databases. In ICDE, 2007.
19. A. Simitsis, K. Wilkinson, M. Castellanos, and U. Dayal. Qox-driven etl design: reducing the cost of etl consulting engagements. In SIGMOD '09, 2009.
20. Yahoo! shopping. http://shopping.yahoo.com/.