PRISM

Indexing multi-dimensional data in P2P networks using reference vectors

O. D. Sahin, A. Gulbeden, F. Emekci, D. Agrawal, A. El Abbadi

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

23 Citations (Scopus)

Abstract

Peer-to-peer (P2P) systems research has gained considerable attention recently with the increasing popularity of file sharing applications. Since these applications are used for sharing huge amounts of data, it is very important to efficiently locate the data of interest in such systems. However, these systems usually do not provide efficient search techniques. Existing systems offer only keyword search functionality through a centralized index or by query flooding. In this paper, we propose a scheme based on ref erence vectors for sharing multi-dimensional data in P2P systems. This scheme effectively supports a larger set of query operations (such as k-NN queries and content-based similarity search) than current systems, which generally support only exact key lookups and keyword searches. The basic idea is to store multiple replicas of an object's index at different peers based on the distances between the object's feature vector and the reference vectors. Later, when a query is posed, the system identifies the peers that are likely to store the index information about relevant objects using reference vectors. Thus the system is able to return accurate results by contacting a small fraction of the participating peers.

Original languageEnglish
Title of host publicationProceedings of the 13th ACM International Conference on Multimedia, MM 2005
Pages946-955
Number of pages10
DOIs
Publication statusPublished - 1 Dec 2005
Externally publishedYes
Event13th ACM International Conference on Multimedia, MM 2005 - Singapore, Singapore
Duration: 6 Nov 200511 Nov 2005

Other

Other13th ACM International Conference on Multimedia, MM 2005
CountrySingapore
CitySingapore
Period6/11/0511/11/05

Keywords

  • Peer-to-Peer Systems
  • Reference Vectors
  • Similarity Search

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Computer Vision and Pattern Recognition
  • Human-Computer Interaction
  • Software

Cite this

Sahin, O. D., Gulbeden, A., Emekci, F., Agrawal, D., & El Abbadi, A. (2005). PRISM: Indexing multi-dimensional data in P2P networks using reference vectors. In Proceedings of the 13th ACM International Conference on Multimedia, MM 2005 (pp. 946-955) https://doi.org/10.1145/1101149.1101349

PRISM : Indexing multi-dimensional data in P2P networks using reference vectors. / Sahin, O. D.; Gulbeden, A.; Emekci, F.; Agrawal, D.; El Abbadi, A.

Proceedings of the 13th ACM International Conference on Multimedia, MM 2005. 2005. p. 946-955.

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

Sahin, OD, Gulbeden, A, Emekci, F, Agrawal, D & El Abbadi, A 2005, PRISM: Indexing multi-dimensional data in P2P networks using reference vectors. in Proceedings of the 13th ACM International Conference on Multimedia, MM 2005. pp. 946-955, 13th ACM International Conference on Multimedia, MM 2005, Singapore, Singapore, 6/11/05. https://doi.org/10.1145/1101149.1101349
Sahin OD, Gulbeden A, Emekci F, Agrawal D, El Abbadi A. PRISM: Indexing multi-dimensional data in P2P networks using reference vectors. In Proceedings of the 13th ACM International Conference on Multimedia, MM 2005. 2005. p. 946-955 https://doi.org/10.1145/1101149.1101349
Sahin, O. D. ; Gulbeden, A. ; Emekci, F. ; Agrawal, D. ; El Abbadi, A. / PRISM : Indexing multi-dimensional data in P2P networks using reference vectors. Proceedings of the 13th ACM International Conference on Multimedia, MM 2005. 2005. pp. 946-955
@inproceedings{dfd9f4cb72b7405b9bdc092e710f6249,
title = "PRISM: Indexing multi-dimensional data in P2P networks using reference vectors",
abstract = "Peer-to-peer (P2P) systems research has gained considerable attention recently with the increasing popularity of file sharing applications. Since these applications are used for sharing huge amounts of data, it is very important to efficiently locate the data of interest in such systems. However, these systems usually do not provide efficient search techniques. Existing systems offer only keyword search functionality through a centralized index or by query flooding. In this paper, we propose a scheme based on ref erence vectors for sharing multi-dimensional data in P2P systems. This scheme effectively supports a larger set of query operations (such as k-NN queries and content-based similarity search) than current systems, which generally support only exact key lookups and keyword searches. The basic idea is to store multiple replicas of an object's index at different peers based on the distances between the object's feature vector and the reference vectors. Later, when a query is posed, the system identifies the peers that are likely to store the index information about relevant objects using reference vectors. Thus the system is able to return accurate results by contacting a small fraction of the participating peers.",
keywords = "Peer-to-Peer Systems, Reference Vectors, Similarity Search",
author = "Sahin, {O. D.} and A. Gulbeden and F. Emekci and D. Agrawal and {El Abbadi}, A.",
year = "2005",
month = "12",
day = "1",
doi = "10.1145/1101149.1101349",
language = "English",
isbn = "1595930442",
pages = "946--955",
booktitle = "Proceedings of the 13th ACM International Conference on Multimedia, MM 2005",

}

TY - GEN

T1 - PRISM

T2 - Indexing multi-dimensional data in P2P networks using reference vectors

AU - Sahin, O. D.

AU - Gulbeden, A.

AU - Emekci, F.

AU - Agrawal, D.

AU - El Abbadi, A.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - Peer-to-peer (P2P) systems research has gained considerable attention recently with the increasing popularity of file sharing applications. Since these applications are used for sharing huge amounts of data, it is very important to efficiently locate the data of interest in such systems. However, these systems usually do not provide efficient search techniques. Existing systems offer only keyword search functionality through a centralized index or by query flooding. In this paper, we propose a scheme based on ref erence vectors for sharing multi-dimensional data in P2P systems. This scheme effectively supports a larger set of query operations (such as k-NN queries and content-based similarity search) than current systems, which generally support only exact key lookups and keyword searches. The basic idea is to store multiple replicas of an object's index at different peers based on the distances between the object's feature vector and the reference vectors. Later, when a query is posed, the system identifies the peers that are likely to store the index information about relevant objects using reference vectors. Thus the system is able to return accurate results by contacting a small fraction of the participating peers.

AB - Peer-to-peer (P2P) systems research has gained considerable attention recently with the increasing popularity of file sharing applications. Since these applications are used for sharing huge amounts of data, it is very important to efficiently locate the data of interest in such systems. However, these systems usually do not provide efficient search techniques. Existing systems offer only keyword search functionality through a centralized index or by query flooding. In this paper, we propose a scheme based on ref erence vectors for sharing multi-dimensional data in P2P systems. This scheme effectively supports a larger set of query operations (such as k-NN queries and content-based similarity search) than current systems, which generally support only exact key lookups and keyword searches. The basic idea is to store multiple replicas of an object's index at different peers based on the distances between the object's feature vector and the reference vectors. Later, when a query is posed, the system identifies the peers that are likely to store the index information about relevant objects using reference vectors. Thus the system is able to return accurate results by contacting a small fraction of the participating peers.

KW - Peer-to-Peer Systems

KW - Reference Vectors

KW - Similarity Search

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

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

U2 - 10.1145/1101149.1101349

DO - 10.1145/1101149.1101349

M3 - Conference contribution

SN - 1595930442

SN - 9781595930446

SP - 946

EP - 955

BT - Proceedings of the 13th ACM International Conference on Multimedia, MM 2005

ER -