Computable queries for object oriented databases
From MaRDI portal
Recommendations
Cites work
- Computable queries for relational data bases
- Computing with first-order logic
- Computing with infinitary logic
- Descriptive characterizations of computational complexity
- Fixpoint logics, relational machines, and computational complexity
- scientific article; zbMATH DE number 3825806 (Why is no real title available?)
- scientific article; zbMATH DE number 3941493 (Why is no real title available?)
- scientific article; zbMATH DE number 3700811 (Why is no real title available?)
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- scientific article; zbMATH DE number 566081 (Why is no real title available?)
- scientific article; zbMATH DE number 1950753 (Why is no real title available?)
- scientific article; zbMATH DE number 1507289 (Why is no real title available?)
- scientific article; zbMATH DE number 1552575 (Why is no real title available?)
- La logique des topos
- On the expressibility and the computability of untyped queries
- On the expressive power of database queries with intermediate types
- Reflective relational machines
- Structure and complexity of relational queries
Cited in
(6)- Choiceless polynomial time
- scientific article; zbMATH DE number 8791 (Why is no real title available?)
- scientific article; zbMATH DE number 1304041 (Why is no real title available?)
- scientific article; zbMATH DE number 5034153 (Why is no real title available?)
- On the expressibility and the computability of untyped queries
- On instance-completeness for database query languages involving object creation.
This page was built for publication: Computable queries for object oriented databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916216)