The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1989 vol.15)
pp: 632-638
ABSTRACT
<p>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.</p>
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
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool