Botoeva, Elena, Calvanese, Diego, Cogrel, Benjamin, Xiao, Guohui (2017) Formalizing MongoDB Queries. In: CEUR Workshop Proceedings. Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, Montevideo, Uruguay, June 7-9, 2017. 1912. CEUR-WS.org (KAR id:91297)
PDF
Publisher pdf
Language: English
This work is licensed under a Creative Commons Attribution 4.0 International License.
|
|
Download this file (PDF/264kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://ceur-ws.org/Vol-1912/paper5.pdf |
Abstract
In this paper, we report on our ongoing work in which we formalize MongoDB, a widely adopted document database system managing complex (tree structured) values represented in a JSON-based data model, equipped with a powerful query mechanism. We study the expressiveness of the MongoDB query language, showing its equivalence with nested relational algebra, and we investigate the computational complexity of significant fragments of it.
Item Type: | Conference or workshop item (Proceeding) |
---|---|
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Amy Boaler |
Date Deposited: | 03 Nov 2021 12:42 UTC |
Last Modified: | 05 Nov 2024 12:56 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/91297 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):