On instance-completeness for database query languages involving object creation.

DOI10.1006/JCSS.1996.0027zbMATH Open1152.68433OpenAlexW2021216589MaRDI QIDQ960474FDOQ960474

Marc Andries, Jan Paredaens

Publication date: 21 December 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://repository.uantwerpen.be/docman/irua/89e4cc/5140.pdf

zbMATH Keywords

BP-completenessrelational database languages

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (1)

• A semideterministic approach to object creation and nondeterminism in database queries

Recommendations

• Relational completeness of query languages for annotated databases 👍 👎
• Tractable query languages for complex object databases 👍 👎
• A semideterministic approach to object creation and nondeterminism in database queries 👍 👎
• Completeness of query languages 👍 👎
• On the completeness of object-creating database transformation languages 👍 👎
• Computable Queries for Object Oriented Databases 👍 👎

This page was built for publication: On instance-completeness for database query languages involving object creation.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960474)