公开(公告)号：US10789260B2

公开(公告)日：2020-09-29

申请号：US15090754

申请日：2016-04-05

Applicant: Cray Inc.

Inventor： David Mizell ,  Christopher Douglas Rickett ,  Andrew Steven Kopser

IPC: G06F16/248 ,  G06F16/80 ,  G06F16/22 ,  G06F16/2455

Abstract: A method and system for identifying results of a query that includes a type predicate is provided. A search system maintains a collection of facts that includes a triple for each fact and a type table that maps entities of the facts to their corresponding type. The search system uses the type table to speed up the process of identifying the search results when the query includes a non-type query triple and a type query triple. A type query triple is a triple that has a type predicate, rather than a non-type predicate. To execute a query that contains a non-type query triple and a type query triple, the search system identifies the triples of the collection that match the non-type query triple. The search system then uses the type table to determine which of the identified triples match the type query triple for inclusion in the search results.

公开(公告)号：US20160217189A1

公开(公告)日：2016-07-28

申请号：US15090754

申请日：2016-04-05

Applicant: Cray Inc.

Inventor： David Mizell ,  Christopher Douglas Rickett ,  Andrew Steven Kopser

IPC: G06F17/30

CPC classification number: G06F16/248 ,  G06F16/2282 ,  G06F16/2455 ,  G06F16/80

Abstract: A method and system for identifying results of a query that includes a type predicate is provided. A search system maintains a collection of facts that includes a triple for each fact and a type table that maps entities of the facts to their corresponding type. The search system uses the type table to speed up the process of identifying the search results when the query includes a non-type query triple and a type query triple. A type query triple is a triple that has a type predicate, rather than a non-type predicate. To execute a query that contains a non-type query triple and a type query triple, the search system identifies the triples of the collection that match the non-type query triple. The search system then uses the type table to determine which of the identified triples match the type query triple for inclusion in the search results.

公开(公告)号：US20150138206A1

公开(公告)日：2015-05-21

申请号：US14570073

申请日：2014-12-15

Applicant: Cray Inc.

Inventor： David Mizell

IPC: G06T11/20

CPC classification number: G06T11/206 ,  G06F17/30321 ,  G06F17/30958

Abstract: A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

Abstract translation: 公开了一种用于通过矩阵接口动态地提供条目的数据存储的图形表示的计算机系统中的方法和系统。 动态图系统提供了一个矩阵接口，向应用程序公开存储在数据存储器中的数据的图形表示，例如存储三元组的语义数据库。 对于应用程序，矩阵接口将图形表示为以压缩形式存储的稀疏邻接矩阵。 数据存储的每个条目被认为表示图形的节点之间的链接。 每个条目具有标识通过链路连接的节点的第一字段和第二字段，以及连接所识别的节点的链接的值的第三字段。 第一，第二和第三字段表示邻接矩阵的行，列和元素。

公开(公告)号：US20140244657A1

公开(公告)日：2014-08-28

申请号：US13777884

申请日：2013-02-26

Applicant: CRAY INC.

Inventor： David Mizell

IPC: G06F17/30

CPC classification number: G06T11/206 ,  G06F17/30321 ,  G06F17/30958

Abstract: A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

Abstract translation: 公开了一种用于通过矩阵接口动态地提供条目的数据存储的图形表示的计算机系统中的方法和系统。 动态图系统提供了一个矩阵接口，向应用程序公开存储在数据存储器中的数据的图形表示，例如存储三元组的语义数据库。 对于应用程序，矩阵接口将图形表示为以压缩形式存储的稀疏邻接矩阵。 数据存储的每个条目被认为表示图形的节点之间的链接。 每个条目具有标识通过链路连接的节点的第一字段和第二字段，以及连接所识别的节点的链接的值的第三字段。 第一，第二和第三字段表示邻接矩阵的行，列和元素。

公开(公告)号：US20140081934A1

公开(公告)日：2014-03-20

申请号：US13623688

申请日：2012-09-20

Applicant: CRAY INC.

Inventor： David Mizell

IPC: G06F17/30

CPC classification number: G06F17/30348 ,  G06F17/30321 ,  G06F17/3033 ,  G06F17/30917

Abstract: A system for updating an index into a tuple table of tuples is provided. An indexing system updates an index into a tuple table using fine-grain locking of the index. The index includes a values table with an entry for each index value of an index field that references a value-tuple table that includes, for each tuple with the index value, a row that identifies a tuple of the tuple table with that indexed value. After a new tuple is added to the tuple table with a value, the index is updated by locking the entry in the values table, updating the value-tuple table for the value, and then unlocking the entry. When the index is accessed for locating tuples with a value, the accessor locks the entry in the values table for the value, uses the value-tuple table to locate the tuples, and unlocks the entry.

Abstract translation: 提供了一种用于将索引更新为元组的元组表的系统。 索引系统使用索引的细粒度锁定将索引更新为元组表。 索引包括一个值表，其中包含索引字段的每个索引值的条目，该索引字段引用一个值元组表，该值包含具有索引值的每个元组，该行用于标识具有该索引值的元组表的元组。 在使用值添加到元组表的新元组之后，通过将值表中的条目锁定，更新该值的值 - 元组表，然后解锁该条目来更新该索引。 当访问用于定位具有值的元组的索引时，访问器将该值锁定在值表中的值，使用value-tuple表来定位元组，并解锁该条目。

