Database structure for distributed key-value pair, document and graph models

Patent metadata

Field	Value
Publication number	US-2016275201-A1
Application number	US-201514660987-A
Country	US
Kind code	A1
Filing date	Mar 18, 2015
Priority date	Mar 18, 2015
Publication date	Sep 22, 2016
Grant date	—

Abstract

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.

First claim

What is claimed is:

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.

2 . The method of claim 1 , further comprising:
integrating computer-readable program code into a computer system comprising the processor, a computer readable memory in circuit communication with the processor, and a computer readable storage medium in circuit communication with the processor; and wherein the processor executes program code instructions stored on the computer-readable storage medium via the computer readable memory and thereby performs the steps of defining the plurality of documents, storing each of the plurality of documents to the different rows in the wide-column store, defining the at least one column for each of the document rows within the wide-column store, defining the graph edge, and storing the graph edge as the graph column within the row of the first source document.

3 . The method of claim 1 , wherein the unique key is an alpha-numeric value.

4 . The method of claim 1 , wherein the value of the at least one column field is an array, the method further comprising:
defining a cell value of the at least one column field as a size of the array; and defining a plurality of additional columns for the row for each value of the array in recursively named columns.

5 . The method of claim 4 , further comprising:
indicating a data type of the at least one column field value via a type of notation.

6 . The method of claim 5 , wherein the type of notation is dot notation or separator notation.

7 . The method of claim 5 , wherein the step of storing each of the plurality of documents to the different rows in the wide-column store comprises storing the documents in a first column family; and
wherein the step of storing the graph edge as the graph column within the row of the first source document comprises the storing the graph column in a second column family that is different from the first column family.

8 . The method of claim 5 , wherein the step of storing each of the plurality of documents to the different rows in the wide-column store comprises adding a first prefix to each of the different column names of the columns of the fields comprising the pairs of the name and the values; and
wherein the step of storing the graph edge as the graph column within the row of the first source document comprises adding a second prefix to the graph column name that is different from the first prefix.

9 . A system, comprising:
a processor; a computer readable memory in circuit communication with the processor; and a computer readable storage medium in circuit communication with the processor; wherein the processor executes program instructions stored on the computer-readable storage medium via the computer readable memory and thereby: defines a plurality of documents, each with a unique key that is different from a key of any other of the documents; stores 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; defines 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; defines 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 stores 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.

10 . The system of claim 9 , wherein the unique key is an alpha-numeric value.

11 . The system of claim 10 , wherein the value of the at least one column field is an array, and wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby further:
defines a cell value of the at least one column field as a size of the array; and defines a plurality of additional columns for the row for each value of the array in recursively named columns.

12 . The system of claim 11 , wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby further:
indicates a data type of the at least one column field value via a type of notation.

13 . The system of claim 12 , wherein the type of notation is dot notation or separator notation.

14 . The system of claim 11 , wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby further:
stores each of the plurality of documents to the different rows in the wide-column store by storing the documents in a first column family; and stores the graph edge as the graph column within the row of the first source document by the storing the graph column in a second column family that is different from the first column family.

15 . The system of claim 11 , wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby further:
stores each of the plurality of documents to the different rows in the wide-column store by adding a first prefix to each of the different column names of the columns of the fields comprising the pairs of the name and the values; and stores the graph edge as the graph column within the row of the first source document by adding a second prefix to the graph column name that is different from the first prefix.

16 . A computer program product for defining a NoSQL database structure that supports wide-column, document, and graph data models, the computer program product comprising:
a computer readable hardware storage device having computer readable program code embodied therewith, wherein the hardware storage device is not a transitory signal per se, the computer readable program code comprising instructions for execution by a processor that cause the processor to: defi

Assignees

• Adp Llc

Inventors

• Li Haifeng
• Masiero Roberto A

Classifications

• G06F16/9024 Primary

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title

• G06F16/284

  Relational databases · CPC title

• G06F16/221

  Column-oriented storage; Management thereof · CPC title

• G06F16/211

  Schema design and management · CPC title

• G06F17/30315

  Physics · mapped topic