WO2022105682A1

WO2022105682A1 - Paging data acquisition method and apparatus, electronic device, and computer readable storage medium

Info

Publication number: WO2022105682A1
Application number: PCT/CN2021/130261
Authority: WO
Inventors: 廖建军; 姚东伟; 熊俊杰
Original assignee: 北京字节跳动网络技术有限公司
Priority date: 2020-11-18
Filing date: 2021-11-12
Publication date: 2022-05-27
Also published as: CN112417276A

Abstract

A paging data acquisition method and apparatus, an electronic device, and a computer readable storage medium. The paging data acquisition method comprises: acquiring paging parameters(S101); acquiring first candidate paging data according to the paging parameters (S102); acquiring second candidate paging data according to the paging parameters (S103); and acquiring target paging data from among the first candidate paging data and the second candidate paging data according to the paging parameters (S104). In the method, the candidate paging data is acquired, and a selection is performed on the candidate paging data, such that the technical problem of difficulty in providing personalized paging data is solved.

Description

Paging data acquisition method, device, electronic device, and computer-readable storage medium

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the priority of the Chinese patent application filed on November 18, 2020, the application number is 202011294529.0, and the invention name is "paging data acquisition method, device, electronic device and computer-readable storage medium", the full text of the application Incorporated herein by reference.

technical field

The present disclosure relates to the field of paging data acquisition, and in particular, to a method, an apparatus, an electronic device, and a computer-readable storage medium for paging data acquisition.

Background technique

With the development of network technology, Internet users have ushered in the era of mobile terminals. Higher bandwidth allows smart devices to display more and more information at the same time. It is difficult to display a lot of data on the same page at the same time. In order to take account of users In terms of experience and product effects, client-side application products are more inclined to choose the method of paging display to present content. At the same time, in order to meet the personalized needs of users, the scenarios of client products tend to be more complex. It is common to filter or add specific content in the presented element set according to the characteristics and commercialization needs of users.

In some scenarios, when the client displays paging to the user, the server needs to provide paging data to the client, and it is necessary to enable the paging data to provide some personalized data, but because the page data provided by the server is in the form of a long list and sorted Fixed, which makes it difficult to operate on long lists to provide some personalized pagination data while providing paginated data.

SUMMARY OF THE INVENTION

This Summary is provided to introduce concepts in a simplified form that are described in detail in the Detailed Description section that follows. This summary section is not intended to identify key features or essential features of the claimed technical solution, nor is it intended to be used to limit the scope of the claimed technical solution.

In order to solve the above technical problems, the embodiments of the present disclosure propose the following technical solutions.

In a first aspect, an embodiment of the present disclosure provides a method for acquiring paging data, including:

Get paging parameters;

Obtain the first candidate paging data according to the paging parameter;

Acquire second candidate paging data according to the paging parameter;

Target paging data is obtained from the first candidate paging data and the second candidate paging data according to the paging parameter.

In a second aspect, an embodiment of the present disclosure provides a device for acquiring paging data, including:

Parameter obtaining module, used to obtain paging parameters;

a first candidate data acquisition module, configured to acquire the first candidate paging data according to the paging parameter;

A second candidate data obtaining module, configured to obtain second candidate paging data according to the paging parameter;

A paging data acquisition module, configured to obtain target paging data from the first candidate paging data and the second candidate paging data according to the paging parameter.

In a third aspect, embodiments of the present disclosure provide an electronic device, including: at least one processor; and,

a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to cause the at least one process The device is capable of performing the method of any one of the preceding first aspects.

In a fourth aspect, an embodiment of the present disclosure provides a non-transitory computer-readable storage medium, characterized in that the non-transitory computer-readable storage medium stores computer instructions, and the computer instructions are used to cause a computer to execute the foregoing first aspect. of any of the methods described.

Embodiments of the present disclosure disclose a method, an apparatus, an electronic device, and a computer-readable storage medium for acquiring paging data. The method for obtaining paging data includes: obtaining paging parameters; obtaining first candidate paging data according to the paging parameters; obtaining second candidate paging data according to the paging parameters; Target paging data is obtained from the second candidate paging data. The above method solves the technical problem of difficulty in providing personalized paging data by acquiring and selecting candidate paging data.

