81 results about "Query transformation" patented technology

A system, method and article of manufacture are provided for accessing data independent of the particular manner in which the data is physically represented. In one embodiment, a plurality of data repository abstractions provide different logical views of the same underlying data repository. The plurality of data repository abstractions may each be associated with different users, thereby exposing a different set of data to each user. A runtime component performs translation of abstract queries into a form that can be used against a particular physical data representation.

A query may be applied against search engines that respectively return a set of search results relating to various items discovered in the searched data sets. However, presenting numerous and varied search results may be difficult on mobile devices with small displays and limited computational resources. Instead, search results may be associated with search domains representing various information types (e.g., contacts, public figures, places, projects, movies, music, and books) and presented by grouping search results with associated query domains, e.g., in a tabbed user interface. The query may be received through an input device associated with a particular input domain, and may be transitioned to the query domain of a particular search engine (e.g., by recognizing phonemes of a voice query using an acoustic model; matching phonemes with query terms according to a pronunciation model; and generating a recognition result according to a vocabulary of an n-gram language model.)

A method for publishing relational data as XML by translating XML queries into queries against a relational database. Conversion of the relational database into an XML database is not required. Each relational table is mapped to a virtual XML document, and XML queries are issued over these virtual documents. An XML query is parsed and transformed into a language-neutral intermediate representation, which is a sequence of operations describing how the output document is derived from the underlying relational tables. The intermediate representation is then translated into an SQL query over the underlying relational tables. The intermediate representation is also used to generate a tagger graph, which the tagger runtime ‘walks’ to generate the tagged, structured XML output. Each of the nodes of the tagger graph are operators which perform processing on the results of the SQL query. The SQL query is executed, and the SQL query results are then provided to the tagger. The tagger runtime applies the operators of each node to the inputs at that node to produce the structured XML document as a query result, guided by the structure of the tagger graph.

A dialog with a conversational virtual assistant includes a sequence of user queries and systems responses. Queries are received and interpreted by a natural language understanding system. Dialog context information gathered from user queries and system responses is stored in a layered context data structure. Incomplete queries, which do not have sufficient information to result in an actionable interpretation, become actionable with use of context data. The system recognizes the need to access context data, and retrieves from context layers information required to transform the query into an executable one. The system may then act on the query and provide an appropriate response to the user. Context data buffers forget information, perhaps selectively, with the passage of time, and after a sufficient number and type of intervening queries.

Methods, articles of manufacture and a system for providing query suggestions using a query log that includes a number of user sessions. The sessions comprise training data including a sequence of a plurality of sets of queries, some of the sets of queries including query transitions followed by a purchase related event. The query log is cleaned and normalized. From the cleaned and normalized query log stationary scores and transition scores of at least some of the plurality of sets is generated. A set of query suggestions is built and similarity scores are computed for at least some of the set of query suggestions to determine whether individual ones of the at least some of the set of query suggestions meet a predetermined assurance level. Those that meet the level are included as elements of the set of query suggestions that meet the predetermined assurance level. The set of query suggestions are mixed and ranked in accordance with a user behavior sought to be optimized.

Method and system for querying a collection of unstructured and semi-structured documents in a specified database to identify presence of, and provide context and / or content for, keywords and / or keyphrases. The documents are analyzed and assigned a node structure, including an ordered sequence of mutually exclusive node segments or strings. Each node has an associated set of at least four, five or six attributes with node information and can represent a format marker or text, with the last node in any node segment usually being a text node. A keyword (or keyphrase) query is specified, the query is converted to a statement that is recognized and respondeed to by the specified database, and the last node in each node segment is searched for a match with the keyword. When a match is found at a query node, or at a node determined with reference to a query node, the system displays the context and / or the content of the query node.

The present invention generally is directed to a system, method and article of manufacture for accessing data independent of the particular manner in which the data is physically represented. In one embodiment, a data repository abstraction layer provides a logical view of the underlying data repository that is independent of the particular manner of data representation. A query abstraction layer is also provided and is based on the data repository abstraction layer. A runtime component performs translation of an abstract query into a form that can be used against a particular physical data representation.

The invention is a method for retrieving answers to questions from an information retrieval system. The method involves automatically learning phrase features for classifying questions into different types, automatically generating candidate query transformations from a training set of question / answer pairs, and automatically evaluating the candidate transforms on information retrieval systems. At run time, questions are transformed into a set of queries, and re-ranking is performed on the documents retrieved.

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

Disclosed are methods and apparatus for efficiently and reliably handling DNS (domain name service) PTR (pointer) queries and replies across IPv4 and IPv6 networks. In general terms, an IPv4 DNS PTR query which is sent by an IPv4 device to an IPv6 DNS Server is intercepted or received, for example, by a network device configured with NAT-PT and DNS-ALG. The received IPv4 DNS PTR query is then translated into two different types of IPv6 DNS PTR queries: a query having an “IP6.INT” string and a query having an “IP6.ARPA” string. Both types of IPv6 queries are then sent to the IPv6 destination DNS Server. Whether the DNS sends an IP6.ARPA or an IP6.INT type reply or both types of replies back, a valid reply is identified (if present) and then translated before reaching the IPv4 device.

