Content-based similarity search over peer-to-peer systems

Ozgur D. Sahin, Fatih Emekci, Divyakant Agrawal, Amr El Abbadi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

Peer-to-peer applications are used to share large volumes of data. An important requirement of these systems is efficient methods for locating the data of interest in a large collection of data. Unfortunately current peer-to-peer systems either offer exact keyword match functionality or provide inefficient text search methods through centralized indexing or flooding. In this paper we propose a method based on popular Information Retrieval techniques to facilitate content-based searches in peer-to-peer systems. A simulation of the proposed design was implemented and its performance was evaluated using some commonly used test collections, including Ohsumed which was used for the TREC-9 Filtering Track. The experiments demonstrate that our approach is scalable as it achieves high recall by visiting only a small subset of the peers.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsW.S. Ng, B.C. Ooi, A. Ouksel, C. Sartori
Pages61-78
Number of pages18
Volume3367
Publication statusPublished - 2005
Externally publishedYes
EventSecond International Workshop on Databases, Information Systems, and Peer-to-Peer Computing, DBISP2P 2004 - Toronto, Ont., Canada
Duration: 29 Aug 200430 Aug 2004

Other

OtherSecond International Workshop on Databases, Information Systems, and Peer-to-Peer Computing, DBISP2P 2004
CountryCanada
CityToronto, Ont.
Period29/8/0430/8/04

Fingerprint

Information retrieval
Experiments

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Sahin, O. D., Emekci, F., Agrawal, D., & El Abbadi, A. (2005). Content-based similarity search over peer-to-peer systems. In W. S. Ng, B. C. Ooi, A. Ouksel, & C. Sartori (Eds.), Lecture Notes in Computer Science (Vol. 3367, pp. 61-78)

Content-based similarity search over peer-to-peer systems. / Sahin, Ozgur D.; Emekci, Fatih; Agrawal, Divyakant; El Abbadi, Amr.

Lecture Notes in Computer Science. ed. / W.S. Ng; B.C. Ooi; A. Ouksel; C. Sartori. Vol. 3367 2005. p. 61-78.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sahin, OD, Emekci, F, Agrawal, D & El Abbadi, A 2005, Content-based similarity search over peer-to-peer systems. in WS Ng, BC Ooi, A Ouksel & C Sartori (eds), Lecture Notes in Computer Science. vol. 3367, pp. 61-78, Second International Workshop on Databases, Information Systems, and Peer-to-Peer Computing, DBISP2P 2004, Toronto, Ont., Canada, 29/8/04.
Sahin OD, Emekci F, Agrawal D, El Abbadi A. Content-based similarity search over peer-to-peer systems. In Ng WS, Ooi BC, Ouksel A, Sartori C, editors, Lecture Notes in Computer Science. Vol. 3367. 2005. p. 61-78
Sahin, Ozgur D. ; Emekci, Fatih ; Agrawal, Divyakant ; El Abbadi, Amr. / Content-based similarity search over peer-to-peer systems. Lecture Notes in Computer Science. editor / W.S. Ng ; B.C. Ooi ; A. Ouksel ; C. Sartori. Vol. 3367 2005. pp. 61-78
@inproceedings{2f03dccc009f4963a0a693663aebac42,
title = "Content-based similarity search over peer-to-peer systems",
abstract = "Peer-to-peer applications are used to share large volumes of data. An important requirement of these systems is efficient methods for locating the data of interest in a large collection of data. Unfortunately current peer-to-peer systems either offer exact keyword match functionality or provide inefficient text search methods through centralized indexing or flooding. In this paper we propose a method based on popular Information Retrieval techniques to facilitate content-based searches in peer-to-peer systems. A simulation of the proposed design was implemented and its performance was evaluated using some commonly used test collections, including Ohsumed which was used for the TREC-9 Filtering Track. The experiments demonstrate that our approach is scalable as it achieves high recall by visiting only a small subset of the peers.",
author = "Sahin, {Ozgur D.} and Fatih Emekci and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2005",
language = "English",
volume = "3367",
pages = "61--78",
editor = "W.S. Ng and B.C. Ooi and A. Ouksel and C. Sartori",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - Content-based similarity search over peer-to-peer systems

AU - Sahin, Ozgur D.

AU - Emekci, Fatih

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2005

Y1 - 2005

N2 - Peer-to-peer applications are used to share large volumes of data. An important requirement of these systems is efficient methods for locating the data of interest in a large collection of data. Unfortunately current peer-to-peer systems either offer exact keyword match functionality or provide inefficient text search methods through centralized indexing or flooding. In this paper we propose a method based on popular Information Retrieval techniques to facilitate content-based searches in peer-to-peer systems. A simulation of the proposed design was implemented and its performance was evaluated using some commonly used test collections, including Ohsumed which was used for the TREC-9 Filtering Track. The experiments demonstrate that our approach is scalable as it achieves high recall by visiting only a small subset of the peers.

AB - Peer-to-peer applications are used to share large volumes of data. An important requirement of these systems is efficient methods for locating the data of interest in a large collection of data. Unfortunately current peer-to-peer systems either offer exact keyword match functionality or provide inefficient text search methods through centralized indexing or flooding. In this paper we propose a method based on popular Information Retrieval techniques to facilitate content-based searches in peer-to-peer systems. A simulation of the proposed design was implemented and its performance was evaluated using some commonly used test collections, including Ohsumed which was used for the TREC-9 Filtering Track. The experiments demonstrate that our approach is scalable as it achieves high recall by visiting only a small subset of the peers.

UR - http://www.scopus.com/inward/record.url?scp=24144457249&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24144457249&partnerID=8YFLogxK

M3 - Conference contribution

VL - 3367

SP - 61

EP - 78

BT - Lecture Notes in Computer Science

A2 - Ng, W.S.

A2 - Ooi, B.C.

A2 - Ouksel, A.

A2 - Sartori, C.

ER -