Skip to main content

A Novel Method of Data Partitioning Using Genetic Algorithm Work Load Driven Approach Utilizing Machine Learning

  • Chapter
  • First Online:
Cognitive Computing in Human Cognition

Part of the book series: Learning and Analytics in Intelligent Systems ((LAIS,volume 17))

Abstract

The data partition is a method which makes the processing of the database server’s easy. It is like the clustering of the similar type of data files in an order so that the searching becomes easy. The data may be structured or unstructured. This paper focuses on the development of a unique data partition method which utilizes column integrated data. The proposed algorithm also utilizes Natural Computing Optimization inspired Genetic Algorithm (GA) for the improvisation of the partitioned data structure. The optimized set is cross validated utilizing Artificial Neural Network. This results into high values of evaluation parameters. The evaluation of the proposed algorithm is done using Precision, Recall and F-measure.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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

References

  1. S. Ahirrao, R. Ingle, Scalable transactions in cloud data stores, in IEEE 3rd International Advance Computing Conference (IACC) (2013), pp 116–119

    Google Scholar 

  2. J. Baker, C. Bond, J. Corbett, J.J. Furman, A. Khorlin, J. Larson, J.-M. Leon, Y. Li, A. Lloyd, V. Yushprakh, Megastore: providing scalable, highly available storage for interactive services, in CIDR, vol. 11 (2011)

    Google Scholar 

  3. C. Curino, E. Jones, Y. Zhang, S. Madden: Schism: a workload-driven approach to database replication and partitioning, in Proceedings of the VLDB Endowment, vol 3 (2010), pp. 48–57

    Google Scholar 

  4. C. Curino, E.P.C. Jones, S. Madden, H. Balakrishnan: Workload-aware database monitoring and consolidation, in Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, (2011), pp. 313–324

    Google Scholar 

  5. C. Curino, E.P.C. Jones, R.A. Popa, N. Malviya, E. Wu, S. Madden, H. Balakrishnan, N. Zeldovich, Relational cloud: a database-as-a-service for the cloud (2011)

    Google Scholar 

  6. S. Das, S. Agarwal, D. Agrawal, A.E. Abbadi, C. Bunch, N. Chohan, C. Krintz, J. Chohan, J. Kupferman, P. Lakhina: Elastras: an elastic, scalable, and self managing transactional database for the cloud, in Technical Report 2010–04, CS, UCSB (2010)

    Google Scholar 

  7. S. Das, D. Agrawal, A. El Abbadi (2009) Elastras: an elastic transactional data store in the cloud, in USENIX HotCloud, 2 (2009)

    Google Scholar 

  8. M. Liroz-Gistau, R. Akbarinia, E. Pacitti, F. Porto, P. Valduriez, Dynamic workload-based partitioning for large-scale databases, in Database and Expert Systems Applications (Springer. Berlin, 2012), pp 183–190

    Google Scholar 

  9. P.A. Bernstein, I. Cseri, N. Dani, N. Ellis, A. Kalhan, G. Kakivaya, D.B. Lomet, R. Manne, L. Novik, T. Talius, Adapting microsoftsql server for cloud computing, in Data Engineering (ICDE). IEEE 27th International Conference (2011), pp 1255–1263

    Google Scholar 

  10. S. Agrawal, V. Narasayya, B. Yang, Integrating vertical and horizontal partitioning into automated physical database design, in Proceedings of the 2004 ACM SIGMO International Conference on Management of Data (2004), pp. 359–370

    Google Scholar 

  11. C. Sharma, J. Muthuraj, R. Varadarajan, S. Navathe, An objective function for vertically partitioning relations in distributed databases and its analysis, in Distributed and Parallel Databases, vol. 2(2) (1994), pp 183–207

    Google Scholar 

  12. W.W. Chu, I.T. Leong, A transaction-based approach to vertical partitioning for relational database systems. IEEE Trans. Softw. Eng. 19(8), 804–812 (1993)

    Google Scholar 

  13. D.W. Cornell, P.S. Yu, An effective approach to vertical partitioning for physical design of relational databases. IEEE Trans. Software Eng. 16(2), 248–258 (1990)

    Article  Google Scholar 

  14. J.A. Hoffer, D.G. Severance, The use of cluster analysis in physical data base design, in Proceedings of the 1st International Conference on Very Large Data Bases (ACM, 1975), pp. 69–86

    Google Scholar 

  15. Huang, Y.-F., Lai, C-J., Integrating frequent pattern clustering and branch-and-bound approaches for data partitioning. Inf. Sci. 288–301 (2016)

    Google Scholar 

  16. A. Jindal, J. Dittrich, September) Relax and let the database do the partitioning online, International Workshop on Business Intelligence for the Real-Time Enterprise (Springer, Berlin, 2011), pp. 65–80

    Google Scholar 

  17. J. Kamal, M. Murshed, R. Buyya, Workload aware incremental repartitioning of shared-nothing distributed databases for scalable OLTP applications. Fut. Gener. Comput. Syst. 421–435 (2016)

    Google Scholar 

  18. S. Navathe, M. Ra (1989) Vertical partitioning for database design: a graphical algorithm. ACM SIGMOD Record 18(2), 440–450

    Google Scholar 

  19. S. Navathe, S. Ceri, G. Wiederhold, J. Dou, Vertical partitioning algorithms for database design. ACM Trans. Database Syst. (TODS) 9(4), 680–710 (1984)

    Google Scholar 

  20. S. Papadomanolakis, A. Anastassia, Autopart: Automating schema design for large scientific databases using data partitioning, in Scientific and Statistical Database Management. 16th International Conference on IEEE Proceedings (2004) pp. 383–392

    Google Scholar 

  21. S. Phansalkar, A. Dani, Transaction aware vertical partitioning of database (TAVPD) for responsive OLTP applications in cloud data stores. J. Theoret. Appl. Inf. Technol. 59(1), 73–81 (2016)

    Google Scholar 

  22. J.H. Son, M.H. Kim, An adaptable vertical partitioning method in distributed systems. J. Syst. Softw. 73(3), 551–561 (2004)

    Article  Google Scholar 

  23. D.E. Goldberg, J.H. Holland, Genetic algorithms and machine learning. Mach. Learn. 3(2), 95–99 (1988)

    Google Scholar 

  24. M. Sharma, G. Singh, R. Singh, Stark assessment of lifestyle based human disorders using data mining based learning techniques. IRBM 38, 305–324 (2017)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kiranjit Kaur .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Kaur, K., Laxmi, V. (2020). A Novel Method of Data Partitioning Using Genetic Algorithm Work Load Driven Approach Utilizing Machine Learning. In: Mallick, P., Pattnaik, P., Panda, A., Balas, V. (eds) Cognitive Computing in Human Cognition. Learning and Analytics in Intelligent Systems, vol 17. Springer, Cham. https://doi.org/10.1007/978-3-030-48118-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-48118-6_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-48117-9

  • Online ISBN: 978-3-030-48118-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics