Static and dynamic semantics of NoSQL languages
Authors:
Open Access
- 23 January 2013
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 48 (1) , 101-114
Abstract
We present a calculus for processing semistructured data that spans differences of application area among several novel query languages, broadly categorized as "NoSQL". This calculus lets users define their own operators, capturing a wider range of data processing capabilities, whilst providing a typing precision so far typical only of primitive hard-coded operators. The type inference algorithm is based on semantic type checking, resulting in type information that is both precise, and flexible enough to handle structured and semistructured data. We illustrate the use of this calculus by encoding a large fragment of Jaql, including operations and iterators over JSON, embedded SQL expressions, and co-grouping, and show how the encoding directly yields a typing discipline for Jaql as it is, namely without the addition of any type definition or type annotation in the code.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Making standard ML a practical database programming language2011
- The World According to LINQQueue, 2011
- A co-relational model of data for large shared data banksCommunications of the ACM, 2011
- ASTERIX: towards a scalable, semistructured data platform for evolving-world modelsDistributed and Parallel Databases, 2011
- Semantic subtypingJournal of the ACM, 2008
- Pig latin2008
- Typechecking XML views of relational databasesACM Transactions on Computational Logic, 2003
- Comprehension syntaxACM SIGMOD Record, 1994
- Making smalltalk a database system1984
- Top-down tree transducers with regular look-aheadTheory of Computing Systems, 1976