WO2019100853A1 - Procédé d'interrogation de page, dispositif, et appareil électronique - Google Patents

Procédé d'interrogation de page, dispositif, et appareil électronique Download PDF

Info

Publication number
WO2019100853A1
WO2019100853A1 PCT/CN2018/108924 CN2018108924W WO2019100853A1 WO 2019100853 A1 WO2019100853 A1 WO 2019100853A1 CN 2018108924 W CN2018108924 W CN 2018108924W WO 2019100853 A1 WO2019100853 A1 WO 2019100853A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
creation time
query
data source
server
Prior art date
Application number
PCT/CN2018/108924
Other languages
English (en)
Chinese (zh)
Inventor
刘晨曦
Original Assignee
阿里巴巴集团控股有限公司
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 阿里巴巴集团控股有限公司 filed Critical 阿里巴巴集团控股有限公司
Publication of WO2019100853A1 publication Critical patent/WO2019100853A1/fr

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/951Indexing; Web crawling techniques

Definitions

  • the embodiments of the present disclosure relate to the field of Internet technologies, and in particular, to a paging query method and apparatus, and an electronic device.
  • the method and device for paging query and the electronic device provided by the embodiments of the present specification are used to provide a more efficient solution for finding a service consumer using the obsolete field.
  • the method includes:
  • the first request for the paging data query is initiated by the client to the server; wherein the paging data query involves at least two data sources, where the first request carries the user identifier, the number of queries, and the first of each data source. a creation time, where the first creation time is a creation time when the client last queries the data source to return the last data;
  • the server After receiving the first request initiated by the client, the server initiates a second request for data query to each data source; wherein the second request carries the user identifier, the number of queries, and the corresponding The first creation time of the data source;
  • the data source After receiving the second request initiated by the server, the data source queries data that belongs to the user identifier and meets the first creation time;
  • the data source sorts the queried data according to the creation time of each data, and returns the data of the previous query number to the server;
  • the server merges the data returned by each data source, and sorts the merged data according to the creation time of each data;
  • the server intercepts the data of the number of the previous query, and records the second creation time in the intercepted data; wherein the second creation time is the creation time of the last data returned by the query to the data source;
  • the server returns the intercepted number of the query data and the recorded second creation time of each data source to the client;
  • the client receives data returned by the server and a second creation time of each data source
  • the client updates the first creation time of each data source according to the second creation time of each data source.
  • the method includes:
  • a first request for initiating a paging data query to the server wherein the paging data query involves at least two data sources, where the first request carries a user identifier, a number of queries, and a first creation moment of each data source
  • the first creation time is a creation time of returning the last data to the data source from the previous query
  • the method includes:
  • the paging data query involves at least two data sources, where the first request carries a user identifier, a number of queries, and a first creation of each data source
  • the first creation time is a creation time at which the client returns the last data after the last query to the data source
  • the method includes:
  • the second request carries a user identifier, a number of queries, and a first creation time corresponding to the data source, where the first creation time is a last query of the client Return to the creation time of the last data to this data source;
  • the queried data is sorted according to the creation time of each data, and the data of the previous query number is returned to the server.
  • a paging inquiry device includes:
  • the first request for initiating a paging data query to the server; wherein the paging data query involves at least two data sources, where the first request carries a user identifier, a number of queries, and a number of each data source
  • the first creation time is a creation time of returning the last data to the data source from the previous query;
  • Receiving unit receiving data returned by the server and a second creation time of each data source
  • An update unit that updates the first creation time of each of the data sources according to the second creation time of each of the data sources.
  • a paging inquiry device includes:
  • the receiving unit receives the first request for the paging data query initiated by the client, where the paging data query involves at least two data sources, where the first request carries the user identifier, the number of queries, and each data source. a first creation time, where the first creation time is the creation time of the last data returned by the client to the data source;
  • a requesting unit initiating a second request for a data query to each of the data sources involved in the paging data query; wherein the second request carries the user identifier, the number of queries, and a first creation moment corresponding to the data source ;
  • Sorting unit merging the data returned by each data source, and sorting the merged data according to the creation time of each data
  • the processing unit intercepts data of the number of queries before, and records a second creation time in the intercepted data; wherein the second creation time is a creation time of returning the last data to the data source for the current query;
  • a paging inquiry device includes:
  • the receiving unit receives a second request for data query initiated by the server, where the second request carries a user identifier, a number of queries, and a first creation time corresponding to the data source, where the first creation time is a client The last time the query returned to the data source to return the last data creation time;
  • Querying unit querying data belonging to the user identifier and conforming to the first creation time
  • a memory for storing processor executable instructions
  • processor is configured to:
  • a first request for initiating a paging data query to the server wherein the paging data query involves at least two data sources, where the first request carries a user identifier, a number of queries, and a first creation moment of each data source
  • the first creation time is a creation time of returning the last data to the data source from the previous query
  • a memory for storing processor executable instructions
  • processor is configured to:
  • the paging data query involves at least two data sources, where the first request carries a user identifier, a number of queries, and a first creation of each data source
  • the first creation time is a creation time at which the client returns the last data after the last query to the data source
  • a memory for storing processor executable instructions
  • processor is configured to:
  • the second request carries a user identifier, a number of queries, and a first creation time corresponding to the data source, where the first creation time is a last query of the client Return to the creation time of the last data to this data source;
  • the queried data is sorted according to the creation time of each data, and the data of the previous query number is returned to the server.
  • the paging data query across multiple data sources can be realized; and the new data table is not needed, and the paging data query delay is not caused.
  • FIG. 1 is a system architecture diagram of implementing a paged query provided by an embodiment of the present specification
  • FIG. 2 is a flowchart of a page query method provided by an embodiment of the present specification
  • FIG. 3 is a schematic diagram of a first request and a second request provided by an embodiment of the present disclosure
  • FIG. 5 is a flowchart of a paging query method according to an embodiment of the present disclosure
  • FIG. 6 is a flowchart of a client-side method according to an embodiment of the present disclosure.
  • FIG. 7 is a flowchart of a method for taking a server as a main body according to an embodiment of the present disclosure
  • FIG. 8 is a flowchart of a method for taking a data source as a main body according to an embodiment of the present disclosure
  • FIG. 9 is a schematic block diagram of a paging query apparatus according to an embodiment of the present disclosure.
  • FIG. 10 is a schematic block diagram of a paging query apparatus according to an embodiment of the present disclosure.
  • FIG. 11 is a schematic block diagram of a paging query apparatus according to an embodiment of the present disclosure.
  • first, second, third, etc. may be used in this specification to describe various information, such information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other.
  • first information may also be referred to as the second information without departing from the scope of the present description.
  • second information may also be referred to as the first information.
  • word "if” as used herein may be interpreted as "when” or “when” or “in response to a determination.”
  • FIG. 1 is a system architecture diagram of implementing paging query provided in an embodiment of the present application.
  • the system may include a client 11, a server 12, and a plurality of data sources 13.
  • the client 11 may be a terminal on which an application is installed, such as a mobile application (App) installed in Apple's IOS system, an application installed in Google's Android system, or an application installed in Microsoft's Windows/WindowsPhone system.
  • an application such as a mobile application (App) installed in Apple's IOS system, an application installed in Google's Android system, or an application installed in Microsoft's Windows/WindowsPhone system.
  • the client 11 can communicate with the server 12.
  • the client 11 can initiate a request for paging query to the server 12.
  • the server 12 may be an application server for a data query corresponding to an application in the client 11, a server cluster, or a service platform built based on a server cluster.
  • the server 12 can query the data source 13 for data based on the request sent by the client 11, and return the queried data to the client 11.
  • Data source 13 can refer to a database or database server used by a database application.
  • the data source 13 can generally store related data.
  • the plurality of data sources 13 may refer to at least 2 data sources.
  • different data sources can store different data.
  • different services can correspond to different data sources, and the business data generated by each service needs to be stored in the corresponding data source.
  • the user queries the data through the client 11 page, and the server 12 queries the data source according to the request initiated by the client 11, and processes the queried data, and returns the processed data to the client 11, the client. 11 shows the data returned by the server 12.
  • Step 210 The client initiates a first request for paging data query to the server.
  • the paging data query involves at least two data sources, where the first request carries a user identifier, a number of queries, and a first creation time of each data source, where the first creation time is The last time the client retrieved the data source to return the last data creation time.
  • the user identifier may refer to a unique identifier of the user or the account, and may include, for example, a user ID, a user account name, a mobile phone number, and the like.
  • the number of the query may include the maximum number of data that can be displayed simultaneously on the client screen, and may also include the number of data set by the user.
  • the following defines the number of queries as N; the first creation time is T; the first creation time of different data sources may be, for example, T1, T2, .
  • the first creation time of each data source carried in the first request is empty when the first request of the paging data query is initiated by the client to the server.
  • Step 220 After receiving the first request initiated by the client, the server initiates a second request for data query to each data source.
  • the server may initiate a second request for data query to the data sources according to the multiple data sources involved in the first request.
  • the second request carries the user identifier, the number of queries, and a first creation time corresponding to the data source. That is, the server can transmit the user identifier, the number of queries, and the first creation time transmitted by the client to the corresponding data source.
  • the client initiates a first request for paging data query, where the paging data query involves an A data source and a B data source; the first request carries a user identifier user, and the number of queries is N.
  • the server may initiate a second request for the data query to the A data source and the B data source respectively:
  • the second request initiated by the A data source carries the user identifier user, the number of queries N, and the first creation time T1 of the A data source;
  • the second request initiated by the B data source carries the user identifier user, and queries the number N and the first creation time T2 of the B data source.
  • Step 230 After receiving the second request initiated by the server, the data source queries data that belongs to the user identifier and meets the first creation time.
  • the data stored in the data source generally has a creation time, which is usually the time when the data is written to the data source, or the time or time stamp in which the data is generated in the data source.
  • the data that meets the first creation time needs to be specifically sorted according to the paging data query.
  • the sorting method may include positive order and reverse order;
  • the data that meets the first creation time may specifically include:
  • a data whose creation time is greater than the first creation time is created.
  • the method uses a positive sequence, and the data displayed in the client is sorted according to the order of creation time, and the later the data is created, the earlier the data is created.
  • the data source may query the data according to the parameter carried in the second request, specifically:
  • the data whose creation time is greater than the first creation time is filtered out; thus the filtered data is the data required for the current query.
  • the data of a user ID is as follows:
  • the data that meets the first creation time should be the data whose creation time is greater than September 1, 2017, that is, data 1 and data 4.
  • the data that meets the first creation time may specifically include:
  • the data whose creation time is less than or equal to the first creation time is created.
  • the method is reversed, and the data displayed in the client is sorted according to the order of creation time, and the earlier the data is created, the later the data is created.
  • the data source may query the data according to the parameter carried in the second request, specifically:
  • the filtered data is the data required for the current query.
  • the data that meets the first creation time should be the data whose creation time is less than or equal to September 1, 2017, that is, data 2, data 3, and data 5.
  • Step 240 The data source sorts the queried data according to the creation time of each data, and returns the data of the previous query number to the server.
  • the data queried in the previous step is generally unordered, so this step needs to be sorted.
  • the sorting may be based on the sorting manner of the paging data query. If the paging data query specifies a positive order, the sorting here is also a positive order; if the paging data query specifies a reverse order, the sorting here is also a reverse order.
  • the server can arrange the queried data in order from the late to the early according to the creation time.
  • the queried data is:
  • the server sorts according to the creation time of the data 1 and the data 4, since the creation time of the data 4 is later than the creation time of the data 1; therefore, the order after sorting is: the data 4 is in the front and the data 1 is in the back.
  • the server can arrange the queried data in order of creation time from morning to night.
  • the queried data is:
  • the server sorts according to the creation time of data 2, data 3, and data 5. Since the creation time of data 3 is the earliest, the creation time of data 2 is the latest, and the creation time of data 5 is in the middle; therefore, the order after sorting is: data 3 Before, data 5 is in the middle, and data 2 is in the back.
  • the data may be returned to the server according to the number N of queries carried in the second request.
  • N the number of queries carried in the second request.
  • all the sorted data will be directly returned, that is, how much data is returned when there is a query.
  • Step 250 The server merges the data returned by each data source, and sorts the merged data according to the creation time of each data.
  • each data source may return N data
  • the server can receive X*N data by initiating X second requests.
  • the data returned by a single data source can be considered sorted, the data returned by multiple data sources merges and becomes unordered, so the server also needs to sort the data.
  • the server-side sorting is the same as the above-mentioned data source sorting. If the data source is a positive sequence, the server is also a positive sequence. If the data source is in reverse order, the server is also in reverse order. The specific sorting process is not described here.
  • both the A data source and the B data source return N data to the server; after the server merges the 2N data, it needs to be sorted.
  • the order is: data 1, data 4, data 2, data 5, data 3, and data 6.
  • Step 260 The server intercepts data of the number of queries before the sorting, and records a second creation time in the intercepted data.
  • the second creation time is the creation time of the last data returned by the query to the data source.
  • Step 270 The server returns the intercepted data of the query number and the recorded second creation time of each data source to the client.
  • the server sorts the merged data, the first N data can be intercepted, and the second creation time of the first N data is recorded.
  • the number of data returned by the server to the client is N, and also carries the second creation time of each data source.
  • the order of the server after sorting is: data 1, data 4, data 2, data 5, data 3, data 6;
  • the second creation time of the A data source is the creation time T1' of the data 2, that is, October 1, 2016;
  • the second creation time of the B data source is the creation time T2' of the data 4, that is, August 1, 2016;
  • the server returns to the client including Data 1, Data 4, Data 2, and T1' and T2'.
  • the server receives X*N data, but only intercepts the first N data and returns it to the client; and the remaining (X-1)*N data is not returned to the client. Since the remaining data is useless data, after the step 270, the method may further include:
  • the server clears the data remaining after the interception.
  • Step 280 The client receives data returned by the server and a second creation time of each data source.
  • Step 290 The client updates the first creation time of each data source according to the second creation time of each data source.
  • the client may display the data, and update each of the data according to the second creation time of each data source.
  • the first creation time of the data source that is, the second creation time of each data source is assigned to the first creation time of each data source.
  • the first creation time of the A data source is May 1, 2017; the second creation time of the received A data source is June 1, 2017; then, the client can create the first creation of the A data source.
  • the time is updated from May 1, 2017 to June 1, 2017.
  • the client can repeat the above steps 210-290. Since the first local creation time has been updated locally by the client, the data of the next query is the data after the data of the current query.
  • the paging data query across multiple data sources can be realized; and the new data table is not needed, and the paging data query delay is not caused.
  • the first request further carries a first identification number of each data source; the first identification number is the last query of the client. The identification number of the last data returned to the data source;
  • the second request further carries a first identification number corresponding to the data source
  • the step 240 may specifically include:
  • Step 241 The data source sorts the queried data according to the creation time of each data.
  • Step 242 In the case that there is data of the same creation time, the data source sorts the data of the same creation time according to the identification number of the data;
  • Step 243 The data source returns data of the number of queries before the sorting to the server.
  • the method may further include:
  • Step 251 In the case that there is data of the same creation time, the server sorts the data of the same creation time according to the identification number of the data.
  • the step 260 may specifically include:
  • the server intercepts the data of the previous query, and records the second creation time and the second identification number in the intercepted data; wherein the second identification number returns the last one for the query to the data source The identification number of the data.
  • the step 270 may specifically include:
  • the server returns the intercepted data of the query number and the recorded second creation time and identification number of each data source to the client.
  • the step 280 may specifically include:
  • the client receives data returned by the server, a second creation time of each data source, and a second identification number.
  • the step 290 may specifically include:
  • Step 291 The client updates the first creation time of each data source according to the second creation time of each data source.
  • Step 292 The client updates the first identification number of each data source according to the second identification number of each data source.
  • the data of the same creation time can be further sorted according to the identification number when sorting.
  • Step 310 Initiating a first request for paging data query to the server; wherein the paging data query involves at least two data sources, where the first request carries a user identifier, a number of queries, and a number of each data source.
  • the first creation time is the creation time of the last data returned by the last query to the data source.
  • the first creation time of each data source carried in the first request is empty.
  • Step 320 Receive data returned by the server and a second creation time of each data source.
  • Step 330 Update the first creation time of each data source according to the second creation time of each data source.
  • FIG. 6 Based on the embodiment shown in FIG. 6, another specific embodiment may correspond to FIG. 5:
  • the first request further carries a first identification number of each data source; the first identification number is an identification number of the last data returned by the client to the data source last time;
  • the step 320 specifically includes:
  • the step 330 includes:
  • Step 410 Receive a first request for a paging data query initiated by a client, where the paging data query involves at least two data sources, where the first request carries a user identifier, a number of queries, and each data source.
  • the first creation time is the creation time of the last data returned by the client last time the data source is queried.
  • the first creation time of each data source carried in the first request is empty.
  • Step 420 Initiate a second request for data query to each data source involved in the paging data query, where the second request carries the user identifier, the number of queries, and a first creation moment corresponding to the data source. ;
  • Step 430 Combine the data returned by each data source, and sort the merged data according to the creation time of each data;
  • Step 440 Intercept the data of the number of the previous query, and record the second creation time in the intercepted data; wherein the second creation time is the creation time of the last data returned by the query to the data source.
  • the method may further include:
  • the server clears the data remaining after the interception.
  • Step 450 Return the intercepted data of the query number and the recorded second creation time of each data source to the client.
  • FIG. 7 Based on the embodiment shown in FIG. 7, another specific embodiment may correspond to FIG. 5:
  • the first request further carries a first identification number of each data source, where the first identification number is an identification number of the last data returned by the client to the data source last time;
  • the second request further carries a first identification number corresponding to the data source
  • the method may further include:
  • the data of the same creation time is sorted according to the identification number of the data
  • the step 440 may specifically include:
  • the step 450 may specifically include:
  • FIG. 8 The method embodiment of the present application with the data source as the main body is described below with reference to FIG. 8 , which may correspond to FIG. 2 :
  • Step 510 Receive a second request for a data query initiated by the server, where the second request carries a user identifier, a number of queries, and a first creation time corresponding to the data source, where the first creation time is a client. The last time the query returned to the data source to return the last data creation time;
  • Step 520 Query data belonging to the user identifier and conforming to the first creation time
  • Step 530 Sort the queried data according to the creation time of each data, and return the data of the previous query number to the server.
  • FIG. 8 On the basis of the embodiment shown in FIG. 8, another specific embodiment may correspond to FIG. 5:
  • the second request further carries a first identification number corresponding to the data source
  • the step 530 specifically includes:
  • the data of the same creation time is sorted according to the identification number of the data
  • the data of the number of queries before the sorting is returned to the server.
  • the present specification also provides an embodiment of a page-by-page query device.
  • the device embodiment may be implemented by software, or may be implemented by hardware or a combination of hardware and software.
  • the processor of the device in which it is located reads the corresponding computer program instructions in the non-volatile memory into the memory.
  • a hardware structure of the device in which the paging device is located may include a processor, a network interface, a memory, and a non-volatile memory.
  • the device in which the device is located generally queries the actual function according to the paging. It can also include other hardware, which will not be described here.
  • FIG. 9 is a block diagram of a paging query device according to an embodiment of the present disclosure, where the device includes:
  • the requesting unit 610 the first request for the paging data query is initiated to the server; wherein the paging data query involves at least two data sources, where the first request carries the user identifier, the number of queries, and each data source. a first creation time, the first creation time is a creation time of returning the last data to the data source from the previous query;
  • the receiving unit 620 receives the data returned by the server and the second creation time of each data source
  • the updating unit 630 updates the first creation time of each of the data sources according to the second creation time of each of the data sources.
  • the first creation time of each data source carried in the first request is empty.
  • the first request further carries a first identification number of each data source, where the first identification number is an identification number of the last data returned by the client to the data source last time;
  • the receiving unit 620 specifically includes:
  • the updating unit 630 specifically includes:
  • the present specification also provides an embodiment of a page-by-page query device.
  • the device embodiment may be implemented by software, or may be implemented by hardware or a combination of hardware and software.
  • the processor of the device in which it is located reads the corresponding computer program instructions in the non-volatile memory into the memory.
  • a hardware structure of the device in which the paging device is located may include a processor, a network interface, a memory, and a non-volatile memory.
  • the device in which the device is located generally queries the actual function according to the paging. It can also include other hardware, which will not be described here.
  • FIG. 10 is a block diagram of a paging query device according to an embodiment of the present disclosure, where the device includes:
  • the receiving unit 710 is configured to receive a first request for the paging data query initiated by the client, where the paging data query involves at least two data sources, where the first request carries the user identifier, the number of queries, and each data source. a first creation time, where the first creation time is a creation time when the client last queries the data source to return the last data;
  • the requesting unit 720 initiating a second request for data query to each data source involved in the paging data query; wherein the second request carries the user identifier, the number of queries, and the first creation corresponding to the data source time;
  • the sorting unit 730 merges the data returned by each data source, and sorts the merged data according to the creation time of each data;
  • the processing unit 740 is configured to intercept the data of the number of the previous query, and record the second creation time in the intercepted data; wherein the second creation time is the creation time of returning the last data to the data source for the current query;
  • the returning unit 750 returns the intercepted data of the query number and the recorded second creation time of each data source to the client.
  • the first creation time of each data source carried in the first request is empty.
  • the first request further carries a first identification number of each data source, where the first identification number is an identification number of the last data returned by the client to the data source last time;
  • the second request further carries a first identification number corresponding to the data source
  • the apparatus further includes:
  • the data of the same creation time is sorted according to the identification number of the data
  • the processing unit 740 specifically includes:
  • the returning unit 750 specifically includes:
  • the present specification also provides an embodiment of a page-by-page query device.
  • the device embodiment may be implemented by software, or may be implemented by hardware or a combination of hardware and software.
  • the processor of the device in which it is located reads the corresponding computer program instructions in the non-volatile memory into the memory.
  • a hardware structure of the device in which the paging device is located may include a processor, a network interface, a memory, and a non-volatile memory.
  • the device in which the device is located generally queries the actual function according to the paging. It can also include other hardware, which will not be described here.
  • FIG. 11 is a block diagram of a paging query device according to an embodiment of the present disclosure, where the device includes:
  • the receiving unit 810 is configured to receive a second request for data query initiated by the server, where the second request carries a user identifier, a number of queries, and a first creation time corresponding to the data source, where the first creation time is a client. The last time the query reaches the data source to return the last data creation time;
  • the query unit 820 queries data that belongs to the user identifier and meets the first creation time
  • the returning unit 830 sorts the queried data according to the creation time of each data, and returns the data of the previous query number to the server.
  • the second request further carries a first identification number corresponding to the data source
  • the returning unit 830 specifically includes:
  • the data of the same creation time is sorted according to the identification number of the data
  • the data of the number of queries before the sorting is returned to the server.
  • the system, device, module or unit illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product having a certain function.
  • a typical implementation device is a computer, and the specific form of the computer may be a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email transceiver, and a game control.
  • the device embodiment since it basically corresponds to the method embodiment, reference may be made to the partial description of the method embodiment.
  • the device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, ie may be located A place, or it can be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the objectives of the present specification. Those skilled in the art can understand and implement without any creative work.
  • the internal function module and structure of the paging query device are described in FIG. 9 above.
  • the substantial execution body of the device may be an electronic device, including:
  • a memory for storing processor executable instructions
  • processor is configured to:
  • a first request for initiating a paging data query to the server wherein the paging data query involves at least two data sources, where the first request carries a user identifier, a number of queries, and a first creation moment of each data source
  • the first creation time is a creation time of returning the last data to the data source from the previous query
  • the first creation time of each data source carried in the first request is empty.
  • the first request further carries a first identification number of each data source, where the first identification number is an identification number of the last data returned by the client to the data source last time;
  • the receiving the data returned by the server and the second creation time of each data source specifically include:
  • the updating the first creation time of each data source according to the second creation time of each data source includes:
  • the internal function module and structure of the paging query device are described in FIG. 10, and the substantial execution body of the device may be an electronic device, including:
  • a memory for storing processor executable instructions
  • processor is configured to:
  • the paging data query involves at least two data sources, where the first request carries a user identifier, a number of queries, and a first creation of each data source
  • the first creation time is a creation time at which the client returns the last data after the last query to the data source
  • the first creation time of each data source carried in the first request is empty.
  • the first request further carries a first identification number of each data source, where the first identification number is an identification number of the last data returned by the client to the data source last time;
  • the second request further carries a first identification number corresponding to the data source
  • the method further includes:
  • the data of the same creation time is sorted according to the identification number of the data
  • FIG. 11 above illustrates the internal functional modules and structure of the paging query device.
  • the substantial execution body of the device can be an electronic device, including:
  • a memory for storing processor executable instructions
  • processor is configured to:
  • the second request carries a user identifier, a number of queries, and a first creation time corresponding to the data source, where the first creation time is a last query of the client Return to the creation time of the last data to this data source;
  • the queried data is sorted according to the creation time of each data, and the data of the previous query number is returned to the server.
  • the second request further carries a first identification number corresponding to the data source
  • the data is sorted according to the creation time of each data, and the data of the previous query is returned to the server, which specifically includes:
  • the data of the same creation time is sorted according to the identification number of the data
  • the data of the number of queries before the sorting is returned to the server.
  • the processor may be a central processing unit (English: Central Processing Unit, CPU for short), or other general-purpose processor, digital signal processor (English: Digital Signal Processor) , referred to as: DSP), ASIC (English: Application Specific Integrated Circuit, referred to as: ASIC).
  • the general-purpose processor may be a microprocessor or the processor may be any conventional processor or the like, and the foregoing memory may be a read-only memory (English: read-only memory, abbreviation: ROM), a random access memory (English) :random access memory (abbreviation: RAM), flash memory, hard disk or solid state disk.
  • the steps of the method disclosed in the embodiments of the present invention may be directly implemented as a hardware processor, or may be performed by a combination of hardware and software modules in the processor.

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Transfer Between Computers (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

Les modes de réalisation de la présente invention concernent un procédé d'interrogation de page, un dispositif, et un appareil électronique. Le procédé comprend les étapes consistant : à recevoir une première demande pour une interrogation de données de page initiée par un client ; à initier et à envoyer une seconde demande pour une interrogation de données à chaque source de données associée à l'interrogation de données de page ; à combiner des éléments de données renvoyés par chaque source de données, et à trier les éléments de données combinés conformément à une estampille temporelle de création de chacun des éléments de données ; à extraire un nombre d'interrogation de principaux éléments de données associés, et à enregistrer des secondes estampilles temporelles de création d'éléments de données extraits ; et à renvoyer le nombre d'interrogation des éléments de données extraits et les secondes estampilles temporelles de création enregistrées de chaque source de données au client.
PCT/CN2018/108924 2017-11-22 2018-09-30 Procédé d'interrogation de page, dispositif, et appareil électronique WO2019100853A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201711172207.7 2017-11-22
CN201711172207.7A CN107798135B (zh) 2017-11-22 2017-11-22 分页查询方法及装置和电子设备

Publications (1)

Publication Number Publication Date
WO2019100853A1 true WO2019100853A1 (fr) 2019-05-31

Family

ID=61535416

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/108924 WO2019100853A1 (fr) 2017-11-22 2018-09-30 Procédé d'interrogation de page, dispositif, et appareil électronique

Country Status (3)

Country Link
CN (1) CN107798135B (fr)
TW (1) TWI686705B (fr)
WO (1) WO2019100853A1 (fr)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107798135B (zh) * 2017-11-22 2020-06-16 阿里巴巴集团控股有限公司 分页查询方法及装置和电子设备
CN108848244B (zh) * 2018-04-02 2020-08-21 阿里巴巴集团控股有限公司 一种分页显示的方法及装置
CN110928900B (zh) * 2018-09-17 2021-02-19 马上消费金融股份有限公司 多表数据的查询方法、装置、终端以及计算机存储介质
CN109684528A (zh) * 2018-12-04 2019-04-26 深圳店匠科技有限公司 跨库分页查询方法、系统和存储介质
CN113326302A (zh) * 2021-05-28 2021-08-31 网易(杭州)网络有限公司 数据查询方法及装置、存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103425708A (zh) * 2012-05-25 2013-12-04 金蝶软件(中国)有限公司 一种优化的web分页查询方法及装置
JP5579140B2 (ja) * 2011-09-05 2014-08-27 日本電信電話株式会社 文書検索装置及び方法及びプログラム
CN105653537A (zh) * 2014-11-13 2016-06-08 阿里巴巴集团控股有限公司 一种数据库应用系统的分页查询方法和装置
CN107798135A (zh) * 2017-11-22 2018-03-13 阿里巴巴集团控股有限公司 分页查询方法及装置和电子设备

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7788260B2 (en) * 2004-06-14 2010-08-31 Facebook, Inc. Ranking search results based on the frequency of clicks on the search results by members of a social network who are within a predetermined degree of separation
CN106886548B (zh) * 2016-08-03 2020-06-30 阿里巴巴集团控股有限公司 数据查询方法及装置
CN106446080B (zh) * 2016-09-09 2021-08-13 华为技术有限公司 数据查询的方法、查询服务设备、客户端设备和数据系统
CN106599310A (zh) * 2016-12-29 2017-04-26 中国建设银行股份有限公司 基于多数据源场景的并发查询方法和装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5579140B2 (ja) * 2011-09-05 2014-08-27 日本電信電話株式会社 文書検索装置及び方法及びプログラム
CN103425708A (zh) * 2012-05-25 2013-12-04 金蝶软件(中国)有限公司 一种优化的web分页查询方法及装置
CN105653537A (zh) * 2014-11-13 2016-06-08 阿里巴巴集团控股有限公司 一种数据库应用系统的分页查询方法和装置
CN107798135A (zh) * 2017-11-22 2018-03-13 阿里巴巴集团控股有限公司 分页查询方法及装置和电子设备

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
DUAN, HANCONG ET AL.: "Dynamical Merging Algorithm in Paging Querying Towards Distributed Structured Data", JOURNAL OF CHINESE COMPUTER SYSTEMS, vol. 34, no. 7, 31 July 2013 (2013-07-31), pages 1504 *
HAN, BING ET AL.: "Multi-Table Paging Query Optimization Technology in MySql", COMPUTER SYSTEMS & APPLICATIONS, vol. 25, no. 8, 31 August 2016 (2016-08-31), pages 172 - 175 *

Also Published As

Publication number Publication date
TW201926085A (zh) 2019-07-01
CN107798135B (zh) 2020-06-16
TWI686705B (zh) 2020-03-01
CN107798135A (zh) 2018-03-13

Similar Documents

Publication Publication Date Title
WO2019100853A1 (fr) Procédé d'interrogation de page, dispositif, et appareil électronique
CN111344706B (zh) 管理区块链上的交易的方法和系统
US11651008B2 (en) Method and system for synchronizing databases automatically and periodically
TWI717866B (zh) 跨鏈存證方法及接取方法、裝置、電子設備
US9762670B1 (en) Manipulating objects in hosted storage
US9934263B1 (en) Big-fast data connector between in-memory database system and data warehouse system
WO2017114206A1 (fr) Procédé et dispositif destinés au traitement de liaison courte et serveur de liaison courte
US9721015B2 (en) Providing a query results page
CN107590207B (zh) 数据同步方法及装置、电子设备
CN109729121B (zh) 一种云存储系统及用于云存储系统中实现自定义数据处理的方法
WO2016101758A1 (fr) Procédé et dispositif de synchronisation de données intergroupes
CN113064919B (zh) 数据处理方法、数据存储系统、计算机设备及存储介质
CN111046106A (zh) 缓存数据同步方法、装置、设备及介质
CN112559913B (zh) 一种数据处理方法、装置、计算设备及可读存储介质
US10048883B2 (en) Integrated page-sharing cache storing a single copy of data where the data is stored in two volumes and propagating changes to the data in the cache back to the two volumes via volume identifiers
WO2021057515A1 (fr) Procédé, appareil, dispositif de délestage de données de commutation de date et support
WO2019237949A1 (fr) Procédé et dispositif de recherche
EP3082050A1 (fr) Procédé et système de stockage de fusion de données massives
CN112464049B (zh) 号码详单下载方法、装置和设备
CN114493598A (zh) 计算资源管理方法、装置、计算机设备和存储介质
CN113672640A (zh) 数据查询方法、装置、计算机设备和存储介质
CN112527900A (zh) 一种数据库读多副本一致性的方法、装置、设备及介质
CN107679093B (zh) 一种数据查询方法及装置
CN110889040B (zh) 用于推送信息的方法和装置
CN113486627B (zh) 一种单号生成方法、装置及电子设备

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18881089

Country of ref document: EP

Kind code of ref document: A1