Abstract
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. These queries may cause considerable processing effort within the directory, thus limiting scalability. In this paper we present a novel approach to increase scalability: The directory offers a compact digest that service composition clients download to solve the hard part of a composition problem locally. In this paper we compare two different digest representations, a sparse matrix and a Zero-Suppressed Reduced Ordered Binary Decision Diagram (ZDD). Our evaluation confirms that both representations are compact and shows that the ZDD enables more efficient service composition.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Constantinescu, I., Binder, W., Faltings, B.: Flexible and efficient matchmaking and ranking in service directories. In: 2005 IEEE International Conference on Web Services (ICWS 2005), Florida, July 2005, pp. 5–12 (2005)
Constantinescu, I., Faltings, B., Binder, W.: Large scale, type-compatible service composition. In: IEEE International Conference on Web Services (ICWS 2004), San Diego, CA, USA, July 2004, pp. 506–513 (2004)
Li, L., Horrocks, I.: A software framework for matchmaking based on semantic web technology. In: Proceedings of the 12th International Conference on the World Wide Web, pp. 331–339 (2003)
McIlraith, S.A., Son, T.C.: Adapting Golog for composition of semantic web services. In: Fensel, D., Giunchiglia, F., McGuinness, D., Williams, M.-A. (eds.) Proceedings of the 8th International Conference on Principles and Knowledge Representation and Reasoning (KR 2002), April 2002, pp. 482–496. Morgan Kaufmann Publishers, San Francisco (2002)
Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proceedings of the 30th ACM/IEEE Design Automation Conference, Dallas, TX, June 1993, pp. 272–277. ACM Press, New York (1993)
Okuno, H.G., Ichi Minato, S., Isozaki, H.: On the properties of combination set operations. Information Processing Letters 66(4), 195–199 (1998)
OWL-S. DAML Services, http://www.daml.org/services/owl-s/
Paolucci, M., Kawamura, T., Payne, T.R., Sycara, K.P.: Semantic matching of web services capabilities. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 333–347. Springer, Heidelberg (2002)
Papazoglou, M.P., Georgakopoulos, D.: Introduction: Service-oriented computing. Communications of the ACM 46(10), 24–28 (2003)
Ponnekanti, S.R., Fox, A.: Sword: A developer toolkit for web service composition. In: 11th World Wide Web Conference (Web Engineering Track) (2002)
Thakkar, S., Knoblock, C.A., Ambite, J.L., Shahabi, C.: Dynamically composing web services from on-line sources. In: Proceeding of the AAAI 2002 Workshop on Intelligent Service Integration, Edmonton, Alberta, Canada, July 2002, pp. 1–7 (2002)
W3C. Web services description language (WSDL) version 1.2, http://www.w3.org/TR/wsdl12
Wu, D., Parsia, B., Sirin, E., Hendler, J., Nau, D.S.: Automating DAML-S Web Services Composition Using SHOP2. In: Fensel, D., Sycara, K.P., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 195–210. Springer, Heidelberg (2003)
Zaremski, A.M., Wing, J.M.: Specification matching of software components. ACM Transactions on Software Engineering and Methodology 6(4), 333–369 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Binder, W., Constantinescu, I., Faltings, B. (2006). Scalable Automated Service Composition Using a Compact Directory Digest. In: Bressan, S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2006. Lecture Notes in Computer Science, vol 4080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11827405_31
Download citation
DOI: https://doi.org/10.1007/11827405_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37871-6
Online ISBN: 978-3-540-37872-3
eBook Packages: Computer ScienceComputer Science (R0)