CN110597859A - Method and device for querying data in pages - Google Patents

Method and device for querying data in pages Download PDF

Info

Publication number
CN110597859A
CN110597859A CN201910850135.XA CN201910850135A CN110597859A CN 110597859 A CN110597859 A CN 110597859A CN 201910850135 A CN201910850135 A CN 201910850135A CN 110597859 A CN110597859 A CN 110597859A
Authority
CN
China
Prior art keywords
data
paging
database
cache
value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201910850135.XA
Other languages
Chinese (zh)
Other versions
CN110597859B (en
Inventor
韩天伟
李荣尊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tianjin Vehicle Home Data Information Technology Co Ltd
Original Assignee
Tianjin Vehicle Home Data Information Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tianjin Vehicle Home Data Information Technology Co Ltd filed Critical Tianjin Vehicle Home Data Information Technology Co Ltd
Priority to CN201910850135.XA priority Critical patent/CN110597859B/en
Publication of CN110597859A publication Critical patent/CN110597859A/en
Application granted granted Critical
Publication of CN110597859B publication Critical patent/CN110597859B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2455Query execution
    • G06F16/24552Database cache management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2455Query execution
    • G06F16/24553Query execution of query operations
    • G06F16/24561Intermediate data storage techniques for performance improvement

Abstract

The invention discloses a method for paging data, which is suitable for being executed in a distributed system, wherein the distributed system comprises a database server, a cache server and an application server, the application server is suitable for receiving a request of a client, the cache server is suitable for acquiring data from a cache, the database server is suitable for acquiring data from a database, and a paging mark key with a set as a data structure is preset in the cache. The method comprises the following steps: acquiring a request parameter when an interface is called; generating a paging flag value based on the request parameter; acquiring a binary log of a database to judge whether data in the database changes or not; writing the paging flag value into the set corresponding to the paging flag key, and receiving a return value, wherein when the data in the database changes, the set corresponding to the paging flag key is emptied so as to update the return value; and paging out the query data from the cache or database based on the return value.

Description

Method and device for querying data in pages
Technical Field
The present invention relates to the field of data processing technologies, and in particular, to a method, an apparatus, and a system for paging data.
Background
Redis is a key-value data structure storage system, and supported data structures comprise string strings, list linked lists, set sets, zset ordered sets and hash hashes. In actual business, some data are often cached in Redis, and when the data volume is large, the pressure of the database can be relieved by paging cache data. When the interface is called, the server caches each page of data by Redis according to the incoming parameters, and when the interface is called again, the data is directly returned from the cache without querying a database, so that the performance of the interface can be improved. If the interface list data changes, when the interface is called, the server ignores the cache, and directly inquires the data from the database and updates the cache. Under the condition of high concurrency of big data, when the terminal sends a paging data request to the server, whether the paging interface applies the current cache or not needs to be judged according to the actual situation.
Whether the interface applies the current cache is judged in two modes, one mode is that the same cache expiration time is set for each page, and the cache is invalid when the cache is expired, so that data is inquired from a database. In this way, when the list data changes, the added data cannot be reflected in the list in real time due to the fact that the cache is not expired. Duplication of data between different pages may occur due to different call times per page and different cache expiration time points. One way is to query the database directly, without using a cache. This approach can present a serious performance problem when the paging interface access or concurrency is large.
Therefore, a method for querying data in a page is needed, which can ensure that data between different pages is not repeated, and achieve the purpose of synchronizing data in a database and a cache in real time.
Disclosure of Invention
To this end, the present invention provides a method of paging data in an attempt to solve, or at least alleviate, at least one of the problems identified above.
According to one aspect of the present invention, a method for paging query data is provided, which is suitable for being executed in a distributed system, wherein the distributed system comprises a database server, a cache server and an application server, which are coupled to each other, the application server is suitable for receiving a paging query data request called by a client to an application program interface, the cache server is suitable for obtaining data from a cache, the database server is suitable for obtaining data from a database, and a paging flag key of a set in a data structure is preset in the cache. In the method, first, request parameters of paging query data are obtained. Then, based on the request parameters, a paging flag value is generated. And acquiring a binary log of the database to judge whether the data in the database are changed. And then, writing the paging flag value into the set corresponding to the paging flag key, and receiving a return value, wherein when the data in the database is changed, the set corresponding to the paging flag key is cleared so as to update the return value. And finally, acquiring query data from a cache or a database in a paging mode based on the return value.
Optionally, in the above method, the request parameter includes a current page number and an amount of data displayed per page.
Optionally, in the above method, the binary log is adapted to record operation information of the database, the operation information including deletion, addition or modification of data in the database.
Optionally, in the above method, when data in a database table in which query data is located changes, all elements in the set corresponding to the paging flag key are deleted.
Optionally, in the above method, when the paging flag value does not exist in the set corresponding to the paging flag key, the return value is 1; and when the paging flag value exists in the set corresponding to the paging flag key, the return value is 0.
Optionally, in the above method, if the return value is 1, obtaining query data from the database in a paging manner and updating the query data to the cache; if the return value is 0, the query data is paged from the cache.
Optionally, in the above method, the database is a MySQL database, and the cache is a Redis cache.
According to another aspect of the present invention, there is provided an apparatus for paging query data, comprising: the device comprises an acquisition module, a generation module, a judgment module, a writing module and an inquiry module. The obtaining module is suitable for obtaining request parameters of paging query data. And the generating module is suitable for generating a paging mark value based on the request parameter. The judging module is suitable for acquiring the binary log of the database so as to judge whether the data in the database are changed. And the writing module is suitable for writing the paging mark value into the set corresponding to the paging mark key and receiving a return value, wherein when the data in the database is changed, the set corresponding to the paging mark key is emptied so as to update the return value. And the query module is suitable for acquiring query data from a cache or a database in a paging mode based on the return value.
According to the scheme, a paging flag key with a data structure as a set is maintained in the cache, a unique paging flag value is generated according to parameters in each paging query request, and whether data is acquired from the cache or not is judged according to a return result of writing the paging flag value into the paging flag key, so that data among different pages can be ensured not to be repeated; when data affecting paging changes, the return value is updated in real time by clearing the set corresponding to the paging flag key, so that the aim of keeping the database and the cache data consistent can be fulfilled.
Drawings
To the accomplishment of the foregoing and related ends, certain illustrative aspects are described herein in connection with the following description and the annexed drawings, which are indicative of various ways in which the principles disclosed herein may be practiced, and all aspects and equivalents thereof are intended to be within the scope of the claimed subject matter. The above and other objects, features and advantages of the present disclosure will become more apparent from the following detailed description read in conjunction with the accompanying drawings. Throughout this disclosure, like reference numerals generally refer to like parts or elements.
FIG. 1 shows a schematic block diagram of a distributed system 100 according to an embodiment of the invention;
FIG. 2 illustrates a schematic flow chart diagram of a method 200 of paging query data in accordance with one embodiment of the present invention;
FIG. 3 illustrates a schematic flow diagram of paging query data in accordance with one embodiment of the present invention;
FIG. 4 is a schematic block diagram illustrating an apparatus 400 for paging query data in accordance with one embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
When the data volume is large, the paging query data is a common performance optimization method, generally, a client transmits page numbers and two parameters of each page to the paging query data, firstly, when an interface is called, a server caches each page of data according to the transmitted parameters, then, when the interface is called again, the data is directly returned from the cache to improve the performance of the interface, and if the interface list data changes, the server ignores the cache to query the data from the database again and updates the data in the cache.
Fig. 1 shows a schematic block diagram of a distributed system 100 according to an embodiment of the invention. As shown in fig. 1, distributed system 100 includes application server 110, database server 120, and cache server 130. Wherein the application server 110 is adapted to receive a request for paging query data called by a client to an application program interface, the database server 120 is adapted to obtain data from a database, and the cache server 130 is adapted to obtain data from a cache. According to one embodiment of the invention, the cache is a Redis distributed cache and the database is a MySQL distributed database. Redis is a memory cache database, the data model of which is key-value, and meanwhile, the storage of string, list, set, zset and hash data structures is provided. The Mysql database may implement distributed cluster deployment. In one implementation manner of the present invention, a paging flag key with a data structure as a set is preset in the Redis cache. Wherein, set is an unordered set and is realized by a hash table, so the complexity of addition, deletion and lookup is 0 (1). The elements in the set are unique, that is, there is no duplicate data in the set. An element may be added to the set corresponding to the flag key, returning 1 successfully, returning 0 if the element is already in the set, and returning an error if the set corresponding to the flag key does not exist.
FIG. 2 illustrates a schematic flow chart diagram of a method 200 of paging query data in accordance with one embodiment of the present invention. The method is suitable for execution in a distributed system 100. As shown in fig. 2, the method is suitable for step S210, and in step S210, request parameters of the paging query data are acquired.
The client obtains the data to be queried in a paging mode by calling an application program interface. The calling request of the client to the application program interface comprises a request address, a request method and request parameters, wherein the request parameters at least comprise the current page number and the data volume to be displayed on each page.
Subsequently, in step S220, a paging flag value is generated based on the request parameter.
Generally, an id increment field is forcibly added in a database table, so that data is more conveniently queried. If the data size is large, such as an order, it is generally recommended to perform the sorting and tabulating. The request parameters may include the total number of pages and the total data amount, in addition to the current page number and the data amount displayed per page. And calculating the ID range of the query data according to the current page number and the data quantity displayed on each page, and generating a unique paging mark value of paging query in a user-defined manner. For example, the current page number pc and the data amount pn displayed per page may be separated by underlining "pc _ page" to represent the page flag value, and the start data ID, the end data ID, and the current page number may be used to generate the page flag value. The request parameters are different, the paging flag values are different, and the paging flag value corresponding to each request parameter is unique.
In step S230, a binary log of the database is obtained to determine whether the data in the database is changed.
The binary log is used for recording all DDL data definition statements and statements of which DML is used for adding and deleting data in a database table in an event form, and also comprises time consumed by execution, and under the condition of data loss, data recovery can be carried out by using a binary log function. MySQL can use the MySQL in command to view the contents of the binary log after it has opened the binlog binary log. The format of the Binlog log is three: STATEMENT, ROW, MIXED are provided. Wherein the STATMENT mode is based on the replication of SQL statements, and each SQL statement that would modify data is recorded in the binlog. The ROW mode is based on line copy, does not record the context information of each SQL statement, and only needs to record which data is modified and what the data is modified. Mixed mode replication is a MIXED use of the two modes, a common replication uses STATEMENT mode to save binlog, a ROW mode is used to save binlog for STATEMENT mode operation which cannot be replicated, and MySQL selects a log saving mode according to executed SQL statements. According to one embodiment of the invention, a line mode of the binlog synchronization mechanism may be used, with the log recording the modified form of each line of data, and then modifying the same data in the cache.
Then, in step S240, the paging flag value is written into the set corresponding to the paging flag key, and a return value is received, wherein when the data in the database changes, the set corresponding to the paging flag key is cleared, so as to update the return value.
According to an embodiment of the present invention, when there is no written page tag value in the set corresponding to the page tag key, the returned value is 1. When the paging flag value already exists in the set corresponding to the paging flag key, the returned value is 0.
Since set is itself a constructor, it is used to generate the set data structure. The method of operation of the set data structure includes: add (value): add a value, return the set structure itself. delete (value): deleting a value and returning a Boolean value to indicate whether the deletion was successful. has (value): a Boolean value is returned indicating whether the value is a member of set. clear (): all members are cleared and no value is returned. For example, the following code may be used to write elements to a collection:
const s=new set();
[2,3,5,4,5,2,2].forEach(x=>s.add(x));
for(let i of s){console.log(i);}
//2354
the above code adds a member to the set structure by the add method, which indicates that the set structure does not add a duplicate value.
According to one embodiment of the invention, the command "SADD key member1[ member2 ]" may be used to add one or more members to a collection, with elements already present in the collection being ignored. The return value returns the number of elements that were newly successfully added to the collection, excluding elements already present in the collection. If the set key does not exist, a set containing only the added elements as members is created, and when the set key is not the set type, an error message is returned. For example, the element is written into the set myset using the SADD command:
Redis>SADD myset“2”
(integer)1
Redis>SADD myset“3”
(integer)1
Redis>SADD myset“3”
(integer)0
Redis>SMEMBERS myset
“2””3”
therefore, whether the elements exist in the set can be directly judged according to the return value, so that whether the query data is acquired from the cache is judged.
According to an embodiment of the present invention, after receiving the data with the added or deleted and changed in the binlog log, the data is processed according to the operation type of the data, for example, when the data in the data table where the interface query data is located has the operation with the added or deleted and changed, the paging flag key is deleted. Deleting the paging flag key means that all hash data in the set corresponding to the paging flag key are deleted, and the set is empty at this time. When the interface is called again, the return value of each generated paging flag value at the first write is 1, since the paging flag values generated by different page numbers are different. Therefore, whenever the data in the database table where the data to be queried is located changes, the set corresponding to the paging flag key is cleared, so as to update the return value in real time. Therefore, the data of different pages can be ensured to be the data at the same time point, and the data of different pages can not be repeated.
Finally, in step S250, query data is obtained from the cache or database in pages based on the return value.
According to an embodiment of the present invention, if the return value is 1, it indicates that there is no page flag value written in the page flag key this time, that is, it indicates that the data is not cached or the current cache is invalidated, the query data is obtained from the database by paging, and the query data is updated to the cache, so as to achieve the purpose of updating the cache of each page in real time. If the return value is 0, it indicates that the paging flag value already exists in the paging flag key, i.e. it indicates that the paging data is cached and valid, and directly obtains the query data from the cache in a paging manner. For example, when query data is obtained from a database, such as 10000 pieces of data in the database and 10 pieces of data in a page, only 10 pieces of data are actually returned per query, and when query data is obtained from a cache, 10 pieces of data are queried from the database in a cache.
FIG. 3 illustrates a schematic flow diagram of paging query data in accordance with one embodiment of the present invention. As shown in fig. 3, first, request parameters of paging query data are received. The request parameters include the current page number and the data amount displayed on each page. Subsequently, a paging flag value is generated based on the request parameter. The unique paging flag value may be expressed according to the current page number and the amount of data displayed per page. And then, adding a paging mark value into a paging mark key page _ flag in the cache, receiving a return result, inquiring and acquiring return data from the database and updating the return data to a redis cache when the return result is 1, and otherwise, acquiring the return data from the cache. When data affecting paging in a database, namely data in a data table where data to be queried recorded in a binlog log is located, is subjected to addition deletion or modification operation, all elements in a corresponding set of a paging flag key page _ flag in a redis cache are deleted. When the interface is called again, because the set corresponding to the paging flag key is empty, when the paging flag value is written into the paging flag key page _ flag, the return result is 1, and then the query data is directly obtained from the database. Therefore, the consistency of the data of the database and the cache can be ensured, and the data between different pages can be ensured not to be repeated.
For example, in the following application scenarios: a user issues a plurality of articles for sale promotion, and because the number of the articles is large and the articles cannot be displayed on a page, a paging query display mode is adopted. The paging interface has two parameters, one is the current page number [ pageindex ] and the other is the number of display bars per page [ pagesize ] (the back end limits the maximum 100, if it exceeds 100, the maximum 100 is taken). When a user accesses a page, the paged paging interface inputs the parameters pageindex 1 and pagesize 20, representing that the first page is taken and 20 pieces of data are returned. When the paging interface receives the two parameters, the paging interface firstly generates a paging flag key value of 1_20 and writes the value into a paging flag key page _ flag. When the write operation return value is 1, the page data is not cached or the current cache needs to be ignored, and the program inquires and updates the page data from the database; when the return value is 0, the page data is cached, and the program directly inquires the data from the cache. If the user releases a promotion article, the binlog log is received and analyzed to obtain that article table data is newly added, and simultaneously, the program deletes SET structure data stored in the page mark key, so that the effect that all current page caches are invalid is achieved.
FIG. 4 is a block diagram of an apparatus 400 for paging query data according to an embodiment of the present invention. As shown in fig. 4, the apparatus 400 includes an obtaining module 410, a generating module 420, a determining module 430, a writing module 440, and a querying module 450.
The obtaining module 410 is adapted to obtain request parameters of the paging query data. The generation module 420 may generate a paging flag value based on the request parameter. The determining module 430 may obtain a binary log of the database to determine whether the data in the database has changed. The writing module 440 may write the paging flag value into the set corresponding to the paging flag key, and receive a return value, wherein when data in the database changes, the set corresponding to the paging flag key is cleared, so as to update the return value. Query module 450 may retrieve the query data from a cache or a database in pages based on the return value.
According to the scheme, a paging flag key with a set data structure is maintained in the cache, a unique paging flag value is generated according to parameters in each paging query request, whether data are acquired from the cache or not is judged according to a return result of writing the paging flag value into the paging flag key, and data among different pages can be guaranteed not to be repeated; when data affecting paging changes, the return value is updated in real time by clearing the set corresponding to the paging flag key, so that the aim of keeping the database and the cache data consistent can be fulfilled.
It should be appreciated that in the foregoing description of exemplary embodiments of the invention, various features of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that the invention as claimed requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.
Those skilled in the art will appreciate that the modules or units or components of the devices in the examples disclosed herein may be arranged in a device as described in this embodiment or alternatively may be located in one or more devices different from the devices in this example. The modules in the foregoing examples may be combined into one module or may be further divided into multiple sub-modules.
Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments described herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the following claims, any of the claimed embodiments may be used in any combination.
While the invention has been described with respect to a limited number of embodiments, those skilled in the art, having benefit of this description, will appreciate that other embodiments can be devised which do not depart from the scope of the invention as described herein. Furthermore, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter. Accordingly, many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the appended claims. The present invention has been disclosed in an illustrative rather than a restrictive sense, and the scope of the present invention is defined by the appended claims.

Claims (8)

1. A method for paging query data, adapted to be executed in a distributed system, wherein the distributed system includes a database server, a cache server and an application server, which are coupled to each other, the application server is adapted to receive a request parameter of paging query data when a client calls an application program interface, the cache server is adapted to obtain data from a cache, the database server is adapted to obtain data from a database, a paging flag key with a data structure set as a set is preset in the cache, and the method includes:
obtaining request parameters of paging query data;
generating a paging flag value based on the request parameter;
acquiring a binary log of a database to judge whether data in the database changes or not;
writing the paging flag value into the set corresponding to the paging flag key, and receiving a return value, wherein when data in a database changes, the set corresponding to the paging flag key is cleared so as to update the return value; and
and acquiring query data from a cache or a database in a paging mode based on the return value.
2. The method of claim 1, wherein the request parameters include a current page number and an amount of data displayed per page.
3. The method as claimed in claim 2, wherein the step of clearing the corresponding set of paging flag keys when the data in the database changes includes:
and when the data in the database table where the paging query data is located is changed, deleting all elements in the set corresponding to the paging mark key.
4. The method of claim 1, wherein the binary log is adapted to record operational information of the database, the operational information including deletion, addition, or modification of data in the database.
5. The method of claim 1, wherein writing the paging flag value to the set corresponding to the paging flag key and receiving a return value comprises:
when the paging flag value does not exist in the set corresponding to the paging flag key, the return value is 1;
and when the paging flag value exists in the set corresponding to the paging flag key, the return value is 0.
6. The method of claim 5, wherein the step of retrieving query data from a cache or database in pages based on the return value comprises:
if the return value is 1, acquiring query data from the database in a paging mode and updating the query data to a cache;
if the return value is 0, the query data is paged from the cache.
7. The method of claim 1, wherein the database is a MySQL database and the cache is a Redis cache.
8. An apparatus for paging query data, comprising:
the acquisition module is suitable for acquiring request parameters of paging query data;
a generation module adapted to generate a paging flag value based on the request parameter;
the judging module is suitable for acquiring a binary log of a database so as to judge whether data in the database are changed or not;
a writing module, adapted to write the paging flag value into the set corresponding to the paging flag key, and receive a return value, wherein when data in the database changes, the set corresponding to the paging flag key is cleared, so as to update the return value; and
and the query module is suitable for acquiring query data from a cache or a database in a paging mode based on the return value.
CN201910850135.XA 2019-09-06 2019-09-06 Method and device for querying data in pages Active CN110597859B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910850135.XA CN110597859B (en) 2019-09-06 2019-09-06 Method and device for querying data in pages

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910850135.XA CN110597859B (en) 2019-09-06 2019-09-06 Method and device for querying data in pages

Publications (2)

Publication Number Publication Date
CN110597859A true CN110597859A (en) 2019-12-20
CN110597859B CN110597859B (en) 2022-03-29

Family

ID=68858369

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910850135.XA Active CN110597859B (en) 2019-09-06 2019-09-06 Method and device for querying data in pages

Country Status (1)

Country Link
CN (1) CN110597859B (en)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111240650A (en) * 2020-01-22 2020-06-05 上海钧正网络科技有限公司 Data paging method and device and mobile terminal
CN111367952A (en) * 2020-03-02 2020-07-03 中国邮政储蓄银行股份有限公司 Paging query method and system for cache data and computer readable storage medium
CN111400347A (en) * 2020-03-20 2020-07-10 北京思特奇信息技术股份有限公司 Paging query method, system and electronic equipment
CN111858581A (en) * 2020-06-08 2020-10-30 远光软件股份有限公司 Page query method and device, storage medium and electronic equipment
CN112347396A (en) * 2020-10-22 2021-02-09 杭州安恒信息技术股份有限公司 Webpage table display method, system and device based on IndexDB database
CN112437160A (en) * 2020-11-25 2021-03-02 中国电子科技集团公司第二十九研究所 Method and system for realizing real-time transmission processing of large file based on redis
CN112699147A (en) * 2020-12-31 2021-04-23 京东数字科技控股股份有限公司 Paging query method, device, equipment and storage medium
CN113641711A (en) * 2021-08-17 2021-11-12 天津卓盛云科技有限公司 Data caching processing method, device and medium for SAAS tenant
CN114363361A (en) * 2022-03-17 2022-04-15 武汉中科通达高新技术股份有限公司 Data synchronization method and device, electronic equipment and storage medium
WO2023093607A1 (en) * 2021-11-23 2023-06-01 天翼数字生活科技有限公司 Offline data fuzzy search method and apparatus, device and medium

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090201842A1 (en) * 2006-10-20 2009-08-13 Huawei Technologies Co., Ltd. Method, device and system for paging terminal device across heterogeneous networks
CN102880685A (en) * 2012-09-13 2013-01-16 北京航空航天大学 Method for interval and paging query of time-intensive B/S (Browser/Server) with large data size
US20130263269A1 (en) * 2012-03-29 2013-10-03 F-Secure Corporation Controlling Anti-Virus Software Updates
CN103425708A (en) * 2012-05-25 2013-12-04 金蝶软件(中国)有限公司 Optimized web paging query method and device
CN103853727A (en) * 2012-11-29 2014-06-11 深圳中兴力维技术有限公司 Method and system for improving large data volume query performance
CN104573035A (en) * 2015-01-16 2015-04-29 杭州犀照科技有限公司 Caching service method and device and news information obtaining method and system
US20150127599A1 (en) * 2013-11-07 2015-05-07 Dirk Schiebeler Stateless database cache
CN105045932A (en) * 2015-09-02 2015-11-11 南京邮电大学 Data paging inquiry method based on descending order storage
CN105653611A (en) * 2015-12-24 2016-06-08 深圳市汇朗科技有限公司 Submeter paging sorting query method and device
CN106021357A (en) * 2016-05-09 2016-10-12 泰华智慧产业集团股份有限公司 Distribution-based big data paging query method and system
CN106649435A (en) * 2016-09-07 2017-05-10 努比亚技术有限公司 Data query device and method of querying data
CN108399231A (en) * 2018-02-13 2018-08-14 中体彩科技发展有限公司 A kind of collecting method and Flume data collection clients
CN108595487A (en) * 2018-03-14 2018-09-28 摇了购(武汉)电子商务有限公司 The method and system of data are accessed under a kind of big data high concurrent

Patent Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090201842A1 (en) * 2006-10-20 2009-08-13 Huawei Technologies Co., Ltd. Method, device and system for paging terminal device across heterogeneous networks
US20130263269A1 (en) * 2012-03-29 2013-10-03 F-Secure Corporation Controlling Anti-Virus Software Updates
CN103425708A (en) * 2012-05-25 2013-12-04 金蝶软件(中国)有限公司 Optimized web paging query method and device
CN102880685A (en) * 2012-09-13 2013-01-16 北京航空航天大学 Method for interval and paging query of time-intensive B/S (Browser/Server) with large data size
CN103853727A (en) * 2012-11-29 2014-06-11 深圳中兴力维技术有限公司 Method and system for improving large data volume query performance
US20150127599A1 (en) * 2013-11-07 2015-05-07 Dirk Schiebeler Stateless database cache
CN104573035A (en) * 2015-01-16 2015-04-29 杭州犀照科技有限公司 Caching service method and device and news information obtaining method and system
CN105045932A (en) * 2015-09-02 2015-11-11 南京邮电大学 Data paging inquiry method based on descending order storage
CN105653611A (en) * 2015-12-24 2016-06-08 深圳市汇朗科技有限公司 Submeter paging sorting query method and device
CN106021357A (en) * 2016-05-09 2016-10-12 泰华智慧产业集团股份有限公司 Distribution-based big data paging query method and system
CN106649435A (en) * 2016-09-07 2017-05-10 努比亚技术有限公司 Data query device and method of querying data
CN108399231A (en) * 2018-02-13 2018-08-14 中体彩科技发展有限公司 A kind of collecting method and Flume data collection clients
CN108595487A (en) * 2018-03-14 2018-09-28 摇了购(武汉)电子商务有限公司 The method and system of data are accessed under a kind of big data high concurrent

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
XIONGPAI QIN 等: "DB Facade: A Web Cache with Improved Data Freshness", 《2009 SECOND INTERNATIONAL SYMPOSIUM ON ELECTRONIC COMMERCE AND SECURITY》 *
王瑞波 等: "一种分页查询优化方法的研究与实现", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111240650A (en) * 2020-01-22 2020-06-05 上海钧正网络科技有限公司 Data paging method and device and mobile terminal
CN111240650B (en) * 2020-01-22 2023-06-30 上海钧正网络科技有限公司 Data paging method and device and mobile terminal
CN111367952A (en) * 2020-03-02 2020-07-03 中国邮政储蓄银行股份有限公司 Paging query method and system for cache data and computer readable storage medium
CN111367952B (en) * 2020-03-02 2023-08-25 中国邮政储蓄银行股份有限公司 Paging query method, system and computer readable storage medium for cache data
CN111400347A (en) * 2020-03-20 2020-07-10 北京思特奇信息技术股份有限公司 Paging query method, system and electronic equipment
CN111858581A (en) * 2020-06-08 2020-10-30 远光软件股份有限公司 Page query method and device, storage medium and electronic equipment
CN112347396A (en) * 2020-10-22 2021-02-09 杭州安恒信息技术股份有限公司 Webpage table display method, system and device based on IndexDB database
CN112437160B (en) * 2020-11-25 2022-06-07 中国电子科技集团公司第二十九研究所 Method and system for realizing real-time transmission processing of large file based on redis
CN112437160A (en) * 2020-11-25 2021-03-02 中国电子科技集团公司第二十九研究所 Method and system for realizing real-time transmission processing of large file based on redis
CN112699147A (en) * 2020-12-31 2021-04-23 京东数字科技控股股份有限公司 Paging query method, device, equipment and storage medium
CN113641711A (en) * 2021-08-17 2021-11-12 天津卓盛云科技有限公司 Data caching processing method, device and medium for SAAS tenant
WO2023093607A1 (en) * 2021-11-23 2023-06-01 天翼数字生活科技有限公司 Offline data fuzzy search method and apparatus, device and medium
CN114363361A (en) * 2022-03-17 2022-04-15 武汉中科通达高新技术股份有限公司 Data synchronization method and device, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN110597859B (en) 2022-03-29

Similar Documents

Publication Publication Date Title
CN110597859B (en) Method and device for querying data in pages
CN105630865B (en) N-bit compressed versioned column data array for memory columnar storage
US8918436B2 (en) Hybrid database table stored as both row and column store
US20140304219A1 (en) Hybrid Database Table Stored as Both Row and Column Store
US10838622B2 (en) Method and apparatus for improving storage performance of container
AU2017243870B2 (en) "Methods and systems for database optimisation"
CN107025243A (en) A kind of querying method of resource data, inquiring client terminal and inquiry system
EP2336901B1 (en) Online access to database snapshots
US11567681B2 (en) Method and system for synchronizing requests related to key-value storage having different portions
CN106155934B (en) Caching method based on repeated data under a kind of cloud environment
WO2022062184A1 (en) High-concurrency query method, intelligent terminal and storage medium
CN112637305A (en) Data storage and query method, device, equipment and medium based on cache
US11748357B2 (en) Method and system for searching a key-value storage
CN106161193B (en) Mail processing method, device and system
CN111752804A (en) Database cache system based on database log scanning
CN108280123B (en) HBase column polymerization method
CN116975159B (en) Incremental data synchronization processing method
CN111797119B (en) Caching device, system and caching method
CN102004800A (en) Data query method and device of PDM (Product Data Management) system
CN113626382B (en) Index method, system and related device for aggregation object in distributed file system
CN114153378A (en) Database memory management system and method
EP3436988B1 (en) "methods and systems for database optimisation"
CN110658999A (en) Information updating method, device, equipment and computer readable storage medium
CN108021562B (en) Disk storage method and device applied to distributed file system and distributed file system
CN114063935B (en) Method and device for processing data

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant