LINP: Supporting similarity search in unstructured peer-to-peer networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

An important problem that confronts peer-to-peer (P2P) systems is efficient support for content-based search. In this paper, we look at how similarity query in high-dimensional spaces can be supported in unstructured P2P systems. We design an efficient index mechanism, named Linking Identical Neighborly Partitions (LINP), which takes advantage of both space partitioning and routing indices techniques. We evaluate our proposed scheme over various data sets, and experimental results show the efficacy of our approach.

Original languageEnglish
Title of host publicationAdvances in Data and Web Management - Joint 9th Asia-Pacific Web Conference, APWeb 2007 and 8th International Conference on Web-Age Information Management, WAIM 2007, Proceedings
PublisherSpringer Verlag
Pages127-135
Number of pages9
ISBN (Print)9783540724834
DOIs
StatePublished - 2007
EventJoint 9th Asia-Pacific Web Conference on Advances in Data and Web Management, APWeb 2007 and 8th International Conference on Web-Age Information Management, WAIM 2007 - Huang Shan, China
Duration: 16 Jun 200718 Jun 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4505 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceJoint 9th Asia-Pacific Web Conference on Advances in Data and Web Management, APWeb 2007 and 8th International Conference on Web-Age Information Management, WAIM 2007
Country/TerritoryChina
CityHuang Shan
Period16/06/0718/06/07

Fingerprint

Dive into the research topics of 'LINP: Supporting similarity search in unstructured peer-to-peer networks'. Together they form a unique fingerprint.

Cite this