40 results about "Query tree" patented technology

The invention provides a data query method of a database and a related product. The method comprises the steps of obtaining a target query statement, and obtaining a sub-query statement in the target query statement; constructing an initial query tree of the sub-query statement, and judging whether an OR XML clause exists in the sub-query statement or not; if yes, aggregating non-OR XML clauses in the sub-query statements according to the OR XML clauses, and constructing a reconstructed query tree of the sub-query statements according to an aggregation result and the initial query tree; and performing data query according to the reconstructed query tree to obtain a query result of the target query statement. According to the technical scheme, the application range of the OR XML clauses can be expanded, and the purpose of improving the applicability of the OR XML clauses is achieved.

Implementations described herein relate to systems and methods to generate a response to a business intelligence question received from a user. In some implementations, a computer-implemented method may include receiving the question as a natural language string, determining one or more fragments based on the natural language string, identifying one or more query operators based on the one or more fragments, constructing a structured query tree based on the one or more query operators, executing at least a portion of the structured query tree on a data source, receiving, from the data source, an output result based on the execution, generating the response based on the output result, and providing the response to the user.

The invention provides an execution optimization method for database operation statements, a product and equipment. The method comprises the steps of determining system resource data of a target database in a current state in response to a database operation statement; obtaining a query tree corresponding to the database operation statement and decomposing the query tree to obtain a plurality of execution path nodes, wherein each execution path node corresponds to an operator type; performing cost evaluation on an operator type and an operator execution mode of each execution path node according to the system resource data, and determining a target operator corresponding to the execution path node according to a cost evaluation result; and combining the target operators corresponding to each execution path node to obtain an optimal execution plan of the database operation statement in the target database. By means of the method, the system resource data of the database can be dynamically obtained, the optimal execution plan better conforming to the current system resource use condition is generated, and therefore the execution efficiency of the database operation statement is improved.

The embodiment of the invention relates to the technical field of data processing, in particular to a verifiable cross-domain query method and device, equipment and a storage medium, and aims at achieving verifiable cross-domain query compatible with multiple query modes. The method comprises the steps that according to a query condition in a received query statement, a corresponding query tree is determined, the query tree at least comprises an Id tree, a commitment tree, a dictionary tree and a range query tree, and a root node hash value of the query tree stores a backup in a block chain; obtaining a corresponding query result according to the query tree and the query condition; and sending the query result and proof content generated in the query process to a query party, so that the query party reconstructs a tree root node hash value of the query tree according to the proof content and the query result, and compares the tree root node hash value with a tree root node hash value corresponding to the query tree stored on the block chain, and determining whether the query result is correct or not.

The invention belongs to the technical field of data query, and relates to a distributed data tracking method based on a micro-service architecture, which comprises the following steps: S1, performing task configuration based on a query demand, and constructing an associated query task crossing a plurality of micro-service systems into a query tree; s2, traversing and executing the query tree from a root node, and executing the following steps on the traversed current node: obtaining an intermediate result data set of a front node, and extracting values of predefined association key fields from the set to form an association key value list; binding the associated key value list and an external input parameter as a corresponding placeholder in a pre-configured SQL template of the current node, and generating an executable SQL statement; the result data obtained by executing the SQL statement and the intermediate result data of the front node are associated and merged to form new intermediate result data; and S3, performing output processing after traversal is completed. The problems of poor real-time performance, unstable performance and large resource consumption during database association query are solved.

The invention discloses a distributed storage method and device based on a time sequence database, and relates to the technical field of data storage. Obtaining original time sequence data and carrying out time clustering segmentation to obtain a time sequence data fragment set; performing data merging on the time sequence data fragments in the time sequence data fragment set to obtain a merged data fragment set; determining a storage position of each merged data fragment in the merged data fragment set; constructing a time query index for the data in each merged data segment; and for the data in each merged data segment, obtaining a storage address of the data, enabling the storage address to correspond to the time query index of the data, and storing the data in the storage address. According to the method, data of a time sequence is clustered and then segmented, then the segmented data is merged, storage fragmentation is reduced, finally, a storage address and a time query index are associated by constructing a query tree, efficient storage is still met in the face of mass data, and the data management efficiency is improved.

