Associative Array Model of SQL, NoSQL, and NewSQL Databases

Abstract

The success of SQL, NoSQL, and NewSQL databases is a reflection of their ability to provide significant functionality and performance benefits for specific domains, such as financial transactions, internet search, and data analysis. The BigDAWG polystore seeks to provide a mechanism to allow applications to transparently achieve the benefits of diverse databases while insulating applications from the details of these databases. Associative arrays provide a common approach to the mathematics found in different databases: sets (SQL), graphs (NoSQL), and matrices (NewSQL). This work presents the SQL relational model in terms of associative arrays and identifies the key mathematical properties that are preserved within SQL. These properties include associativity, commutativity, distributivity, identities, annihilators, and inverses. Performance measurements on distributivity and associativity show the impact these properties can have on associative array operations. These results demonstrate that associative arrays could provide a mathematical model for polystores to optimize the exchange of data and execution queries.

arXiv comment9 pages; 6 figures; accepted to IEEE High Performance Extreme Computing (HPEC) conference 2016

References in corpus (3)

• Standards for Graph Algorithm Primitives
• D4M 2.0 Schema: A General Purpose High Performance Schema for the Accumulo Database
• Set-Theoretic Preliminaries for Computer Scientists

Cited by in corpus (6)

• LaraDB: A Minimalist Kernel for Linear and Relational Algebra Computation
• Polystore Mathematics of Relational Algebra
• Streaming 1.9 Billion Hypersparse Network Updates per Second with D4M
• Mathematics of Digital Hyperspace
• TabulaROSA: Tabular Operating System Architecture for Massively Parallel Heterogeneous Compute Engines
• Linear Systems over Join-Blank Algebras