Similarity Searching in Structured and Unstructured P2P Networks

DOHNAL, Vlastislav and Pavel ZEZULA. Similarity Searching in Structured and Unstructured P2P Networks. In Social-Informatics and Telecommunications Engineering. Berlin Heidelberg: Springer, 2009, p. 400-416. ISBN 978-3-642-10624-8. Available from: https://dx.doi.org/10.1007/978-3-642-10625-5_25.

Basic information

• Original name: Similarity Searching in Structured and Unstructured P2P Networks
• Name in Czech: Podobnostní hledání ve strukturovaných a nestrukturovaných P2P sítích
• Authors: DOHNAL, Vlastislav (203 Czech Republic, guarantor, belonging to the institution) and Pavel ZEZULA (203 Czech Republic, belonging to the institution).
• Edition: Berlin Heidelberg, Social-Informatics and Telecommunications Engineering, p. 400-416, 17 pp. 2009.
• Publisher: Springer

Other information

• Original language: English
• Type of outcome: Proceedings paper
• Field of Study: 10201 Computer sciences, information science, bioinformatics
• Country of publisher: Germany
• Confidentiality degree: is not subject to a state or trade secret
• Publication form: printed version "print"
• WWW: URL
• RIV identification code: RIV/00216224:14330/09:00065867
• Organization unit: Faculty of Informatics
• ISBN: 978-3-642-10624-8
• ISSN: 1867-8211
• Doi: http://dx.doi.org/10.1007/978-3-642-10625-5_25
• UT WoS: 000307744900025
• Keywords (in Czech): similarity searching; structured peer-to-peer network; unstructured peer-to-peer network; self-organizing system; metric space; scalability; resilience to failures; performance evaluation
• Keywords in English: podobnostní hledání; strukturované peer-to-peer sítě; nestrukturované peer-to-peer sítě; samoorganizující se systémy; metrický prostor; škálovatelnost; odolnost proti výpadkům; výkonnostní vyhodnocení
• Tags: DISA
• Tags: International impact, Reviewed

Abstract

The exponential growth of digital data in contemporary computer networks induces a lot of scalability, resilience, and survivability issues. At the same time, the increasing complexity of digital data makes the task of similarity searching that is inherently difficult, more and more important. In this paper, we report on the Multi Feature Indexing Network, MUFIN, which is an extensible, scalable, and infrastructure independent similarity search engine. It is able to achieve high performance and guarantee quality of service by applying structured Peer-to-Peer networks. On the other hand, its unstructured version based on self-organizing principles is extremely robust and able to operate in very volatile environments. To exemplify MUFIN's properties, an on-line demo is available for public use.

Abstract (in Czech)

The exponential growth of digital data in contemporary computer networks induces a lot of scalability, resilience, and survivability issues. At the same time, the increasing complexity of digital data makes the task of similarity searching that is inherently difficult, more and more important. In this paper, we report on the Multi Feature Indexing Network, MUFIN, which is an extensible, scalable, and infrastructure independent similarity search engine. It is able to achieve high performance and guarantee quality of service by applying structured Peer-to-Peer networks. On the other hand, its unstructured version based on self-organizing principles is extremely robust and able to operate in very volatile environments. To exemplify MUFIN's properties, an on-line demo is available for public use.

Links

• GA201/09/0683, research and development project: Name: Vyhledávání v rozsáhlých multimediálních databázích

Investor: Czech Science Foundation, Similarity Searching in Very Large Multimedia Databases

• GP201/07/P240, research and development project: Name: Distribuované indexační struktury pro podobnostní hledání

Investor: Czech Science Foundation, Distributed Index Structures for Similarity Searching