Systems and methods are provided for enhanced processing of time series data via parallelization of instructions. An example method includes receiving a query indicating time series datasets and operations to be performed on the time series datasets. Nodes associated with the query are identified, with each node associated with a time series dataset. Nodes associated with operations to be performed are generated. The nodes are assembled into query tree, with parent nodes of the query tree indicating operations that are to be applied to children nodes. Instructions for processing the query tree are generated. At least a subset of the instructions is provided to one or more compute systems for processing in parallel. Results are received, and presented in a user interface.

The invention relates to the technical field of database optimization, provides a database optimization method based on artificial intelligence, and aims to solve the problems of low efficiency, high resource consumption and insufficient privacy protection in a traditional query method. According to the method, query tree construction, semi-connection traversal, aggregation query and noise addition technologies are combined, the query efficiency is remarkably improved, the Laplace noise and confusion circuit privacy protection technologies are utilized, the security of sensitive information is protected, and the effectiveness and reliability of a query result are ensured; through accurate feature extraction and intelligent decision tree optimization, a query method is automatically selected and optimized, and high precision and low resource consumption are realized in a complex query scene with a large data volume; the method provides efficient and safe technical support for intelligent analysis and decision-making of college employment planning data, and has a wide application prospect.

The application provides a database query statement query method, a storage medium and equipment. The database query statement query method comprises the following steps: obtaining a query statement; performing syntax analysis on the query statement to obtain a syntax tree; performing semantic analysis on the syntax tree and constructing an initial query tree and a target column list; checking whether the query statement has a nested call of an aggregation function; if yes, separating the initial query tree into a parent query tree and a child query tree according to the target column list; and performing query by using the parent query tree and the child query tree. The query of the query statement with the preset form is realized by using the hierarchical query tree, so that the server can process the query statement with the simplified nested call of the aggregation function, thereby simplifying the writing process of the query statement with the nested call of the aggregation function and helping to improve the writing efficiency.

One or more embodiments of the present specification provide a multi-party secure computing system, method, device, storage medium and program product. The multi-party secure computing system comprises a data holder, a data query party and N computing participants; the data holder splits a data table held by itself into N secret sub-tables and sends them to the N computing participants respectively; the computing participants receive and store the secret sub-tables; the data query party sends a query statement to the computing participants; the computing participants determine a query tree of the query statement, an intermediate node of the query tree represents an operation operator and is provided with a safe output tuple number; the computing participants execute the query tree based on the secret sub-tables corresponding to the query tree and in cooperation with other computing participants, if there is an intermediate node whose actual output tuple number is less than the safe output tuple number of the intermediate node, a virtual tuple is added in the actual output of the intermediate node to meet the safe output tuple number, and the virtual tuple carries an invalid marked secret shard.

The invention provides an information processing method and device and electronic equipment. The method comprises the following steps: analyzing a query statement to obtain a query field and a sub-query statement of the query statement; a query tree is constructed based on the sub-query statements, and fields in the sub-query statements corresponding to father nodes in the query tree are source fields of fields in the sub-query statements corresponding to child nodes of the father nodes; traversing nodes in the query tree, and determining a first source field of the query field and a query link between the query field and the first source field; and generating operator blood relationship information of the query field based on the query link, wherein the operator blood relationship information indicates an operator processing relationship between the query field and the first source field. According to the method and the device, the precision of the determined operator blood relationship information can be improved, so that the efficiency of correcting the wrong query field through the operator blood relationship information is improved.

The application relates to the technical field of property management and discloses a data task coordination management method based on a multistage organization framework, which comprises the following steps: S1, synchronizing an organization framework through an enterprise WeChat API to generate cross-system identity mapping; an interval nesting model is constructed, and interval information of all nodes is stored by using an R tree space index; S2, receiving an index abnormal event, automatically generating a task object, and associating all contents of the event with the task object as a context snapshot; S3, acquiring all subordinate departments which are completely contained in an interval and meet a depth condition by querying the R tree to generate a permission matrix of a current user; S4, managing a task life cycle by using a finite state machine, and synchronizing to a PC terminal board in real time through a WebSocket; and S5, after the task is completed, automatically acquiring the latest index value from the board, comparing the latest index value with a snapshot, and generating an effect improvement report. According to the application, offline communication cost is reduced, task transmission time is greatly shortened, system docking cost is reduced, the whole life cycle of a task is covered, and coordination efficiency is improved.

