93 results about "Query Rewriting" patented technology

Staging data record changes from a faster storage medium to a slower storage medium using data query rewriting is provided. In response to receiving a data query corresponding to a particular data record, it is determined whether the data query is one of a transactional data query or an analytical data query. In response to determining that the data query is a transactional data query, the transactional data query is rewritten to apply transactional delta changes to the particular data record on a storage-class memory of a computer. In response to determining that the data query is an analytical data query, the analytical data query is rewritten to select and reconcile each data record corresponding to the particular data record stored on the storage-class memory with the particular data record stored on a persistent data storage device of the computer.

Aspects of the invention provide methods for rewriting and computing database queries that include outer join conditions, and for determining columns that satisfy a criteria. According to one aspect, a component relation key is assigned to each unique column in a first table and an aggregate relation key is generated for each record in a second table, wherein the aggregate relation key is based on one or more of the component relation keys corresponding to columns with non-null values from the second table. Distinct aggregate relation keys are determined, and an original query with an outer join is rewritten into at least a number of sub-queries equal to the number of distinct aggregate keys, wherein each sub-query includes a join condition based on each column represented by the respective distinct aggregate keys. Significantly, the combination of sub-queries is logically equivalent to the original query, but does not include outer join conditions. Therefore, a more efficient query is provided.

A method and system for optimizing SQL queries for Simple Network Management Protocol (SNMP) Management Information Base (MIB) tables. An SNMP client receives a source query defined in structured query language to access data stored in one or more MIB tables. The SNMP client parses the source query into one or more queries and sub-queries and applies sets of optimization rules and heuristics to the source query to generate a query execution plan for each set of optimization rules and heuristics applied to the source query. The SNMP client selects ah optimal query execution plan from the generated query execution plans and rewrites the source query as a SNMP-based query using the optimization rules and heuristics specified in the optimal query execution plan. The SNMP-based query may then be used to retrieve the data requested by the source query without performing a full query scan of the MIB tables.

An XML query compilation processor (20) includes an execution compiler (42) that transforms an XML query into an executable XML query plan (22). A query rewrite processor (34) performs query transformations on the XML query. Said query transformations include transforming an expression input (60) received by an expression (62) conditional upon a set of items defined by an output (64) of the expression (62) being independent of grouping of items in the expression input (60).

A method and system for cleansing anomalies from sequence-based data at query time. Sequence-based data such as RFID data is loaded into a database. One or more cleansing rules are received at a cleansing rules engine. The cleansing rule engine converts the cleansing rule(s) to a template that includes logic to compensate for anomalies in the sequence-based data. A query to retrieve the sequence-based data is received by a query rewrite engine. The query rewrite engine rewrites the query by applying the template logic. The rewritten query is executed at query time. The result of the rewritten query execution is identical to the result of executing the original query on a data set generated by applying the cleansing rule to all of the sequence-based data.

An aspect of error handling includes a parsing block for pre-processing a document indexing application, a filtering block for discarding irrelevant documents, a transformation block to clean up and annotate input data by identifying a document language, and a processor configured for grouping inputs to collect documents for a same entity in a single spot. The processor processes a query operation. An aspect of error handling also includes a data package including a data result component that includes data generated based on successful completion of at least a portion of the query operation. The data package also includes an error information data component based on one or more errors encountered during processing of the query operation. An indicator separates the error information data from the data result. The system also includes a memory associated with a distributed file system for storing a final write output relating to the query operation.

A system determines whether a received search query includes an entity name, determines whether to rewrite the received search query based on information relating to prior searches involving the entity name, and rewrites the received search query when it is determined that the received search query should be rewritten. The system further determines whether to provide a suggestion of rewriting the received search query, as a rewriting suggestion, based on information relating to prior searches involving the entity name when it is determined that the received search query should not be rewritten. The system also generates the rewriting suggestion when it is determined that the rewriting suggestion should be provided. The system performs a search based on one of the received search query and the rewritten search query to obtain search results, presents the search results, and presents the rewriting suggestion when it is determined that the rewriting suggestion should be provided.

A method and system for cleansing anomalies from sequence-based data at query time. Sequence-based data such as RFID data is loaded into a database. One or more cleansing rules are received at a cleansing rules engine. The cleansing rule engine converts the cleansing rule(s) to a template that includes logic to compensate for anomalies in the sequence-based data. A query to retrieve the sequence-based data is received by a query rewrite engine. The query rewrite engine rewrites the query by applying the template logic. The rewritten query is executed at query time. The result of the rewritten query execution is identical to the result of executing the original query on a data set generated by applying the cleansing rule to all of the sequence-based data.

A system receives a search query, determines whether the received search query includes an entity name, and determines whether the entity name is associated with a common word or phrase. When the entity name is associated with a common word or phrase, the system generates a link to a rewritten query, performs a search based on the received search query to obtain first search results, and provides the first search results and the link to the rewritten query. When the entity name is not associated with a common word or phrase, the system rewrites the received search query to include a restrict identifier associated with the entity name, generates a link to the received search query, performs a search based on the rewritten search query to obtain second search results, and provides the second search results and the link to the received search query.

The present invention is directed towards systems and methods for generating a linear regression model based on statistically frequent query pairs. The method of the present invention comprises storing statistically frequent query pairs, the query pairs constituting a query and a query rewrite. Query pair samples are generated based on the statistically frequent query pairs and an active learning algorithm is utilized to select the most informative query pairs. A linear regression algorithm is then utilized to generate a linear regression model based on the selected most informative query pairs.

The invention relates to a method of flexible data service composition based on semantic query rewriting, which includes the steps as following: 1. model and issue a data body model of a data source; 2. construct and issue a data service model of the data source; 3.a user inputs a query request and the query request is transmitted to a query rewriter; 4. the query rewriter calls the matching algorithm based on DS of a graph model, and a candidate DS collection for accomplishing the query requirement is found; 5. call a DS composition actuator on the basis of the candidate DS; 6. the DS combination actuator calls the DS composition algorithm based on the query rewriting, and a DS sequence which can accomplish the query requirement and be combined is found; 7. actuate sequentially and combine data services and obtain the data collection which the user wants to query according to the DS sequence generated finally. The invention has the advantages that: 1. the flexibility of user query requests is enhanced; 2. the description of data source is more accurate and the more fine-grained query interface is provided; 3. the efficiency of service combination is improved.