Patent classifications
G06F16/284
Object relational mapper for non-relational databases
This disclosure relates to increasing database functionality in non-relational databases using an object relational mapper to provide updates to table field values across a plurality of separate tables and provide virtual table functionality through compound search operations and condensed table structures.
Automatic creation of schema annotation files for converting natural language queries to structured query language
Methods, systems and computer readable media are provided for automatically creating a semantic model of a relational database for processing natural language queries. A computing device automatically extracts relational database metadata. The computing device prompts a user to enter textual labels for columns of the extracted metadata. The computing device automatically generates a schema annotation file based upon the relational database metadata and the textual labels for the columns. A natural language query is processed for the relational database using the schema annotation file.
Aggregation framework system architecture and method
A system and computer implemented method for execution of aggregation expressions on a distributed non-relational database system is provided. The method comprises the acts of determining, by a computer system, an optimization for execution of an aggregation operation, wherein the aggregation operation includes a plurality of data operations on a distributed non-relational database; modifying, by the computer system, the plurality of data operations to optimize execution; splitting the aggregation operation into a distributed aggregation operation and a merged aggregation operation; instructing each of a plurality of shard servers to perform the distributed aggregation operation; aggregating, at a merging shard server, the results of the distributed aggregation operation from each of the plurality of shard servers; and performing the merged aggregation operation on the aggregated results of the distributed aggregation operation from each of the plurality of shard servers.
Hierarchical window function
A method may include generating, based on a representation of a hierarchy stored in a database, a visiting sequence data structure. The hierarchy may be stored in a table in the database. Each of a plurality of rows comprising the table may correspond to one of a plurality of nodes comprising the hierarchy. The visiting sequence data structure may include a row vector specifying an order for traversing the plurality of nodes in the hierarchy. A hierarchical window function may be executed by iterating through the plurality of rows in the table in accordance with the order specified by the row vector. The execution of the hierarchical window function may further include determining, for a first node in the hierarchy, a summary value corresponding to a first value of the first node and a second value of a second node descendent from the first node.
Utilizing machine learning to determine data storage pruning parameters
A device receives, from a user device, a request to prune a primary database, and receives primary database information associated with the primary database and secondary database information associated with a secondary database that is different than the primary database. The device processes the primary database information and the secondary database information, with a machine learning model, to generate suggested pruning parameters, and provides the suggested pruning parameters to the user device. The device receives selected pruning parameters from the user device, where the selected pruning parameters are selected from the suggested pruning parameters or are input via the user device. The device removes pruned information from the primary database based on the selected pruning parameters, and provides the pruned information to the secondary database based on the selected pruning parameters.
Bi-gram cardinality estimation in a graph database
A method and apparatus for estimating the cardinality of graph pattern queries using graph statistics and metadata is presented. In various embodiments, node and edge labels are used to compute estimates for graph patterns (bi-grams) and the estimates for these patterns as composed to provide cardinality estimates of longer paths. The computation of bi-grams is low cost and requires only minimal changes to the existing query planner in the existing database machinery to be useful. The resulting estimates are used during query execution to minimize the amount of work needed to complete a query and return a faithful and accurate answer to the user. The apparatus includes modules containing computer-executable instructions to perform the above method.
DATA AGGREGATION IN A HIERARCHY FOR QUERY EXECUTION
Systems and methods for controlling data in a hierarchy receive a data query corresponding to data organized within nodes in a data hierarchy, wherein the data hierarchy is defined by a plurality of dimensions. A data traversal of the data hierarchy is performed including a rollup operation between different nodes at different levels of the plurality of dimensions. The rollup operation aggregates data values of the nodes at the different levels. Aggregated values for different nodes at each level are output based on the rollup operation, and the data query is executed using the aggregated values for the different nodes.
Pre-caching of relational database management system based on data retrieval patterns
A processor tracks a frequency of access requests of a first index corresponding to a first data page of a plurality of data pages stored in a database. The processor determines the first index corresponding to the first data page having a frequency of access requests that exceeds a configurable target, and the processor retains, with preference, the first data page that corresponds to the first index, within the cache memory.
System and method for using multimedia content as search queries
There is provided a method for searching a plurality of information sources using a multimedia element, the method may include receiving at least one multimedia element; generating, by a signature generator, for the at least one multimedia element at least one signature that is unidirectional, and yields compression; generating at least one textual search query using the at least one signature; wherein the generating of the textual search query comprises: (a) searching for at least one matching stored signature that matches one or more of the at least one signature; and (b) using a mapping between stored signatures and textual search queries, selecting at least one textual search query mapped to at least one matching stored signature; searching the plurality of information sources using the at least one textual search query; and causing a display of search results retrieved from the plurality of information sources.
Content metadata service for lifecycle management of digital content
Methods, systems, and computer-readable storage media for receiving, by a content transfer service of a content management system and from a source system, a first content file comprising first content and first content metadata, the first content metadata being stored in a first format, processing the first content file using a set of metadata retrieval definitions to extract file-type-specific metadata from the first content metadata and map at least a portion of the file-type-specific metadata to a first uniform content metadata file having a second format that is different from the first format, each metadata retrieval definition comprising a computer-executable, declarative procedure, and transferring, by the content transfer service, the first content file and the first uniform content metadata file to a target system, the target system consuming the content at least partially based on the first uniform content metadata file.