A translation scheme translates DICOM content into a format compatible for storage in an NDMA relational database. The translation scheme employs a schema for indexing the DICOM content, and employs a mechanism for translating queries embedded in XML into SQL. The translation scheme translates DICOM compatible data into a tab delimited flat representation of the DICOM content. The flat representation is then translated into data compatible with a relational database format, such as SQL, and then into database insert commands. The schema enables capture of the DICOM information into relational tables. Methods are also provided to service XML formatted research and clinical queries, to translate XML queries to optimized SQL and to return query results to XML specified destinations with record de-identification where required. Methods are also provided to interface to NDMA WallPlugs, secured query devices, or GRID devices.

An inexact query transformation system selects a query element from a query statement. If an inexact transformation improves the query performance, the system prioritizes the candidate transformation rules applicable to the selected query element. The system applies the candidate transformation rules to the selected query element to generate a transformed query element that includes a transformed remote query element. If the transformed remote query element is pushdownable, the system adds the transformed remote query element to a transformed inexact query output. Otherwise, the system applies additional candidate transformation rules to the selected query element to generate the transformed inexact query output. The system applies the transformed inexact query output to a heterogeneous datastore to provide an output query result.

A system and method is provided for XML query processing includes an execution compiler for transforming an XML query into an executable XML query plan. A query rewrite processor performs query transformation on the XML query, the query transformations including transforming an XPath within said XML Query into a pre-filter. The XML query is then transformed into a transformed XML query which includes the pre-filter.

A system, for acquiring and processing data from multiple different data sources, includes a first source, a second source, and a query processor. The first source of predetermined configuration information associates a received query for information in a first data format with a corresponding particular structured data request format and multiple different data sources. The second source of predetermined configuration information associates the particular structured data request format with multiple different data sources. The query processor uses the first and second source of predetermined configuration information for translating the received query for information in the first data format to multiple queries in different data formats for communication to the multiple different data sources.

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 system for structured query language tagging is provided. The system comprises a parsing unit for parsing a structured query language string into components, an analysis unit for analyzing the components and applying associated tags to the components, and a string generation unit for concatenating the components with associated tags into a new string.

Query processing system and method by query transformation transform a user request query based on an original DB structure, destined to a DBMS of a DB with some columns encrypted, into a query based on an encrypted DB structure so that the DBMS processes the query. The query is processed irrespective of whether or not the query includes an encryption-related item, and query-processing performance is remarkably improved.

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.

According to one embodiment of the present invention, a system processes a database query, and comprises a computer system including at least one processor. The system identifies one or more expressions within the database query utilizing a database object with value masking. Masking requirements are determined for each identified expression and the database object utilized by that identified expression is replicated to provide masked and actual versions of that database object in response to the masking requirements for that expression including masked values and actual values of that database object. The value masking of the database object is applied to the identified expressions within the database query based on the determined masking requirements to produce search results with masked values for the database query. Embodiments of the present invention further include a method and computer program product for processing a database query in substantially the same manner described above.

A method, apparatus, and article of manufacture for optimizing a query in a computer system, wherein the query is performed by the computer system to retrieve data from a database stored on the computer system. The optimization includes: (a) combining join predicates from a query with local predicates from each branch of one or more UNION ALL views referenced by the query; (b) analyzing the combined predicates; and (c) not generating the join when the analysis step indicates that the combined predicates lead to an empty result.

Disclosed is a computer-implemented method for comparing text documents. The method comprises building a database comprising first text document data associated with a plurality of first text documents. The method further comprises receiving a query. The method also comprises converting the query to second text document data. The method further comprises comparing second text document data to first text document data and computing at least one similarity measure between second text document data and first document data. Further disclosed is a computer-implemented method for processing of similarities in text documents. The method comprises harmonizing at least one incoming query. It further comprises normalizing the at least one incoming harmonized query. The method also comprises constructing at least one query vector using the at least one normalized harmonized query. The method further comprises computing at least one similarity measure between the at least one query vector and at least one further text document, wherein the at least one further text document underwent the previous steps. Also disclosed is a computer-implemented system. The system comprises at least one memory component adapted for at least storing a database comprising a plurality of first text document data associated with first text documents. The system also comprises at least one input device adapted for receiving a query. The query comprises a second text document and / or information identifying a second text document. The second text document is associated with second text document data comprised within first text document data already stored within the memory component. The system further comprises at least one processing component adapted for converting a query into second text document data and / or retrieving second text document data associated with the query from storage within the at least one memory component. The processing component is also adapted to compare second text document data to the first text document data stored within the at least one memory component. The system also comprises at least one output device adapted for returning information identifying at least one similar first text document associated with first text document data. The similar first text documents is most similar among first text documents to the query.

