Peer-to-Peer Computing, IEEE International Conference on (2006)
Cambridge, United Kingdom
Sept. 6, 2006 to June 8, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/P2P.2006.12
Marcel Karnstedt , Technische Universit?at Ilmenau, Germany
Kai-Uwe Sattler , Technische Universit?at Ilmenau, Germany
Manfred Hauswirth , Ecole Polytechnique Federale de Lausanne (EPFL), Switzerland
Roman Schmidt , Ecole Polytechnique Federale de Lausanne (EPFL), Switzerland
Large-scale distributed data management with P2P systems requires the existence of similarity operators for queries as we cannot assume that all users will agree on exactly the same schema and value representations and data quality problems due to spelling errors and typos. In this paper, we present an approach for efficient processing of similarity selections and joins in a structured overlay. We show that there are several possible strategies exploiting DHT features to a different extent (i.e., key organization, routing, multicasting) and thus the choice of the best operator implementation in a given situation (selectivity, data distribution, load) should be based on cost information allowing the system to estimate the computation and communication costs of query execution plans. Hence, we present a cost model for similarity operations on structured data in a DHT and demonstrate the efficiency of our proposal by experimental results from a large-scale PlanetLab deployment.
R. Schmidt, M. Hauswirth, M. Karnstedt and K. Sattler, "Cost-Aware Processing of Similarity Queries in Structured Overlays," 2006 6th IEEE International Conference on Peer-to-Peer Computing(P2P), Cambridge, 2006, pp. 81-89.