Patent classifications
G06F16/24552
CLUSTERING AND COMPACTION OF MATERIALIZED VIEWS ON A DATABASE SYSTEM
Methods, systems, and computer programs are presented for providing a cluster view method of a database to perform compaction and clustering of database objects, such as database materialized view. A cluster view system identifies a materialized view including data from one or more base tables, a portion of the data of the materialized view including stale data. The cluster view system performs an integrated task within a maintenance operation on a database, the integrated task including compacting the materialized view, the maintenance operation including clustering the materialized view, and stores the compacted and clustered materialized view in the database.
Transmission format cache for database reads
A transmission format cache may be implemented at a database storage node. Versions of data items stored in a database at the database storage node may be processed according to anticipated access requests to generate an anticipated access responses. The anticipated access responses are then stored in a transmission format cache to provide low latency reads of the data items. The versions of the data items may be processed as a result of updates to the database items. The database storage node may be one of a plurality of database storage nodes implementing a distributed database system with the transmission format cache implementing a portion of a distributed response cache providing low latency, eventually consistent or consistent reads of data items in a distributed database.
POLICY DRIVEN EVENT TRANSFORMATION
A system includes processing circuitry; and a memory connected to the processing circuitry, wherein the memory is configured to store executable instructions that, when executed by the processing circuitry, facilitate performance of operations, including: receive an event message frame from a data source, wherein the event message frame is generated by one or more state changes within a network operatively connected to the system; correlate one or more business policies based the event message frame; apply the one or more operations to the event message frame based on the one or more business policies to create a transformed event message frame; and route the transformed event message frame to a message queue.
Data set lookup with binary search integration and caching
In non-limiting examples of the present disclosure, systems, methods and devices for identifying a target value in a data set are presented. A request for a first target value in a data array may be received, wherein the request comprises first reference value. The data array may comprise a plurality of values and a plurality of value types included in one or more tables in a computer-implemented spreadsheet application. An index comprising a plurality of sorted reference numbers corresponding to a plurality of values in the data array may be generated based on the request. The index may be searched, and based at least on the search, the first reference value may be identified. In additional examples, the index may be cached and utilized to process additional target value requests that reference an overlapping range value with the first request.
SYSTEM AND METHOD FOR TRANSFERRABLE DATA TRANSFORMATIONS
This invention enables users to work with large datasets that are available from data producers, transforming the data into meaningful information whose derivation may later be easily comprehended. Users can build queries by applying transformation functions to the datasets. These queries can be saved and used to build further queries, and queries can be saved and visualized, creating a clear and comprehensible record of data transformations. Inferences are applied to datasets and parameters so that transformations are processed with minimal errors. Limited multiprocessing is implemented on each server on which queries are performed, increasing processing speeds. A graph database of relationships between raw data and queries is used to ensure that queries are performed on updated data. These solutions lead to greater processing efficiency even when datasets tend to be enormous and subject to frequent updates.
Distributed data analysis for streaming data sources
A server system, coupled to a linear communication orbit, has a plurality of function modules. Each function module is configured to collect data from machines located at nodes of the linear communication orbit, process collected data according to a schema definition to generate result data, and store the result data in a database. Data collection requests, based on the schema definition, are sent through the linear communication orbit to collecting data from a set of machines via the linear communication orbit. In some embodiments, a central data management module of the one or more servers is configured to provide the schema definition to and receive result data reported from the function modules.
TRANSFORMING RELATIONAL STATEMENTS INTO HIERACHICAL DATA SPACE OPERATIONS
A method for transforming a statement into at least one hierarchical data space operation may include analyzing the statement to produce at least one transformed statement. The method may further include selecting at least one element of the transformed statement. The method may further include determining at least one column for the at least one element. The method may further include generating at least one hierarchical data space operation for the at least one element. The method may further include extracting at least one value from the at least one element for the at least one column. The method may further include determining at least one first logical hierarchical data space for the at least one hierarchical data space operation. The method may further include generating at least one first hierarchical path identifier for the at least one value that preserves the hierarchy of its first hierarchical data space, wherein each value corresponds to at least one subdivision of its first hierarchical data space. The method may further include associating the at least one first hierarchical path identifier with the at least one hierarchical data space operation.
Data processing method, apparatus, and system
A data processing method, apparatus, and system, where the method includes: receiving a data insertion request sent by service software, where the data insertion request includes a data record, and the data record includes an object type identifier, a field value, a field identifier, and an object instance identifier; generating a field index based on the object type identifier, the field value, and the object instance identifier; generating a relationship index based on the object type identifier; writing the data record to a database; and caching an index record and an operation for the index record into a cache apparatus, where the index record includes the relationship index and the field index. Using the foregoing solution, high-performance data processing of a flat-wide table is implemented.
Auto-completion for gesture-input in assistant systems
In one embodiment, a method includes receiving an initial input in a first modality from a first user from a client system associated with the first user, determining one or more intents corresponding to the initial input by an intent-understanding module, generating one or more candidate continuation-inputs based on the one or more intents, where the one or more candidate continuation-inputs are in one or more candidate modalities, respectively, and wherein the candidate modalities are different from the first modality, and sending instructions for presenting one or more suggested inputs corresponding to one or more of the candidate continuation-inputs to the client system.
Workload pool hierarchy for a search and indexing system
Resource management includes storing, for multiple workload pools of a data intake and query system, a workload pool hierarchy arranged in multiple workload pool layers. After storing a processing request is assigned a selected subset of workload pools in a second layer of the workload pool hierarchy based on a type of processing request. The processing request is then assigned to an individual workload pool in the selected subset to obtain a selected workload pool. Execution of the processing request is initiated on the selected workload pool.