171 results about "Relational query" patented technology

A structured natural language query and knowledge system is provided to allow a user who lacks programming skills to enter a database query or a rule in the form of a structured natural language sentence. The scope of the sentence is preferably defined by an improved object relational query language, an object relational algebra, or both. Command and conditions that appear in natural language form are defined with corresponding formal query texts. A user is prompted to compose a structured natural language sentence using the defined commands and conditions. The user-selected command and its arguments appear as the verb phrase of a structured natural language sentence. The user-selected conditions and their parameters appear as the adjective phrases of the sentence. The sentence is parsed and changed into a translated formal query text for formal database query and rule processing.

A method of transforming relational queries of a database into on a data processing system includes receiving a series of relational queries, transforming first parts of the queries into a continuous query embodied as a streaming application, sending parameters in second parts of the queries in the series to the streaming application as a data stream, and executing the continuous query based on the received data stream to generate query results for the series of relational queries. Each query in the series includes a first part and a second part. The first parts are a pattern common to all the queries in the series and the second parts each have one or more parameters that are not common to all of the queries in the series.

A technique for monitoring an execution of a program is provided. At least one relational query is constructed and compiled into a program instrumentation. The program instrumentation is incorporated into the program and one or more query results are output from the program as the program executes.

A system and/or methodology that employs a non-relational (e.g., XML (extensible markup language)) query language to access stored procedures employed in connection with relational (e.g., SQL (structured query language)) database management systems is provided. Stored procedures in SQL enable the predetermination of queries that can be executed against the relational database. The invention bridges the gap between non-relational query languages and relational data stores. In other words, the invention enables the integration of non-relational query languages with relational data stores. The invention can define a view of the relational data in the current data model, convert data from relational to non-relational format and provide a mechanism in which a stored procedure can be referenced from the non-relational query language, using, for example, a function.

Certain example embodiments concern a computer-implemented method of processing a relational query in a database system. The relational query addresses a plurality of data objects linked by one or more relationships. For each data object addressed by the relational query, at least one result is computed in accordance with at least one index structure, with the index structure being stored in a storage device of the database system. The results computed are merged in accordance with at least one translation data structure to produce a final result of the relational query, with the translation data structure representing the one or more relationships between the data objects and being stored in a memory of the database system.

The invention discloses a grouping method of Internet protocol (IP) addresses or cell phone numbers and a query method of an attribution place. The grouping method comprises the steps of grouping of the IP addresses or the cell phone numbers first according to the attribution place, and then converting the IP addresses or the cell phone numbers in each group into integer numbers and storing the integer numbers into a digit group after the integer numbers are sequenced; and grouping of the IP addresses or the cell phone numbers to generate a digit group list according to the grouping method of the IP addresses or the cell phone numbers. The query method comprises the steps of first converting the IP addresses or the cell phone numbers which are requested to be queried into the integer numbers in a corresponding mode, and afterwards, querying the positions of the integer numbers which are matched with the IP addresses or the cell phone numbers in the digit group list through the dichotomy, and finally, returning corresponding attribution place information. By means of the grouping method of the IP addresses or the cell phone numbers and the query method of the attribution place, system consumption can be lowered, a high concurrent processing capacity is achieved, the query speed is higher than query speed of a database query and an internal memory query, and initialization time which is shorter than time of a query of a corresponding relation of internal memory distributed storage is achieved.

A system method and computer-readable media for searching an object oriented database are provided. The present invention may be employed to detect software bugs, deficiencies and/or errors in, affecting, or related to, an object database management system. The invented technique may use an SQL table join query to search for incomplete, damaged or erroneous software objects.

The invention discloses a relational query method implemented on a large-scale data set and belongs to the field of semantic webs. The method comprises the following steps: 1) calculating connective subgraphs (only containing a same type of tags) in a semantic data directed graph G; 2) merging the connective subgraphs, and dividing the directed graph G into a plurality of subgraphs; 3) calculating a strongest connective subgraph C in each subgraph subjected to merging, and calculating a bipartite graph of the strongest connective subgraph C; 4) storing the shortest path of all the subgraphs Cinto a path set RS; 5) recording the tags (containing two points of a non-redundant tag path) in each divided subgraph so as to obtain a tag set of each subgraph; and 6) judging whether paths conforming to the query conditions exist in the directed graph G by using the tag set, if so, returning path query results, otherwise, carrying out traversal among the subgraphs, determining subgraphs which can reach a target node according to the path set RS, and then, returning the path query results by using the tag set of the subgraph. The method disclosed by the invention is used for supporting the relational query of mass data, and is strong in expandability.

A tabular set provider is provided for processing a data agnostic business intelligence query with relational set operations, herein called a relational query against a multidimensional datasource. The tabular set provider comprises a query interceptor, a query decomposer, an OLAP query provider interface, and an operation module. The query interceptor is provided for detecting and intercepting a data agnostic Business intelligence query that has relational set operations that is issued against one or more multidimensional data sources. The query decomposer is provided for decomposing the operands of the set operation in the input query into one or more sub-queries. The OLAP query provider interface is provided for sending the OLAP supported sub-queries to an OLAP query provider and receiving results. The operation module is provided for using set operation functionality provided by a relational query provider that performs the set operations locally on the results of the OLAP data extraction.

A query plan for executing a query within a relational database system including at least one non-relational data source is generated by analyzing expressions that reference a non-relational data source within a query for the database system via an interface for that non-relational data source, determining for each analyzed expression at least one of the database system and interface capable of processing that analyzed expression for executing the query, providing an indicator for each of the analyzed expressions that indicates at least one of the database system and interface determined to process that analyzed expression, and generating the query plan for execution of the query, via the database system, based on the indicators for the expressions of the query.

Systems and methods are provided for generating prediction queries to help a user build and execute prediction queries. A user interface (UI) is provided that is easy to use and understand in connection with the generation of a prediction query for data mining. The UI can be instantiated from a variety of disparate sources that may request query building services. While prediction queries and relational queries are quite different, the UI enables prediction queries to be built in a manner that is similar to the way relational queries are built. In one embodiment, the main screen of the UI includes four main components: (1) a table column mapping area, (3) a selection grid area, (4) a query text display area and (5) a query result grid area. In one embodiment, the query text display area and the query result grid area are initially not presented to the user.

The invention discloses a method and a device for connecting and managing multiple APs (access points). The method comprises the following steps: connecting a plurality of APs, and acquiring network configuration information corresponding to each AP; receiving an access request of an application program, and acquiring the connection information of the application program; inquiring AP network configuration matched with the connection information according to the mapping relationship between the preset connection information and AP or the AP network configuration; and connecting the application program to the corresponding AP according to the matched AP network configuration. In the embodiment of the invention, the mapping relationship between the connection information and the AP network configuration is prestored in the system; after receiving the access request of the application program, the connection information of the application program is acquired; the matched AP network configuration is inquired according to the mapping information; and the application program is connected to the corresponding AP according to the AP network configuration, so that the connection requirement of the user terminal application program is more convenient to realize under the condition of the plurality of APs.

A tabular operation provider is provided for processing a data agnostic business intelligence query with relational operations, herein called a relational query against a multidimensional datasource. The tabular operation provider comprises a query interceptor, a query decomposer and a query replacer. The query interceptor detects and intercepts a relational query that is issued against one or more multidimensional data sources. The query decomposer decomposes expressions of the relational query into one multidimensional expression and one or more relational expressions. The query replacer replaces the relational query with a stack of operations expressed by the decomposed multidimensional expressions and/or the relational expressions.

An XML wrapper queries an XML document in an on-the-fly manner so that only parent nodes in the document that satisfy the query are extracted and then unnested. The parent nodes and associated descendent nodes are located using XPath expressions contained as options in data definition language (DDL) statements. The parent nodes satisfying the query and associated descendent nodes are extracted and stored outside of a database according to a relational schema. The wrapper facilitates applications that use convention SQL queries and views to operate on that information stored according to the relational schema. The wrapper also responds to query optimizer requests for costs associated with queries against external data sources associated with the wrapper.

The invention discloses a method, device and method for querying order relations. The method comprises the following steps: responding to an order relation query request from a query requester and searching for a preset buffer which is used for storing all or partial order relations in an order relation database; if an entry matching identification information carried by the query request is searched in the preset buffer, returning the searched entry to the query requester; or, obtaining the order relation corresponding to the identification information from the order relation database and returning the order relation to the query requester, wherein the order relation database stores all the order relations. The required order relations are provided to the query requester of the order relations by setting the buffer which stores the order relations, thus the invention solves the problem that the system performances are affected because the query is slow and the query process increases the load of the system in the related arts, and can effectively improve the query efficiency.

