A Next-Generation Data Language Proposal
Eugene Panferov

TL;DR
This paper introduces a new data language with pragmatic typisation and a multitable index, enabling relations to be domains of relations and bridging the gap between SQL and programming languages.
Contribution
It proposes a novel data language and a multitable index to overcome relational calculus limitations and unify data querying with general-purpose programming.
Findings
Enables relations to be domains of relations.
Supports set operations and tuple manipulation as fluently as arithmetic.
Bridges SQL and application programming seamlessly.
Abstract
This paper analyzes the fatal drawback of the relational calculus not allowing relations to be domains of relations, and its consequences entrenched in SQL. In order to overcome this obstacle we propose "multitable index" - an easily implementable upgrade to an existing data storage, which enables a revolutionary change in the field of data languages - the demotion of relational calculus and tables. We propose a new data language with "pragmatic typisation" where types represent domain knowledge but not memory management. The language handles sets of tuples as first class data objects and supports set operation and tuple (de)composition operations as fluently as basic arith. And it is equally suitable for building-into a general purpose language as well as querying a remote DB (thus removing the ubiquitous gap between SQL and application).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Database Systems and Queries · Semantic Web and Ontologies · Service-Oriented Architecture and Web Services
