COMPILER-GENERATED ALTERNATE MEMORY-MAPPED DATA ACCESS OPERATIONS

    公开(公告)号:US20220083319A1

    公开(公告)日:2022-03-17

    申请号:US17024521

    申请日:2020-09-17

    Abstract: Techniques for compiling source code include generating object code by processing source code corresponding to a portion of a software program. The source code includes an instruction, native to a program language, for a memory location access. Based at least in part on processing the source code, the compiler generates second object code that, when executed by one or more processors, configures the one or more processors to determine to implement the memory location access using first database access transaction operations or to implement the memory location access using second database access transaction operations. The compiler may generate third object code that configures the one or more processors to implement the memory location access using the first database access transaction operations or to implement the memory location access using the second database access transaction operations, based at least in part based on the determining.

    CURSOR-BASED STATE-COLLAPSE SCHEME FOR SHARED DATABASES

    公开(公告)号:US20170147669A1

    公开(公告)日:2017-05-25

    申请号:US15288140

    申请日:2016-10-07

    Abstract: In one embodiment, a cursor management process inserts temporal references into a plurality of records written to a table of a shared database, the temporal references indicative of an order in which the records are written. A table write cursor points at a last-written record from among the plurality of records, and read cursors point to a last-read record of a corresponding application. The cursor management process may then provide, table updates to a particular application by determining a chain of one or more updated records of the table from the last-read record of the particular application to the last-written record based on walking a particular read cursor for the particular application through the temporal references of the one or more updated records until the particular read cursor points to the last-written record according to the table write cursor.

    Software flow execution tracing
    5.
    发明授权

    公开(公告)号:US10282268B1

    公开(公告)日:2019-05-07

    申请号:US15338558

    申请日:2016-10-31

    Abstract: In one embodiment, a logging process initiates a trace of an execution flow across a plurality of processes, and creates a log context for the trace, the log context having a universally unique identifier (UUID) and an indication that the trace is to be performed as the plurality of processes are executed during the execution flow. The logging process manages passage of the log context across the plurality of processes during the execution flow, and gathers log entries from the plurality of processes based on the UUID for the trace, where the log entries were created based on the indication being within the log context. As such, the logging process may stitch the log entries into a flow execution log for the trace of the execution flow.

    Compiler-enabled application execution tracking

    公开(公告)号:US11669432B1

    公开(公告)日:2023-06-06

    申请号:US16932363

    申请日:2020-07-17

    CPC classification number: G06F11/3624 G06F8/44

    Abstract: This disclosure describes techniques to compile source code corresponding to a portion of a software program. The techniques include generating first object code by processing the source code. Based at least in part on processing the source code, generating second object code, wherein the second object code, when executed by one or more processors, causes the one or more processors to perform an operation unconditionally bound to a unique identifier of the operation. The described techniques further include generating an indication of a mapping of the unique identifier to the portion of the software program.

    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