Heuristic search in database systems
Proceedings from the first international workshop on Expert database systems
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
Flow diagrams, turing machines and languages with only two formation rules
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Machines, Languages and Computation
Machines, Languages and Computation
Genesis: A Reconfigurable Database Management System
Genesis: A Reconfigurable Database Management System
Query Optimization for Nontraditional Database Applications
IEEE Transactions on Software Engineering
The expressive power structured values in pure OODB's (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Extensions to Query Languages for Graph Traversal Problems
IEEE Transactions on Knowledge and Data Engineering
A Graph-Oriented Object Database Model
IEEE Transactions on Knowledge and Data Engineering
A Frame Manipulation Algebra for ER Logical Stage Modelling
ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
| Hi-index | 0.00 |
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.