Skip to main content

Graph-Based Cyclic Multi-join Query Optimization Algorithm

  • Conference paper
Advances in Web-Age Information Management (WAIM 2004)

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

Included in the following conference series:

  • 905 Accesses

Abstract

Although many Multi-Join query optimizations algorithms have been proposed, there is a lack of cyclic multi-join query optimization algorithms. In this paper, a graph-based cyclic multi-join query optimization algorithm-Improved Minimum Result Relation-Minimum Weight First (Improved-MR-MWF) was proposed. The time complexity is O(mn). This algorithm, considering the influences among the join operations concerning same relation, chooses the join that the result relation is minimum as the top-priority operation. The minimum weight join among the top-priority operations was selected. The experimental results indicated that the cost and the query response time of the new algorithm were less than that of others.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lee, C., Shih, C.-S., Chen, Y.-H.: Optimizing Large Join Queries Using A Graph-Based Approach. IEEE Trans on Knowledge and Data Engineering 13(2), 298–315 (2001)

    Article  Google Scholar 

  2. Chen, M.-S., Yu, P.S., Wu, K.-L.: Optimization of Parallel Execution for Multi-Join Queries. IEEE Trans on Knowledge and Data Engineering 8(3), 416–428 (1996)

    Article  Google Scholar 

  3. Lee, Chang, Z.A.: Utilizing Page-level Join Index for Optimization in Parallel Join Execution. IEEE Trans on Knowledge and Data Engineering 7(6), 900–914 (1995)

    Article  MathSciNet  Google Scholar 

  4. Hua, K.A., Lee, C., Hua, C.M.: Dynamic Load Balancing in Multi computer Database System Using Partition Tuning. IEEE Trans on Knowledge and Data Engineering 7(6), 968–983 (1995)

    Article  Google Scholar 

  5. Cao, Y., Fang, Q., Wang, G.-r., Yu, G.: Parallel Query Optimization Tech-niques for Multi-join Expressions Based on Genetic Algorithm. Journal of software 13(2), 250–257 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, H., Wang, XK., Zhang, JY. (2004). Graph-Based Cyclic Multi-join Query Optimization Algorithm. In: Li, Q., Wang, G., Feng, L. (eds) Advances in Web-Age Information Management. WAIM 2004. Lecture Notes in Computer Science, vol 3129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27772-9_83

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27772-9_83

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22418-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics