DATABASE STRUCTURE FOR DISTRIBUTED KEY-VALUE PAIR, DOCUMENT AND GRAPH MODELS

摘要

Aspects define NoSQL database structures that support wide-column, document, and graph data models. Documents are defined with different, unique keys and stored to different rows in a wide-column store by mapping their respective, unique keys directly to different row keys. Columns are defined for the document rows as including pairs of names and values, each column field having a different column name. Graph edges are defined as a function of relationships between a first source document and a second of the documents as tuples of first source document keys, second document keys as targets, tags as labels of relationships, and values of objects associated with the relationships. The graph edges are stored as graph columns within rows of the first source documents with names that are different from names of other columns within the first source document rows.

主权项

1. A computer-implemented method for defining a NoSQL database structure that supports wide-column, document, and graph data models, the method comprising executing on a processor the steps of:
defining a plurality of documents, each with a unique key that is different from a key of any other of the documents; storing each of the plurality of documents to different rows in a wide-column store by mapping the unique keys directly to different row keys of the wide-column store; defining at least one column for each of the document rows within the wide-column store, wherein the at least one column has a field comprising a pair of a name and a value, wherein each of the at least one column fields have different column names; defining a graph edge as a function of a relationship between a first source document and a second of the documents as a tuple of a source, a target, a tag and a value, wherein the source is the first source document key, the target is the second document key, the tag is a label of the relationship, and the value is an object associated with the relationship; and storing the graph edge as a graph column within the row of the first source document with a name that is different from names of other columns within said row of the first source document.