Abstract: Techniques are disclosed relating to a database system. The database system includes multiple coordinator nodes storing replicas of a partition. Each partition describes the state of locks and transactions for keys covered by that partition of keys. Each partition is, in turn, replicated. The multiple coordinator nodes receive, from multiple worker nodes, requests to grant a lock for a key to permit a worker node to write a record for the key as part of executing a transaction. A given coordinator node of the multiple coordinator nodes sends an approval response for the lock to at most one of the worker nodes. A single worker node acquires the lock in response to receiving approval responses from a majority of the multiple coordinator nodes, and none of the multiple worker nodes acquire the lock in response to none of them receiving approval responses from a majority of the multiple coordinator nodes.

Abstract: Techniques are provided for managing LSM tree structures and enabling bulk insertion of data into LSM tree structures. An exemplary embodiment includes a method that is performed by a data management system. The data management system receives a plurality of data records generated at least in part by at least one background process, and generates a burst segment which comprises at least a portion of the plurality of data records. The data management system inserts the burst segment into a non-root level of a LSM tree structure.

Abstract: A system and method are provided that store electronic data describing events that have occurred in a computing system, index the electronic data to create indexed data records; and store the indexed data records in computer memory as part of a flat data structure.

Abstract: A computer-implemented method is presented for storing and querying records from a data segment. The objective of the disclosure is to find computer-implemented methods for storing and querying records from a data segment that are fast and space efficient storing and querying of APM data stored in a segmented database.

Abstract: Embodiments are directed to operating a cloud based product configurator. Embodiments store, as vectorized data in a vector database product, information corresponding to a first product to be configured. While configuring the first product, embodiments receive a query regarding the first product. Embodiments augment the query in response to a context based semantic search of the vector database using the query. Embodiments prompt a large language model (“LLM”) using the augmented query and receiving an LLM response. Embodiments the provide the LLM response in response to the query.

Abstract: A query coordinator can receive a query. The query coordinator can determine one or more data semantics of a first data processing system. The data semantics of the first data processing system may be based on execution of one or more queries by the first data processing system. The query coordinator can define a query processing scheme for obtaining and processing data based on the query. The query processing scheme may include instructions for a second data processing system to execute at least a portion of the query according to the data semantics of the first data processing system. The query coordinator can provide the query processing scheme to the second data processing system and obtain query results from the second data processing system.

Abstract: Disclosed herein are various embodiments of a location data processing system. An embodiment operates by configuring a column of a table to store data across a plurality of different coordinate systems. The data to be stored in the configured column is received. The received data is divided into a plurality of fragments, including a first fragment comprising a plurality of data entries. A first data entry in the first fragment includes a coordinate specification including metadata indicating how to evaluate corresponding data of a first coordinate system represented by the first data entry. A query for data from the first fragment is received. The plurality of data entries of the first fragment are evaluated based on the coordinate specification to identify data that satisfies the query. The data is returned responsive to the query.

Abstract: Provided are methods and systems comprising receiving a plurality of data tables, wherein each data table comprises at least one row, generating a first handle for a first value in a table of the plurality of tables, wherein the first handle comprises an indication of whether a row in each of the plurality of tables is associated or not associated with the first value, and performing one or more operations on the first handle.

Abstract: Methods and systems for key-value shard creation and management in a key-value store (319). A method includes the steps of partitioning the key-value store (319) including a plurality of keyspaces (364A, 364B) into a plurality of shards including a coordinator shard (362), receiving a first shard assignment value for a first key-value pair from a key-value store client, the key-value store client having access to the key-value store, creating a first shard (321A) using the first shard assignment value, the first shard including a data structure, assigning the first key-value pair to the first shard (321a) based on the first shard assignment value, updating the coordinator shard (362) to reference to the first shard (321A), writing the first shard (321A) to a storage device, and storing modifications to the first shard (321A) in a modified version of the first shard (321A) while the first shard (321A) remains unmodified.

Abstract: The current document is directed to methods and systems that efficiently transmit and process log/event messages within and among distributed computer facilities. By digesting and condensing log/event messages at the message-collector level, the volume of data transmitted from message collectors to message-ingestion-and-processing systems is greatly reduced, which increases system efficiencies by decreasing network overheads and which provides sufficient additional computational bandwidth at the message-collector level to allow message collectors to offload many message-processing tasks from message-ingestion-and-processing system and other downstream processing systems.