The above description is only an overview of the technical solutions of the present disclosure. In order to understand the technical means of the present disclosure more clearly, it can be implemented according to the content of the description, and to make the above and other purposes, features and advantages of the present disclosure more obvious and easy to understand , the following specific preferred embodiments, and in conjunction with the accompanying drawings, are described in detail as follows.

Description of drawings

The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent when taken in conjunction with the accompanying drawings and with reference to the following detailed description. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that the originals and elements are not necessarily drawn to scale.

1 is a schematic flowchart of a method for acquiring paging data provided by an embodiment of the present disclosure;

FIG. 2 is a further schematic flowchart of the method for obtaining paging data according to an embodiment of the present disclosure;

FIG. 3 is a further schematic flowchart of the method for obtaining paging data according to an embodiment of the present disclosure;

FIG. 4 is a further schematic flowchart of the method for obtaining paging data according to an embodiment of the present disclosure;

5a-5g are schematic diagrams of exemplary execution processes of the method for obtaining paging data according to an embodiment of the present disclosure;

FIG. 6 is a further schematic flowchart of the method for obtaining paging data according to an embodiment of the present disclosure;

FIG. 7 is a further schematic flowchart of the method for obtaining paging data according to an embodiment of the present disclosure;

FIG. 8 is a further schematic flowchart of the method for obtaining paging data according to an embodiment of the present disclosure;

9 is a schematic structural diagram of an embodiment of an apparatus for obtaining paging data provided by an embodiment of the present disclosure;

FIG. 10 is a schematic structural diagram of an electronic device provided according to an embodiment of the present disclosure.

Detailed ways

Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain 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 construed as limited to the embodiments set forth herein, but rather are provided for the purpose of A more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes, and are not intended to limit the protection scope of the present disclosure.

It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and/or in parallel. Furthermore, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the present disclosure is not limited in this regard.

As used herein, the term "including" and variations thereof are open-ended inclusions, ie, "including but not limited to". The term "based on" is "based at least in part on." The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". Relevant definitions of other terms will be given in the description below.

It should be noted that concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order of functions performed by these devices, modules or units or interdependence.

It should be noted that the modifications of "a" and "a plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless the context clearly indicates otherwise, they should be understood as "one or a plurality of". multiple".

The names of messages or information exchanged between multiple devices in the embodiments of the present disclosure are only for illustrative purposes, and are not intended to limit the scope of these messages or information.

1 is a flowchart of an embodiment of a method for obtaining paging data provided by an embodiment of the present disclosure. The method for obtaining paging data provided in this embodiment may be executed by a paging data obtaining device, and the paging data obtaining device may be implemented as software, or Implemented as a combination of software and hardware, the paging data acquisition device can be integrated in a device in a paging data acquisition system, such as a paging data acquisition server or a paging data acquisition terminal device. As shown in Figure 1, the method includes the following steps:

Step S101, obtaining paging parameters;

Optionally, the method for obtaining paging data is performed by a server, and the paging parameter is sent to the server by a client device. Exemplarily, a long page is displayed on a client device, and when the user slides the page to turn pages, the client sends a paging request to the server to request to obtain subsequent paginated data.

As shown in FIG. 2, optionally, the step S101 includes:

Step S201, receiving a paging data request;

Step S202, parsing the paging data request to obtain the paging parameter.

Optionally, the paging data request includes paging parameters, wherein the paging parameters include: one or more of a flag bit, a fragment size, filtering information, and an offset; wherein the flag bit represents a page data list The starting position of the paging data in ; the fragment size represents the quantity of the target paging data; the filtering information represents the information required to filter the paging data; the offset represents the quantity of the acquired target paging data.

Exemplarily, the data structure of the parameters included in the paging data request is as follows:

Among them, Sorting_position indicates the flag bit, which indicates that the paging data starts from the 5th position of the page data list of the server; Count indicates the size of the fragment, that is, the number of target paging data required by each client is 4; Filter indicates the filtering information , which may include the user's preference for using the client, the performance parameters of the client device, etc., so that the server generates corresponding filter conditions according to the filtering information, and filters out the paging data that the user does not like or may cause the client The paging data of the device crash is filtered out. It is understandable that the filtering information can be any information, which will not be repeated here; Cursor represents the offset, that is, the amount of paging data displayed by the client or the The starting position of the ordered list. As in the above example, the ordered list in the client starts from the 5th position. Combined with the size of the shard, the client will display the order [5, 6, 7 of the ordered list]. ,8] bits of paging data.

It can be understood that the above paging parameters are only examples, and in actual use, the paging parameters can be increased or decreased as required, and details are not described herein again.

Step S102, obtaining first candidate paging data according to the paging parameter;

In this step, a first candidate paging parameter is obtained according to the paging parameter. As shown in FIG. 3 , optionally, the paging parameters include flag bits and filter information, and the step S102 further includes:

Step S301, obtaining a page data list;

Step S302 , according to the flag bit and the filtering information, obtain the page data of the fragment size from the page data list as the first candidate page data.

Wherein, the page data list is a list that stores all data elements in the page, and each data element represents a paging data. Exemplarily, the paging data list is data stored in the form of an array with a fixed order, wherein the data There is data structure similarity between elements. For a general page display method, the server returns the page data list to the client, and the client device parses the data elements in the list and generates a display page. In the technical solution of the present disclosure, however, the data in the page data list needs to be processed to obtain target paging data.

In step S302, the starting position of the paging data is located in the page data list through the flag bit, and the paging data is filtered one by one from the starting position of the paging data through the filtering information, until the number of the obtained paging data is the same as all the paging data. The size of the fragments is the same, and the obtained paging data is the first candidate paging data.

Optionally, as shown in FIG. 4 , the step S302 includes:

Step S401, generating filter conditions according to the filter information;

Step S402, determining the starting position of the paging data in the page data list according to the flag bit;

Step S403, according to the filter condition, obtain the page data of the fragment size from the start position of the page data in the page data list as the first candidate page data.

In step S401, the server generates filter conditions according to the filtering information, for example, the filtering information is that the user does not like pictures of ball games, the user's client device cannot play videos with a frame rate higher than 60, etc. The server integrates these The filter information generates filter conditions to filter the obtained paging data.

In step S402, the starting position of the paging data in the page data list is determined according to the flag bit. As shown in Figure 5a, if the flag bit is 5, the start position of the page data in the page data list can be located at 5 through the flag bit.

In step S403, according to the filtering condition, starting from the paging data indicated by the starting position of the paging data, the paging data in the page list is filtered one by one, the paging data satisfying the filtering condition is excluded, and the paging data that does not satisfy the filtering condition is excluded. Conditional paging data is retained until the number of retained paging data is equal to the size of the shard. Optionally, in this step, an intrusive condition can also be added, and the intrusive condition can be generated by the intrusive information in the page parameters or generated independently of the page parameters. Add the strong insertion mark and the strong insertion position to the paging data. If it is found that the paging data has the strong insertion mark when traversing the paging data, it will also be temporarily filtered out, that is, the first candidate paging data only includes: does not satisfy the filter Conditional paging data and paging data that do not meet the insertion conditions.

Optionally, as shown in FIG. 6 , the step S403 includes:

Step S601, initialize the paging window;

Step S602, obtaining paging data from the starting position of the paging data in the page data list according to the filter condition until the size of the paging window is equal to the size of the fragment;

Step S603, taking the paging data in the paging window as the first candidate paging data.

In step S601, a paging window is initialized, and the size of the paging window can be dynamically adjusted to determine the range of the first candidate paging data. The size of the paging window is initialized to 0, that is, in the initial state, there is no first candidate paging data that meets the conditions.

Figures 5b-5d are examples of acquiring the first candidate paging data in steps S602 and S603. As shown in Figure 5b, the starting position of the paging data is 5, then starting from the fifth position of the page data list, it is judged whether the paging data in the fifth position satisfies the filtering condition. In this example, the paging data in the fifth position does not satisfy the filtering condition. If the condition should be reserved, the fifth-bit paging data is the paging data in the first candidate paging data, and the size of the paging window is incremented by 1. And so on, as shown in Figure 5c, the paging data in the sixth position and the paging data in the eighth position are paging data that satisfies the filtering conditions, which will not increase the size of the paging window, and the paging data in the seventh position does not satisfy the filtering conditions. Conditional paging data, so it is reserved, then the size of the paging window is 2; in this example, the detection of intrusive data is also added, as shown in Figure 5d, when traversing to the ninth bit of paging data, the detection The paging data up to the ninth position is strong insertion data. If it meets the strong insertion conditions or the paging data in the ninth position has an intrusive insertion mark, etc., the intrusive data needs to be processed separately at this time, so it is not included in the first candidate paging. In the data, the window size remains unchanged at this time, and the traversal continues; as shown in Figure 5e, the 10th and 11th paging data do not meet the filtering conditions, and they are not interpolated data, so they are included in the first candidate paging data, At this time, the size of the paging window is accumulated to 4, which is the same as the size of the shard, and it stops continuing to traverse the data backwards. At this time, the paging data in the paging window that does not satisfy the filtering conditions and is not the intrusive data is the first candidate paging data.

