93 results about "Query Rewriting" patented technology

Techniques are provided for XML data storage and query rewrites in relational databases. According to certain embodiments of the invention, a mechanism is provided to allow the user to store an XML document in a relational database and to submit mapping information that indicates a mapping of each field of the XML document to the column in the relational database in which the data from each field is stored. If the user submits an XML query to access the data in the XML document that is stored in the relational database, then a mechanism is provided to generate a database query based on the XML query and the mapping information.

Systems, methods, and computer media for identifying query rewriting replacement terms are provided. A list of related string pairs each comprising a first string and second string is received. The first string of each related string pair is a user search query extracted from user click log data. For one or more of the related string pairs, the string pair is provided as inputs to a statistical machine translation model. The model identifies one or more pairs of corresponding terms, each pair of corresponding terms including a first term from the first string and a second term from the second string. The model also calculates a probability of relatedness for each of the one or more pairs of corresponding terms. Term pairs whose calculated probability of relatedness exceeds a threshold are characterized as query term replacements and incorporated, along with the probability of relatedness, into a query rewriting candidate database.

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).

An improved system and method for identifying context-dependent term importance of queries is provided. A query term importance model is learned using supervised learning of context-dependent term importance for queries and is then applied for advertisement prediction using term importance weights of query terms as query features. For instance, a query term importance model for query rewriting may predict rewritten queries that match a query with term importance weights assigned as query features. Or a query term importance model for advertisement prediction may predict relevant advertisements for a query with term importance weights assigned as query features. In an embodiment, a sponsored advertisement selection engine selects sponsored advertisements scored by a query term importance engine that applies a query term importance model using term importance weights as query features and inverse document frequency weights as advertisement features to assign a relevance score.

An improved system and method for identifying context-dependent term importance of queries is provided. A query term importance model is learned using supervised learning of context-dependent term importance for queries and is then applied for advertisement prediction using term importance weights of query terms as query features. For instance, a query term importance model for query rewriting may predict rewritten queries that match a query with term importance weights assigned as query features. Or a query term importance model for advertisement prediction may predict relevant advertisements for a query with term importance weights assigned as query features. In an embodiment, a sponsored advertisement selection engine selects sponsored advertisements scored by a query term importance engine that applies a query term importance model using term importance weights as query features and inverse document frequency weights as advertisement features to assign a relevance score.

A system and method for data integration by querying multiple extensible markup language (XML) source schemas through a common XML target schema, wherein the system comprises XML mapping connections between the XML source schemas and the XML target schema, wherein the XML mapping connections accommodate XML mappings, the XML source schemas comprise data, and the XML target schema comprise a set of constraints, which comprise data merging rules for integrating the data from multiple source schemas comprising overlapping information; a target query associated with the target schema; and a query rewriter adapted to reformulate the target query in terms of the source schemas based on the mappings, and to integrate the data based on the set of constraints. The query rewriter is adapted to rewrite the target query into a set of source queries comprising the source schemas. A processor evaluates a union of the set of source queries.

The invention relates to a method for realizing optimization of a data source extensive makeup language (XML) query system based on sub-queries. The method comprises the following steps: receiving corresponding XML query input information; carrying out morphological analysis and syntactic analysis, and verifying the correctness and the validity; if the analysis is successful and the verification is passed, generating an XML analytical syntactic tree; translating the XML analytical syntactic tree, and converting the XML query input information into intermediate logical representation; carrying out rewriting treatment, and generating a target query expression; and calling supported querying and computing engines for querying and computing, and acquiring output query results. By adopting the method for realizing the optimization of the data source XML query system based on the sub-queries, the query rewriting can be used for converting a procedural query into a descriptive query, the sub-queries are optimized, and certain specific sub-queries are rewritten into equivalent attended operation of a plurality of tables by the combination of the sub-queries, thus the levels of query sentences are reduced as much as possible, the treatment of planning optimization can be carried out conveniently, and the method has stable and reliable working performance and wider application range.

Systems and methods for rewriting queries based on data features are disclosed. A data source contains a history of queries and results associated with the queries. A source query is received and a subset of the data source is extracted that is related to the query. Costs are then associated with the associations of the queries and results, and an absorbed cost is determined for each query. The queries having the lowest absorbed cost are recommended for rewrites.

The invention provides a query rewriting method and apparatus. The method can comprise the steps of receiving a search keyword input by a user; selecting an extended word corresponding to the search keyword, wherein the similarity between semantic vectors corresponding to the extended word and the search keyword in a semantic vector space of a preset dimension reaches preset similarity; and rewriting the search keyword to the selected extended word. Through the technical scheme, query rewriting can be realized in combination with semanteme, so that the pushed word coverage rate and the rewriting accuracy can be improved.

