Skip to main content
SpringerLink
Log in

The PN-Tree: A Parallel and Distributed Multidimensional Index

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

Multidimensional indexing is concerned with the indexing of multi-attributed records, where queries can be applied on some or all of the attributes. Indexing multi-attributed records is referred to by the term multidimensional indexing because each record is viewed as a point in a multidimensional space with a number of dimensions that is equal to the number of attributes. The values of the point coordinates along each dimension are equivalent to the values of the corresponding attributes. In this paper, the PN-tree, a new index structure for multidimensional spaces, is presented. This index structure is an efficient structure for indexing multidimensional points and is parallel by nature. Moreover, the proposed index structure does not lose its efficiency if it is serially processed or if it is processed using a small number of processors. The PN-tree can take advantage of as many processors as the dimensionality of the space. The PN-tree makes use of B+-trees that have been developed and tested over years in many DBMSs. The PN-tree is compared to the Hybrid tree that is known for its superiority among various index structures. Experimental results show that parallel processing of the PN-tree reduces significantly the number of disk accesses involved in the search operation. Even in its serial case, the PN-tree outperforms the Hybrid tree for large database sizes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. Aref and I. Ilyas, “SP-GiST: An extensible database index for supporting space partitioning trees,” Journal of Intelligent Information Systems (JIIS), vol. 17, pp. 215–240, 2001.

    Google Scholar 

  2. R. Bayer, “The universal B-Tree for multidimensional Indexing: General Concepts,” in World Wide Computing and its Applications (WWCA, 97), 1997, pp. 198–209.

  3. N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, “The R*-tree: An efficient and robust access method for points and rectangles,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1990, pp. 322–331.

  4. J.L. Bentley, “Multidimensional binary search trees used for associative searching,” Communications of the ACM (CACM), vol. 18, no. 9, pp. 509–517, 1975.

    Google Scholar 

  5. S. Berchtold, D.A. Keim, and H.P. Kriegel, “The X-tree: An index structure for high-dimensional data,” in Proceedings of the International Conference on Very Large Databases (VLDB), 1996, pp. 28–39.

  6. K. Chakrabarti and S. Mehrotra, “High dimensional feature indexing using hybrid trees,” in Proceedings of the International Conference on Data Engineering (ICDE), 1999, pp. 440–447.

  7. C. Faloutsos and I. Kamel, “High performance R-trees,” IEEE Data Eng. Bull, vol. 16, no. 3, pp. 28–33, 1993.

    Google Scholar 

  8. M. Freeston, “The BANG file: A new kind of grid file,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1987, pp. 260–269.

  9. V. Gaede and O. Günther, “Multidimensional access methods,” ACM Computing Surveys, vol. 30, no. 2, pp. 170–231, 1998.

    Google Scholar 

  10. A. Guttman, “R-Trees: A dynamic index structure for spatial searching,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1984, pp. 47–57.

  11. A. Henrich, H.W. Six, and P. Widmayer, “The LSD tree: Spatial access to multidimensional point and nonpoint objects,” in Proceedings of the International Conference on Very Large Databases (VLDB), 1989, pp. 45–53.

  12. K. Hinrichs, “Implementation of the grid file: Design concepts and experience,” BIT Journal, vol. 25, no. 4, pp. 569–592, 1985.

    Google Scholar 

  13. A. Hutflesz, H.W. Six, and P. Widmayer, “Twin grid files: Space optimizing access schemes,” In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1988, pp. 183–190.

  14. H.V. Jagadish, “On indexing line segments,” in Proceedings of the International Conference on Very Large Databases (VLDB), 1990, pp. 614–625.

  15. I. Kamel and C. Faloutsos, “Parallel R-trees,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1992, pp. 195–204.

  16. N. Katayama and S. Satoh, “The SR-tree: An index structure for high-dimensional nearest neighbor queries,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1997, pp. 369–380.

  17. A. Klinger, “Patterns and search statistics,” in Optimizing Methods in Statistics, J.S. Rustagi (Ed.), Academic Press: NY, 1971, pp. 303–337.

    Google Scholar 

  18. K.I. Lin, H.V. Jagadish, and C. Faloutsos, “The TV-tree: An index structure for high-dimensional data,” VLDB Journal, vol. 3, no. 4, pp. 517–542 1994.

    Google Scholar 

  19. D.B. Lomet and B. Salzberg, “The hB-tree: A multiattribute indexing method with good guaranteed performance,” ACM Transaction on Database System (TODS), vol. 15, no. 4, pp. 625–658, 1990.

    Google Scholar 

  20. J. Nievergelt, H. Hinterberger, and K. Sevick, “The grid file: An adaptable, symmetric multikey file structure,” ACM Transactions On Database Systems (TODS), vol. 9, no. 1, pp. 38–71, 1984.

    Google Scholar 

  21. J.T. Robinson, “The K-D-B-tree: A search structure for large multidimensional dynamic indexes,” in Proceedings of the SIGMOD International Conference on Management of Data, 1981, pp. 10–18.

  22. N. Roussopoulos, S. Kelly, and F. Vincent, “Nearest neighbor queries,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, 1995, pp. 71–79.

  23. H. Samet, “Spatial data structures,” Modern Database Systems: The Object Model, Interoperability, and Beyond, Addison Wesley/ACM Press, 1995, pp. 361–385.

  24. B. Seeger and H.P. Kriegel, “The buddy tree: an efficient and robust access method for spatial database systems,” in Proceedings of the International Conference on Very Large Databases (VLDB), 1990, pp. 590–601.

  25. T.K. Sellis, N. Roussopoulos, and C. Faloutsos, “Multidimensional access methods: Trees have grown everywhere,” in Proceedings of the International Conference on Very Large Databases (VLDB), 1997, pp. 13–14.

  26. H.W. Six and P. Widmayer, “Spatial searching in geometric databases,” in Proceedings of the International Conference on Data Engineering (ICDE), 1988, pp. 496–503.

  27. M. Tamminen, “The extendible cell method for closest point problems,” BIT Journal, vol. 22, no. 1, pp. 27–41, 1982.

    Google Scholar 

  28. R. Weber, H.J. Schek and S. Blott, “A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces,” in Proceedings of the International Conference on Very Large Databases (VLDB), 1998, pp. 194–205.

  29. D. White and R. Jain, “Similarity indexing with the SS-tree,” in Proceedings of International Conference on Data Engineering (ICDE), 1996, pp. 516–523.

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Purdue University, West Lafayette, IN, 47907, USA

    M.H. Ali

  2. Department of Computer Science and Automatic Control, Faculty of Engineering, Alexandria University, Alexandria, Egypt

    A.A. Saad & M.A. Ismail

Authors
  1. M.H. Ali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A.A. Saad
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M.A. Ismail
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M.H. Ali.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ali, M., Saad, A. & Ismail, M. The PN-Tree: A Parallel and Distributed Multidimensional Index. Distrib Parallel Databases 17, 111–133 (2005). https://doi.org/10.1007/s10619-004-0234-6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10619-004-0234-6

Search

Navigation