Proceedings

Use of Data Representation Mapping in Automatic Generation of Data Base Access Procedures

Download BibTeX Cite

Proceedings of the Seventh International Joint Conference on Artificial Intelligence. Automatic Programming. Pages 1010-1014.

© 1981 International Joint Conferences on Artificial Intelligence

Abstract

Formal definitions of data structure mappings are given and are used to transform relational algebraic formula into data base access procedures which search a formally defined data structure. Especially, a hierarcical data structure is introduced to represent a set of relations which are inherently hierarchical. A retrieval procedure using data accesses along a two level hierarchy is obtained from an original formula on flat relations by applying equivalence transformation rules and data representation mappings.

  1. Backman, C. W. "Data Structure Diagrams", DATABASE (ACM SIGBDP Newsletter), 1, 2, 1969, 4-10. 2.
  2. Codd
  3. Codd, E. F. "Relational Completeness of Data Base Sublanguages", In Data Base Systems (Ed .
  4. R. Rustin), Prentice-Hall, 1972, 65-98. 3.
  5. Furukawa, K. Access to . Data Bases", ETL 804, 1979 (in Japanese). "On Intelligent Research Report No. 4.
  6. Hansson 79
  7. Hansson, A. and Tarnlund, S. A. "A Natural PrograiDIDing Calculus", Proc. Sixth IJCAI, 1979, 348-355. 1015 5.
  8. Hoare
  9. Hoare, C. A. R. "Proof of Correctness of Data Representations", Acta Informatica 1, 1972, 271-281. 6.
  10. Reiter, R. "On Closed World Data Base Systems", In Logic and Data Bases (Eds. H. Gallaire and J. Minker), 1978, 55-76.
  11. Yonezawa
  12. Yonezawa, A. "A Method for Synthesis of Data Base Access Programs", Research Report No . C-30, Department of Information Science, Tokyo Institute of Technology, 1980.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards