Tractable query languages for complex object databases
From MaRDI portal
Recommendations
- Bounded fixpoints for complex objects
- On the expressive power of database queries with intermediate types
- Deductive query languages for recursively typed complex objects
- Algebraic and calculus query languages for recursively typed complex objects
- A semantics for complex objects and approximate answers
Cited in
(18)- Safety, domain independence and translation of complex value database queries
- On the expressive power of database queries with intermediate types
- Complex object multi-level fixpoint queries.
- A query language for NC
- The complexity of the evaluation of complex algebra expressions
- -languages for sets and LOGSPACE computable graph transformers
- Bounded fixpoints for complex objects
- A trace query language for rule-based models
- Advanced query language for manipulating complex entities
- Object identity as a query language primitive
- Expressivity and complexity of MongoDB queries
- Deductive query languages for recursively typed complex objects
- scientific article; zbMATH DE number 1304041 (Why is no real title available?)
- A query language for NC (extended abstract)
- The expressiveness of a family of finite set languages
- Principles of programming with complex objects and collection types
- Comparison of functional and predicative query paradigms
- On instance-completeness for database query languages involving object creation.
This page was built for publication: Tractable query languages for complex object databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900921)