An inexact query transformation system selects a query element from a query statement. If an inexact transformation improves the query performance, the system prioritizes the candidate transformation rules applicable to the selected query element. The system applies the candidate transformation rules to the selected query element to generate a transformed query element that includes a transformed remote query element. If the transformed remote query element is pushdownable, the system adds the transformed remote query element to a transformed inexact query output. Otherwise, the system applies additional candidate transformation rules to the selected query element to generate the transformed inexact query output. The system applies the transformed inexact query output to a heterogeneous datastore to provide an output query result.

A method, apparatus, and article of manufacture for optimizing a query in a computer system, wherein the query is performed by the computer system to retrieve data from a database stored on the computer system. The optimization includes: (a) combining join predicates from a query with local predicates from each branch of one or more UNION ALL views referenced by the query; (b) analyzing the combined predicates; and (c) not generating the join when the analysis step indicates that the combined predicates lead to an empty result.

A system for checking data for errors, the system comprising a checking module operable to check tuples of data stored in a target database for errors, the tuples in the target database originating from the output of at least one query transformation module which applies a query transformation to tuples of data from at least one data source an identification module operable to identify a problematic tuple from a data source that produces an error in the target database, the identification module being operable to quantify the contribution of the problematic tuple in producing the error in the target database, and a description generation module operable to generate a descriptive query which represents at least one of errors identified by the checking module in the target database which are produced by the at least one query transformation module, and problematic tuples identified in a data source by the identification module.

A query transformation system for transforming nested aggregates in a query is provided. The query transformation system comprises a nested aggregate analysis module for analysing a query that is not supported by a target database system, and a nested aggregate transformation module for transforming the query into a semantically equivalent query that is supported by the target database system.

A method, system and article of manufacture for managing execution of an abstract query against an underlying database. One embodiment comprises receiving an abstract query against one or more databases having physical data and receiving a user-selection specifying how to apply an abstract filter for filtering data. The abstract query is defined using logical fields of an abstraction model that models physical data of the database(s). If the abstract filter should be applied to the abstract query, the abstract query is submitted to a runtime unit configured to (i) modify the abstract query on the basis of the abstract filter, and (ii) transform the modified abstract query into a physical query suitable for execution against the one or more databases to determine a result set. As a result of executing the physical query, the result set containing data from the one or more databases is received.

Whenever a document is going to be included into the textual database, a semantic binder is used to associate the document with one or more semantic nodes which are defined in a semantic taxonomy. When a search is performed, a search application looks through a semantic dictionary (which contains a table mapping queries to nodes on the semantic taxonomy) to see whether any corresponding semantic node can be found for the searchers query. If a match is found, the search application transforms the user's query into [“original query” OR “semantic node”] so that relevant documents, even they do not contain any user's keyword, can also be found in the database. The system binds semantic nodes arranged in a hierarchical structure of the taxonomy using a Log Analyzer which periodically looks through the system log for new queries and through textual indices for documents added to the database to generate the semantic dictionary and to bind the semantic nodes to the queries in the textual indices of the documents.

The invention discloses a deep learning model adaptation method and device, electronic equipment and a medium, and relates to the technical field of artificial intelligence, deep learning and cloud computing. According to the specific implementation scheme, the method comprises the steps: after model information of an original deep learning model and the hardware information of the target hardwareneeds to be adapted are acquired, querying the conversion path table according to the model information and the hardware information to obtain a matched target conversion path, converting the original deep learning model into an intermediate deep learning model in the conversion path according to the target conversion path, and converting the intermediate deep learning model into the target deeplearning model. Therefore, the model conversion path is determined based on the model information of the original deep learning model and the hardware information of the target hardware; the conversion of the deep learning model is carried out, the conversion of any type of original deep learning model into the target deep learning model adapted to any target hardware is achieved, and the problemthat the deep learning model is difficult to adapt to different hardware terminals is solved.

The invention relates to a semantic retrieval system and method of vague concepts. The semantic retrieval system and method of the vague concepts are characterized in that the semantic retrieval system comprises an application layer composed of a human-computer interaction interface, a service logic layer and a data layer, wherein the service logic layer is composed of a preprocessing module, a query transformation module, a body expander, a query processing module and a customization processing module, and the data layer is composed of a plurality of index information bases; a user can submits a query request to the preprocessing module through the human-computer interaction interface for preprocessing, and an original retrieval word set is generated and submitted to the query transmission module; the query transformation module conducts vague concept transformation on the received retrieval word set to generate an expanded synonymous retrieval word set and a selectable semantic relativity retrieval word set which are then submitted to the query processing module and the customization processing module respectively; the query processing module retrieves the index information bases and submits retrieval results to the customization processing module; after the customization processing module processes the retrieval results and the selectable semantic relativity retrieval word set, submits the retrieval results and the selectable semantic relativity retrieval word set are submitted to the human-computer interaction interface.

A method, apparatus, and article of manufacture for optimizing a query in a computer system, wherein the query is performed by the computer system to retrieve data from a database stored on the computer system. The optimization is performed by identifying a correlated subquery in the query that qualifies for transformation, transitively closing a local filtering predicate within the identified correlated subquery that is on a same column as a correlation join predicate within the identified correlated subquery, and pulling out or bubbling up the transitively closed predicate from the correlated subquery to a parent query block of the query.