Method for creating a scalable graph database

A method of encoding data for a graph database, comprising:

• receiving a plurality of triples from a data source, each triple of the plurality of triples including at least three parts;
• encoding each part of each of the plurality of triples with a 12-byte long unique part identifier, the unique part identifier comprising a one-byte tag that identifies a datatype for the part, and a code of length 11 bytes or less that encodes the data content for the part in order to form a tuple-structure comprising a number of tagged tuples, wherein the code preserves a relative ranking of the data content for the corresponding datatype within the plurality of triples;
• and
• generating an index using the tag for each datatype to create tagged datatypes from the original data of the plurality of triples, such that the original data comprising the graph database can be sorted in a single table through one or more sorting process that utilizes the order of the content data encoded in the unique part identifier for a specific datatype.

A method of creating a graph database containing a plurality of tuples, comprising:

• defining a datatype for each tuple part of each of the plurality of tuples;
• encoding content data for each tuple part in a code, the code configured to maintain an order of the content data within the datatype for the tuple part relative to other tuple parts of the same datatype in other of the plurality of tuples of the tuple-structure, thereby allowing the relative value of the tuple part within the same datatype to be preserved during a subsequent sort operation;
• storing the datatype and code for each tuple part in a unique part identifier comprising 12 unsigned bytes, and corresponding to each tuple part;
• tagging each unique the datatype of the respective tuple part, wherein the tag comprises at least the first byte of the respective UPI;
• encoding an identifier for the tuple-structure comprising a vector of defined byte length within the tuple-structure;
• storing the unique part identifiers and corresponding content data for each tuple part in a database;
• and
• sorting the plurality of tuples based on the tuple parts to create sorted indices that facilitate the use of graph algorithms for efficient analysis of the content data.