The application relates to the technical field of database systems and data governance, in particular to a multi-source data relationship acquisition method based on a database kernel. The method comprises the following steps: in the analysis and parsing stage, table and column information of a target SQL query statement is extracted, and table-level and column-level initial dependency relationships are identified; in the rewriting stage, whether rewriting has an impact is analyzed, if yes, the initial dependency relationships are updated, and intermediate dependency relationships are obtained; in the optimization stage, a target path is determined according to initial costs, blood relationship complexity, blood relationship capture completeness and a preset blood relationship influence coefficient of each path corresponding to a query tree, and the intermediate dependency relationships are replaced or supplemented according to table-level and column-level blood relationship information extracted from the target path, so that static dependency relationships are obtained; in the execution stage, dynamic blood relationship information is captured, and the dynamic blood relationship information and the static dependency relationships are combined, so that target dependency relationships are obtained. The application can improve the accuracy and completeness of acquired data blood relationship information.

The invention discloses a statement analysis method and device, electronic equipment, a storage medium and a program product. Obtaining a to-be-analyzed vector corresponding to the to-be-analyzed statement; determining a query tree vector corresponding to the query tree; splicing the vector to be analyzed and the query tree vector to obtain a spliced vector; and inputting the splicing vector into an exception analysis model, and outputting a root cause which causes the execution time exception of the to-be-analyzed statement. According to the method, the features of the to-be-analyzed statement are captured more accurately and more comprehensively, the dimensionality of the features of the to-be-analyzed statement is enriched, statement analysis focuses on the to-be-analyzed statement, end-to-end statement analysis is achieved, the root cause causing the execution time abnormity of the to-be-analyzed statement is automatically output, and statement analysis is more efficient.

The present application discloses a method, system, and computer system for managing lineage data for data entities. The method includes generating lineage data, wherein generating the lineage data, and storing and indexing, in a data structure, the lineage data in association with the selected data entity. The generating the lineage data includes selecting a selected data entity, obtaining a query tree that was used to generate the selected data entity, and determining lineage data for the selected data entity based at least in part on the query tree.

This invention relates to the field of data processing. To address the problem of low efficiency in relational queries after database sharding and table partitioning, it provides a fast query method for tree-like relationships in massive code data. The code association table pre-stores all ancestor-descendant relationships, and the reverse linked list pre-stores the complete path, eliminating the need for recursion or multiple joins during queries. The partition key ensures that all queries are executed within a single shard, resulting in single code queries ≤20ms, tree queries ≤2 times, and query times ≤50ms for database access, improving performance by tens of times compared to traditional recursive queries.

The embodiments of the present specification provide a plan generation method and apparatus, wherein the plan generation method includes: obtaining a query statement and creating a query tree corresponding to the query statement; when the query statement is a constant query statement, replacing the constant object in the query tree with a parameter object, and performing numerical update processing on the parameter object to obtain a target parameter object; recording the target parameter object in a parameter linked list, and creating a parameterized query tree based on the parameter linked list; generating a target query plan based on the parameterized query tree, and storing the plan in a target storage location.

The application relates to an ID fuzzy query method and device, electronic equipment and a storage medium. The method comprises the following steps: establishing an ID query tree; when a target message to be queried is received, determining the first target byte length corresponding to the ID of indefinite length in the target message; determining the first byte length group to which the first target byte length belongs from a plurality of preset byte length groups and determining the first preset byte length corresponding to the first byte length group; extracting the first N bytes from the target message, wherein N is the first preset byte length; determining the hash value of the first N bytes to obtain the target hash value corresponding to the ID of indefinite length in the target message; and according to the target hash value, querying the ID query tree and the prefix subset ID corresponding to each preset hash value to obtain the fuzzy query result corresponding to the ID of indefinite length in the target message. The application improves the efficiency of the query of the ID of indefinite length.

