Supporting complex multi-dimensional queries in P2P systems

Bin Liu, Wang-chien Lee, Dik Lun Lee

Research output: Contribution to conferencePaper

65 Citations (Scopus)

Abstract

More and more applications require peer-to-peer (P2P) systems to support complex queries over multi-dimensional data. For example, a P2P auction network for real estate frequently needs to answer queries such as "select five available buildings closest to the airport". Such queries are not efficiently supported in current P2P systems. Towards an efficient and scalable P2P system capable of processing complex multi-dimensional queries, we first propose a comprehensive framework for sharing, indexing, and querying multi-dimensional data, where (i) peers with more computational power coordinate indexing and query processing, and (ii) other peers participate in part of the computation in order to achieve scalability and load-balance. Based on this framework, we propose Network-R-tree (NR-tree), a P2P adaptation of the dominant spatial index - R*-tree. NR-tree, indexing spatial data at clustered peers, is capable of processing complex queries such as range queries and k-nearest neighbor queries. We propose query processing algorithms for range and k-nearest neighbor queries and experimentally prove the effectiveness of proposed techniques with real data.

Original languageEnglish (US)
Pages155-164
Number of pages10
StatePublished - Jan 1 2005
Event25th IEEE International Conference on Distributed Computing Systems - Columbus, OH, United States
Duration: Jun 6 2005Jun 10 2005

Other

Other25th IEEE International Conference on Distributed Computing Systems
CountryUnited States
CityColumbus, OH
Period6/6/056/10/05

Fingerprint

Query processing
Processing
Airports
Scalability

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Liu, B., Lee, W., & Lee, D. L. (2005). Supporting complex multi-dimensional queries in P2P systems. 155-164. Paper presented at 25th IEEE International Conference on Distributed Computing Systems, Columbus, OH, United States.
Liu, Bin ; Lee, Wang-chien ; Lee, Dik Lun. / Supporting complex multi-dimensional queries in P2P systems. Paper presented at 25th IEEE International Conference on Distributed Computing Systems, Columbus, OH, United States.10 p.
@conference{d05ed665178645ddadb03520447e58d0,
title = "Supporting complex multi-dimensional queries in P2P systems",
abstract = "More and more applications require peer-to-peer (P2P) systems to support complex queries over multi-dimensional data. For example, a P2P auction network for real estate frequently needs to answer queries such as {"}select five available buildings closest to the airport{"}. Such queries are not efficiently supported in current P2P systems. Towards an efficient and scalable P2P system capable of processing complex multi-dimensional queries, we first propose a comprehensive framework for sharing, indexing, and querying multi-dimensional data, where (i) peers with more computational power coordinate indexing and query processing, and (ii) other peers participate in part of the computation in order to achieve scalability and load-balance. Based on this framework, we propose Network-R-tree (NR-tree), a P2P adaptation of the dominant spatial index - R*-tree. NR-tree, indexing spatial data at clustered peers, is capable of processing complex queries such as range queries and k-nearest neighbor queries. We propose query processing algorithms for range and k-nearest neighbor queries and experimentally prove the effectiveness of proposed techniques with real data.",
author = "Bin Liu and Wang-chien Lee and Lee, {Dik Lun}",
year = "2005",
month = "1",
day = "1",
language = "English (US)",
pages = "155--164",
note = "25th IEEE International Conference on Distributed Computing Systems ; Conference date: 06-06-2005 Through 10-06-2005",

}

Liu, B, Lee, W & Lee, DL 2005, 'Supporting complex multi-dimensional queries in P2P systems' Paper presented at 25th IEEE International Conference on Distributed Computing Systems, Columbus, OH, United States, 6/6/05 - 6/10/05, pp. 155-164.

Supporting complex multi-dimensional queries in P2P systems. / Liu, Bin; Lee, Wang-chien; Lee, Dik Lun.

2005. 155-164 Paper presented at 25th IEEE International Conference on Distributed Computing Systems, Columbus, OH, United States.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Supporting complex multi-dimensional queries in P2P systems

AU - Liu, Bin

AU - Lee, Wang-chien

AU - Lee, Dik Lun

PY - 2005/1/1

Y1 - 2005/1/1

N2 - More and more applications require peer-to-peer (P2P) systems to support complex queries over multi-dimensional data. For example, a P2P auction network for real estate frequently needs to answer queries such as "select five available buildings closest to the airport". Such queries are not efficiently supported in current P2P systems. Towards an efficient and scalable P2P system capable of processing complex multi-dimensional queries, we first propose a comprehensive framework for sharing, indexing, and querying multi-dimensional data, where (i) peers with more computational power coordinate indexing and query processing, and (ii) other peers participate in part of the computation in order to achieve scalability and load-balance. Based on this framework, we propose Network-R-tree (NR-tree), a P2P adaptation of the dominant spatial index - R*-tree. NR-tree, indexing spatial data at clustered peers, is capable of processing complex queries such as range queries and k-nearest neighbor queries. We propose query processing algorithms for range and k-nearest neighbor queries and experimentally prove the effectiveness of proposed techniques with real data.

AB - More and more applications require peer-to-peer (P2P) systems to support complex queries over multi-dimensional data. For example, a P2P auction network for real estate frequently needs to answer queries such as "select five available buildings closest to the airport". Such queries are not efficiently supported in current P2P systems. Towards an efficient and scalable P2P system capable of processing complex multi-dimensional queries, we first propose a comprehensive framework for sharing, indexing, and querying multi-dimensional data, where (i) peers with more computational power coordinate indexing and query processing, and (ii) other peers participate in part of the computation in order to achieve scalability and load-balance. Based on this framework, we propose Network-R-tree (NR-tree), a P2P adaptation of the dominant spatial index - R*-tree. NR-tree, indexing spatial data at clustered peers, is capable of processing complex queries such as range queries and k-nearest neighbor queries. We propose query processing algorithms for range and k-nearest neighbor queries and experimentally prove the effectiveness of proposed techniques with real data.

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

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

M3 - Paper

AN - SCOPUS:27944486782

SP - 155

EP - 164

ER -

Liu B, Lee W, Lee DL. Supporting complex multi-dimensional queries in P2P systems. 2005. Paper presented at 25th IEEE International Conference on Distributed Computing Systems, Columbus, OH, United States.