Efficient graph database traversal

    公开(公告)号:US10437883B2

    公开(公告)日:2019-10-08

    申请号:US15287970

    申请日:2016-10-07

    Abstract: In one embodiment, an operating system on a computer device interfaces with a graph database that has data nodes interconnected by relationship edges. The operating system generates database instructions that specify a database operation for a target node in the graph database and a node traversal list through the graph database to reach the target node. By then transmitting the database instruction to the graph database, the graph database (e.g., a database management operating system) traverses the specified node traversal list through the graph database to the target node, and performs the database operation on the target node.

    Efficient graph database traversal

    公开(公告)号:US10984048B2

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

    申请号:US16545449

    申请日:2019-08-20

    Abstract: In one embodiment, an operating system on a computer device interfaces with a graph database that has data nodes interconnected by relationship edges. The operating system generates database instructions that specify a database operation for a target node in the graph database and a node traversal list through the graph database to reach the target node. By then transmitting the database instruction to the graph database, the graph database (e.g., a database management operating system) traverses the specified node traversal list through the graph database to the target node, and performs the database operation on the target node.

    Network-wide, location-independent object identifiers for high-performance distributed graph databases

    公开(公告)号:US10585943B2

    公开(公告)日:2020-03-10

    申请号:US15288282

    申请日:2016-10-07

    Abstract: In one embodiment, an operating system (on a computer device in a network of computer devices) interfaces with a distributed graph database that is distributed across the network of computer devices, and executes an application that has one or more parent data constructs that reference one or more child objects within the distributed graph database. Specifically, the one or more child objects each have a location-independent object identifier (OID) having at least: a) an OID-identifier (OID-ID) assigned upon creation to each particular child object by a data source of the location-independent OID; b) an OID-source structure that uniquely identifies the data source of the location-independent OID within the network of computer devices; and c) an OID-pointer indicative of a relative location of the particular child object in a memory mapped region. Accordingly, the operating system accesses the child objects (e.g., for an application) based on the location-independent OID.

Patent Agency Ranking