WSBen: A Web services discovery and composition benchmark

Proceedings - ICWS 2006: 2006 IEEE International Conference on Web Services

Volumn , Issue , 2006, Pages 239-246

  Oh, Seog Chan ^a   Kil, Hyunyoung ^b   Lee, Dongwon ^b   Kumara, Soundar R T ^a  

^a The Pennsylvania State University   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTER SOFTWARE; QUERY PROCESSING; STATISTICAL METHODS; USER INTERFACES;

SYNTHETIC WEB SERVICES; WEB SERVICES DISCOVERY;

WEB SERVICES;

EID: 38949139063     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICWS.2006.148     Document Type: Conference Paper

References (18)

1. nd edn. Athena Scientific, 2000.
2. A. Blum, and M. Furst, "Fast planning through planning graph analysis", Proceeding of IJCAI, 1995.
3. I. Constantinescu, B. Faltings, and W. Binder, "Large scale testbed for type compatible service composition", Proceeding of ICAPS, 2004.
4. X. Dong, A. Halevy, J. Madhavan, E. Nemes, and J. Zhang, "Similarity search for web services", Proceeding of VLDB, 2004.
5. J. Fan and S. Kambhampati, "A snapshot of public web services", SIGMOD Record, 34(1), 2005.
6. R. E. Fikes, and N. Nilsson, "STRIPS: A new approach to the application of theorem proving to problem solving", Artificial Intelligence, 5(2), 1971.
7. H. Kautz, and B. Selman, "Unifying SAT-based and Graph-based planning", Proceeding of IJCAI, 1999.
8. J. Zhang, and L.-J. Zhang, "Web services quality testing", Int'l J. of Web Services Research, 2(2), 2005
9. M. E. J. Newman, S. H. Strogatz, and D. J. Watts, "Random graphs with arbitrary degree distributions and their applications", Phys. Rev. E 64, 026118, 2001.
10. S.-C. Oh, D. Lee, and S. Kumara, "A comparative illustration of AI planning-based web services composition", ACM SIGecom Exchanges, 5(5), 2005.
11. S.-C. Oh, D. Lee, and S. Kumara, "WSPR: An effective web service composition algorithm", Submitted to Int'l J. of Web Services Research, Special issue on web service discovery and composition, 2006.
12. Xmark XML Benchmark, http://monetdb.cwi.nl/xml/
13. J. P. Denning, "Network Laws", Communications of the ACM, 47(11), 2004.
14. T. Bylander, "The computational complexity of propositional STRIPS planning", Artificial Intelligence, 69(1-2), 1994.
15. K. Sivashanmugam, J. A. Miller, A. Sheth, and K. Verma, "Framework for semantic web process composition", Int'l J. of Electronic Commerce, 9(2), 2004.
16. D. McDermott, "Estimated-regression planning for interactions with web services", Proceeding of AIPS, 2002.
17. D. McDermott, "A heuristic estimator for means-ends analysis in planning". Proceeding of AIPS, 1996.
18. Cognitive Science Laboratory in Princeton University, http://wordnet.princeton.edu/