NOTICE Unless I explicitly say otherwise, all pages and posts on this site are largely speculation based on observations. Where experiments have been done to provide conclusive evidence it is noted. These posts are a brain dump of my thoughts (to capture those elusive moments) at the time of writing, and is therefore likely to change as the results of research proves otherwise. Obviously this does not apply to posts where I describe a technique that has been implemented and tested.

Abstract - Introduction

The Tesseract Graph Query Language (TGQ) is inspired by SQL(Codd, 1972), not in syntax but by purpose. SQL allows querying, creating, updating and deleting (CRUD) of data in a relational database (Codd, 1982). TGQ serves the same purpose. While it is written for The Tesseract's query model in particular, it is general enough to apply to other graph storage systems.


  1. Codd, E. F. (1972). Relational completeness of data base sublanguages. IBM Corporation.
  2. Codd, E. F. (1982). Relational database: a practical foundation for productivity. Communications of the ACM, 25(2), 109–117.