Skip to main content
SpringerLink
Log in

Distributed Database Design with Genetic Algorithm and Relation Clustering Heuristic

  • Conference paper
  • First Online:
Computer and Information Sciences

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 62))

Abstract

We describe a genetic algorithm based heuristic for distributed database (DDB) design, Relation Clustering (RC). Relations in a database are allocated to nodes of a distributed database such that the total cost of executing a set of queries (each with a given frequency) over a time period is minimized. The experimental results are compared with another earlier GA based algorithm which shows about 15% improvement

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Goldberg, D.E., Genetic Algorithms in Search, Optimization, and Machine Learning, Addison- Wesley, (1989)

    Google Scholar 

  2. Hellerstein, J.M., “Optimization Techniques for Queries with Expensive Methods,” ACM Transactions on Database Systems, Vol. 23, No. 2, pp. 113–157 (1998)

    Article  MathSciNet  Google Scholar 

  3. Ionnidis, Y.E. and Kang, Y.C.,“Randomized Algorithms for optimizing large join queries,” In Proc. ACM SIGMOD, pp. 312–321 (1990)

    Google Scholar 

  4. Johansson, J.M., March, S.T. and Naumann, J.D., “Modeling Network Latency and Parallel Processing in DDB design,” Decision Sciences, vol. 34 no. 4, pp. 677–706 (2003)

    Article  Google Scholar 

  5. Kossmann, D., Stocker, K., Iterative dynamic programming: a new class of query optimization algorithms. ACM Transactions on Database Systems, vol. 25/1, pp. 43–82 (2000)

    Article  Google Scholar 

  6. March, S.T. and Rho, S., “Allocating data and operations to nodes in a distributed database design,” IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 2, pp. 305–317 (1995)

    Article  Google Scholar 

  7. Nahar, S., Sahni, S. and Shragowitz, E., Simulated Annealing and Combinatorial Optimization, Proc. of the 23rd Design Automation Conference, pp 293–299 (1986)

    Google Scholar 

  8. Ozsu, M.T. and Valduriez, P., Principles of Distributed Database Systems, Prentice Hall, 2nd ed. (1999)

    Google Scholar 

  9. Rho, S., March, S.T., “Optimizing distributed join queries: A genetic algorithm approach,” Annals of Operations Research, pp.199–228 (1997)

    Google Scholar 

  10. Selinger, P., Astrahan, M., Chamberlin, D., Lorie, R. and Price, T., Access Path Selection in a Relational Database Management System. In Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 23–34, Boston, USA (1979)

    Google Scholar 

  11. Sevinç, E., Coşar, A., “An Evolutionary Genetic Algorithm for Optimization of Distributed Database”, The Computer Journal, Advance Access Jan. 15 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering Department, Middle East Technical University, 06531, Ankara, Turkey

    Ender Sevinç & Ahmet Coşar

Authors
  1. Ender Sevinç
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ahmet Coşar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. , EEE Dept., Imperial College, Exhibition Road, London, SW72BT, United Kingdom

    Erol Gelenbe

  2. , EEE Dept., Imperial College, Exhibition Rd., London, SW72AZ, United Kingdom

    Ricardo Lent

  3. , EEE Dept., Imperial College, Exhibition Rd., London, SW72AZ, United Kingdom

    Georgia Sakellari

  4. , School of Biomedical Eng., Sci. and Heal, Drexel University, Bossone 702, 3120 Market Street, Philadelphia, 19104, Pennsylvania, USA

    Ahmet Sacan

  5. , Dept. of Computer Engineering, Middle East Technical University, Ankara, 06531, Turkey

    Hakki Toroslu

  6. Fac. Engineering, Dept. Computer Engineering, Middle East Technical University - METU, Ankara, 06531, Turkey

    Adnan Yazici

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media B.V.

About this paper

Cite this paper

Sevinç, E., Coşar, A. (2011). Distributed Database Design with Genetic Algorithm and Relation Clustering Heuristic. In: Gelenbe, E., Lent, R., Sakellari, G., Sacan, A., Toroslu, H., Yazici, A. (eds) Computer and Information Sciences. Lecture Notes in Electrical Engineering, vol 62. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-9794-1_27

Download citation

  • DOI: https://doi.org/10.1007/978-90-481-9794-1_27

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-9793-4

  • Online ISBN: 978-90-481-9794-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation