126 results about "Query tree" patented technology

A method and system for evaluating a path query are disclosed. The path query corresponds to a query tree including a plurality of query nodes. At least one query node corresponds to at least one predicate and is at a level. The predicate(s) are evaluated for previous query node(s). The method and system include scanning data nodes of a document and determining if the data nodes match the query nodes. The method and system also include placing data related to the data node in match stacks corresponding to matched query nodes. The data for the query node(s) include attribute(s) corresponding to the predicate(s). The method and system further include propagating a matching of the at least one query node backward to a matching of the at least one previous query node.

Filtering trees for selectively notifying subscribers of events are provided, and are constructed with OR nodes to substantially reduce their size. The filtering trees have nodes representing event variables that ultimately branch to leaf nodes thereunder, and the leaf nodes identify which of a set of queries are satisfied by an actual event. A mechanism recursively merges nodes of trees into a single tree, and uses OR nodes when nodes cannot be combined, to essentially add a parallel path in the resulting tree to traverse. Nodes that can be combined are those that represent the same event variable, and may have data points that are merged into a combined node. Threshold gains in efficiency may be evaluated to determine whether the original trees should be kept instead of the resulting tree.

Methods, systems, and apparatuses for improving performance of parallel database query plans are described. An exchange operator is positioned in a query tree. A child operator of the exchange operator is parallelized into a plurality of parallel child operators, each of the parallel child operators coupled to the exchange operator in a respective branch of a plurality of parallel branches of the query tree. An output of each of the plurality of parallel child operators may be buffered at the exchange operator. Furthermore, child operators of the plurality of parallel child operators may also be parallelized. Query plans of any form and containing any number of operators may be parallelized in this manner. Any number of parallel branches may be used, independent of the number of operators in the original plan. The parallelized query plans achieve effective load balancing across all branches.

When queries written in SQL are converted into query trees by the query optimizer (S1102). The query processor finds tasks to be processed directly from the query trees (S1104), and if the next tasks performing operation on processing results of the tasks that can be processed directly are project operation, the query processor retrieves both the tasks that can be processed directly and the tasks of the project operation, and combines these tasks to create tasks that combined relational operations (S1106). The query processor checks whether there is any group in the group queue collecting tasks that access the same relation (S1108). If a group is found, the query processor adds these tasks into the group (S1112). Otherwise, the query processor creates a new group for these tasks, adds these tasks into the group, and insert the group into the group queue. The query processor further collects the tasks having common sub-expression into sub-groups (S1116). The query processor creates a task of a synthetic relational operation or a task that combined synthetic relational operation for each sub-group in the group (S1118), The multi-operation processor performs processing the task of the synthetic relational operation, the task that combined synthetic relational operations, and other tasks not collected into a sub-group in the group simultaneously by using multi-operation processing (S1120). A virtual relation is created for each task in the sub-group to share the processing result of the task of the synthetic relational operation, or the processing result of the task that combined synthetic relational operations.

The invention relates to a method for carrying out fast vehicle comparison and vehicle type recognition at a tollgate. The method comprises the steps that firstly, a standard snapshot vehicle image is collected through a high-definition tollgate vidicon, the foreground vehicle detection is carried out on the image, and a vehicle area is extracted; the vehicle area is preprocessed, feature points are detected, a sift feature descriptor is calculated, a query tree carries out the inquiry, the rough vehicle type matching is achieved, a vehicle type data image set is obtained, accurate matching is carried out on standby vehicle type images through the sift feature descriptor again, geometric verification is carried out through geometric information, and a final vehicle type comparison result is obtained through rearrangement and is output. According to the method, the multi-scale sift feature serves as the descriptor of the image, the sift feature is the local feature of the image, invariance of image rotating, dimension zooming and luminance changing is kept, and certain stability of vision angle changing, radiation converting and noise is kept.

Various embodiments of a computer-implemented method, computer program product, and data processing system are provided that generate an index plan that produces a superset of data comprising the query result. In some embodiments, a computer-implemented method, computer program product, and data processing system produce a maximal-index-satisfiable query tree.

The invention discloses an IP address ownership information indexing and fast querying method. The method includes the first step that an ownership information configuration file is selected or built; the second step that CIDR block records in the configuration file are read and each record is built as a new node of a query tree; if a block belongs to an IPV4 address block or an IPV6 address block, and a head node corresponding to a query sub-tree of the IPV4 or a query sub-tree of the IPV6 is empty, then the new node is used as the head node, or the corresponding head nodes are selected to carry out transversal on the query sub-tree until conditions are met (the transversal is carried out to reach leaf nodes, or comparing bits of current nodes are larger than the new node and comprises CIDR block information), and joint network prefix length L of the current nodes and the new node is calculated, if the L is larger than the comparing bits of the current nodes, the L will return to father nodes and the father nodes are set as the current nodes; the insertion position of the new node is determined according to the L value and the current nodes and the ownership information of the L value is associated to the new node. The IP address ownership information indexing and fast querying method has higher querying efficiency.

The invention relates to a knowledge base-based fast construction method of a common correlation information query tree. The knowledge base-based fast construction method comprises the following steps of: (1) constructing a correlation information logic tree structure of a business main body by taking the business main body as a root node according to business relations among various data in target data; (2) recording datasheets to which a father node and child nodes point, as well as correlation fields among the datasheets according to the correlation information logic tree structure; (3) constructing a knowledge base of the correlation information tree structure according to information of the correlation fields among the datasheets of the tree-like structure; (4) constructing a correlation information query function according to the knowledge base of the correlation information tree structure, and realizing the common correlation information query with a loose coupling degree in a recursive manner; and (5) reconstructing the correlation information of the business main body according to the correlation information logic tree structure. The method is suitable for all one-to-one table correlation business requirements; and by adopting the method, the construction efficiency of a complex business information extraction function can be greatly improved, and the fast adaptation to the adjustment of the business requirements can be realized.

The invention discloses a multi-hop visual problem reasoning model and a reasoning method thereof, and the model comprises a multi-hop visual problem reasoning data set establishment unit which is used for fusing a scene graph and a knowledge base into a knowledge graph, and constructing a data set containing multi-hop knowledge reasoning question and answer pairs by using the knowledge graph; a convolutional neural network used for extracting image features of the input image; a long-short-term memory network used for extracting problem characteristics; and a knowledge routing modular networkused for analyzing the questions into query trees, the query trees being symbolic expressions of reasoning processes of the questions, extracting correct relationships or entities from the knowledgegraph by combining the query trees and the knowledge base, and carrying out multi-hop reasoning to give a final answer.

The invention provides a caching system for realizing network inquiry, which comprises an inquiry binder, an inquiry resolver, an inquiry descriptor manager, an inquiry scheduler and an inquiry buffer. The query binder is used for binding virtual view meta-information relating to the examples of inquiry requests to a system memory and setting in sequence time marks of write operation of virtual views from a lower layer to an upper layer; the inquiry resolver is used for resolving the virtual views into a querying tree according to the validity of the examples of the inquiry requests; the inquiry descriptor manager is used for storing a queue of the examples of the inquiry requests imposed on the virtue views, determining examples of the inquiry requests to enter and exit the queue, and judging the validity of the examples of the inquiry requests; the inquiry scheduler is used for dispatching the inquiry nodes of the querying tree so as to execute inquiry; the inquiry buffer is used for establishing and deleting temporary tables, managing data set in the temporary tables, updating time characteristics making of examples of the inquiry requests in the inquiry descriptor and outputting inquiry result. The cache of the system of the invention is carried out based on increment, thereby improving inquiring performance and throughout rate, and providing transparent support for the implementation process of the inquiry requests.

The invention discloses a policy rule matching query tree generating method and a matching method. The generating method comprises the following steps: (A) arranging the current node position S as a node root and arranging the current character C as a first character; (B) comparing the current character C with nodes at a next level of the node S; and if a node n equal to the character C exists in the nodes at the next level of the node S, obtaining that S is equal to n; otherwise, establishing a new sub node n of the node S and setting that n is equal to C and S is equal to n; and (C) judging whether the current character C is the last character or not; if the current character C is the last character, ending up the process; otherwise, setting the current character C as the next character; and executing the step (B). According to the invention, as leaf nodes of the query tree are assigned with values by the characters and values of the leaf nodes are allowed form a set, the policy matching rule is more flexibly made, and a routing and addressing or policy matching problem based on a naming label in a novel network system architecture can be solved.

