Advertisement

Parallel Index Structures

  • Yannis Manolopoulos
  • Yannis Theodoridis
  • Vassilis J. Tsotras
Part of the Advances in Database Systems book series (ADBS, volume 17)

Abstract

Access methods compose a powerful tool for efficient query processing in database systems. The research in the field is active for several decades and new access methods are being proposed, because new data types appear in diverse application domains. For example, as explained in previous section, the traditional B-tree approach does not guarantee satisfactory performance as a method to index spatial data (e.g. rectangles, polygons, etc.)

Keywords

Binary Image Query Processing Range Query Access Method Address Space 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abel, D.J. (1983). A B+-tree Structure for Large Quadtrees. Computer Vision, Graphics and Image Processing, 27(1):19–31.CrossRefGoogle Scholar
  2. Bayer, R. and McCreight, E. (1972). Organization and Maintenance of Large Ordered Indexes. Acta Informatica, 1(3):173–189.CrossRefGoogle Scholar
  3. Beckmann, N, Kriegel, H.-P., Schneider, R., and Seeger, B. (1990). The R*-tree: an Efficient and Robust Access Method for Points and Rectangles. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 322–331.Google Scholar
  4. Berchtold, S., Bohm, C., Braunmuller, B, Keim, D.A., and Kriegel, H.-P. (1997). Fast Similarity Search in Multimedia Databases. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 1–12.Google Scholar
  5. Deppisch, U. (1986). S-tree: a Dynamic Balanced Signature Index for Office Retrieval. In Proceedings of ACM SIGIR Conference on Information Retrieval, pages 77–87.Google Scholar
  6. Faloutsos, C. (1985). Access Methods for Text. ACM Computing Surveys, 17(1):49–74.MathSciNetCrossRefGoogle Scholar
  7. Faloutsos, C. and Metaxas, D. (1991). Disk Allocation Methods Using Error Correcting Codes. IEEE Transactions on Computers, 40(8):907–914.CrossRefGoogle Scholar
  8. Gaede, V. and Guenther, O. (1998). Multidimensional Access Methods. ACM Computing Surveys, 30(2):170–231.CrossRefGoogle Scholar
  9. Guttman, A (1984). R-trees: a Dynamic Index for Spatial Searching. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 47–57.Google Scholar
  10. Kamel, I. and Faloutsos, C. (1992). Parallel R-trees. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 195–204.Google Scholar
  11. Li, J., Rotem, D., and Srivastava, J. (1993). Algorithms for Loading Parallel Grid Files. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 347–356.Google Scholar
  12. Litwin, W. and Lomet, D. (1986). The Bounded Disorder Access Method. In Proceedings of the 2 nd IEEE International Conference on Data Engineering, pages 38–48.Google Scholar
  13. Litwin, W., Neimat, M.A., and Schneider, D. (1993). LH*: a Scalable, Distributed Data Structure. ACM Transactions on Database Systems, 21(4):480–525.CrossRefGoogle Scholar
  14. Litwin, W., Neimat, M.A., and Schneider, D. (1996). LH*: Linear Hashing for Distributed Files. Proceedings of ACM SIGMOD Conference on Management of Data, pages 327–336.Google Scholar
  15. Litwin, W. and Neimat, M.A. (1996). High Availability LH* Schemes with Mirroring. Proceedings of the 1 st International Conference on Cooperative Information Systems, pages 196–205..Google Scholar
  16. Liu, D.-R. and Shekhar, S. (1995). A Similarity Graph-based Approach to Declustering Problems and Its Application towards Paralleling Grid Files. In Proceedings of the 11 th IEEE International Conference on Data Engineering, pages 373–381.Google Scholar
  17. Nanopoulos, A., Psiliagos, G., Papadopoulos, A.N., and Manolopoulos, Y. (1997a). Parallel Linear Quadtrees. Proceedings of the 6 th Hellenic Conference in Informatics, Vol.2, pages 401–410.Google Scholar
  18. Nanopoulos, A., Papadopoulos, A., and Manolopoulos, Y. (1997b). On the Impact of Area Balancing of Declustered Linear Quadtrees. In Proceedings of the 2nd International Conference for Geographical Information Systems in Urban, Environmental and Regional Planning (Athens, Greece), pages 736–747.Google Scholar
  19. Papadopoulos, A.N. and Manolopoulos, Y. (1996). Parallel Processing of Nearest Neighbor Queries in Declustered Spatial Data. In Proceedings of the 4 th ACM Workshop on Advances in Geographic Information Systems, pages 35–43.Google Scholar
  20. Papadopoulos, A.N. and Manolopoulos, Y. (1997). Nearest Neighbor Queries in Shared-Nothing Environments. GeoInformatica, 1(4):369–392.CrossRefGoogle Scholar
  21. Papadopoulos, A.N., Giannakidou, I., Orfanidou, M., and Manolopoulos, Y. (1997). Performance Evaluation of Paged Quadtrees on a Single-processor Multi-disk System. In Proceedings of the DataSem’ 97 Conference, pages 201–210.Google Scholar
  22. Papadopoulos, A.N. and Manolopoulos, Y. (1998). Similarity Query Processing Using Disk Arrays. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 225–236.Google Scholar
  23. Patterson, D.A., Gibson, G.A., and Katz, R.H. (1988). A Case for Redundant Arrays of Inexpensive Disks (RAID). In Proceedings of ACM SIGMOD Conference on Management of Data, pages 109–116.Google Scholar
  24. Patterson, D. and Hennessy, J. (1990). Computer Architecture: A Quantitative Approach, Morgan-Kaufmann.Google Scholar
  25. Samet, H. (1990). The Design and Analysis of Spatial Data Structures, Addison-Wesley.Google Scholar
  26. Seeger, B. and Larson, P.A. (1991). Multi-Disk B-trees. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 436–445.Google Scholar
  27. Sellis, T., Roussopoulos, N., and Faloutsos, C. (1987). The R+-tree: a Dynamic Index for Multi-Dimensional Objects. In Proceedings of the 13 th International Conference on Very Large Data Bases, pages 507–518.Google Scholar
  28. Seo, M. and Kim, C.-H. (1995). Allocation Strategies of Multimedia Data on Disk Arrays. Computer Communications, 18(3):185–191.MathSciNetCrossRefGoogle Scholar
  29. Tousidou, E., Vassilakopoulos, M., and Manolopoulos, Y. (1999). Performance Evaluation of Parallel S-trees. Journal of Database Management, to appear.Google Scholar
  30. Zezula, P., Savino, P., Rabitti, F., Amato, G., and Ciaccia, P. (1998). Processing M-trees with Parallel Resources. In Proceedings of the 8 th International Workshop on Research Issues in Data Engineering, pages 147–154.Google Scholar
  31. Zhou, Y., Shekhar S., and Coyle, M. (1994). Disk Allocation Methods for Parallelizing Grid Files. In Proceedings of the 10 th IEEE International Conference on Data Engineering, pages 243–252.Google Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Yannis Manolopoulos
    • 1
  • Yannis Theodoridis
    • 2
  • Vassilis J. Tsotras
    • 3
  1. 1.Aristotle UniversityGreece
  2. 2.Greece
  3. 3.University of CaliforniaRiversideUSA

Personalised recommendations