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

A data partitioning method for a distributed parallel database system, comprising creating fact tables and dimension tables according to a constructed distributed parallel database system, inserting records of the dimension tables and the fact tables into nodes according to partitioning rules, replicating the records of dimension tables into the nodes that include fact tables, performing data deletion, and performing data update.

The invention discloses a method for fast retrieval of spatio-temporal data based on MF-Octree, comprising: Step 1, establishing a time axis based on time; Step 2, when receiving newly arrived spatio-temporal data, based on the Z-order curve The newly arrived spatio-temporal data is stored in the octree; wherein the octree is sequentially located on the corresponding time period of the time axis according to the time attributes of the stored spatio-temporal data; step 3, when receiving the query request, according to the query The requested time attribute, find the root node of the octree that meets the corresponding time attribute on the time axis; step 4, calculate the association degree ranking score of each node in the octree to which the root node belongs, and rank the association degree score value Nodes that are less than the preset relevance ranking score standard value are output as query results. The invention can meet the user's real-time requirement for spatio-temporal data retrieval, reduces the query response time, and effectively improves the user experience of the retrieval system.

The invention discloses a single inadvertent link-resistant query system and method for encrypted data, which is applied in a network environment composed of multiple data upload modules, multiple data request modules and a data cloud storage module; The data upload module calculates the security index of the data, and uploads the encrypted data to the data cloud storage module and shares the key with some data upload modules; the data request module generates a query token, submits the token to the data cloud storage module, and waits for the data Decrypt the matching data after sending it back, otherwise wait for valid data; the data cloud storage module receives the security index and encrypted data from the data upload module, receives the token from the data request module, uses the token to search the security index and returns the query result, otherwise returns null value. The invention can protect the privacy of the data requesting party from infringement by untrustworthy data cloud storage parties.

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 belongs to the field of index rebuilding, and discloses an index rebuilding method of a fictitious asset preservation system. The method comprises the following steps of: (1) database log processing: analyzing a database operation log in the fictitious asset preservation system, counting the number of inquired times of each attribute value in a database, and calculating an inquiry hit rate of indexes; (2) index use condition analysis: counting the index item number and the bit item number of each attribute column, and calculating the index use rate; (3) index efficiency evaluation: setting the inquiry hit rate and the index use rate as measuring indexes, and evaluating the current index affiliation condition according to the inquiry hit rate and the index use rate; and (4) index rebuilding: according to the affiliation condition of the index efficiency evaluation in the third step, adding or deleting the indexes of the attribute columns to rebuild the indexes. The index rebuilding method provided by the invention by aiming at the fictitious asset preservation system has the advantages the space utilization rate of the rebuilt indexes is high, and the inquiry response time can be reduced.

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.

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