Systems and method for searching for approximate matches in a database of documents represented by a tree structure. A fast solution to the Top-k Approximate Subtree Matching Problem involves determining candidate subtrees which will be considered as possible matches to a query also represented by a tree structure. Once these candidate subtrees are found, a tree edit distance between each candidate subtree and the query tree is calculated. The results are then sorted to find those with the lowest tree edit distance.

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.

The invention provides a natural language query interface achievement method oriented to big data. Chinese natural language query is converted into an SQL or BSON transformation strategy, semantic depending trees are generated according to natural languages, then the semantic depending trees are converted into query trees according to established rules, and BSO sentences of SQL and NoBSON corresponding to the natural languages are obtained by parsing the query trees. The method supports corpus extension and improves the conversion accuracy in the given field. In addition, NoSQL conversion nodes are increased, and the application range of the method is widened.

The invention relates to a method and a system for managing an output port queue of a network processor. The method comprises the following steps: realizing mode matching on the received data message through a query tree table by an FPP micro-engine; according to the matching result, enabling the data message to enter a corresponding service processing stream; with regard to the data message entering the corresponding service stream, identifying the priority of the data message and sending the data message and a priority parameter thereof together to a TM micro-engine; and using the priority parameter of the data message and a buffer threshold value of an output logical port as an ACL rule by the TM micro-engine; according to the ACL rule, generating a judgment conclusion whether the data message is added to the output port queue; and completing the processing of forwarding or abandoning the data message in the output port queue of the TM micro-engine. The method and the system utilize the ALC rule to realize the blocking processing on the specific data message in an output port queue management part of the network processor and avoid the occurrence of congestion more effectively.

The invention relates to a subgraph matching query method, and belongs to the field of databases and distributed graph analysis processing. The subgraph matching query method comprises the following steps: firstly, revising a query graph into a query tree; secondly, from a leaf node to a root node, sequentially matching data graph nodes layer by layer according to the query tree to obtain a matching count, and sending the count to an adjacent node till a matching root node; thirdly, from the root node to the leaf node, sequentially sending a matching requirement layer by layer among the data graph nodes according to the query tree till the matching requirement is sent to the leaf node; finally, from the leaf node to the root node, sequentially sending a subtree matching result to a source of the query requirement according to the query tree by the data graph nodes. Compared with the existing distributed method, the subgraph matching query method is greatly improved in aspects of traffic and computational cost.

The invention discloses a system and a method for integrated searching of structured data and unstructured data. After original data are stored into a data base, a B+ tree index is established for the structured data, and a reverse index is established for the unstructured data; during searching, the B+ tree index is queried in case of structured searching, the reverse index is queried in case of unstructured searching, the B+ tree index and the reverse index are queried respectively in case of mixed structured and unstructured searching, query results of the indexes are merged, and finally, the original data are obtained according to the query results of the indexes. According to the method, the problem of low efficiency caused by full table scanning performed during the unstructured searching of the current data base is solved, the performance of the structured searching is guaranteed, and meanwhile, the performance of performing of the unstructured searching in the data base is greatly improved.

System, computer implemented method and computer program product for preparing and navigating a query tree including a plurality of query nodes and informational nodes. Each query node is associated with a prompt, branching criteria and keywords. A current query node provides a prompt to a user and a user response is received and analyzed to identify branching criteria and keywords from the user response. The method navigates to another node in the query tree in consideration of the branching criteria received in the user response and a comparison between the keywords received in the user response and the keywords associated with the query nodes. The comparison may validate navigation to a destination node corresponding to the branching criteria or the comparison may indicate incorrect navigation of the query tree. Corrective navigation can be implemented in various ways based upon the keywords received in the user response.

A method of creating and defining complex functions and/or expressions that may be run against an entity relationship model. An anchor entity serves as a beginning point of the expression and determines what data that will be returned by the user-created expression within the context of a query. When a relationship from any entity is traversed, including the anchor entity, the role name for the target entity is displayed hierarchically beneath the entity it was navigated from. When an entity is selected, the relationships from this entity are shown as possible navigation paths. The user may select one of these paths to navigate and add to the query tree or chose a field from the field list. Entities can be dragged and dropped into a formula area to create the expression. Functions, and mathematical and logical operations can be performed on the entities and fields in creating the expression. The fields and entities can be filtered to refine the results retrieved by the expression.