Method for interval and paging query of time-intensive B/S (Browser/Server) with large data size

A paging query, large data volume technology, applied in electrical digital data processing, special data processing applications, instruments, etc., can solve the problem that the query method cannot return query results, etc., to save memory, reduce response time, and respond quickly. Effect

Inactive Publication Date: 2013-01-16
BEIHANG UNIV
View PDF4 Cites 44 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0011] The problem to be solved by the present invention is: for the massive time series data stored in the database, in the query results, each time point corresponds to a piece of result d

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for interval and paging query of time-intensive B/S (Browser/Server) with large data size
  • Method for interval and paging query of time-intensive B/S (Browser/Server) with large data size
  • Method for interval and paging query of time-intensive B/S (Browser/Server) with large data size

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0038] The purpose of the present invention is to propose a time-intensive and large data volume inter-partition paging query method. This method performs inter-partition and paging of all the queried data, and each time a new interval is queried, only all data in the interval are obtained. Data time information, and then cache the start time and end time of each page of data on the server side. When querying each page of data, you only need to read the start time and end time of the page from the cache to limit the query range In a short time range, the query is divided into tables through query decomposition, and then spliced ​​by time point to obtain the final result, which solves the problems of excessive query response time and waste of storage space.

[0039] The present invention will be further described in detail below with reference to the drawings and embodiments.

[0040] There is an application system for test data management in the aerospace field. The main functions...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a method for interval and paging query of a time-intensive B/S (Browser/Server) with large data size. The method comprises the steps as follows: inputting an initial query condition by a user through the browser end to request one page or one interval; querying the interval for the first time, obtaining all time points of the interval at the server end, obtaining the total pages of the interval according to the number of the time points and sequentially writing start time and end time of each page into a cache file in an appending way, obtaining data of the page according to the start time and the end time of the first page, and returning the total pages of the interval and the data of the first page to a front desk; for the queried interval, only reading out the start time and the end time of the page to be queried from the cache file, querying the data of the page from a database according to the time condition and returning; and querying the database by dividing a table and combining by the time points to obtain a final result. According to the method, the result sets in each query are reduced, the response time for database query is shortened, and little memory space of a client and an application server is occupied.

Description

technical field [0001] The invention belongs to the field of computer data analysis, and in particular relates to a time-intensive and large data volume B / S inter-partition paging query method. Background technique [0002] Business data in many fields such as finance, telecommunications, and large-scale system automation testing are stored in databases. With the development of enterprise informatization, these data have the following characteristics: [0003] Large amount of data: data entries can usually reach millions or even tens of millions, and occupy storage space up to TB level; [0004] Time correlation of data: In the database, business data takes time as the primary key; logically, data has time correlation, that is, when querying and analyzing data, time is used as the retrieval condition, emphasizing the time at each time point within a period of time data situation; [0005] The time density of the data is high: the time interval between two adjacent pieces o...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30
Inventor 李倩倩吕江花田径文乔马世龙
Owner BEIHANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap