Skip to main content
SpringerLink
Log in

Generate Optimal Distributed Query Plans Using Clonal Selection Process

  • Conference paper
  • First Online:
Distributed Computing and Internet Technology (ICDCIT 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10722))

  • 1113 Accesses

Abstract

In this paper we have proposed a bio-inspired approach which selects optimal Top-k query plans of minimal cost from large search space. We have also shown that proposed approach is better in computing Top-k Query plans in terms of shipping cost for Distributed Query Plans Generation (DQPG).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Zhu, Q., Larson, P.-A.: Global query processing and optimization in the CORDS multidatabase system. In: Proceedings of the 9th PDCS Conference, pp. 640–646 (1996)

    Google Scholar 

  2. Özsu, M.T., Valduriez, P.: Principles of Distributed Database Systems. Springer, Cham (2011)

    Google Scholar 

  3. Jarke, M., Koch, J.: Query optimization in database systems. ACM Comput. Surv. 16(2), 111–152 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kumar, T.V.V., Singh, V., Verma, A.K.: Distributed Query Processing Plans Generationusing Genetic Algorithm. Int. J. Comput. Theory Eng. 3(1), 38 (2011)

    Article  Google Scholar 

  5. de Castro, L.N., Timmis, J.: Artificial immune systems: a novel paradigm to pattern recognition. Artif. Neural Networks Pattern Recogn. 1, 67–84 (2002)

    Google Scholar 

  6. Rani, R.: An efficient bio-inspired approach to generate distributed query plans. In: IEEE International Conference on Power Electronics, Intelligent Control and Energy Systems (ICPEICES), pp. 1–5 (2016)

    Google Scholar 

  7. Abdoun, O., Abouchabaka, J., Tajani, C.: Analyzing the performance of mutation operators to solve the travelling salesman problem. arXiv Prepr. arXiv:1203.3099 (2012)

Download references

Acknowledgments

This research work is partially supported by the UPE-II grant received from JNU. Author sincerely thanks to the anonymous reviewers for their kind comments.

Author information

Authors and Affiliations

  1. School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, 110067, India

    Ruby Rani

Authors
  1. Ruby Rani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ruby Rani .

Editor information

Editors and Affiliations

  1. University of Hyderabad, Hyderabad, India

    Atul Negi

  2. University of Cincinnati, Cincinnati, Ohio, USA

    Raj Bhatnagar

  3. IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA

    Laxmi Parida

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rani, R. (2018). Generate Optimal Distributed Query Plans Using Clonal Selection Process. In: Negi, A., Bhatnagar, R., Parida, L. (eds) Distributed Computing and Internet Technology. ICDCIT 2018. Lecture Notes in Computer Science(), vol 10722. Springer, Cham. https://doi.org/10.1007/978-3-319-72344-0_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-72344-0_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-72343-3

  • Online ISBN: 978-3-319-72344-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation