Using a b-tree to store graph information in a database

A method, comprising:

• creating for at least one of each node of a plurality of nodes and at least one edge_one or more pages of data, each corresponding to a prescribed page size associated with a storage device in which said one or more pages are to be stored, and each page having a b-tree index data structure that includes a first section having a variable-sized set of fixed width data slots and a second section having a variable-sized variable length data region;
• and
• performing at least one of a read, update, and delete transaction operation on the plurality of nodes and edges;
• determining traversal of relationships between nodes and edges.

A computer program product embodied in a non-transitory computer readable medium and comprising computer instructions for:

• creating for at least one of each node of a plurality of nodes and at least one edge one or more pages of data, each corresponding to a prescribed page size associated with a storage device in which said one or more pages are to be stored, and each page having a b-tree index data structure that includes a first section having a variable-sized set of fixed width data slots and a second section having a variable-sized variable length data region;
• and
• performing at least one of a read, update, and delete transaction operation on the plurality of nodes and edges;
• determining traversal of relationships between nodes and edges.