Abstract
Finding intensional encapsulations of database subsets is the inverse of query evaluation. Whereas query evaluation transforms an intensional expression (the query) to its extension (a set of data values), intensional encapsulation assigns an intensional expression to a given set of data values. We describe a method for deriving intensional representations of subsets of records in large database tables. Our method is based on the paradigm of genetic programming. It is shown to achieve high accuracy and maintain compact expression size, while requiring cost that is acceptable to all applications, but those that require instantaneous results. Intensional encapsulation has a broad range of applications including cooperative answering, information integration, security and data mining.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Acar, A.C., Motro, A.: Why is this User Asking so Many Questions? Explaining Sequences of Queries. In: Proceedings of the 18th Annual IFIP WG 11.3 Working Conference on Data and Applications Security, pp. 159–176. Kluwer, Dordrecht (2004)
Berlin, J., Motro, A.: Autoplex: Automated Discovery of Contents for Virtual Databases. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, pp. 108–122. Springer, Heidelberg (2001)
Carvalho, D.R., Freitas, A.A.: A Hybrid Decision Tree/Genetic Algorithm for Coping with the Problem of Small Disjuncts in Data Mining. In: Proceedings of the 2000 Genetic and Evolutionary Computation Conference, pp. 1061–1068. Morgan Kaufmann, San Francisco (2000)
Freitas, A.A.: A Survey of Evolutionary Algorithms for Data Mining and Knowledge Discovery. In: Advances in Evolutionary Computing: Theory and Applications, pp. 819–845. Springer, Heidelberg (2003)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Luke, S.: Two Fast Tree-creation Algorithms for Genetic Programming. IEEE Transactions on Evolutionary Computation 4(3), 274–283 (2000)
Motro, A.: Intensional Answers to Database Queries. IEEE Transactions on Knowledge and Data Engineering 6(3), 444–454 (1994)
Motro, A.: Cooperative Database Systems. International Journal of Intelligent Systems 11(10), 717–732 (1996)
Shum, C.D., Muntz, R.: Implicit Representation for Extensional Answers. In: Proceedings of the Second International Conference on Expert Database Systems, Benjamin Cummings, pp. 497–522 (1988)
Transaction Processing Performance Council. TPC Benchmark H Rev. 2.1.0. Technical Report, TPC (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Acar, A.C., Motro, A. (2005). Intensional Encapsulations of Database Subsets via Genetic Programming. In: Andersen, K.V., Debenham, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2005. Lecture Notes in Computer Science, vol 3588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546924_36
Download citation
DOI: https://doi.org/10.1007/11546924_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28566-3
Online ISBN: 978-3-540-31729-6
eBook Packages: Computer ScienceComputer Science (R0)