This HTML5 document contains 24 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n2https://kar.kent.ac.uk/id/eprint/
n19https://kar.kent.ac.uk/91266/
wdrshttp://www.w3.org/2007/05/powder-s#
n14http://purl.org/ontology/bibo/status/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n17https://kar.kent.ac.uk/id/subject/
n12https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/
n7http://eprints.org/ontology/
n20https://kar.kent.ac.uk/id/event/
n10doi:10.4230/
bibohttp://purl.org/ontology/bibo/
n16https://kar.kent.ac.uk/id/publication/
n6https://kar.kent.ac.uk/id/org/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n8https://kar.kent.ac.uk/id/
n15https://kar.kent.ac.uk/id/eprint/91266#
xsdhhttp://www.w3.org/2001/XMLSchema#
n13https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/
n4https://kar.kent.ac.uk/id/person/

Statements

Subject Item
n2:91266
rdf:type
bibo:AcademicArticle bibo:Article n7:ConferenceItemEPrint n7:EPrint
rdfs:seeAlso
n19:
owl:sameAs
n10:LIPIcs.ICDT.2018.9
dcterms:title
Expressivity and Complexity of MongoDB Queries
wdrs:describedby
n12:export_kar_RDFN3.n3 n13:export_kar_RDFN3.n3
dcterms:date
2018-03-26
dcterms:creator
n4:ext-e.botoeva@kent.ac.uk n4:ext-d4c26e7e7c4f2333fc2268681b07c839 n4:ext-4abc01d6ec7eab108ab7b071269200b8 n4:ext-cfa20b894db033c79c1229a2fc3a5156
bibo:status
n14:peerReviewed n14:published
dcterms:publisher
n6:ext-fb716d0e4677e460329957b7f78b51e8
bibo:abstract
In this paper, we consider MongoDB, a widely adopted but not formally understood database system managing JSON documents and equipped with a powerful query mechanism, called the aggregation framework. We provide a clean formal abstraction of this query language, which we call MQuery. We study the expressivity of MQuery, showing the equivalence of its well-typed fragment with nested relational algebra. We further investigate the computational complexity of significant fragments of it, obtaining several (tight) bounds in combined complexity, which range from LogSpace to alternating exponential-time with a polynomial number of alternations.
dcterms:isPartOf
n8:repository n16:ext-18688969
dcterms:subject
n17:QA76
bibo:authorList
n15:authors
bibo:presentedAt
n20:ext-d563556ea3ed00acb1293b563cf5e352
bibo:volume
98