Roogle: Supporting Efficient High-Dimensional Range Queries in P2P Systems

  • Di Wu
  • Ye Tian
  • Kam-Wing Ng
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4128)


Multi-dimensional range query is an important query type and especially useful when the user doesn’t know exactly what he is looking for. However, due to improper indexing method and high routing latency, existing schemes cannot perform well under high-dimensional situations. In this paper, we propose Roogle, a decentralized non-flooding P2P search engine that can efficiently support high-dimensional range queries in P2P systems. Roogle makes improvements on both indexing and routing. The high-dimensional data is indexed based on the maximum or minimum value among all dimensions. This simple indexing method performs rather well under high-dimensional situations and tolerates data points with missing values or different dimensionality. To speed query routing, Roogle is built on top of our proposed structured overlay – Aurelia, which has better routing performance by exploiting node heterogeneity. Aurelia also guarantees the data locality and efficiently support range queries. Experimental results from simulation validate the scalability and efficiency of Roogle.


Range Query Virtual Node Query Performance Node Capacity Query Selectivity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Oppenheimer, D., Albrecht, J., Patterson, D., Vahdat, A.: Scalable wide-area resource discovery. In: UC Berkeley Technical Report UCB CSD-04-1334 (2004)Google Scholar
  2. 2.
    Cai, M., Frank, M., Chen, J., Szekely, P.: Maan: A multi-attribute addressable network for grid information services. In: Proc. 4th International Workshop on Grid Computing (Grid2003), Phoenix, Arizona (2003)Google Scholar
  3. 3.
    Schmidt, C., Parashar, M.: Enabling flexible queries with guarantees in p2p systems. Internet Computing Journal 8(3) (2004)Google Scholar
  4. 4.
    Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: Supporting scalable multi-attribute range queries. In: Proc. ACM SIGCOMM 2004(2004)Google Scholar
  5. 5.
    Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proc. VLDB 1998, St. Johns, Canada (1998)Google Scholar
  6. 6.
    Ramabhadran, S., Ratnasamy, S., Hellerstein, J.M., Shenker, S.: Brief announcement: Prefix hash tree. In: Proc. ACM PODC 2004, St. Johns, Canada (2004)Google Scholar
  7. 7.
    Ganesan, P., Yang, B., Garcia-Molina, H.: One torus to rule them all: Multi-dimensional queries in p2p systems. In: Proc. WebDB2004 (2004)Google Scholar
  8. 8.
    Zhang, C., Krishnamurthy, A., Wang, R.Y.: Skipindex: Towards a scalable peer-to-peer index service for high dimensional data. Princeton Technical Report (submitted for publication) (2004)Google Scholar
  9. 9.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. ACM SIGCOMM 2001, San Diego, CA (2001)Google Scholar
  10. 10.
    Aspnes, J., Shah, G.: Skip graphs. In: Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms (2003)Google Scholar
  11. 11.
    Hu, J., et al.: Smartboa: Constructing p2p overlay network in the heterogeneous internet using irregular routing tables. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, Springer, Heidelberg (2005)CrossRefGoogle Scholar
  12. 12.
    Yu, C., Bressan, S., Ooi, B.C., Tan, K.: Querying high-dimensional data in single-dimensional space. VLDB Journal 13(2), 105–119 (2004)CrossRefGoogle Scholar
  13. 13.
    Hardekopf, B., Kwiat, K., Upadhyaya, S.: Secure and fault-tolerant voting in distributed systems. In: IEEE Aerospace Conference (2001)Google Scholar
  14. 14.
  15. 15.
  16. 16.
    Saroiu, S.: Measurement and analysis of internet content delivery systems. Doctoral Dissertation, University of Washington (2004)Google Scholar
  17. 17.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Di Wu
    • 1
  • Ye Tian
    • 1
  • Kam-Wing Ng
    • 1
  1. 1.Department of Computer Science & EngineeringThe Chinese University of Hong KongShatin, N.T., Hong Kong

Personalised recommendations