PRoBe: Multi-dimensional range queries in P2P networks

O. D. Sahin, S. Antony, D. Agrawal, A. El Abbadi

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

5 Citations (Scopus)

Abstract

Structured P2P systems are effective for exact key searches in a distributed environment as they offer scalability, self-organization, and dynamicity. These valuable properties also make them a candidate for more complex queries, such as range queries. In this paper, we describe PRoBe, a system that supports range queries over multiple attributes in P2P networks. PRoBe uses a multi-dimensional:logical space for this purpose and maps data items onto this space based on their attribute values. The logical space is divided into hyper-rectangles, each maintained by a peer in the system. The range queries correspond to hyper-rectangles which are answered by forwarding the query to the peers responsible for overlapping regions of the logical space. We also propose load balancing techniques and show how cached query answers can be utilized for the efficient evaluation of similar range queries. The performance of PRoBe and the effects of various parameters are analyzed through a simulation study.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages332-346
Number of pages15
Volume3806 LNCS
DOIs
Publication statusPublished - 1 Dec 2005
Externally publishedYes
Event6th International Conference on Web Information Systems Engineering, WISE 2005 - New York, NY, United States
Duration: 20 Nov 200522 Nov 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3806 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other6th International Conference on Web Information Systems Engineering, WISE 2005
CountryUnited States
CityNew York, NY
Period20/11/0522/11/05

Fingerprint

Range Query
P2P Network
Resource allocation
Scalability
Query
Rectangle
Attribute
P2P Systems
Distributed Environment
Self-organization
Load Balancing
Overlapping
Simulation Study
Evaluation

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Sahin, O. D., Antony, S., Agrawal, D., & El Abbadi, A. (2005). PRoBe: Multi-dimensional range queries in P2P networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3806 LNCS, pp. 332-346). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3806 LNCS). https://doi.org/10.1007/11581062_25

PRoBe : Multi-dimensional range queries in P2P networks. / Sahin, O. D.; Antony, S.; Agrawal, D.; El Abbadi, A.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3806 LNCS 2005. p. 332-346 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3806 LNCS).

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

Sahin, OD, Antony, S, Agrawal, D & El Abbadi, A 2005, PRoBe: Multi-dimensional range queries in P2P networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3806 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3806 LNCS, pp. 332-346, 6th International Conference on Web Information Systems Engineering, WISE 2005, New York, NY, United States, 20/11/05. https://doi.org/10.1007/11581062_25
Sahin OD, Antony S, Agrawal D, El Abbadi A. PRoBe: Multi-dimensional range queries in P2P networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3806 LNCS. 2005. p. 332-346. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11581062_25
Sahin, O. D. ; Antony, S. ; Agrawal, D. ; El Abbadi, A. / PRoBe : Multi-dimensional range queries in P2P networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3806 LNCS 2005. pp. 332-346 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0b4faad8dfad4ae0b0c05b9347784dc2,
title = "PRoBe: Multi-dimensional range queries in P2P networks",
abstract = "Structured P2P systems are effective for exact key searches in a distributed environment as they offer scalability, self-organization, and dynamicity. These valuable properties also make them a candidate for more complex queries, such as range queries. In this paper, we describe PRoBe, a system that supports range queries over multiple attributes in P2P networks. PRoBe uses a multi-dimensional:logical space for this purpose and maps data items onto this space based on their attribute values. The logical space is divided into hyper-rectangles, each maintained by a peer in the system. The range queries correspond to hyper-rectangles which are answered by forwarding the query to the peers responsible for overlapping regions of the logical space. We also propose load balancing techniques and show how cached query answers can be utilized for the efficient evaluation of similar range queries. The performance of PRoBe and the effects of various parameters are analyzed through a simulation study.",
author = "Sahin, {O. D.} and S. Antony and D. Agrawal and {El Abbadi}, A.",
year = "2005",
month = "12",
day = "1",
doi = "10.1007/11581062_25",
language = "English",
isbn = "3540300171",
volume = "3806 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "332--346",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - PRoBe

T2 - Multi-dimensional range queries in P2P networks

AU - Sahin, O. D.

AU - Antony, S.

AU - Agrawal, D.

AU - El Abbadi, A.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - Structured P2P systems are effective for exact key searches in a distributed environment as they offer scalability, self-organization, and dynamicity. These valuable properties also make them a candidate for more complex queries, such as range queries. In this paper, we describe PRoBe, a system that supports range queries over multiple attributes in P2P networks. PRoBe uses a multi-dimensional:logical space for this purpose and maps data items onto this space based on their attribute values. The logical space is divided into hyper-rectangles, each maintained by a peer in the system. The range queries correspond to hyper-rectangles which are answered by forwarding the query to the peers responsible for overlapping regions of the logical space. We also propose load balancing techniques and show how cached query answers can be utilized for the efficient evaluation of similar range queries. The performance of PRoBe and the effects of various parameters are analyzed through a simulation study.

AB - Structured P2P systems are effective for exact key searches in a distributed environment as they offer scalability, self-organization, and dynamicity. These valuable properties also make them a candidate for more complex queries, such as range queries. In this paper, we describe PRoBe, a system that supports range queries over multiple attributes in P2P networks. PRoBe uses a multi-dimensional:logical space for this purpose and maps data items onto this space based on their attribute values. The logical space is divided into hyper-rectangles, each maintained by a peer in the system. The range queries correspond to hyper-rectangles which are answered by forwarding the query to the peers responsible for overlapping regions of the logical space. We also propose load balancing techniques and show how cached query answers can be utilized for the efficient evaluation of similar range queries. The performance of PRoBe and the effects of various parameters are analyzed through a simulation study.

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

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

U2 - 10.1007/11581062_25

DO - 10.1007/11581062_25

M3 - Conference contribution

AN - SCOPUS:33744814068

SN - 3540300171

SN - 9783540300175

VL - 3806 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 332

EP - 346

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -