Skip to main content

A general multidimensional data allocation method for multicomputer database systems

  • Allocation Concepts
  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1308))

Included in the following conference series:

Abstract

Several studies have demonstrated that both the performance and scalability of a shared-nothing parallel database system depend on the physical layout of data across the processing nodes of the system. Today, data is allocated in these systems using horizontal partitioning strategies. This approach has a number of drawbacks. In recent years, several multidimensional data declustering techniques have been proposed to address these problems. However, these schemes are too restrictive, or optimized for a certain type of queries. In this paper, we introduce a new technique which is flexible, and performs well for general queries.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Khaled A. S. Abdel-Ghaffar and Anir El Abbadi. Optimal disk allocation for partial match. ACM Trans. on Database Systems, 18(1):132–156, March 1993.

    Google Scholar 

  2. H. C. Du and J. S. Sobolewski. Disk allocation for cartesian product files on multiple disk systems. ACM Trans. on Database Systems, 7(1):82–101, March 1982.

    Google Scholar 

  3. C. Faloutsos and P. Bhagwat. Declustering using fractals. In Proc. of Hie Int'l Conf. on Parallel and Distributed Information Systems, pages 18–25, San Diego, California, January 1993.

    Google Scholar 

  4. C. Faloutsos and D. Metaxas. Disk allocation methods using error correcting codes. IEEE Trans. on Computers, C-40(8):907–914, August 1991.

    Google Scholar 

  5. C. Faloutsos and S. Roseman. Fractals for secondary key retrieval. In Proc. of ACM Symposium on Principles of Database Systems, pages 247–252, March 1989.

    Google Scholar 

  6. H. V. Jagadish. Linear clustering of objects with multiple attributes. In Proc. of ACM SIGMOD Conf., pages 332–342, Atlantic City, New Jersey, May 1990.

    Google Scholar 

  7. M. H. Kim and S. Pramanik. Optimal file distribution for partial match retrieval. In Proc. of ACM SIGMOD Conf., pages 173–182, Chicago, Illinois, June 1988.

    Google Scholar 

  8. J. Nievergelt, H. Hinterberger, and K. C. Sevcik. The grid file: An adaptive symmetric multikey file structure. ACM Trans. on Database Systems, 9(1):38–71, March 1984.

    Google Scholar 

  9. R. L. Rivest. Partial-match retrieval algorithms. SIAM J. Computing, 15(1):1950, March 1976.

    Google Scholar 

  10. M. Stonebraker. The case for shared nothing. IEEE Database Engineering, 9(1):49, March 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Abdelkader Hameurlain A Min Tjoa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lo, Yl., Hua, K.A., Young, H.C. (1997). A general multidimensional data allocation method for multicomputer database systems. In: Hameurlain, A., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1997. Lecture Notes in Computer Science, vol 1308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022045

Download citation

  • DOI: https://doi.org/10.1007/BFb0022045

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63478-2

  • Online ISBN: 978-3-540-69580-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics