公开(公告)号：US11256746B2

公开(公告)日：2022-02-22

申请号：US15494141

申请日：2017-04-21

Applicant: Oracle International Corporation

Inventor： Zhe Wu ,  Gabriela Montiel Moreno ,  Jiao Tao ,  Jayanta Banerjee

IPC: G06F16/901 ,  G06F16/22 ,  G06F16/2457

Abstract: A method and apparatus for a graph database instance (GDI) maintaining a secondary index, that indexes data from a sparse data map storing graph application data, within a sparse data map dedicated to the secondary index. The GDI formulates row-keys, for the secondary index map, by hashing the values of key/value pairs stored in rows of a map storing application data. The GDI stores for each formulated row-key, in the row of the secondary index that is indexed by the formulated row-key, references to rows of the map storing application data that match the key/value pair on which formulation of the row-key was based. The row-keys into the secondary index map may incorporate bucket identifiers, which, for each key/value pair, allows the GDI to spread the references to graph elements that match the key/value pair among a set number of “buckets” for the key/value pair within the secondary index map.

公开(公告)号：US10984042B2

公开(公告)日：2021-04-20

申请号：US15652044

申请日：2017-07-17

Applicant: Oracle International Corporation

Inventor： Jagannathan Srinivasan ,  Jayanta Banerjee ,  Vinh Thi Kim Nguyen

IPC: G06F16/80 ,  G06F16/951 ,  G06F16/9535

Abstract: A method, system, and computer program product for transforming RDF quads to relational views. The method commences by receiving a named graph, the named graph comprising at least one RDF quad, and analyzing the named graph to produce analysis metadata. The method uses the analysis metadata to generate relational views. The method further comprises publishing a relational view in the form of a SPARQL query. The quality of the results can be quantitatively measured and reported by calculating a goodness score based at least in part on aspects of the relational view definitions. Several variants for transformation include generating relational view definitions formed using a named-graph strict variant, or a named-graph relaxed variant, or a named-graph agnostic variant. The transformations can form outputs responsive to characteristics or properties such as a number of classes, a number of single-valued properties, a number of nullability properties, or a number of type-uniformed ranges.

公开(公告)号：US20160019228A1

公开(公告)日：2016-01-21

申请号：US14332182

申请日：2014-07-15

Applicant: Oracle International Corporation

Inventor： Sungpack Hong ,  Zhe Wu ,  Martin Sevenich ,  Jayanta Banerjee ,  Hassan Chafi ,  Korbinian Schmid

IPC: G06F17/30

CPC classification number: G06F17/30958 ,  G06F17/30327 ,  G06F2201/80

Abstract: Techniques for storing and processing graph data in a database system are provided. Graph data (or a portion thereof) that is stored in persistent storage is loaded into memory to generate an instance of a particular graph. The instance is consistent as of a particular point in time. Graph analysis operations are performed on the instance. The instance may be used by multiple users to perform graph analysis operations. Subsequent changes to the graph are stored separate from the instance. Later, the changes may be applied to the instance (or a copy thereof) to refresh the instance.

Abstract translation: 提供了用于在数据库系统中存储和处理图形数据的技术。 将存储在永久存储器中的图形数据（或其一部分）加载到存储器中以生成特定图形的实例。 实例在特定时间点是一致的。 在实例上执行图形分析操作。 多个用户可以使用该实例来执行图形分析操作。 图形的后续更改与实例分开存储。 之后，可以将更改应用于实例（或其副本）以刷新实例。

公开(公告)号：US20140310302A1

公开(公告)日：2014-10-16

申请号：US13893018

申请日：2013-05-13

Applicant: Oracle International Corporation

Inventor： Zhe Wu ,  Gabriela Montiel Moreno ,  Jayanta Banerjee

IPC: G06F17/30

CPC classification number: G06F16/2453 ,  G06F16/245 ,  G06F16/532

