Efficiently updating a secondary index associated with a log-structured merge-tree database

    公开(公告)号:US10776345B2

    公开(公告)日:2020-09-15

    申请号:US15962962

    申请日:2018-04-25

    申请人: DataStax

    摘要: Systems and methods are described herein for efficiently updating a secondary index associated with a log-structured merge-tree (LSM) database. A Global approximate member query (AMQ) Filter is queried to determine whether a primary key, retrieved from a list of LSM database updates, already exists in the LSM database. If the primary key does not already exist in the LSM database then read-before-write and delete operations, typically performed with known approaches, do not need to be performed on the secondary index in order to update the secondary index, thereby avoiding significant additional computer processing and input/output operations.

    Virtual edge of a graph database
    2.
    发明授权

    公开(公告)号:US10754853B2

    公开(公告)日:2020-08-25

    申请号:US14933697

    申请日:2015-11-05

    申请人: DataStax, Inc.

    摘要: At least a portion of a graph database having a plurality of vertex-centric indices is stored. A virtual edge to be generated is identified based on a plurality of edges of the graph database. The virtual edge connecting at least a pair of vertices that were not previously directly connected is generated. The plurality of vertex-centric indices is updated to include information about the virtual edge.

    TRIE-BASED INDICES FOR DATABASES
    3.
    发明申请

    公开(公告)号:US20200004851A1

    公开(公告)日:2020-01-02

    申请号:US16020936

    申请日:2018-06-27

    申请人: DataStax, Inc.

    IPC分类号: G06F17/30

    摘要: A database system uses byte ordering for keys and a trie index to reference stored data. The keys of a database are converted into byte-comparable sequences of byte values. The trie index is generated including nodes connected by edges defining paths from a root node to leaf nodes. Each edge is associated with at least one byte value such that each path from the root node to a leaf node through one or more edges defines a unique byte prefix for a byte-comparable sequence of byte values. The leaf node of each path is associated with a database location value. A record is accessed in the database using a database location value determined from referencing the trie index using a byte-comparable sequence of byte values of the record generated from a key of the record. A trie structure and byte ordered keys may be used for partition or row indices.

    Backup to and restore from an offsite backup location

    公开(公告)号:US10402275B2

    公开(公告)日:2019-09-03

    申请号:US14608028

    申请日:2015-01-28

    申请人: DataStax

    IPC分类号: G06F17/30 G06F11/14

    摘要: Various operations, functionalities and systems are described herein for backing up one or more node to an offsite location, restoring the one or more node from the offsite location, restoring the one or more node to a point-in-time (PIT) from the offsite location, cloning the one or more node from the offsite location, and cloning the one or more node to a PIT from the offsite location. Example operating contexts include one or more cluster of nodes running a NoSQL (Not only Structured Query Language) distributed database and backup, restore and/or cloning on those one or more cluster of nodes.

    Graph database super vertex partitioning

    公开(公告)号:US11423085B2

    公开(公告)日:2022-08-23

    申请号:US16786244

    申请日:2020-02-10

    申请人: DataStax, Inc.

    IPC分类号: G06F16/00 G06F16/901

    摘要: In partitioning a graph database, a plurality of vertices of the graph database is assigned to a plurality of nodes. The vertices of the graph database are connected by edges that indicate relationships between the vertices. A vertex of the graph database is designated as a super-vertex that is split into a truncated vertex and at least one vertex representative.

    GRAPH DATABASE SUPER VERTEX PARTITIONING
    6.
    发明申请

    公开(公告)号:US20200242167A1

    公开(公告)日:2020-07-30

    申请号:US16786244

    申请日:2020-02-10

    申请人: DataStax, Inc.

    IPC分类号: G06F16/901

    摘要: In partitioning a graph database, a plurality of vertices of the graph database is assigned to a plurality of nodes. The vertices of the graph database are connected by edges that indicate relationships between the vertices. A vertex of the graph database is designated as a super-vertex that is split into a truncated vertex and at least one vertex representative.

    System and method for fault tolerant queries

    公开(公告)号:US10210220B2

    公开(公告)日:2019-02-19

    申请号:US14856001

    申请日:2015-09-16

    申请人: DataStax

    摘要: Fault tolerant querying of data distributed across multiple nodes is accomplished by each node determining and reporting its own health status and indexing status to the other nodes in the cluster via a gossip protocol. A coordinator node then prioritizes replica nodes based on the received status of the other nodes and sends query requests to those nodes based on the prioritization. Should a node fail to provide an response to a query request, further query requests are sent to a next highest priority replica node containing the relevant data. This results in improved query performance by avoiding busy nodes and further provides a fault tolerant approach to data queries.

    RESOURCE MANAGEMENT IN A DISTRIBUTED SYSTEM
    8.
    发明申请

    公开(公告)号:US20190028540A1

    公开(公告)日:2019-01-24

    申请号:US16143218

    申请日:2018-09-26

    申请人: DataStax, Inc.

    摘要: A distributed system that manages resources of the distributed system without the need for complex time synchronization systems is described. The distributed system includes a resource manager that manages the resources of the distributed system. The resource manager assigns leases and renews leases of resources of the distributed system to clients in the distributed system. The leases specify the duration of time that the lease is awarded to clients.

    Web application configuration settings for execution in a cloud computing environment

    公开(公告)号:US12061900B2

    公开(公告)日:2024-08-13

    申请号:US17966715

    申请日:2022-10-14

    申请人: DataStax, Inc.

    IPC分类号: G06F8/71 G06F8/38 G06F9/54

    CPC分类号: G06F8/71 G06F8/38 G06F9/547

    摘要: Methods, systems, and apparatus, including computer programs encoded on computer-storage media, for web application generation. In some implementations, a method includes receiving an identifier for code written for execution on a local device; determining, by analyzing the code, contextual information for executing the code; generating, using the contextual information, a web services layer for the code that enables execution of the code in a cloud computing environment; creating configuration settings i) for the code and ii) that include first data defining the web services layer and second data defining one or more access tokens, each access token enabling calling of a respective function in the code; and storing, in memory, the configuration settings for use during deployment of the code in response to receipt of a request to execute at least one function in the code.

    WEB APPLICATION GENERATION
    10.
    发明公开

    公开(公告)号:US20230367586A1

    公开(公告)日:2023-11-16

    申请号:US17966715

    申请日:2022-10-14

    申请人: DataStax, Inc.

    IPC分类号: G06F8/71 G06F8/38 G06F9/54

    CPC分类号: G06F8/71 G06F8/38 G06F9/547

    摘要: Methods, systems, and apparatus, including computer programs encoded on computer-storage media, for web application generation. In some implementations, a method includes receiving an identifier for code written for execution on a local device; determining, by analyzing the code, contextual information for executing the code; generating, using the contextual information, a web services layer for the code that enables execution of the code in a cloud computing environment; creating configuration settings i) for the code and ii) that include first data defining the web services layer and second data defining one or more access tokens, each access token enabling calling of a respective function in the code; and storing, in memory, the configuration settings for use during deployment of the code in response to receipt of a request to execute at least one function in the code.