31results about How to "Reduce query response time" patented technology

The invention relates to the field of information retrieval, in particular to a method for querying a keyword based on a topic cluster unit in a relational database, and aims to solve the problem of huge time overhead caused by frequent table connections in a query process for an existing keyword online query method as well as the problem of low query efficiency of an existing keyword offline query method for query on a large-scale database with a complicated internal structure and huge data volume. The method for querying the keyword based on the topic cluster unit in the relational database is implemented by the following steps of 1, constructing a topic cluster unit: (1), performing vertical grouping based on data table characteristics and query logs; (2), proposing a table connection sequence optimization scheme in a topic cluster; and (3), performing horizontal grouping based on a topic cluster tuple association graph; 2, establishing an association rule-based index optimization mechanism; and 3, returning a query result to a user. The method is applied to the field of the information retrieval.

The present application provides a data query method and apparatus. The method comprises: receiving a data query request for a target page sent by a client, wherein the data query request is carried with a first id set read from the local data source to the target page by the client and the amount of data displayed in the target page; querying a second id set of the data in the target page according to the amount; comparing the queried second id set with the first id set in the data query request; and if the comparison result is that the first id set and the second id set have the same id, not returning data with the same id when returning the query result to the client. According to the embodiments of the present application, not only reduction of the flow loss when querying data by the client is realized, but also the amount of data returned to the client is reduced since the server does not need to return the data that exists both in the client and the server, so that the data query response time is reduced.

This invention discloses an information index method in a relation-type database including the following steps: structuring a dimensionality reduction strategy tree to be set in a database system, in which, said tree includes at least a sub-node and a root node, each sub-node includes the identification information of the local node number and enquiry condition combination information and lower level sub-node number, when searching said database according to user enquiry condition but does not get the necessary data, it structures new enquiry conditions based on the strategy tree, searching the database according to a new enquiry condition till getting the necessary data or enquiring the root node of the tree to feed back information of the undesired data. This invention discloses an information index device in a relation-type database including: an enquiry condition obtaining unit, an enquiry condition output unit, a strategy tree storage unit and an operation unit.

The invention discloses a local multi-query optimization method based on predicate statutes and cost estimation and belongs to the field of big data query optimization. The method comprises the steps that firstly, an existing optimizer of a data query system is utilized to optimize queries in a query set, and the queries are shown in the form of query trees to obtain an optimized query tree set; then, the local multi-query optimization method is combined to conduct equivalent or statute processing on same or similar sub-tasks among the queries through multiple times of iteration to generate a global multi-query plan tree; finally, the statute relation between generated global multi-query plans and the sub-tasks is combined to estimate intermediate result reuse expenditure according to a price model, whether the sub-tasks are directly executed or intermediate results are reused is judged, and the global multi-query plans are optimized. The method fully considers the balance between intermediate result utilization and query concurrence, repeated operations are decreased, and the query performance is effectively improved.

The invention discloses a storage and query method and device of Feed data. The storage and query method of Feed data comprises following steps of fragmenting the Feed data of each user, wherein each fragment comprises first data, second data and third data, and chain table structures are formed among the fragments; storing each fragment in a storage system; when a user sends out a query request for the Feed data, obtaining the unique identifier of a current fragment from the query request; querying the storage system by taking the unique identifier of the current fragment as a keyword; and returning the first data and the second data in the fragment pointed by the third data to the user, wherein the third data is in the fragment in which the second data is located, and the second data is stored in the storage system and matches with the keyword successfully. According to the method and the device, on the basis of storing the fragments of the Feed content data in the system, the query times of the Feed content data is reduced, the efficient reading and writing capabilities of the system to small data blocks are improved, the response time of a server is effectively reduced, and the efficiency is improved.

The invention discloses a dynamic query system and method under a concurrent query condition. The system comprises an index file disk, a buffer, an index file retrieval device, a request dispatcher and N query responders, wherein any one of the query responders is used for carrying out first search responding on a received query request by utilizing an inversion table stored in the buffer, returning a corresponding search document set back to a corresponding user terminal if the corresponding search document set is obtained after the first search responding , carrying out second search responding on the received query request by utilizing an inversion table stored in the index file disk if the corresponding search document set is not obtained after the first search responding, and returning a search document set obtained after the second search responding to the corresponding user terminal. According to the system and method disclosed in the invention, the aim of further decreasing the query response time is realized and then the query experience of the users is improved.

The invention discloses a method for querying hierarchical node data. By using the method, MDX (multidimensional expressions) statements, BWETL (band width extract transform and load) data extracting and RFC (request for comment) remote functions are invoked integrally, the hierarchical node data are queried, hierarchical nodes are inputted, and queried nodes are inputted on a data retrieval platform. The method for querying hierarchical node data comprises the following steps of examination on authorization: verifying authorization of inputted nodes and personnel using the method; parameter transmitting: transmitting parameters to a function if verification passes and performing specific data extracting operation; executing on a node report: invoking a BWQUERY node report according to the parameters after the parameters are received by the function; invoking of the MDX statements: invoking the MDX statements if data of the inputted nodes exist, transmitting the running result of the report to an inner table of the function and maintaining the running result as a queried parameter; and returning of the result: reading data from a DSO (digital storage oscilloscope) model according to the node parameters and limiting conditions of the function, and returning the result to the data retrieval platform to obtain the hierarchical node data. By using the method, the data acquisition efficiency is improved, and data uploading is stable.

Embodiments of the invention disclose an information processing method and an electronic device. The method comprises the steps of obtaining first query data, and/or, obtaining first load information for representing a load state of a computing device; analyzing the first query data, and obtaining a first parameter for representing a complexity degree of the first query data; and selecting a first computing framework in the computing device according to a preset policy based on the first parameter and/or the first load information, and sending the first query data to the first computing framework in the computing device, wherein the computing device comprises at least two computing frameworks, and the first computing framework is any computing framework in the two computing frameworks.

The invention provides a pruning method for partitioned duplicated data of spatial big data. The pruning method can be built in a distributed spatial big data query system and does not need to carry out refinement operation on candidate results. Comprising the following steps: firstly, reading partition information pi of spatial big data to obtain a spatial minimum boundary rectangle ri covered by data of each partition, and carrying out intersection operation on ri and a spatial query rectangular window q to obtain a query range si of each partition; secondly, performing intersection operation on si and sj (i is not equal to j) to obtain an overlapped rectangular region sinsj = sij between partition query ranges si and sj, introducing a reference point, determining an attribution partition of the region sij through the reference point, and returning query ranges tri and trj after duplicate removal of pi and pj in a form of < pi, tri >; then, executing intersection operation on tr under the same partition p to obtain a final query range of p; finally, the final query range of each partition serves as a new constraint condition to prune partition data, and an obtained query result is a final result.

The invention discloses a repeated, casual and anti-link query method and system for encrypted data. The method and system are applied to an environment formed by a plurality of data uploading modules, a plurality of data request modules and a data cloud storage module. The data uploading module calculates a data security index with limited access time, uploads the data security index and encrypted data to the data cloud storage module and shares a secret key with some data request modules; the data request module generates a query token according to the access time, submits the token to the data cloud storage module, decrypts the matched data and verifies the authenticity after the data is sent back, otherwise, waits for valid data all the time; and the data cloud storage module receives the security index and the encrypted data from the data uploading module, receives the token from the data request module, searches the security index by using the token, and returns k recent query results and evidences. According to the method, data items from the cloud can be repeatedly matched in an oblivious and anti-link mode, and collusion attacks between the cloud and a data owner can be resisted.

A method for processing query effectively in a radio data broadcast environment is able to minimize a query response time by pre-declaring data items which are wanted to be accessed by a mobile client before the query is operated, and by obtaining data of the pre-declared data items in advance from a radio space regardless of data transmitting order.

The invention discloses a graph encryption shortest path query method and system supporting k unordered nodes. The graph encryption shortest path query method and system are applied to an environment formed by a user module and a cloud service module. The user module processes the original graph data to calculate a security index encrypted by the graph, generates a query token according to k disordered queried nodes, uploads the security index and the query token to the cloud service module, decrypts to obtain the shortest path after a query result is sent back, and otherwise, waits for the query result all the time; and the cloud service module receives the security index and the query token from the user module, searches the security index by using the query token and returns the shortest path passing through the k disordered nodes. According to the method, the path query privacy of the user can be protected from being damaged by the untrusted cloud service.

The invention discloses an incremental sampling algorithm for a row mode of a window function. According to the method, by utilizing random sampling and incremental sampling thoughts, data in a windowis sampled in a calculation process of each row of data; a window function value of original data is fitted by using statistical information of the sampled data; and a confidence interval is returnedto a user. The calculation process for the window function is optimized; the whole data set is prevented from being processed; the efficiency and accuracy are taken into account; and the performanceis excellent in big data application.