Similarity Searching in Structured and Unstructured P2P Networks
| Authors | |
|---|---|
| Year of publication | 2009 |
| Type | Article in Proceedings |
| Conference | Social-Informatics and Telecommunications Engineering |
| MU Faculty or unit | |
| Citation | |
| Web | http://www.springerlink.com/content/p7x14lw730725327/ |
| Doi | http://dx.doi.org/10.1007/978-3-642-10625-5_25 |
| Field | Informatics |
| Keywords | 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í |
| Description | 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. |
| Related projects: |