MIME: A Dynamic Index Scheme for Multi-dimensional Query in Mobile P2P Networks

  • Ping Wang
  • Lidan Shou
  • Gang Chen
  • Jinxiang Dong
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4443)


Nowadays, as the mobile services become widely used, there is a strong demand for mobile support in P2P search techniques. In this paper, we introduce a new cost model for searching multi-dimensional data in mobile P2P environment and propose a novel multi-dimensional MP2P search scheme MIME. MIME models the physical node layout in a two-dimensional plane and keeps records of the locations of the nodes to construct a proximity-aware P2P overlay. MIME also incorporates two adaptive features: an update algorithm that makes dynamic updates to the overlay, and a cache mechanism that reduces the load of data migration during the updates. Experiment results show that MIME achieves significant performance improvements in point/range queries compared to the conventional system.


Range Query Point Query Data Migration Cache Mechanism Data Zone 
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.
    Aspnes, J., Shah, G.: Skip graphs. In: SODA (2003)Google Scholar
  2. 2.
    Bentley, J.L.: Multidimensional binary search trees used for associative searching. CACM (1975)Google Scholar
  3. 3.
    Camp, T., Boleng, J., Davies, V.: A survey of mobility models for ad hoc network research. In: WCMC (2002)Google Scholar
  4. 4.
    Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.I.T.: Topology-aware routing in structured peer-to-peer overlay networks. In: FuDiCo (2003)Google Scholar
  5. 5.
    Ganesan, P., Yang, B., Molina, H.G.: One torus to rule them all: Multidimensional queries in p2p systems. In: WebDB (2004)Google Scholar
  6. 6.
    Jagadish, H.: Linear clustering of objects with multiple attributes. In: SIGMOD (1990)Google Scholar
  7. 7.
    Orenstein, J.A., Merrett, T.H.: A class of data structures for associative searching. In: PODS (1984)Google Scholar
  8. 8.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM (2001)Google Scholar
  9. 9.
    Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-aware overlay construction and server selection. In: INFOCOM (2002)Google Scholar
  10. 10.
    Schmidt, C., Parashar, M.: Flexible information discovery in decentralized distributed systems. In: HPDC (2003)Google Scholar
  11. 11.
    Shu, Y.F.: Supporting complex queries in P2P networks. PhD thesis, National University of Singapore (2005)Google Scholar
  12. 12.
    Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM (2001)Google Scholar
  13. 13.
    Wang, P., Shou, L.D., Chen, G., Dong, J.X.: MIME: A dynamic index scheme for multi-dimensional query in mobile P2P networks (extended version),
  14. 14.
    Winter, R., Zahn, T., Schiller, J.: Random landmarking in mobile, topology-aware peer-to-peer networks. In: FTDCS (2004)Google Scholar
  15. 15.
    Zahn, T., Winter, R., Schiller, J.: Simple, efficient peer-to-peer overlay clustering in mobile, ad hoc networks. In: ICON (2004)Google Scholar
  16. 16.
    Zhang, C., Krishnamurthy, A., Wang, R.Y.: Skipindex: Towards a scalable peer-to-peer index service for high dimensional data. Technical Report, TR-703-04 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Ping Wang
    • 1
  • Lidan Shou
    • 1
  • Gang Chen
    • 1
  • Jinxiang Dong
    • 1
  1. 1.College of Computer Science, Zhejiang UniversityChina

Personalised recommendations