A computer implemented method can execute a first query plan for a query, obtain statistics for internal nodes of a first query tree representing the first query plan, receive a second query tree representing a second query plan for the query, search for a matching internal node of the first query tree for a selected internal node of the second query tree, and responsive to finding the matching internal node of the first query tree, apply the statistics for the matching internal node of the first query tree to the selected internal node of the second query tree for estimating cost of the second query plan during query optimization of the query. Related systems and software for implementing the method are also disclosed.

The invention provides an information processing method and device, equipment and a medium, relates to the technical field of data processing, in particular to the technical field of retrieval systems and the like, and can be used for application scenes such as generative retrieval, document intelligent editing, intelligent assistants, virtual assistants and intelligent e-commerce. The method comprises the steps that a query tree is constructed based on a query expression, the query expression comprises a plurality of recall conditions and at least one logic operator, the query tree comprises a plurality of leaf nodes corresponding to the recall conditions respectively, and each leaf node is based on a source of a document index list corresponding to the leaf node; the data list corresponds to a hot data list and / or a cold data list; and at least one internal node corresponding to the at least one logic operator; the merging query tree is traversed to obtain a retrieval result, and the merging strategy and the temperature attribute of each internal node are determined based on the logic operator corresponding to the internal node and the temperature attribute of the child node of the internal node.

One or more embodiments of the present specification provide a multi-party secure computing system, method, device, storage medium, and program product. The multi-party security computing system comprises a data holder, a data query party and N computing participants. The data holder splits a data table held by the data holder into N secret sub-tables and sends the N secret sub-tables to the N calculation participants respectively; the calculation participant receives and stores the secret sub-table; the data query party sends a query statement to the calculation participant; the calculation participant determines a query tree of the query statement, and an intermediate node of the query tree represents an operator and is provided with the number of secure output tuples; the calculation participant cooperatively executes the query tree with other calculation participants based on a secret sub-table corresponding to the query tree, and if the number of tuples actually output by an intermediate node is smaller than the number of secure output tuples of the intermediate node, virtual tuples are added to the actual output of the intermediate node to meet the requirement for the number of secure output tuples, and the query tree is executed; the virtual tuple carries secret fragments with invalid marks.

The present invention discloses a graph index migration method and device based on DCG. DCG is a method for constructing indexes in a dynamic graph pattern matching algorithm. Index migration can migrate valid indexes in the original DCG to the DCG corresponding to the query graph and discard invalid indexes. The graph index migration method based on DCG is mainly divided into the following four parts: generation of a query tree, determination of a matching order, construction of an index, adjustment of a query tree and migration of an index. The method proposed in the present invention is mainly used in network security APT attack pattern recognition scenarios, and can be used when the initial data is small. Therefore, the method can ensure its effectiveness for a long time, ensure millisecond-level return results, and save a lot of storage space.

The application provides a database query processing method, a storage medium and a computer device, and the processing method comprises the following steps: obtaining a query statement, and performing analysis on the query statement to obtain a query tree of the query statement; performing traversal on tables involved in the query tree to obtain a pre-generated aggregation index on the tables; replacing a matching sub-tree on the query tree, which is matched with a query sub-tree, with the query sub-tree to obtain an optimized query tree; and generating an execution plan of the query statement according to the optimized query tree. When a statistical query is processed, the query sub-tree is used to perform the query according to the scheme of the application, so that the data table does not need to be scanned and complex aggregation operations are not needed, thereby greatly shortening the query execution time of the query statement and reducing the occupation of hardware resources.

Systems and methods are provided for enhanced processing of time series data via parallelization of instructions. An example method includes receiving a query indicating time series datasets and operations to be performed on the time series datasets. Nodes associated with the query are identified, with each node associated with a time series dataset. Nodes associated with operations to be performed are generated. The nodes are assembled into query tree, with parent nodes of the query tree indicating operations that are to be applied to children nodes. Instructions for processing the query tree are generated. At least a subset of the instructions is provided to one or more compute systems for processing in parallel. Results are received, and presented in a user interface.

