The Community for Technology Leaders
Cluster Computing and the Grid, IEEE International Symposium on (2009)
Shanghai, China
May 18, 2009 to May 21, 2009
ISBN: 978-0-7695-3622-4
pp: 436-443
ABSTRACT
Item matchmaking that finds items for users is an essential service framework in the web service infrastructure. The current way of carrying out the matchmaking procedure is the selection of items based on a user's specifications. We rethink the item matchmaking framework in such a way that a matchmaker can find items that can satisfy a specific computing demand from a user and recommend a collection of better items candidates among the identified items. This endows a user with the right of choice on deciding best-possible items. We approach the problem in the view of skyline query processing that has become one of the major topics in the database community, and present the efficient skyline algorithm that gathers interesting item candidates efficiently. To this end, we adopt (i) lattice-based indexing using a lattice composition technique,and (ii) an optimized dominance-check algorithm. Our extensive experimental results show that our algorithm outperforms the current state-of-the-art algorithm.
INDEX TERMS
Skyline Computation
CITATION

S. Kim, H. Jung, H. Y. Yeom and H. Han, "A Skyline Approach to the Matchmaking Web Service," Cluster Computing and the Grid, IEEE International Symposium on(CCGRID), Shanghai, China, 2009, pp. 436-443.
doi:10.1109/CCGRID.2009.62
97 ms
(Ver 3.3 (11022016))