This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Computational Completeness of Extended Database Query Languages
May 1989 (vol. 15 no. 5)
pp. 632-638

The computational completeness is demonstrated of certain extended database query languages, namely, POSTGRES and GENESIS, and a language defined by A. Aho and J. Ullman (1979). The method used is to implement a Turing machine interpreter in each of the languages. These query languages were defined as extensions to traditional database languages in order to encompass certain specific new applications. Results show that these extensions have already encompassed all the computational power of any programming language.

[1] A. Aho and J. Ullman, "Universality of data retrieval languages," inProc. 6th ACM Symp: Principles of Programming Languages, San Antonio, TX, Jan. 1979.
[2] D. S. Batoryet al., "GENESIS: A reconfigurable database management system," "Univ. Texas, Austin," Tech. Rep. TR-86-07, 1986.
[3] C. Bohm and G. Jacopini, "Flow diagrams and languages with only two formation rules,"CACM, vol. 9, no. 5, pp. 366-371, May 1966.
[4] E. Codd, "Relational completeness of data base sublanguages," inData Base Systems. Englewood Cliffs, NJ: Prentice-Hall, 1972.
[5] A. K. Chandra and D. Harel, "Structure and complexity of relational queries,"J. Comput. Syst. Sci., vol. 25, no. 1, pp. 99-128, Aug. 1982.
[6] U. Dayal and J. Smith, "PROBE: A knowledge-oriented database management system," inProc. Islamoorada Workshop Large Scale Knowledge Base Reasoning Syst., Feb. 1985, pp. 103-137.
[7] P. J. Denning, J. B. Dennis, and J. E. Qualitz,Machines, Languages and Computation. Englewood Cliffs, NJ: Prentice-Hall, 1978.
[8] H. Gallaire, J. Minker, and J. Nicolas, "Logic and databases: A deductive approach,"ACM Comput. Surveys, vol. 16, pp. 153-185,1984.
[9] A. Guttman, "Extending a relational data base system to effectively manage CAD data," Ph.D. dissertation, Univ. Calif., Berkeley, CA, June 1984.
[10] L. Ho, K. Nygard, and L. Shapiro, "Database management systems as solvers in model management systems," Dep. Comput. Sci., North Dakota State Univ., Fargo, ND, working paper.
[11] H. Korth, "Extending the scope of relational languages,"IEEE Software, pp. 19-28, Jan. 1986.
[12] R. Kung, E. Hanson, Y. Ioannidis, T. Sellis, L. Shapiro, and M. Stonebraker, "Heuristic search in data base systems," inProc. 1st Int. Workshop Expert Data Base Systems, Kiawah Island, SC, Oct. 1984.
[13] M. Mannino and L. Shapiro, "Extensions to query languages for graph traversal problems," Dep. Management Sci. Inform. Syst., Univ. Texas, Austin, TX, working paper.
[14] M. Stonebraker and L. Rowe, "The design of Postgres," Electron. Res. Lab., Univ. Calif., Berkeley, CA, Memo UCB/ERL 85/95, Nov. 1985.
[15] A. M. Turing, "Computability andλ-definability,"J. Symbolic Logic, vol. 2, pp. 153-163, 1937.
[16] J. D. Ullman,Principles of Databases Systems. Rockville, MD: Computer Science Press, 1982.

Index Terms:
computational completeness; extended database query languages; POSTGRES; GENESIS; Turing machine interpreter; traditional database languages; computational power; programming language; database management systems; query languages
Citation:
D.A. Varvel, L. Shapiro, "The Computational Completeness of Extended Database Query Languages," IEEE Transactions on Software Engineering, vol. 15, no. 5, pp. 632-638, May 1989, doi:10.1109/32.24712
Usage of this product signifies your acceptance of the Terms of Use.