Abstract: Techniques are disclosed relating to the serialization of data of a database. A computer system may maintain a database that stores data as a plurality of triples. A triple may include a first data entity that is connected to a second data entity via an edge, and triples of the plurality of triples may be connected to form graphs. The computer system may store metadata defining types of edges between data entities. An edge's type may indicate a procedure for serializing a target data entity connected to that edge's type. The computer system may receive a request to access a data entity associated with a plurality of descendant data entities connected to the data entity via edges. The computer system may generate an output having the data entity and one or more of the plurality of descendant data entities that are serialized according to the types of edges.

Abstract: Techniques are disclosed relating to the garbage collection of data of a database. A computer system may maintain a database that stores data as a plurality of triples. A given triple may include a first data entity that is connected to a second data entity via an edge, and triples of the plurality of triples may be connected to form a plurality of graphs. The computer system may store metadata that defines strengths of edges between graphs of the plurality of graphs. The computer system may receive a request to delete a particular triple or graph of the plurality of graphs. The particular graph may include a set of edges originating in the particular graph to other graphs of the plurality of graphs. The computer system may determine, based on the stored metadata, which graphs of the other graphs to delete in addition to the particular graph.

Abstract: Techniques are disclosed relating to the serialization of data of a database. A computer system may maintain a database that stores data as a plurality of triples. A triple may include a first data entity that is connected to a second data entity via an edge, and triples of the plurality of triples may be connected to form graphs. The computer system may store metadata defining types of edges between data entities. An edge's type may indicate a procedure for serializing a target data entity connected to that edge's type. The computer system may receive a request to access a data entity associated with a plurality of descendant data entities connected to the data entity via edges. The computer system may generate an output having the data entity and one or more of the plurality of descendant data entities that are serialized according to the types of edges.