公开(公告)号：US20150227570A1

公开(公告)日：2015-08-13

申请号：US14693534

申请日：2015-04-22

Applicant: Cray Inc.

Inventor： David Mizell

IPC: G06F17/30

CPC classification number: G06F16/2308 ,  G06F16/2228 ,  G06F16/2255 ,  G06F16/86

Abstract: A system for updating an index into a tuple table of tuples is provided. An indexing system updates an index into a tuple table using fine-grain locking of the index. The index includes a values table with an entry for each index value of an index field that references a value-tuple table that includes, for each tuple with the index value, a row that identifies a tuple of the tuple table with that indexed value. After a new tuple is added to the tuple table with a value, the index is updated by locking the entry in the values table, updating the value-tuple table for the value, and then unlocking the entry. When the index is accessed for locating tuples with a value, the accessor locks the entry in the values table for the value, uses the value-tuple table to locate the tuples, and unlocks the entry.

Abstract translation: 提供了一种用于将索引更新为元组的元组表的系统。 索引系统使用索引的细粒度锁定将索引更新为元组表。 索引包括一个值表，其中包含索引字段的每个索引值的条目，该索引字段引用一个值元组表，该值包含具有索引值的每个元组，该行用于标识具有该索引值的元组表的元组。 在使用值添加到元组表的新元组之后，通过将值表中的条目锁定，更新该值的值 - 元组表，然后解锁该条目来更新该索引。 当访问用于定位具有值的元组的索引时，访问器将该值锁定在值表中的值，使用value-tuple表来定位元组，并解锁该条目。

公开(公告)号：US09047333B2

公开(公告)日：2015-06-02

申请号：US13623688

申请日：2012-09-20

Applicant: Cray Inc.

Inventor： David Mizell

IPC: G06F17/00 ,  G06F17/30

CPC classification number: G06F17/30348 ,  G06F17/30321 ,  G06F17/3033 ,  G06F17/30917

Abstract: A system for updating an index into a tuple table of tuples is provided. An indexing system updates an index into a tuple table using fine-grain locking of the index. The index includes a values table with an entry for each index value of an index field that references a value-tuple table that includes, for each tuple with the index value, a row that identifies a tuple of the tuple table with that indexed value. After a new tuple is added to the tuple table with a value, the index is updated by locking the entry in the values table, updating the value-tuple table for the value, and then unlocking the entry. When the index is accessed for locating tuples with a value, the accessor locks the entry in the values table for the value, uses the value-tuple table to locate the tuples, and unlocks the entry.

Abstract translation: 提供了一种用于将索引更新为元组的元组表的系统。 索引系统使用索引的细粒度锁定将索引更新为元组表。 索引包括一个值表，其中包含索引字段的每个索引值的条目，该索引字段引用一个值元组表，该值包含具有索引值的每个元组，该行用于标识具有该索引值的元组表的元组。 在使用值添加到元组表的新元组之后，通过将值表中的条目锁定，更新该值的值 - 元组表，然后解锁该条目来更新该索引。 当访问用于定位具有值的元组的索引时，访问器将该值锁定在值表中的值，使用value-tuple表来定位元组，并解锁该条目。

公开(公告)号：US10296834B2

公开(公告)日：2019-05-21

申请号：US14458509

申请日：2014-08-13

Applicant: Cray Inc.

Inventor： David Mizell ,  Christopher Douglas Rickett

IPC: G06N5/04 ,  G06N5/02

Abstract: A method and system for inferring facts in parallel in a multiprocessor computing environment is provided. An inference system infers facts by applying rules to a collection of existing facts. For each existing fact, the inference system schedules a thread to apply the rules to that existing fact. As a thread infers a new fact (i.e., one that is not already in the collection of facts), the thread adds that inferred fact to the collection of facts. When a thread adds a new fact to the collection, the thread also applies the rules to that new fact. After the threads complete execution, the inference system may apply the rules to the facts of the collection, including the newly inferred facts, by again launching a thread for each fact to apply the rules to that fact. The inference system performs this processing iteratively until a termination condition is satisfied.

公开(公告)号：US09311731B2

公开(公告)日：2016-04-12

申请号：US14570073

申请日：2014-12-15

Applicant: Cray Inc.

Inventor： David Mizell

IPC: G06F17/20 ,  G06T11/20 ,  G06F17/30

CPC classification number: G06T11/206 ,  G06F17/30321 ,  G06F17/30958

Abstract: A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

公开(公告)号：US08943068B2

公开(公告)日：2015-01-27

申请号：US13777884

申请日：2013-02-26

Applicant: Cray Inc.

Inventor： David Mizell

IPC: G06F17/30

CPC classification number: G06T11/206 ,  G06F17/30321 ,  G06F17/30958

Abstract: A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

Abstract translation: 公开了一种用于通过矩阵接口动态地提供条目的数据存储的图形表示的计算机系统中的方法和系统。 动态图系统提供了一个矩阵接口，向应用程序公开存储在数据存储器中的数据的图形表示，例如存储三元组的语义数据库。 对于应用程序，矩阵接口将图形表示为以压缩形式存储的稀疏邻接矩阵。 数据存储的每个条目被认为表示图形的节点之间的链接。 每个条目具有标识通过链路连接的节点的第一字段和第二字段，以及连接所识别的节点的链接的值的第三字段。 第一，第二和第三字段表示邻接矩阵的行，列和元素。