Abstract: Techniques for storing and querying graph data in a key-value store are provided. A graph statement (e.g., an RDF graph statement) includes a plurality of values, at least two of which correspond to nodes in a graph. A key is generated based on the graph statement. The key may be generated based on concatenating hash values that are generated based on the plurality of values. The key-value store stores the key. The value that corresponds to the key may be a null or empty value. In response to a graph query (e.g., in SPARQL) that includes one or more query patterns, each of which includes one or more values, a key is generated based on the one or more values and sent to the key-value store, which returns one or more other keys, each of which is a superset of the generated key.

Abstract translation: 提供了在键值存储中存储和查询图形数据的技术。 图形语句（例如，RDF图形语句）包括多个值，其中至少两个对应于图中的节点。 基于图形语句生成一个键。 可以基于基于多个值生成的级联哈希值来生成密钥。 键值存储存储键。 对应于该键的值可以是空值或空值。 响应于包括一个或多个查询模式的图形查询（例如，在SPARQL中），每个查询模式包括一个或多个值，基于一个或多个值生成密钥并发送到键值存储，其中 返回一个或多个其他键，每个键是生成的键的超集。

公开(公告)号：US10055509B2

公开(公告)日：2018-08-21

申请号：US14680150

申请日：2015-04-07

Applicant: Oracle International Corporation

Inventor： Sungpack Hong ,  Zhe Wu ,  Korbinian Schmid ,  Felix Kaser ,  Martin Sevenich ,  Hassan Chafi ,  Jayanta Banerjee

IPC: G06F17/30 ,  G06F17/00

CPC classification number: G06F16/9024 ,  G06F16/2246 ,  G06F2201/80

Abstract: Techniques for efficiently loading graph data into memory are provided. A plurality of node ID lists are retrieved from storage. Each node ID list is ordered based on one or more order criteria, such as node ID, and is read into memory. A new list of node IDs is created in memory and is initially empty. From among the plurality of node ID lists, a particular node ID is selected based on the one or more order criteria, removed from the node ID list where the particular node ID originates, and added to the new list. This process of selecting, removing, and adding continues until no more than one node ID list exists, other than the new list. In this way, the retrieval of the plurality of node ID lists from storage may be performed in parallel while the selecting and adding are performed sequentially.

公开(公告)号：US10019536B2

公开(公告)日：2018-07-10

申请号：US14332182

申请日：2014-07-15

Applicant: Oracle International Corporation

Inventor： Sungpack Hong ,  Zhe Wu ,  Martin Sevenich ,  Jayanta Banerjee ,  Hassan Chafi ,  Korbinian Schmid

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F16/9024 ,  G06F16/2246 ,  G06F2201/80

Abstract: Techniques for storing and processing graph data in a database system are provided. Graph data (or a portion thereof) that is stored in persistent storage is loaded into memory to generate an instance of a particular graph. The instance is consistent as of a particular point in time. Graph analysis operations are performed on the instance. The instance may be used by multiple users to perform graph analysis operations. Subsequent changes to the graph are stored separate from the instance. Later, the changes may be applied to the instance (or a copy thereof) to refresh the instance.

公开(公告)号：US20170308621A1

公开(公告)日：2017-10-26

申请号：US15494141

申请日：2017-04-21

Applicant: Oracle International Corporation

Inventor： Zhe Wu ,  Gabriela Montiel Moreno ,  Jiao Tao ,  Jayanta Banerjee

IPC: G06F17/30

CPC classification number: G06F16/9024 ,  G06F16/2255 ,  G06F16/24575

Abstract: A method and apparatus for a graph database instance (GDI) maintaining a secondary index, that indexes data from a sparse data map storing graph application data, within a sparse data map dedicated to the secondary index. The GDI formulates row-keys, for the secondary index map, by hashing the values of key/value pairs stored in rows of a map storing application data. The GDI stores for each formulated row-key, in the row of the secondary index that is indexed by the formulated row-key, references to rows of the map storing application data that match the key/value pair on which formulation of the row-key was based. The row-keys into the secondary index map may incorporate bucket identifiers, which, for each key/value pair, allows the GDI to spread the references to graph elements that match the key/value pair among a set number of “buckets” for the key/value pair within the secondary index map.

公开(公告)号：US09798772B2

公开(公告)日：2017-10-24

申请号：US13893047

申请日：2013-05-13

Applicant: Oracle International Corporation

Inventor： Zhe Wu ,  Gabriela Montiel Moreno ,  Jayanta Banerjee

IPC: G06F17/30

CPC classification number: G06F17/30442 ,  G06F17/30277 ,  G06F17/30424

Abstract: Techniques for storing and querying graph data in a key-value store are provided. A graph statement (e.g., an RDF graph statement) includes a plurality of values, at least two of which correspond to nodes in a graph. A key is generated based on the graph statement. The key may be generated based on concatenating hash values that are generated based on the plurality of values. The key-value store stores the key. The value that corresponds to the key may be a null or empty value. In response to a graph query (e.g., in SPARQL) that includes one or more query patterns, each of which includes one or more values, a key is generated based on the one or more values and sent to the key-value store, which returns one or more other keys, each of which is a superset of the generated key.

公开(公告)号：US20140310260A1

公开(公告)日：2014-10-16

申请号：US13893047

申请日：2013-05-13

Applicant: Oracle International Corporation

Inventor： Zhe Wu ,  Gabriela Montiel Moreno ,  Jayanta Banerjee

IPC: G06F17/30

CPC classification number: G06F17/30442 ,  G06F17/30277 ,  G06F17/30424

Abstract: Techniques for storing and querying graph data in a key-value store are provided. A graph statement (e.g., an RDF graph statement) includes a plurality of values, at least two of which correspond to nodes in a graph. A key is generated based on the graph statement. The key may be generated based on concatenating hash values that are generated based on the plurality of values. The key-value store stores the key. The value that corresponds to the key may be a null or empty value. In response to a graph query (e.g., in SPARQL) that includes one or more query patterns, each of which includes one or more values, a key is generated based on the one or more values and sent to the key-value store, which returns one or more other keys, each of which is a superset of the generated key.

Abstract translation: 提供了在键值存储中存储和查询图形数据的技术。 图形语句（例如，RDF图形语句）包括多个值，其中至少两个对应于图中的节点。 基于图形语句生成一个键。 可以基于基于多个值生成的级联哈希值来生成密钥。 键值存储存储键。 对应于该键的值可以是空值或空值。 响应于包括一个或多个查询模式的图形查询（例如，在SPARQL中），每个查询模式包括一个或多个值，基于一个或多个值生成密钥并发送到键值存储，其中 返回一个或多个其他键，每个键是生成的键的超集。

公开(公告)号：US09710568B2

公开(公告)日：2017-07-18

申请号：US13753329

申请日：2013-01-29

Applicant: Oracle International Corporation

Inventor： Jagannathan Srinivasan ,  Jayanta Banerjee ,  Vinh Thi Kim Nguyen

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30908 ,  G06F17/30864 ,  G06F17/30867

Abstract: A method, system, and computer program product for transforming RDF quads to relational views. The method commences by receiving a named graph, the named graph comprising at least one RDF quad, and analyzing the named graph to produce analysis metadata. The method uses the analysis metadata to generate relational views. The method further comprises publishing a relational view in the form of a SPARQL query. The quality of the results can be quantitatively measured and reported by calculating a goodness score based at least in part on aspects of the relational view definitions. Several variants for transformation include generating relational view definitions formed using a named-graph strict variant, or a named-graph relaxed variant, or a named-graph agnostic variant. The transformations can form outputs responsive to characteristics or properties such as a number of classes, a number of single-valued properties, a number of nullability properties, or a number of type-uniformed ranges.