Supporting multi-dimensional range queries in peer-to-peer systems
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 multidimensional range queries, one needs to consider such issues as space partitioning and mapping, efficient query processing, and load bala...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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 multidimensional range queries, one needs to consider such issues as space partitioning and mapping, efficient query processing, and load balancing. In this paper, the authors describe a scheme called ZNet, which addresses all these issues. Moreover, an extensive performance study which evaluates ZNet against several recent proposals was conducted, and results show that ZNet possesses nearly all desirable properties, while others typically fail in one or another. |
---|---|
ISSN: | 2161-3559 |
DOI: | 10.1109/P2P.2005.35 |