Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Query-driven horizontal class partitioning for object-oriented databases

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 1998)

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

Included in the following conference series:

Abstract

Horizontal partitioning (HP) technique is a logical database design technique first developed for distributed relational (record structured) databases. Though the main objective of HP is to reduce irrelevant data access, there has been very little work done in quantifying this by means of a cost model, and developing algorithms which derive the horizontal partitioning schemes. In this paper, we develop a cost model for query processing in object oriented databases (OODBs) for both unpartitioned and horizontally partitioned object oriented databases. The problem of coming up optimal HP scheme is NP-complete. Therefore, we present and evaluate two algorithms for coming up with optimal (based on exhaustive search) and/or near optimal (based on heuristics) HP schemes.

This research has been funded by RGC CERG HKUST747/96E

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Bellatreche, K. Karlapalem, and G. K. Basak. Horizontal class partitioning for queries in object oriented databases. Technical Report HKUST-CS98-6, 1998.

    Google Scholar 

  2. L. Bellatreche, K. Karlapalem, and A. Simonet. Horizontal class partitioning in object-oriented databases, in 8th International Conference on Database and Expert Systems Applications (DEXA '97), Toulouse, Lecture Notes in Computer Science 1308, pages 58–67, September 1997.

    Article  Google Scholar 

  3. S. Ceri, M. Negri, and G. Pelagatti. Horizontal data partitioning in database design. Proceedings of the ACM SIGMOD International Conference on Management of Data. SIGPLAN Notices, pages 128–136, 1982.

    Google Scholar 

  4. C. I. Ezeife and K. Barker. A comprehensive approach to horizontal class fragmentation in distributed object based system. International Journal of Distributed and Parallel Databases, 3(3):247–272, 1995.

    Article  Google Scholar 

  5. G. Gardarin, J.-R. Gruser, and Z.-H. Tang. A cost model for clustered object-oriented databases. VLDB, pages 323–334, 1995.

    Google Scholar 

  6. K. Karlapalem, S.B. Navathe, and M. M. A. Morsi. Issues in distributed design of object-oriented databases. In Distributed Object Management, pages 148–165. Morgan Kaufman Publishers Inc., 1994.

    Google Scholar 

  7. S.B. Navathe, K. Karlapalem, and M. Ra. A mixed partitioning methodology for distributed database design. Journal of Computer and Software Engineering, 3(4):395–426, 1995.

    Google Scholar 

  8. M. T. özsu and P. Valduriez. Principles of Distributed Database Systems. Prentice Hall, 1991.

    Google Scholar 

  9. S. B. Yao. Approximating the number of accesses in database organizations. Communication of the ACM, 20(4):260, April 1977.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Science and Technology Clear Water Bay Kowloon, Hong Kong

    Ladjel Bellatreche, Kamalakar Karlapalem & Gopal K. Basak

Authors
  1. Ladjel Bellatreche
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kamalakar Karlapalem
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gopal K. Basak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gerald Quirchmayr Erich Schweighofer Trevor J.M. Bench-Capon

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bellatreche, L., Karlapalem, K., Basak, G.K. (1998). Query-driven horizontal class partitioning for object-oriented databases. In: Quirchmayr, G., Schweighofer, E., Bench-Capon, T.J. (eds) Database and Expert Systems Applications. DEXA 1998. Lecture Notes in Computer Science, vol 1460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054525

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-68060-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation