Scalability comparison of Peer-to-Peer similarity search structures

Future Generation Computer Systems

Volumn 24, Issue 8, 2008, Pages 834-848

  Batko, Michal ^a   Novak, David ^a   Falchi, Fabrizio ^b   Zezula, Pavel ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

^b ISTI CNR   (Italy)

Author keywords

Distributed index structures; Metric space; Peer to Peer networks; Scalability; Similarity search

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS;

(ALGORITHMIC) COMPLEXITY; COMPUTATIONAL TASKS; DATA-SETS; DIGITAL DATA; DISTRIBUTED TECHNIQUES; ELSEVIER (CO); INDEXING STRUCTURES; LARGE DATA VOLUMES; PEER-TO-PEER (P2P); QUERY EXECUTION; SIMILARITY SEARCHES; SINGLE SERVERS; SPEED UPS;

DATA STRUCTURES;

EID: 46849117520     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2007.07.012     Document Type: Article

References (33)

1. Zezula P., Amato G., Dohnal V., and Batko M. Similarity Search: The Metric Space Approach. Advances in Database Systems vol. 32 (2006), Springer-Verlag
2. Uhlmann J.K. Satisfying general proximity/similarity queries with metric trees. Information Processing Letters 40 4 (1991) 175-179
3. Batko M., Gennaro C., and Zezula P. Similarity grid for searching in metric spaces. DELOS Workshop: Digital Library Architectures. Lecture Notes in Computer Science vol. 3664/2005 (2005) 25-44
4. Ratnasamy S., Francis P., Handley M., Karp R., and Shenker S. A scalable content addressable network. Proceedings of ACM SIGCOMM 2001 (2001), ACM Press 161-172
5. Stoica I., Morris R., Karger D., Kaashoek M.F., and Balakrishnan H. Chord: A scalable Peer-to-Peer lookup service for internet applications. Proceedings of ACM SIGCOMM'01 (2001), ACM Press 149-160
6. F. Falchi, C. Gennaro, P. Zezula, A content-addressable network for similarity search in metric spaces, in: Proceedings of DBISP2P, 2005, pp. 126-137
7. Novak D., and Zezula P. M-Chord: A scalable distributed similarity search structure. Proceedings of First International Conference on Scalable Information Systems. INFOSCALE 2006, Hong Kong, May 30-June 1 (2006), ACM Press
8. Batko M., Novak D., Falchi F., and Zezula P. On scalability of the similarity search in the world of peers. Proceedings of First International Conference on Scalable Information Systems. INFOSCALE 2006, Hong Kong, May 30-June 1 (2006), ACM Press
9. Litwin W., Neimat M.-A., and Schneider D.A. LH*-A scalable, distributed data structure. ACM Transactions on Database Systems 21 4 (1996) 480-525
10. Hjaltason G.R., and Samet H. Index-driven similarity search in metric spaces. ACM Transactions on Database Systems 28 4 (2003) 517-580
11. Chávez E., Navarro G., Baeza-Yates R., and Marroquín J.L. Searching in metric spaces. ACM Computing Surveys 33 3 (2001) 273-321
12. Dohnal V., Gennaro C., Savino P., and Zezula P. D-index: Distance searching index for metric data sets. Multimedia Tools and Applications 21 1 (2003) 9-33
13. Aberer K. P-Grid: A self-organizing access structure for P2P information systems. Lecture Notes in Computer Science 2172 (2001) 179-194
14. J. Aspnes, G. Shah, Skip graphs, in: Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 384-393
15. N. Harvey, M.B. Jones, S. Saroiu, M. Theimer, A. Wolman, Skipnet: A scalable overlay network with practical locality properties, in: Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, USITS '03, Seattle, WA, 2003
16. A. Crainiceanu, P. Linga, A. Machanavajjhala, J. Gehrke, J. Shanmugasundaram, P-Ring: An index structure for Peer-to-Peer systems, Tech. Rep. TR2004-1946, Cornell University, NY, 2004
17. Cai M., Frank M., Chen J., and Szekely P. MAAN: A multi-attribute addressable network for grid information services. GRID '03: Proceedings of the Fourth International Workshop on Grid Computing (2003), IEEE Computer Society, Washington, DC, USA 184-191
18. Ganesan P., Yang B., and Garcia-Molina H. One torus to rule them all: Multi-dimensional queries in P2P systems. WebDB '04: Proceedings of the 7th International Workshop on the Web and Databases (2004), ACM Press, New York, NY, USA 19-24
19. Bharambe A.R., Agrawal M., and Seshan S. Mercury: Supporting scalable multi-attribute range queries. SIGCOMM Computer Communication Review 34 4 (2004) 353-366
20. Tang C., Xu Z., and Dwarkadas S. Peer-to-Peer information retrieval using self-organizing semantic overlay networks. Proceedings of SIGCOMM '03 (2003), ACM Press, New York, NY, USA 175-186
21. Tanin E., Harwood A., and Samet H. A distributed quadtree index for Peer-to-Peer settings. ICDE (2005), IEEE Computer Society 254-255
22. Banaei-Kashani F., and Shahabi C. SWAM: A family of access methods for similarity-search in Peer-to-Peer data networks. CIKM '04: Proceedings of the Thirteenth ACM Conference on Information and knowledge management (2004), ACM Press 304-313
23. Seidl T., and Kriegel H.-P. Efficient user-adaptable similarity search in large multimedia databases. The VLDB Journal (1997) 506-515
24. Rubner Y., Tomasi C., and Guibas L.J. A metric for distributions with applications to image databases. ICCV '98: Proceedings of the Sixth International Conference on Computer Vision (1998), IEEE Computer Society, Washington, DC, USA 59-66
25. Kröll B., and Widmayer P. Distributing a search tree among a growing number of processors. Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data (1994), ACM Press, Minneapolis 265-276
26. Bustos B., Navarro G., and Chávez E. Pivot selection techniques for proximity searching in metric spaces. Pattern Recognition Letters 24 14 (2003) 2357-2366
27. Ratnasamy S., Handley M., Karp R.M., and Shenker S. Application-level multicast using content-addressable networks. NGC '01: Proceedings of the Third International COST264 Workshop on Networked Group Communication (2001), Springer-Verlag, London, UK 14-29
28. +-tree based indexing method for nearest neighbor search. ACM Transactions on Database Systems 30 2 (2005) 364-397
29. Batko M., Gennaro C., and Zezula P. A scalable nearest neighbor search in P2P systems. Proceedings of DBISP2P. Lecture Notes in Computer Science vol. 3367 (2004) 79-92
30. Levenshtein V.I. Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission 1 (1965) 8-17
31. Needleman S.B., and Wunsch C.D. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology 48 (1970) 443-453
32. Chen C., and Schmidt B. An adaptive grid implementation of DNA sequence alignment. Future Generation Computer Systems 21 7 (2005) 988-1003
33. Özsu M.T., and Valduriez P. Distributed and parallel database systems. ACM Computing Surveys 28 1 (1996) 125-128