Step S103, obtaining second candidate paging data according to the paging parameter;

Optionally, the second candidate paging data is paging data that needs to be inserted between other paging data, such as the strongly inserted data described in the above example. Exemplarily, the intrusive data is pre-set paging data with an intrusive mark.

The second candidate paging data also needs to be screened by filter conditions, so optionally, the step S103 includes:

Step S701, generating filter conditions according to the filter information;

Step S702, obtaining at least one paging data that meets the strong insertion condition;

Step S703: Obtain page data that does not meet the filtering condition from the at least one page data that meets the strong insertion condition as second candidate page data.

The filtering conditions in the step S701 may be the same as the filtering conditions in the foregoing step S401, and details are not described herein again. Alternatively, the filtering conditions in step S701 may also be different from those in step S401, for example, new filtering conditions are generated according to the filtering information and other preset information.

In step S702, at least one paging data that complies with the intrusive insertion condition is obtained. As mentioned above, the intrusive insertion condition can be a combination of logical conditions or a flag bit, so that the paging data that needs to be intruded can be found from the paging data. . The paging data that meets the intrusive insertion condition may be paging data in the page data list, or may be separately stored intrusive data. The quantity and insertion position of intrusive data in each page can also be preset. For example, there are two intrusive data in the paging data of each shard, and the insertion position is before the other two paging data. When there are 4 paging data, the 1st and 3rd paging data in the paging are intrusive data, and the 2nd and 4th paging data are normal paging data in the paging data.

In step S703, the acquired intrusive data is filtered using the above filtering conditions, and the intrusive data that does not meet the filtering conditions is used as the second candidate paging data. As shown in Figure 5f, in this example, the intrusive data is the paging data in the page data list, and it is assumed that there are 2 intrusive data in each page, since the ninth paging data has been determined in the previous step as The data is forced to be inserted, so it is directly judged whether it satisfies the filter conditions. In this example, the paging data of the 9th position does not meet the filter conditions, so the inserted data is retained, and then the next forced insertion data is obtained, and the paging of the 14th position is obtained. The data is interpolated data, but the interpolated data satisfies the filtering conditions, so the 14th paging data is not retained; continue to obtain the next interpolated data, and the 15th paging data is obtained as strong interpolated data and does not meet the filtering conditions, thus The 9th and 15th paging data obtained are the interpolated data that needs to be inserted into the current paging. That is, in this example, the ninth and 15th paging data are the second candidate paging data.

Step S104: Obtain target paging data from the first candidate paging data and the second candidate paging data according to the paging parameter.

In this step, the first candidate paging data and the second candidate paging data are combined and intercepted through paging parameters to obtain target paging data. Wherein, the target paging data is the paging data in the current paging.

As shown in FIG. 8 , optionally, the paging parameter includes the fragment size, and the step S104 further includes:

Step S801, obtaining the insertion position of the second candidate paging data;

Step S802, inserting the second candidate paging data into the first candidate paging data according to the insertion position to obtain candidate paging data;

Step S803: Cut out the target paging data from the candidate paging data according to the fragment size.

Optionally, the insertion position of the second candidate paging data is obtained according to the offset, where the offset is the starting position of the paging data of the paging data in the client. For example, in the above example, the offset Cursor is 5, Since the fragment size of a page is 4, the page data corresponds to the position ["5", "6", "7", "8"] in the ordered list in the client, as shown in Figure 5f, The first interpolated data "9" is inserted at position "5" in the ordered list, the second interpolated data "14" is inserted at position "6" in the ordered list, and the third interpolated data "15" is inserted at position "7" in the ordered list. Since the interpolated data "14" satisfies the filter condition, it is filtered out. In the page data list, since "5" is occupied by "9", "5" is moved to the position of "6", and the paging data at the position of "6" satisfies the filter condition and is filtered out. The position of "7" is occupied by the paging data of "15", so the paging data of the position of "7" is moved backward to the position of "8", and the paging data of the position of "8" satisfies the filtering conditions and is filtered out. After the above steps S801 and S802, candidate paging data ["9", "5", "15", "7", "10", "11"] are obtained.

