Information technology (IT) systems are present in almost all fields of human activity, with emphasis on processing, storage, and handling of datasets. Automated methods to provide access to data stored in databases have been proposed mainly for tasks related to knowledge discovery and data mining (KDD). However, for this purpose, the database is used only to query data in order to find relevant patterns associated with the records. Processes modelled on IT systems should manipulate the records to modify the state of the system. Linear genetic programming for databases (LGPDB) is a tool proposed here for automatic generation of programs that can query, delete, insert, and update records on databases. The obtained results indicate that the LGPDB approach is able to generate programs for effectively modelling processes of IT systems, opening the possibility of automating relevant stages of data manipulation, and thus allowing human programmers to focus on more complex tasks. 1. Introduction Information technology (IT) systems have become the basis of process management of today’s successful enterprises. We can find this kind of system in virtually all fields of activities and inside corporations of any size. The intensive adoption of IT systems has promoted the emergence of an entire ensemble of technologies and services to supply a wide range of demands. Similar to what happens in other areas of product development, methodologies, processes, and tools have been enhanced over the years in order to improve the development of software products, which are going to promote increasing productivity and reduced costs. The first methodologies were inspired by principles found in other areas of product development, like manufacturing. However, the dynamic environment involved in software development is fostering a continuous improvement and customization of methodologies to embrace inevitable uncertainties and necessary redefinition of the product specification, resulting in an iterative and evolutionary process [1]. The need for more agile methodologies is promoting the development of enhanced tools and techniques, more notably in the field of code and design reuse. Approaches to automate entire modules of the software development or to support decision on software engineering have been explored. However, the automated generation of computer algorithms still remains restricted to the scientific field. Knowledge discovery and data mining (KDD) applications are associated with many different approaches to extract relevant patterns from datasets, including solutions
References
[1]
C. Larman, Agile and Iterative Development: A Manager’s Guide, Addison-Wesley Professional, 2004.
[2]
G. Wilson and W. Banzhaf, “Fast and effective predictability filters for stock price series using linear genetic programming,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '10), pp. 1–8, Barcelona, Spain, July 2010.
[3]
J. Yu, J. Yu, A. A. Almal et al., “Feature selection and molecular classification of cancer using genetic programming,” Neoplasia, vol. 9, no. 4, pp. 292–303, 2007.
[4]
T. Lensberg, A. Eilifsen, and T. E. McKee, “Bankruptcy theory development and classification via genetic programming,” European Journal of Operational Research, vol. 169, no. 2, pp. 677–697, 2006.
[5]
A. A. Freitas, “A genetic programming framework for two data mining tasks: classification and generalized rule induction,” Genetic Programming, pp. 96–101, 1997.
[6]
T. W. Ryu and C. F. Eick, “MASSON: discovering commonalities in collection of objects using genetic programming,” in Proceedings of the 1st Annual Conference on Genetic Programming, pp. 200–208, MIT Press, 1996.
[7]
T. W. Ryu and C. F. Eick, “Deriving queries from examples using genetic programming,” in Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD '96), pp. 303–306, August 1996.
[8]
G. A. Archanjo and F. J. von Zuben, “Induction of linear genetic programs for relational database manipulation,” in Proceedings of the IEEE International Conference on Information Reuse and Integration (IRI '11), pp. 347–352, August 2011.
[9]
W. W. Royce, “Managing the development of large software systems,” in Proceedings of the IEEE WESCON, vol. 26, Los Angeles, Calif, USA, 1970.
[10]
B. W. Boehm, “A spiral model of software development and enhancement,” Computer, vol. 21, no. 5, pp. 61–72, 1988.
[11]
A. Manifesto, “Manifesto for agile software development,” Retrieved November, 29: 2006, 2001.
[12]
M. E. Fayad, R. E. Johnson, and D. C. Schmidt, Building Application Frameworks: Object-oriented Foundations of Framework Design, 1999.
[13]
E. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design Patterns: Elements of Reusable Object-oriented Software, Addison-Wesley Longman, 1995.
[14]
M. Bichier and K. J. Lin, “Service-oriented computing,” Computer, vol. 39, no. 3, pp. 99–101, 2006.
[15]
M. Armbrust, A. Fox, R. Griffith, et al., “Above the clouds: a berkeley view of cloud computing,” Tech. Rep. UCB/EECS-2009-28, EECS Department, University of California, Berkeley, Calif, USA, 2009.
[16]
S. W. Ambler, Mapping Objects to Relational Databases: What You Need to Know and Why, IBM DeveloperWorks, 2000.
[17]
S. W. Ambler, Mapping Objects to Relational Databases: O/R Mapping in Detail, Ambysoft, 2006.
[18]
E. Gamma and K. Beck, Junit, 2005, http://www.junit.org/.
[19]
K. Beck, Test Driven Development: By Example, Addison-Wesley Professional, 2003.
[20]
M. Harman and B. F. Jones, “Search-based software engineering,” Information and Software Technology, vol. 43, no. 14, pp. 833–839, 2001.
[21]
C. J. Burgess and M. Lefley, “Can genetic programming improve software effort estimation? a comparative evaluation,” Information and Software Technology, vol. 43, no. 14, pp. 863–873, 2001.
[22]
E. B. Boden and G. F. Martino, “Testing software using order-based genetic algorithms,” in Proceedings of the 1st Annual Conference on Genetic Programming, pp. 461–466, MIT Press, 1996.
[23]
A. J. Bagnall, V. J. Rayward-Smith, and I. M. Whittley, “The next release problem,” Information and Software Technology, vol. 43, no. 14, pp. 883–890, 2001.
[24]
M. Harman, R. Hierons, and M. Proctor, “A new representation and crossover operator for search-based optimization of software modularization,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '02), pp. 1351–1358, 2002.
[25]
T. M. Khoshgoftaar, Y. Liu, and N. Seliya, “A multiobjective module-order model for software quality enhancement,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 6, pp. 593–608, 2004.
[26]
J. H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, 1975.
[27]
N. L. Cramer, “A representation for the adaptive generation of simple sequential programs,” in Proceedings of the 1st International Conference on Genetic Algorithms, vol. 183, p. 187, 1985.
[28]
J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection, The MIT Press, 1992.
[29]
S. Luke, “Genetic programming produced competitive soccer softbot teams for robocup97,” Genetic Programming, pp. 214–222, 1998.
[30]
J. R. Koza, F. H. Bennett III, D. Andre, and M. A. Keane, “Automated WYWIWYG design of both the topology and component values of electrical circuits using genetic programming,” in Proceedings of the 1st Annual Conference on Genetic Programming, pp. 123–131, MIT Press, 1996.
[31]
R. Balzer, “A 15 year perspective on automatic programming,” IEEE Transactions on Software Engineering, vol. 11, no. 11, pp. 1257–1268, 1985.
[32]
L. Xu, H. H. Hoos, and K. Leyton-Brown, “Hydra: automatically configuring algorithms for portfolio-based selection,” in Proceedings of the 24th AAAI Conference on Artificial Intelligence, 2010.
[33]
G. E. Krasner and S. T. Pope, “A cookbook for using the model-view controller user interface paradigm in smalltalk-80,” Journal of Object-Oriented Programming, vol. 1, no. 3, pp. 26–49, 1988.
[34]
H. Garcia-Molina and K. Salem, “Main memory database systems: an overview,” IEEE Transactions on Knowledge and Data Engineering, vol. 4, no. 6, pp. 509–516, 1992.
[35]
A. Silberschatz, H. F. Korth, and S. Sudarshan, Database System Concepts, vol. 72, McGraw-Hill, New York, NY, USA, 2002.
[36]
D. J. Montana, “Strongly typed genetic programming,” Evolutionary Computation, vol. 3, no. 2, pp. 199–230, 1995.
[37]
W. Banzhaf, Genetic Programming: An Introduction on the Automatic Evolution of Computer Programs and Its Applications, Morgan Kaufmann, 1998.
[38]
M. Brameier and W. Banzhaf, Linear Genetic Programming, Springer, New York, NY, USA, 2007.
[39]
P. P. S. Chen, “The entity-relationship model—toward a unified view of data,” ACM Transactions on Database Systems (TODS), vol. 1, no. 1, pp. 9–36, 1976.
