DocumentCode
976881
Title
The computational completeness of extended database query languages
Author
Varvel, Donald A. ; Shapiro, Leonard
Author_Institution
Dept. of Comput. Sci., North Dakota Univ., Grand Forks, ND, USA
Volume
15
Issue
5
fYear
1989
fDate
5/1/1989 12:00:00 AM
Firstpage
632
Lastpage
638
Abstract
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
Keywords
database management systems; query languages; GENESIS; POSTGRES; Turing machine interpreter; computational completeness; computational power; extended database query languages; programming language; traditional database languages; Algebra; Calculus; Computer languages; Computer science; Database languages; Helium; Mathematical model; Mathematical programming; Relational databases; Turing machines;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/32.24712
Filename
24712
Link To Document