In step S803, the candidate page data is intercepted by using the fragment size. As in the above example, if the fragment size is 4, the first 4 page data ["9", "5", "15", "7"] are intercepted from the candidate page data as the target page data.

The server returns the obtained target paging data to the client, so that the client displays the target paging data. Therefore, according to the client sending paging data requests multiple times, the server returns corresponding target paging data according to the above method, so that the server can return the target paging data in a personalized manner to obtain a personalized paging page.

Further, after the step S104, it also includes:

The flag bit in the paging parameter is updated according to the target paging data.

Optionally, the flag bit in the next paging parameter is obtained according to the position of the last paging data in the target paging data. As shown in Figure 5g, the last paging data in the target paging data is the position "7", and the first paging data after the paging data of the position "7" is the paging data of the position "10", so the next paging parameter The flag bits in are set to "10".

Optionally, the flag bit in the paging parameter is sent to the client together with the target paging data, so that the client displays the paging page according to the target paging data, and sets the flag in the next paging data request according to the flag bit. Pagination parameters.

Optionally, the paging data in the page data list will not be deleted. For example, the filtered paging data will not be returned to the client, but it is still stored in the page data list. Move according to the position after the intrusion.

On the basis of the above, optionally, in order not to repeat the filtering of paging data, the last paging data in the paging window is set at the last bit of the paging window, that is, the last page data in the paging window cannot be filtered out. In this way, when paging data is intercepted, the filtered paging data can be directly intercepted, so as to prevent repeated paging data filtering when the next paging data is requested. As shown in Figure 5f, the paging data in the 15th position is inserted before the paging data in the 7th position. Since the paging data in the 7th position is the last qualified paging data in the paging window, it is moved after the paging data in the 8th position. , in this way, when intercepting the paging data, the 8th bit paging data can be directly intercepted, otherwise when calculating the next flag bit, it will be calculated as position 8, then when the target paging data is acquired next time, it is necessary to repeatedly filter the 8th bit. Paginated data.

In the above, although the steps in the above method embodiments are described in the above order, it should be clear to those skilled in the art that the steps in the embodiments of the present disclosure are not necessarily executed in the above order, and may also be performed in reverse order, parallel, interleaved and other steps are performed in other order, and, on the basis of the above steps, those skilled in the art can also add other steps, these obvious modifications or equivalent replacement modes should also be included within the protection scope of the present disclosure, and will not be repeated here. .

FIG. 9 is a schematic structural diagram of an embodiment of an apparatus for acquiring paging data provided by an embodiment of the present disclosure. As shown in FIG. 9 , the apparatus 900 includes: a parameter acquisition module 901 , a first candidate data acquisition module 902 , a second candidate data acquisition module 903 and a paging data acquisition module 904 . in,

A parameter obtaining module 901, used for obtaining paging parameters;

a first candidate data obtaining module 902, configured to obtain first candidate paging data according to the paging parameter;

A second candidate data obtaining module 903, configured to obtain second candidate paging data according to the paging parameter;

The paging data obtaining module 904 is configured to obtain target paging data from the first candidate paging data and the second candidate paging data according to the paging parameter.

Further, the parameter acquisition module 901 is also used for:

Receive paging data requests;

The paging parameter is obtained by parsing the paging data request.

Further, the paging parameters include: one or more of a flag bit, a fragment size, filtering information and an offset; wherein the flag bit represents the start position of the page data in the page data list; the fragment size Indicates the quantity of the target paging data; the filtering information represents the information required for filtering the paging data; the offset represents the quantity of the acquired target paging data.

Further, the first candidate data acquisition module 902 is also used for:

Get a list of page data;

According to the flag bit and the filtering information, the page data of the fragment size is obtained from the page data list as the first candidate page data.

Further, the first candidate data acquisition module 902 is also used for:

generating filter conditions according to the filter information;

Determine the starting position of the paging data in the page data list according to the flag bit;