Methods and systems for efficient query rewriting and the like are described here. One such described method comprises: offline mapping frequently-seen search queries to rewritten queries that may be better for searching; offline caching the mapping in a cache memory; and upon receiving a search query from a user similar to one of the mapped search queries, obtaining a corresponding rewritten query from the mapping in the cache memory based on predetermined conditions, and issuing a search of the rewritten query to the backend data system in order to avoid having to issue a search query to the backend data system twice while the user is online.

Various aspects of this disclosure are directed to receiving, by a computing device, a first table join query that may include a first group of table identifiers that identify the two or more tables. The computing device may determine whether the first table join query includes an outer join command. When the first table join query includes the outer join command, the computing device may compare the first group of table identifiers and a second group of table identifiers of one or more pre-joined tables to determine whether each of the first table identifiers matches at least one of the second group of table identifiers. The computing device may further determine whether a predicate associated with each table identifier matches a predicate associated with a matching second table identifier. When each of the predicates match, the computing device may rewrite the first table join query.

Systems and methods for rewriting query terms are disclosed. The system collects queries and query session data and separates the queries into sequences of queries having common sessions. The sequences of queries are then input into a deep learning network to build a multidimensional word vector in which related terms are nearer one another than unrelated terms. An input query is then received and the system matches the input query in the multidimensional word vector and rewrites the query using the nearest neighbors to the term of the input query.

An XML querying method and system for constructing an XQuery/XPath query to a schema variable XML document. The method includes: receiving the query from a client computer; generating a tree structure; and generating, by query rewriting, an XQuery/XPath for the XML document based on the tree structure and configurable query constraints. The system includes: a tree structure generating unit for generating a tree structure; and a query writing unit for generating an XQuery/XPath query for the XML document based on the tree structure and configurable query constraints.

Query rewrite techniques are provided for rewriting an aggregate query with multiple groupings using multiple summary tables. The rewrite is accomplished by expanding the aggregate query into an equivalent UNION ALL query with multiple subqueries, each containing a single grouping. One or more of the subqueries is then rewritten to reference a summary table. Thus, a grouping of an aggregate query is derived by executing a subquery that either scans the summary table for the grouping, like in the exact-match mode, or by performing a roll-up operation, like in the roll-up mode. In addition, if the grouping of some of the subqueries cannot be derived from a summary table, subqueries are combined into another subquery that computes groupings from the base tables of the aggregate query.

The invention provides a system and method for translating XPATH queries into SQL queries with a simple least fixpoint (LFP) operator, which is already supported by most commercial RDBMS. The method comprises the steps of (a) rewriting an input query into a regular query, which is capable of capturing both DTD recursion and XPATH queries in a uniform framework; and (b) translating the regular query to an SQL query with LFP. The invention further provides optimization techniques for reducing the use of the LFP operator. As a result, the invention is capable of answering a large class of XPATH queries by means of only low-end RDBMS features already available in most RDBMS.

The invention discloses an outsourced data encrypted storage and cryptograph query system and an application method therefor. The system comprises an application server system, an index agent system, and a cloud storage server system. The application server system carries out the encryption and decryption of a local database. The index agent system comprises an index encryption module, a query rewrite encryption module, and an onion secret key management module. The index encryption module carries out the onion encryption of an index, and the query rewrite encryption module carries out the encryption of a query sentence. The onion secret key management module stores the secret key of each onion encryption layer. The system can enable a user to carry out high-efficiency and quick search of a cryptograph index, also can a server or an attacker to be unable to obtain the query result of index information, and guarantees the safety of a database and an index file.

The invention discloses an XML approximate query method based on the various XML documents. The XML various processing modules adopt a mapping rule automatic generation algorithm based on a PTO model, and rewrite the primitive query raised by the users under global query mode into different rewritten query tree under different DTD. The XML documents approximate query method under a single DTD adopts a basic mutation operation to do querying variability for the rewritten query tree. The obtained query closure combing with a plurality of times of precise embedding realizes the approximate query of the XML document set. A querying cost evaluation module adopts a data distribution statistics method based on an XML sample, and computes the query cost of each query result. The invention aiming at the various XML documents not only can retract the precise query result, but also can retract an approximating result sequence with a similarity scoring in time.

A computer implemented system and method that combines data from multiple sources to provide a unified view of data using multi-layered conceptual modeling framework. The invention provides means to model conceptual data models at multiple levels of abstraction and a means to map them with each other and with physical models. A query rewriting approach adopted in the present invention is capable of translating queries down multiple levels of conceptual models into physical models and Conceptual modeling framework provide a means to capture and process semantic intent of data more accurately thereby reducing data integration errors significantly.

Embodiments of the invention relate to automatically suggesting query-rewrite rules. One embodiment includes providing a missing search result for a query. A collection of semantically coherent rewrite rules are generated based on the missing search result. Generating the missing search result includes: selecting candidates including subsequences of the query and subsequences of particular fields of a document, invoking a search engine using the candidates for providing search results, filtering out particular candidates that fail to achieve a desired search result, and classifying remaining candidates based on a learned classifier. Query rewrite rules for document searching are suggested based on the classified remaining candidates.