The invention relates to the technical field of database systems and data management, in particular to a multi-source data relation obtaining method based on a database kernel. The method comprises the following steps: in an analysis and analysis stage, extracting table and column information of a target SQL query statement, and identifying a table-level and column-level initial dependency relationship; in a rewriting stage, analyzing whether rewriting is influenced or not, and if so, updating the initial dependency relationship to obtain an intermediate dependency relationship; in the optimization stage, a target path is determined according to the initial cost, the blood relationship complexity, the blood relationship capture integrity degree and a preset blood relationship influence coefficient of each path corresponding to the query tree, and the intermediate dependency relationship is replaced or supplemented according to the table-level and column-level blood relationship extracted from the target path to obtain a static dependency relationship; and in an execution stage, capturing dynamic blood relationship information, and merging the dynamic blood relationship information and the static dependency relationship to obtain a target dependency relationship. According to the invention, the accuracy and integrity of the obtained data blood relationship can be improved.

The present invention discloses a data structured processing method and system based on a structured query tree. The method comprises the following steps: constructing and optimizing a query tree structure to implement data query and processing in a large-scale data environment. The system dynamically adjusts the query path, identifies and optimizes bottleneck nodes and high-load nodes in the query path, extracts node features based on the structured information of the query tree, constructs a conditional probability model between nodes using a Bayesian inference algorithm, automatically identifies intrinsic relationships between nodes, optimizes the query tree execution path using an intelligent scheduling algorithm, analyzes the inference weight and load of each node, and optimizes the execution order of the query tree. The system supports cross-system data processing and meets the data transmission requirements of large-scale distributed systems by adjusting the query path and data processing strategy. The present invention effectively improves query efficiency, reduces system load, and optimizes query performance in large-scale data processing environments.

The invention discloses a data query method, device and equipment, a medium and a product, and belongs to the technical field of data processing. The method comprises the following steps: acquiring object description information; the object description information and preset description information are input into a pre-trained language model to obtain a first index data combination, the preset description information comprises prompt information used for extracting all preset indexes in an index set and index data of all the preset indexes, and the index set comprises all the preset indexes in the object description information; the first index data combination comprises at least one predetermined index and index data of each predetermined index in the at least one predetermined index; determining a target query tree corresponding to the first index data combination according to a predetermined query tree corresponding to the index set; and searching in a target database based on the target query tree to obtain a search result, wherein the search result comprises at least one target object matched with the first index data combination. According to the technical scheme provided by the embodiment of the invention, the data query difficulty can be reduced.

A computer implemented method can execute a first query plan for a query, obtain statistics for internal nodes of a first query tree representing the first query plan, receive a second query tree representing a second query plan for the query, search for a matching internal node of the first query tree for a selected internal node of the second query tree, and responsive to finding the matching internal node of the first query tree, apply the statistics for the matching internal node of the first query tree to the selected internal node of the second query tree for estimating cost of the second query plan during query optimization of the query. Related systems and software for implementing the method are also disclosed.

The application discloses a radio frequency identification anti-collision method based on a conflict block bit mapping strategy and relates to the technical field of radio frequency identification. The method comprises the following steps: a reader calculates an estimated number of tags based on bit states of a tag backscattering bit string; the reader calculates an optimal initial frame length based on the estimated number of tags; the reader generates a time slot polling command based on the optimal initial frame length and performs time slot polling based on the time slot polling command; when the time slot polling is performed, it is detected whether there is a conflict time slot; when it is detected that there is a conflict time slot, each tag corresponding to the conflict time slot is subjected to a traversal process based on block mapping pruning of a query tree. The application realizes a higher system throughput and a smaller normalized delay with lower power consumption, has the characteristics of good stability and strong expansibility, and is suitable for RFID application occasions with requirements on performance and power consumption.

A computer implemented method can generate a current query execution plan for a query and serialize the current query execution plan into a current query plan object. The current query plan object specifies a query tree which defines a plurality of query operators of the current query execution plan. The method can compare the current query plan object with one or more stored query plan objects contained in a plan repository. The one or more stored query plan objects were serialized from previous query execution plans generated for the query. Responsive to finding that no stored query plan object matches the current query plan object, the method can store the current query plan object in the plan repository. Related systems and software for implementing the method are also disclosed.