According to the filter condition, the page data of the fragment size is acquired from the start position of the page data in the page data list as the first candidate page data.

Further, the first candidate data acquisition module 902 is also used for:

Initialize the paging window;

Acquire paging data from the starting position of the paging data in the page data list according to the filter condition until the size of the paging window is equal to the size of the fragment;

The paging data in the paging window is used as the first candidate paging data.

Further, the first candidate paging data includes:

Paging data that does not meet the filter conditions and paging data that does not meet the insertion conditions.

Further, the second candidate data acquisition module 903 is also used for:

generating filter conditions according to the filter information;

Get at least one paged data that meets the strong insertion condition;

The page data that does not meet the filtering condition is obtained from the at least one page data that meets the strong insertion condition as the second candidate page data.

Further, wherein the paging parameter includes the fragment size, and the paging data acquisition module 904 is further used for:

Obtain the insertion position of the second candidate paging data;

Inserting the second candidate paging data into the first candidate paging data according to the insertion position to obtain candidate paging data;

The target page data is cut out from the candidate page data according to the fragment size.

Further, the paging data acquisition device 900 is also used for:

The apparatus shown in FIG. 9 may execute the method of the embodiment shown in FIG. 1 to FIG. 8 . For parts not described in detail in this embodiment, reference may be made to the related description of the embodiment shown in FIG. 1 to FIG. 8 . For the execution process and technical effects of the technical solution, refer to the descriptions in the embodiments shown in FIG. 1 to FIG. 8 , which will not be repeated here.

Referring next to FIG. 10 , it shows a schematic structural diagram of an electronic device 1000 suitable for implementing an embodiment of the present disclosure. Terminal devices in the embodiments of the present disclosure may include, but are not limited to, such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablets), PMPs (portable multimedia players), vehicle-mounted terminals (eg, mobile terminals such as in-vehicle navigation terminals), etc., and stationary terminals such as digital TVs, desktop computers, and the like. The electronic device shown in FIG. 10 is only an example, and should not impose any limitation on the function and scope of use of the embodiments of the present disclosure.

As shown in FIG. 10, an electronic device 1000 may include a processing device (eg, a central processing unit, a graphics processor, etc.) 1001, which may be loaded into random access according to a program stored in a read only memory (ROM) 1002 or from a storage device 1008 Various appropriate operations and processes are executed by the programs in the memory (RAM) 1003 . In the RAM 1003, various programs and data necessary for the operation of the electronic device 1000 are also stored. The processing device 1001, the ROM 1002, and the RAM 1003 are connected to each other through a bus 1004. An input/output (I/O) interface 1005 is also connected to the bus 1004 .

Typically, the following devices can be connected to the I/O interface 1005: input devices 1006 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; including, for example, a liquid crystal display (LCD), speakers, vibration An output device 1007 such as a computer; a storage device 1008 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009 . The communication means 1009 may allow the electronic device 1000 to communicate wirelessly or by wire with other devices to exchange data. While FIG. 10 shows electronic device 1000 having various means, it should be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided.

In particular, according to embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a non-transitory computer readable medium, the computer program containing program code for performing the method illustrated in the flowchart. In such an embodiment, the computer program may be downloaded and installed from the network via the communication device 1009, or from the storage device 1008, or from the ROM 1002. When the computer program is executed by the processing apparatus 1001, the above-mentioned functions defined in the methods of the embodiments of the present disclosure are executed.

It should be noted that the computer-readable medium mentioned above in the present disclosure may be a computer-readable signal medium or a computer-readable storage medium, or any combination of the above two. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus or device, or a combination of any of the above. More specific examples of computer readable storage media may include, but are not limited to, electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable Programmable read only memory (EPROM or flash memory), fiber optics, portable compact disk read only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing. In this disclosure, a computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In the present disclosure, however, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code therein. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device . Program code embodied on a computer readable medium may be transmitted using any suitable medium including, but not limited to, electrical wire, optical fiber cable, RF (radio frequency), etc., or any suitable combination of the foregoing.

In some embodiments, the client and server can use any currently known or future developed network protocol such as HTTP (HyperText Transfer Protocol) to communicate, and can communicate with digital data in any form or medium Communication (eg, a communication network) interconnects. Examples of communication networks include local area networks ("LAN"), wide area networks ("WAN"), the Internet (eg, the Internet), and peer-to-peer networks (eg, ad hoc peer-to-peer networks), as well as any currently known or future development network of.

