DHR-trees: A distributed multidimensional indexing structure for P2P systems

Proceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006

Volumn , Issue , 2006, Pages 281-288

  Wei, Xinfa ^a   Sezaki, Kaoru ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANT COMPUTER SYSTEMS; HILBERT SPACES; INDEXING (OF INFORMATION); QUERY LANGUAGES; TREES (MATHEMATICS);

MULTIDIMENSIONAL RANGE QUERY; PEER-TO-PEER SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34547511915     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPDC.2006.19     Document Type: Conference Paper

References (17)

1. The gnutella web site, http://gnutella.wego.com.
2. The kazaa web site, http://www.kazaa.com.
3. K. Aberer. P-Grid: A Self-Organizing Access Structure for P2P Information Systems, volume 2172. Jan. 2001.
4. J. Aspnes and G. Shah. Skip graphs. In SODA '03: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pages 384-393, Philadelphia, PA, USA, 2003. Society for Industrial and Applied Mathematics.
5. A. Crainiceanu, P. Linga, J. Gehrke, and J. Shanmugasundaram. Querying peer-to-peer networks using p-trees. In WebDB '04: Proceedings of the 7th International Workshop on the Web and Databases, pages 25-30, New York, NY, USA, 2004. ACM Press.
6. V. Gaede and O. Gunther. Multidimensional access methods. ACM Comput. Surv., 30(2): 170-231, 1998.
7. P. Ganesan, B. Yang, and H. Garcia-Molina. One torus to rule them all: multi-dimensional queries in p2p systems. In WebDB '04: Proceedings of the 7th International Workshop on the Web and Databases, pages 19-24, New York, NY, USA, 2004. ACM Press.
8. A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD '84: Proceedings of the 1984 ACM SIGMOD international conference on Management of data, pages 47-57, New York, NY, USA, 1984. ACM Press.
9. H. V. Jagadish, B. C. Ooi, and Q. H. Vu. Baton: a balanced tree structure for peer-to-peer networks. In VLDB '05: Proceedings of the 31st international conference on Very large data bases, pages 661-672. VLDB Endowment, 2005.
10. H. T. N. Jordi Pujol Ahullo, Ruben Mondejar Andreu. Planetsim. http://planet.urv.es/planetsim/.
11. A. Mondal, Y Lifu, and M. Kitsuregawa. P2PR-Tree: An R-Tree-Based Spatial Index for Peer-to-Peer Environments, volume 3268. Jan. 2004.
12. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A scalable content-addressable network. In SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pages 161-172, New York, NY, USA, 2001. ACM Press.
13. A. Rowstron and P. Druschel. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, volume 2218. Jan. 2001.
14. C. Schmidt and M. Parashar. Enabling flexible queries with guarantees in p2p systems. Internet Computing, IEEE, 8(3): 19-26, 2004.
15. Y Shu, B. C. Ooi, K.-L. Tan, and A. Zhou. Supporting multi-dimensional range queries in peer-to-peer systems. In Peer-to-Peer Computing, 2005. P2P 2005. Fifth IEEE International Conference on, pages 173-180, 2005.
16. I. Stoica, R. Morris, D. Karger, M. E Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pages 149-160, New York, NY, USA, 2001. ACM Press.
17. E. Tanin, A. Harwood, and H. Samet. A distributed quadtree index for peer-to-peer settings. In Data Engineering, 2005. ICDE 2005. Proceedings. 21st International Conference on, pages 254-255, 2005.