Expressivity and complexity of MongoDB queries

DOI10.4230/LIPICS.ICDT.2018.9MaRDI QIDQ3305353zbMATH OpenOpenAlexFDO

Authors Elena Botoeva, Diego Calvanese, Benjamin Cogrel, Guohui Xiao

Publication date 6 August 2020

Full work available at URL https://doi.org/10.4230/LIPIcs.ICDT.2018.9

zbMATH Keywords

aggregation frameworkexpressivityMongoDBNoSQL

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Tractable query languages for complex object databases
• Query languages for bags and aggregate functions
• On the complexity of database queries
• Expressiveness of structured document query languages based on attribute grammars
• scientific article; zbMATH DE number 1086723

Cites work

• Alternation
• scientific article; zbMATH DE number 1142309 (Why is no real title available?)
• Linking Data to Ontologies
• Principles of programming with complex objects and collection types
• Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions
• The expressive power of complex values in object-based data models

Cited in

(1)

• MongoDB

This page was built for publication: Expressivity and complexity of MongoDB queries

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