Skip to main content
SpringerLink
Log in

An efficient join for nested relational databases

  • Relational and Extended Relational Approaches
  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 1996)

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

Included in the following conference series:

Abstract

The join operation is one of the most expensive and critical issues in nested relational query processing. Many natural queries cannot be expressed by extended join operators proposed for the nested relational model so far without restructuring operations. In this paper, we consider a more general form of join, called P-join, which does not require as many restructuring operators and combines the advantages of the extended natural join and the recursive join for efficient data access. We propose an algorithm for computing the P-join and estimate cost required by using various join techniques developed in relational database systems. The complexity of the P-join algorithm is not more than other join algorithms with expensive restructuring operators involved and additional block shuffle for reading unnecessary data files.

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. E. Bertino. An indexing technique for object-oriented databases. In Proceedings of the IEEE Conference on Data Engineering, 1991.

    Google Scholar 

  2. E. Bertino and W. Kim. Indexing techniques for queries on nested objects. IEEE Transactions on Knowledge and Data Engineering, 1989.

    Google Scholar 

  3. C. Beeri. New Data Models and Languages — the Challenge. In Proceedings of the 11th ACM Symposium on Principles of Database Systems, pages 1–15, 1992.

    Google Scholar 

  4. R. Cattell. Object Data Management. Revised Edition, Addison-Wesley, 1994.

    Google Scholar 

  5. L.S. Colby. A Recursive Algebra and Query Optimisation for Nested Relations. In Proceedings of the ACM SIGMOD International Conference on the Management of Data, pages 273–283, 1989.

    Google Scholar 

  6. V. Deshpande and P.A. Larson. The design and implementation of a parallel join algorithm for nested relations on shared-memory multiprocessors. In Proceedings of the IEEE Conference on Data Engineering, 1992.

    Google Scholar 

  7. A. Deshpande and D. Van Gucht. An implementation for nested relational databases. In Proceedings of the International Conference on Very Large Data Bases, 1988.

    Google Scholar 

  8. G. Graefe. Query Evaluation Techniques for Large Databases. ACM Computing Surveys, 25(2), 1993.

    Google Scholar 

  9. M. Gyssens and D. Van Gucht. The Powerset Algebra as a Result of Adding Programming Constructs to the Nested Relational Algebra. In Proceedings of ACM Symposium on Principles of Database Systems, pages 225–232, 1988.

    Google Scholar 

  10. A. Hafez and G. Ozsoyoglu. Storage structures for nested relations. IEEE Database Engineering, 11(3), 1988.

    Google Scholar 

  11. Y. Jan. Algebraic Optimisation for Nested Relations. In Proceedings of the 23rd Hawaii International Conference on System Sciences, Vol.2, pages 278–287, 1990.

    Google Scholar 

  12. H.F. Korth. Optimisation of Object-Retrieval Queries. In Proceedings of the 2nd International Workshop on Object-Oriented Database Systems, pages 352–357, 1988.

    Google Scholar 

  13. M. Kifer, W. Kim and Y. Sagiv. Querying Object-Oriented Databases. In Proceedings of the ACM SIGMOD International Conference on the Management of Data, pages 393–402, 1992.

    Google Scholar 

  14. W. Kim. Object-Oriented Database System: Promises, Reality and Future. In Proceedings of the 19th Very Large Data Bases Conference, pages 676–687, 1993.

    Google Scholar 

  15. H.-C. Liu and K. Ramamohanarao. Multiple Paths Join for Nested Relational Databases. In Proceedings of Fifth Australasian Database Conference, pages 30–44, 1994.

    Google Scholar 

  16. H.-C. Liu and K. Ramamohanarao. Algebraic Equivalences among Nested Relational Expressions. In Proceedings of Third International Conference on Information and Knowledge Management, Gaitherburg, Maryland, pages 234–243, 1994

    Google Scholar 

  17. P. Mishra and M.H. Eich. Join Processing in Relational Databases. In ACM Computing Surveys, 24(1): 63–113.

    Google Scholar 

  18. M.A. Roth, H.F. Korth and A. Silberschatz. Extended Algebra and Calculus for non-1NF Relational Databases. ACM Transactions on Database Systems, 13(4):389–417, 1988.

    Article  Google Scholar 

  19. R. Sacks-Davis, A, Kent, K. Ramamohanarao, J. Thom, J. Zobel. ATLAS: A Nested Relational Database System for Text Applications. IEEE Transactions on Knowledge and Data Engineering, pages 454–470, June, 1995.

    Google Scholar 

  20. M.H. Scholl and H.J. Schek. The Relational Object Model. In Proceedings of International Conference on Database Theory, pages 89–105, 1990.

    Google Scholar 

  21. H.J. Schek and M.H. Scholl. The Relational Model with Relation-Valued Attributes, Information Systems, Vol. 11, No. 2, pages 137–147, 1986.

    Article  Google Scholar 

  22. K. Tanaka and T.S. Chang. On Natural Joins in Object-Oriented Databases. In Proceedings of First International Conference on Deductive and Object-Oriented Databases, Elsevier Science Publishing Company, pages 335–346, 1990.

    Google Scholar 

  23. J. Ullman. Principles of Database and Knowledge-Base System, Vol. 2. Computer Science Press. 1989.

    Google Scholar 

  24. P. Valduriez. Join indices. ACM Transactions on Database Systems. 12(2), 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Edith Cowan University, 2 Bradford Street, 6050, Mount Lawley, W.A., Australia

    Hong-Cheu Liu & Chaiyaporn Chirathamjaree

Authors
  1. Hong-Cheu Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chaiyaporn Chirathamjaree
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Roland R. Wagner Helmut Thoma

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, HC., Chirathamjaree, C. (1996). An efficient join for nested relational databases. In: Wagner, R.R., Thoma, H. (eds) Database and Expert Systems Applications. DEXA 1996. Lecture Notes in Computer Science, vol 1134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034689

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61656-6

  • Online ISBN: 978-3-540-70651-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation