๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The computational completeness of extended database query languages

โœ Scribed by Varvel, D.A.; Shapiro, L.

Book ID
117872008
Publisher
IEEE
Year
1989
Tongue
English
Weight
642 KB
Volume
15
Category
Article
ISSN
0098-5589

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On Instance-Completeness for Database Qu
On Instance-Completeness for Database Query Languages involving Object Creation
โœ Marc Andries; Jan Paredaens ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 838 KB

In 1978 Bancilhon and Paredaens introduced a notion of completeness for relational database languages on instance-level. Their criterion was subsequently called BP-completeness. Since then, it was used frequently in the context of other database models. However, its application in the context of lan

Query processing in DOQL: A deductive da
Query processing in DOQL: A deductive database language for the ODMG model
โœ Pedro R.Falcone Sampaio; Norman W. Paton ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 653 KB

This paper describes the architecture, algebraic query processing framework and query execution approach that comprise the implementation of the deductive object query language (DOQL) query processing system. To the best of our knowledge, it is the ยฎrst deductive object query language to be designed