The above-mentioned computer-readable medium may be included in the above-mentioned electronic device; or may exist alone without being assembled into the electronic device.

The computer-readable medium carries one or more programs, and when the one or more programs are executed by the electronic device, the electronic device: executes the method for acquiring paging data in the foregoing embodiment.

Computer program code for performing operations of the present disclosure may be written in one or more programming languages, including but not limited to object-oriented programming languages—such as Java, Smalltalk, C++, and This includes conventional procedural programming languages - such as the "C" language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer, or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (eg, using an Internet service provider through Internet connection).

The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code that contains one or more logical functions for implementing the specified functions executable instructions. It should also be noted that, in some alternative implementations, the functions noted in the blocks may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It is also noted that each block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations, can be implemented in dedicated hardware-based systems that perform the specified functions or operations , or can be implemented in a combination of dedicated hardware and computer instructions.

The units involved in the embodiments of the present disclosure may be implemented in a software manner, and may also be implemented in a hardware manner. Among them, the name of the unit does not constitute a limitation of the unit itself under certain circumstances.

The functions described herein above may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), Systems on Chips (SOCs), Complex Programmable Logical Devices (CPLDs) and more.

In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in connection with the instruction execution system, apparatus or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. Machine-readable media may include, but are not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or devices, or any suitable combination of the foregoing. More specific examples of machine-readable storage media would include one or more wire-based electrical connections, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable programmable read only memory (EPROM or flash memory), fiber optics, compact disk read only memory (CD-ROM), optical storage, magnetic storage, or any suitable combination of the foregoing.

According to one or more embodiments of the present disclosure, a method for acquiring paging data is provided, including:

Get paging parameters;

Obtain the first candidate paging data according to the paging parameter;

Acquire second candidate paging data according to the paging parameter;

Further, the obtaining paging parameters includes:

Receive paging data requests;

The paging parameter is obtained by parsing the paging data request.

Further, the paging parameter includes the flag bit and the filtering information, and the obtaining the first candidate paging data according to the paging parameter includes:

Get a list of page data;

Further, according to the flag bit and the filtering information, the page data of the fragment size obtained from the page data list is used as the first candidate page data, including:

generating filter conditions according to the filter information;

Further, the obtaining, according to the filter condition, the paging data of the fragment size from the starting position of the paging data in the page data list as the first candidate paging data, includes:

Initialize the paging window;

Further, the first candidate paging data includes:

Further, obtaining the second candidate paging data according to the paging parameter includes:

generating filter conditions according to the filter information;

Get at least one paged data that meets the strong insertion condition;

The page data that does not satisfy the filtering condition is obtained from the at least one page data that meets the strong insertion condition as the second candidate page data.

Further, the paging parameter includes a fragment size, and the obtaining target paging data from the first candidate paging data and the second candidate paging data according to the paging parameter includes:

Obtain the insertion position of the second candidate paging data;

Further, the method also includes:

According to one or more embodiments of the present disclosure, an apparatus for acquiring paging data is provided, including:

Parameter obtaining module, used to obtain paging parameters;

Further, the parameter acquisition module is also used for:

Receive paging data requests;

The paging parameter is obtained by parsing the paging data request.

Further, the first candidate data acquisition module is also used for:

Get a list of page data;

Further, the first candidate data acquisition module is also used for:

generating filter conditions according to the filter information;

Further, the first candidate data acquisition module is also used for:

Initialize the paging window;

Further, the first candidate paging data includes:

Further, the second candidate data acquisition module is also used for:

generating filter conditions according to the filter information;

Get at least one paged data that meets the strong insertion condition;

Further, wherein the paging parameter includes a fragment size, and the paging data acquisition module is further used for:

Obtain the insertion position of the second candidate paging data;

Further, the paging data acquisition device is also used for:

According to one or more embodiments of the present disclosure, there is provided an electronic device, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores data that can be accessed by the at least one processor Instructions executed by at least one processor, the instructions being executed by the at least one processor, so that the at least one processor can execute any one of the methods for obtaining paging data in the foregoing first aspect.

