Advertisement

Intensional Encapsulations of Database Subsets via Genetic Programming

  • Aybar C. Acar
  • Amihai Motro
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3588)

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.

Keywords

Genetic Programming Query Evaluation Query Tree Direct Combination Compact Description 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)zbMATHGoogle Scholar
  6. 6.
    Luke, S.: Two Fast Tree-creation Algorithms for Genetic Programming. IEEE Transactions on Evolutionary Computation 4(3), 274–283 (2000)CrossRefGoogle Scholar
  7. 7.
    Motro, A.: Intensional Answers to Database Queries. IEEE Transactions on Knowledge and Data Engineering 6(3), 444–454 (1994)CrossRefGoogle Scholar
  8. 8.
    Motro, A.: Cooperative Database Systems. International Journal of Intelligent Systems 11(10), 717–732 (1996)CrossRefGoogle Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Transaction Processing Performance Council. TPC Benchmark H Rev. 2.1.0. Technical Report, TPC (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Aybar C. Acar
    • 1
  • Amihai Motro
    • 1
  1. 1.Department of Information and Software EngineeringGeorge Mason UniversityFairfax

Personalised recommendations