Please use this identifier to cite or link to this item:
|Title:||Supporting multi-dimensional range queries in peer-to-peer systems|
|Authors:||Shu, Y. |
|Citation:||Shu, Y., Ooi, B.C., Tan, K.-L., Zhou, A. (2005). Supporting multi-dimensional range queries in peer-to-peer systems. Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005 2005 : 173-180. ScholarBank@NUS Repository. https://doi.org/10.1109/P2P.2005.35|
|Abstract:||Today's peer-to-peer (P2P) systems are unable to cope well with range queries on multi-dimensional data. To extend existing P2P systems and thus support multi-dimensional range queries, one needs to consider such issues as space partitioning and mapping, efficient query processing, and load balancing. In this paper, we describe our scheme called ZNet, which addresses all these issues. Moreover, we conduct an extensive performance study which evaluates ZNet against several recent proposals, and our results show that ZNet possesses nearly all desirable properties, while others typically fail in one or another. © 2005 IEEE.|
|Source Title:||Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 20, 2018
WEB OF SCIENCETM
checked on Sep 4, 2018
checked on Aug 3, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.