According to one or more embodiments of the present disclosure, a non-transitory computer-readable storage medium is provided, wherein the non-transitory computer-readable storage medium stores computer instructions for causing a computer to execute the foregoing Any one of the method for obtaining paging data in the first aspect.

The above description is merely a preferred embodiment of the present disclosure and an illustration of the technical principles employed. Those skilled in the art should understand that the scope of the disclosure involved in the present disclosure is not limited to the technical solutions formed by the specific combination of the above-mentioned technical features, and should also cover, without departing from the above-mentioned disclosed concept, the technical solutions formed by the above-mentioned technical features or Other technical solutions formed by any combination of its equivalent features. For example, a technical solution is formed by replacing the above features with the technical features disclosed in the present disclosure (but not limited to) with similar functions.

Claims

A method for obtaining paging data, comprising:

Get paging parameters;

Obtain the first candidate paging data according to the paging parameter;

Acquire second candidate paging data according to the paging parameter;

Target paging data is obtained from the first candidate paging data and the second candidate paging data according to the paging parameter.
The method for obtaining paging data according to claim 1, wherein the obtaining paging parameters comprises:

Receive paging data requests;

The paging parameter is obtained by parsing the paging data request.
The method for obtaining paging data according to any one of claims 1 or 2, wherein the paging parameters include: one or more of a flag bit, a fragment size, filtering information, and an offset; The flag bit represents the starting position of the paging data in the page data list; the fragment size represents the quantity of the target paging data; the filtering information represents the information required to filter the paging data; the offset represents the acquired data The amount of target paginated data.
The method for obtaining paging data according to claim 3, wherein the paging parameter includes the flag bit and the filtering information, and the obtaining the first candidate paging data according to the paging parameter comprises:

Get the page data list;

According to the flag bit and the filtering information, the page data of the fragment size is obtained from the page data list as the first candidate page data.
The method for obtaining paging data according to claim 4, characterized in that, according to the flag bit and the filtering information, the paging data of the fragment size is obtained from the page data list as the first candidate paging data ,include:

generating filter conditions according to the filter information;

Determine the starting position of the paging data in the page data list according to the flag bit;

According to the filter condition, the page data of the fragment size is acquired from the start position of the page data in the page data list as the first candidate page data.
The method for obtaining paging data according to claim 5, wherein, according to the filtering condition, the paging data of the size of the fragment is obtained from the starting position of the paging data in the page data list as the first A candidate paging data, including:

Initialize the paging window;

Acquire paging data from the starting position of the paging data in the page data list according to the filter condition until the size of the paging window is equal to the size of the fragment;

The paging data in the paging window is used as the first candidate paging data.
The method for obtaining paging data according to claim 5, wherein the first candidate paging data comprises:

The paged data that does not meet the filtering conditions and the paged data that do not meet the strong insertion conditions.
The method for obtaining paging data according to claim 3, wherein the obtaining the second candidate paging data according to the paging parameter comprises:

generating filter conditions according to the filter information;

Get at least one paged data that meets the strong insertion condition;

The page data that does not satisfy the filtering condition is obtained from the at least one page data that meets the strong insertion condition as the second candidate page data.
The method for obtaining paging data according to claim 3, wherein the paging parameter includes the fragment size, and the paging parameter is obtained from the first candidate paging data and the second candidate paging data according to the paging parameter Target paginated data, including:

Obtain the insertion position of the second candidate paging data;

Inserting the second candidate paging data into the first candidate paging data according to the insertion position to obtain candidate paging data;

The target page data is cut out from the candidate page data according to the fragment size.
The method for obtaining paging data according to claim 1, wherein the method further comprises:

The flag bit in the paging parameter is updated according to the target paging data.
A device for obtaining paging data, comprising:

Parameter obtaining module, used to obtain paging parameters;

a first candidate data acquisition module, configured to acquire the first candidate paging data according to the paging parameter;

A second candidate data obtaining module, configured to obtain second candidate paging data according to the paging parameter;

A paging data acquisition module, configured to obtain target paging data from the first candidate paging data and the second candidate paging data according to the paging parameter.
An electronic device comprising:

memory for storing computer-readable instructions; and

A processor for executing the computer-readable instructions such that the processor, when executed, implements the method according to any one of claims 1-10.
A non-transitory computer-readable storage medium for storing computer-readable instructions that, when executed by a computer, cause the computer to perform the method of any one of claims 1-10.