Abstract
Similarity search plays an important part in data management field. In this paper, we present a novel data driven distributed storage structure for similarity search in Metric Space. We use Kademlia based peer-to-peer architecture for data storage, and design effect algorithms for data indexing and similarity query. At the end of this paper, we prove the system performance by simulation experiments.
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
Batko, M., Gennaro, C., Zezula, P.: Similarity grid for searching in metric spaces. In: Türker, C., Agosti, M., Schek, H.-J. (eds.) Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures. LNCS, vol. 3664, pp. 25–44. Springer, Heidelberg (2005)
Falchi, F., Gennaro, C., Zezula, P.: A content-addressable network for similarity search in metric spaces. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, J.-H., Ouksel, A.M. (eds.) DBISP2P 2005 and DBISP2P 2006. LNCS, vol. 4125, p. 98. Springer, Heidelberg (2007)
Dong, D., Wu, Y., Wang, X., Luo, T., Huang, G., Wu, G.: Similarity Search in Metric Space over Content Addressable Network. In: 10th IEEE International Conference on High Performance Computing and Communications, HPCC 2008, pp. 702–707 (2008)
Novak, D., Zezula, P.: M-Chord: A scalable distributed similarity search structure. In: Proceedings of the 1st international conference on Scalable information systems. ACM Press, New York (2006)
Jagadish, H., Ooi, B., Tan, K., Yu, C., Zhang, R.: iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. ACM Transactions on Database Systems (TODS) 30(2), 364–397 (2005)
Maymounkov, P., Mazières, D.: Kademlia: A peer-to-peer information system based on the XOR metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 53. Springer, Heidelberg (2002)
Zezula, P.: Similarity Search: the metric space approach. Springer, Heidelberg (2006)
Bookstein, A., Kulyukin, V., Raita, T.: Generalized hamming distance, pp. 353–375 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dong, D., Wu, Y., Wang, X., Hu, Z., Wu, G. (2009). M-KAD: A Scalable Peer-to-Peer System for Similarity Search in Metric Space. In: Lee, R., Ishii, N. (eds) Software Engineering Research, Management and Applications 2009. Studies in Computational Intelligence, vol 253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05441-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-05441-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05440-2
Online ISBN: 978-3-642-05441-9
eBook Packages: EngineeringEngineering (R0)