Abstract: A method for splitting a node of a metadata tree, the method includes (i) splitting the node of the metadata tree based on a lock contention parameter that differs from a fullness of the node, to provide split nodes; and (ii) preventing a size based merge of the split nodes for a time period following a period of a defined duration that starts after the splitting.

Abstract: Proposed is a method and system for displaying data sets on a user interface. The system may retrieve first, second and third datasets from a plurality of databases. The system may then analyze the datasets to determine anomalies and fraud indicators in the datasets. The system may then generate and display an anomaly alert and a fraud alert respectively on first and second areas of a user interface. The system may display a first set of review data on a third area of the user interface. The system may receive a second set of review data and generate a final audit report on a fourth area of the user interface. The system may display an indication of the final audit report on a fourth area of the user interface such that information contained in the first to fourth areas is simultaneously visible via a same display screen.

Abstract: An application receives user input of a search query by way of a search interface. The application determines a task based on the search query, and divides the task into a plurality of sub-tasks, at least some of the plurality of sub-tasks divided for parallel processing by different compute components. The application receives publication of partial results from the different compute components as those partial results are completed by their respective compute components. The application inputs the partial results into a reducer to create an aggregate partial result, and generates for display the aggregate partial result within the search interface, where the aggregate partial result is updated in real time as further partial results are published.

Abstract: Aspects of the disclosure are directed to a foundational model for learned database tasks. The foundational model can be task-independent and used with low overhead to accomplish various learned database tasks. The foundational model can include a plurality of expert sub-models, each pre-trained to be utilized alone or in combination based on the database task. The foundational model can accomplish the various learned database tasks with reduced training overhead by relying on one or more particular expert sub-models based on the database task at hand.

Abstract: Embodiments relate to a method for training an index selection agent for iteratively determining an index set I to be used when running queries against a database, the method being implemented in a computer system. Preferably, the index selection agent is based on Reinforcement Learning.

Abstract: A technique is disclosed for reducing divergence among a plurality of executing wavefronts. A first wavefront requests that work-items of the first wavefront be sorted based on a sort parameter together with work-items of one or more other wavefronts, and the first wavefront is requested to pause execution. A query is issued for a status of the request, and a query result is provided to the first wavefront. Based on the query result, the first wavefront determines a subsequent action.

Abstract: A database system implementing a concurrency control protocol is provided. The database system includes a node connected through a network to a client; the node comprises: a storage for storing a plurality of data cells; one or more processors; and a memory, the memory containing instructions that, when executed by the one or more processors, configure the node to: receive at least one non-commit statement that is part of a transaction; execute locally tasks included in each of the at least one received statement in an optimistic manner allowing statements of other transactions to independently access same data cells in the database system being modified by tasks of the at least one received statement; and return the client an acknowledgment that the transaction is committed, the acknowledgment is returned upon validation of the transaction, wherein the transaction is validated in a pessimistic manner.

Abstract: Indexing in a low-latency data access and analysis system includes accessing, by an indexing unit of a low-latency data access and analysis system, constituent data from a data source of the low-latency data access and analysis system and indexing the constituent data in an index of the low-latency data access and analysis system by an indexing unit of the low-latency data access and analysis system. Indexing includes partitioning the constituent data based on a characteristic of the constituent data into at least a first partition and a second partition, segmenting the first partition into a first segment of the first partition, sharding the first segment into a first shard of the first segment of the first partition, segmenting, using hash-partitioning, the second partition into one or more segments of the second partition, and for respective segments of the second partition, sharding the respective segment into one or more respective shards.

Abstract: Here is message compression using schema inference for condensing semantic content by removal of syntactic structure in multiple kinds of content. Topological structures of different trees are generalized to generate a merged tree. Because compression discards redundant content and often only semantic content is retained, the signal-to-noise ratio is increased, which increases accuracy of downstream semantic analytics such as machine learning. Compression based on the merged tree removes redundant information from new messages that, without obscuring semantic content, decreases the data volume for downstream analytics or archiving. This compression extracts semantic values that can be assembled into a sequence of lexical tokens that is suitable for natural language processing (NLP), and the sequence of lexical tokens does not contain tokens that represent syntax or structure.

Abstract: Embodiments of the present disclosure provide a data processing method, an electronic device, and a storage medium. In the embodiments of the present disclosure, in a process of obtaining random sampling data from the target database table, through an index tree scanning manner in combine with a mechanism for random sampling a data page of the database table, full-table scanning is not performed on the target database table, thereby effectively reducing the number of times that I/O access is performed on the disk, saving disk I/O resources, and enhancing the query performance of the database system, especially in the case that the distributed database system has mass data.