Patent classifications
G06F16/24553
COLUMN ORDERING FOR INPUT/OUTPUT OPTIMIZATION IN TABULAR DATA
Systems, methods, and computer-readable media for determining column ordering of a data storage table for search optimization are described herein. In some examples, a computing system is configured to receive input containing statistics of a plurality of queries. The computing system can then determine a new column order (i.e., layout) based at least in part on the statistics. In some example techniques described herein, the computing system can determine the new column order based at least in part on the hardware components storing the data storage table, storage system parameters, and/or user preference information. Example techniques described herein can apply the new column order to data subsequently added to the data storage table. Example techniques described herein can apply the new column order to existing data in the data storage table.
Executing untrusted commands from a distributed execution model
Systems and methods are disclosed for generating a distributed execution model with untrusted commands. The system can receive a query, and process the query to identify the untrusted commands. The system can use data associated with the untrusted command to identify one or more files associated with the untrusted command. Based on the files, the system can generate a data structure and include one or more identifiers associated with the data structure in the distributed execution model. The system can distribute the distributed execution model to one or more nodes in a distributed computing environment for execution.
INTERACTIVE QUERY BY EXAMPLE EXPERT SYSTEM FOR AUTONOMOUS DATA PROTECTION
One example method includes scanning a storage device to obtain data and metadata concerning operation of a computing system, analyzing the data and, based on the analyzing, deriving data groups that include some of the data, and deriving data relationships among some of the data, receiving, by an expert system, a query from a user, and the query specifies a sample object for the expert system to investigate, but the query does not indicate purpose of the user in submitting the query, analyzing the query, based on the data groups and data relationships, and based on the analyzing of the query, generating, by the expert system, query results that comprise a set of user-selectable investigation directions that relate to the sample object, and presenting, by the expert system, the set of user-selectable investigation directions to the user.
KEY-VALUE STORE AND FILE SYSTEM INTEGRATION
Techniques are provided for key-value store and file system integration to optimize key value store operations. A key-value store is integrated within a file system of a node. A log structured merge tree of the key-value store may be populated with a key corresponding to a content hash of a value data item stored separate from the key. A random distribution search may be performed upon a sorted log of the log structured merge tree to identify the key for accessing the value data item. A starting location for the random distribution search is derived from key information, a log size of the sorted log, and/or a keyspace size of a keyspace associated with the key.
DATABASE GROUP MANAGEMENT
A system and method include receiving request to create a database group, receiving selection of a database server virtual machine on which to create the database group, receiving selection of at least one database from a list of databases that are not part of another database group to add to the database group, receiving selection of a Service Level Agreement (“SLA”) and a protection schedule, and creating the database group on the database server virtual machine, including associating the database group with the SLA and the protection schedule and adding the at least one database to the database group. Each of the at least one database is protected using the same SLA and the protection schedule that is associated with the database group.
Routing SQL statements to elastic compute nodes using workload class
Technologies are described for routing structured query language (SQL) statements to elastic compute nodes (ECNs) using workload classes within a distributed database environment. The elastic compute nodes do not store persistent database tables. For example, a SQL statement can be received for execution within the distributed database environment. A workload class can be identified that matches properties of the SQL statement. Based on the workload class, a routing location hint can be obtained that identifies a set of elastic compute nodes. The SQL statement can then be routed to one of the identified elastic compute nodes for execution. Execution of the SQL statement at the elastic compute node can involve retrieving database data from other nodes which store persistent database tables.
Tenant Identification for Cache Keys
Techniques are disclosed in which a server computer system manages a database cache for multiple different tenants. The system may compare a key having an unidentified tenant with key segments having a number of occurrences within a database cache satisfying a threshold count, where the key is included in a key-value entry of the cache storing data for multiple tenants. Key segments for keys of the database cache and corresponding occurrence counts are stored in a central database. Based on the comparing, the system determines whether the unidentified key matches one of the key segments satisfying the threshold count. In response to the system determining a match, a tenant corresponding to the unidentified key is identified based on the matching key segment. The disclosed techniques may advantageously allow for analysis of cache metrics for tenants and more efficient use of the cache (e.g., by altering cache parameters for individual tenants).
Data analysis and visualization using structured data tables and nodal networks
Disclosed methods and systems describe an analytics server that generates an inter-related nodal data structure. The analytics server receives an electronic template having a set of input fields, the electronic template identifying at least a portion of data stored within a database and its corresponding domain data table and a display attribute, the electronic template further identifying a database storing the data; retrieves the data from the database; parses the data into a set of unique domain data tables having a first criterion and a set of unique dimension tables having a second criterion; generates a nodal network comprising a set of nodes where each node represents at least a portion of the retrieved data, each node having metadata comprising a unique identifier corresponding to a unique domain table and a unique dimension table corresponding to data associated with each node; links one or more nodes based their respective metadata.
ENVIRONMENTAL HAZARD AND RISK INFORMATION SYSTEM
In a computer-implemented method for transformation of inconsistent environmental data, environmental data is received from a plurality of data sources, wherein each data source of the plurality of data sources is associated with a geographic region and maintains the environmental data using at least one data format of a plurality of disparate data formats, such that the environmental data is received in the plurality of disparate data formats. The environmental data is transformed from the plurality of disparate data formats into a consistent data format, such that the transformed environmental data is in a standardized format capable of direct comparison and analysis. The transformed environmental data is stored in a database configured to receive and perform searches on the transformed environmental data.
Empirical data gathered by ambient computer observation of a person are analyzed to identify an instance of a particular behavior and to respond to its identification
Computer systems configured to correlate instances of empirical data, gathered from ambient observation of a person, as being potentially relevant to each other vis-à-vis one particular behavior. In a behavior-identification-process, a pair of correlated instances of empirical data is analyzed to identify it as an instance of the one particular behavior. Such computer systems facilitate transmission of a digital message, the content of which may be determined in response to the instance of the one particular behavior. The content of some digital messages may include experiments performed by such computer systems on the person, to test the validity of the behavior-identification-process. The behavior-identification-process can then be updated with the observed responses of the person, and with the results of the experiments. These experiments and the updating of the behavior-identification-process might be performed by such computer systems to autonomously refine the behavior-identification-process.