An object oriented query such as an enterprise java bean query is translated into a corresponding relational query by identifying an inter-hierarchal relationship relating two or more object oriented hierarchies; identifying a source object oriented hierarchy of the inter-hierarchal relationship; mapping the source object oriented hierarchy into corresponding source relational tables; building a source series of joins between the source relational tables, the source series being ordered in a top-down order from a root of the source object oriented hierarchy; identifying a target class of the inter-hierarchal relationship; mapping the target object oriented hierarchy into corresponding target relational tables; building a target series of joins between the target relational tables, the target series comprising a first target series and a second target series, the first target series corresponding to the target class, a root of the target object oriented hierarchy, and intervening nodes between the target class and the root of the target object oriented hierarchy, and the second target series corresponding to nodes in leaves of the target object oriented hierarchy located below the target class; and combining the source series of joins and the target series of joins into the corresponding relational query. For a query selection based upon a plurality of relationships between the object oriented hierarchies, the steps may be repeated for each of the plurality of relationships. The combined series of joins may be further reordered by recursively finding a join relationship between a current node and a preceding node in the combined series of joins. To improve performance, a join above a target of a relationship is built as an inner join, and a join below the target of relationship is built as an outer join.

The invention discloses a sample knowledge graph relation learning method and system based on an adversarial attention mechanism. The method comprises: obtaining relation triples in a target knowledgegraph and natural text description corresponding to the relation triples; performing representation learning on the target knowledge graph to obtain vector representation of a triple; performing linedrawing representation learning on the text corresponding to the triple to obtain word vector representation in the text; constructing a conditional adversarial generation network with a denoising attention module and a confusion attention module; and performing optimization training on the conditional adversarial generation network, and predicting a target entity corresponding to the relationship query without the relationship type ru based on the trained conditional adversarial generation network. The relationship category of traditional relationship prediction is expanded from a visible relationship to an unseen relationship category, so that the range of predicting the relationship category is enlarged. And the scale of the training data is reduced from the traditional big data scaleto the learning and prediction of the unseen relationship by only needing a small number of samples or even one sample.

The invention discloses a transformer machine account data verification system and a method thereof. The method comprises respectively acquiring station equipment machine account information and power station equipment machine account nonstandard information for transmitting to a server; encoding the station equipment machine account information and the station equipment machine account nonstandard information by use of a character string form; carrying out one-to-one character matching on transformer information in the encoded station equipment machine account nonstandard information and transformer information in the encoded station equipment machine account standard information; on the basis that the transformer information matches each other, according to preset ownership relations between transformer stations and transformers, querying and obtaining a transformer machine account list of a corresponding transformer; comparing the transformer attributes of the obtained transformer machine account list to obtain transformer machine account information with different matching degree values; classifying the transformers with the same matching degree value into the same kind of transformers; and storing machine account information of the same kind of transformers in the form of a machine account corresponding table, and ending transformer machine account data verification.

A method, information processing system, and computer readable storage medium manage public relations queries using semantic analysis. A public relations query expressed in natural language is received from a user. A set of relevant topics and subjects associated with the query are identified. A set of information sources are identified that comprise data associated with the set of topics and subjects based on the set of topics and subjects. A set of data from the set of information sources is identified that satisfies the query. A set of weights are assigned to the set of data that has been identified. A set of data elements within the set of data that comprises a set of weights above a given threshold are identified. A response to the query is generated using the set of data elements that has been identified.

Described are systems and methods relating to database query optimization and query cost estimation. The approach is described in the context of searching balanced and semi-balanced tree indexes such as B-trees, B+ trees, and R-B trees. The described approach may be used for both simple and composite queries, and the described approach may be used for relational queries, i.e., where a variable is less than or greater than a certain value and the database is being used to find the set of records that satisfy the relation. Further, the described approach may be used for generalized N-ary tree queries and cost estimations.

The present invention provides a database capable of integrated query processing and a data processing method thereof. The database capable of integrated query processing includes: a storage unit configured to store data including relational data, and graph data; a converter configured to convert a query language for a property graph data model for processing the graph data into a relational algebra that is a statement in an intermediate stage; and a controller configured to control the converter so as to convert the query language for the property graph data model in an input integrated query into a syntactic statement structure, and convert the query language for the property graph data model included in the query into the relational algebra, when the integrated query, in which the query language for the property graph data model and the relational query language are mixed, is input.