A data table processing method and device, a storage medium and an apparatus

Abstract

Embodiments of the present application disclose a data table processing method and device, a storage medium and equipment. The method comprises: obtaining a first update operation task associated with a first data region of a target data table; splitting the first data region to obtain a first visible sub-region and a first non-visible sub-region; updating data content in the first visible sub-region according to the first update operation task; if the data content in the first visible sub-region has been updated completely and a second update operation task associated with a second data region of the target data table is obtained, merging the second data region and the first non-visible sub-region to obtain a to-be-updated region of the target data table; and updating data content in the to-be-updated region according to the first update operation task and the second update operation task. Through the present application, the probability of data table freezing during updating can be reduced, and the updating efficiency of the data table can be improved.

Description

Technical Field

[0001] This application relates to the field of computer technology, and more particularly to a data table processing method, apparatus, storage medium, and device. Background Technology

[0002] With the development of computer technology, spreadsheets have become a commonly used data processing tool. Users frequently use spreadsheets for data statistics and collection, especially in the fields of management and statistics, where they offer significant convenience in data organization. For example, businesses can use spreadsheets to collect revenue information over a period of time, or students can use them to collect weekly class schedules. However, currently, updating data in spreadsheets is prone to issues such as slowdowns, resulting in relatively low update efficiency. Summary of the Invention

[0003] The technical problem to be solved by the embodiments of this application is to provide a data table processing method, apparatus, storage medium and device to reduce the probability of data table lag during the update process and improve the update efficiency of data table.

[0004] One embodiment of this application provides a data table processing method, including:

[0005] Retrieve the first update operation task associated with the first data area of ​​the target data table;

[0006] If the first data region includes both visible and invisible data content in the target data table, then the first data region is split into a first visible sub-region including visible data content and a first non-visible sub-region including invisible data content.

[0007] Update the data content within the first visible sub-area according to the first update operation task;

[0008] If a second update operation task associated with the second data area of ​​the target data table is obtained, the second data area and the first non-visible sub-area are merged to obtain the area of ​​the target data table to be updated.

[0009] When the data content in the first visible sub-area has been updated, the data content in the area to be updated is updated according to the first update operation task and the second update operation task.

[0010] One embodiment of this application provides a data table processing apparatus, including:

[0011] The acquisition module is used to acquire the first update operation task associated with the first data area of ​​the target data table;

[0012] The splitting module is used to split the first data region into a first visible sub-region that includes the visible data content and the invisible data content in the target data table if the first data region includes the visible data content and the invisible data content in the target data table.

[0013] The first update module is used to update the data content within the first visible sub-area according to the first update operation task;

[0014] The merging module is used to merge the second data area and the first non-visible sub-area if a second update operation task associated with the second data area of ​​the target data table is obtained, so as to obtain the area to be updated of the target data table.

[0015] The second update module is used to update the data content in the area to be updated according to the first update operation task and the second update operation task when the data content in the first visible sub-area has been updated.

[0016] One embodiment of this application provides a computer device, including: a processor and a memory;

[0017] The processor is connected to a memory, which stores a computer program. When the computer program is executed by the processor, it causes the computer device to perform the method provided in the embodiments of this application.

[0018] One aspect of this application provides a computer-readable storage medium storing a computer program adapted to be loaded and executed by a processor, so that a computer device having the processor performs the method provided in this application.

[0019] One embodiment of this application provides a computer program product or computer program, which includes computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium and executes the computer instructions, causing the computer device to perform the method provided in this application embodiment.

[0020] In this embodiment, the data content within the first visible sub-region is updated first, and then the data content within the area to be updated is updated. This reduces the amount of data that needs to be updated in a single update, lowers the probability of data table lag, and improves the smoothness and efficiency of data table updates. The area to be updated is obtained by merging the first non-visible sub-region and the second data region corresponding to the second update operation task. By merging the first non-visible sub-region and the second data region corresponding to the second update operation task, the number of updates and the amount of computation for the target data table can be reduced, thereby improving the update efficiency of the target data table. The first visible sub-region and the first non-visible sub-region are obtained by splitting the first data region corresponding to the first update operation task. Splitting the first data region corresponding to the first update operation task facilitates updating the data content within the first visible sub-region and the data content within the first non-visible sub-region separately. Meanwhile, during the process of updating the data content in the first visible sub-region or the first non-visible sub-region, it is not necessary to scan the entire data content in the target data table to determine whether the data content in the first visible sub-region or the first non-visible sub-region has been updated, thereby reducing the consumption of computing resources during the data table update process and improving the efficiency of the data table update. Attached Figure Description

[0021] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0022] Figure 1 This is a schematic diagram of the architecture of a data table processing system provided in an embodiment of this application;

[0023] Figure 2 This is a schematic diagram illustrating an application scenario of data table processing provided in an embodiment of this application;

[0024] Figure 3 This is a flowchart illustrating a data table processing method provided in an embodiment of this application;

[0025] Figure 4 This is a schematic diagram of a region segmentation provided in an embodiment of this application;

[0026] Figure 5 This is a schematic diagram illustrating a data table update provided in an embodiment of this application;

[0027] Figure 6This is a schematic diagram illustrating a data table update provided in an embodiment of this application;

[0028] Figure 7 This is a schematic diagram illustrating the determination of the area to be updated according to an embodiment of this application;

[0029] Figure 8 This is a schematic diagram illustrating the updating of an area to be updated, provided in an embodiment of this application.

[0030] Figure 9 This is a schematic diagram illustrating the updating of an area to be updated, provided in an embodiment of this application.

[0031] Figure 10 This is a schematic diagram of a region update in a data table management area provided in an embodiment of this application;

[0032] Figure 11 This is a schematic diagram illustrating a data table update provided in an embodiment of this application;

[0033] Figure 12 This is a flowchart illustrating a data table processing method provided in an embodiment of this application;

[0034] Figure 13 This is a schematic diagram of the structure of a data table processing device provided in an embodiment of this application;

[0035] Figure 14 This is a schematic diagram of the structure of a computer device provided in an embodiment of this application. Detailed Implementation

[0036] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0037] Please see Figure 1 , Figure 1 This is a schematic diagram of the structure of a data table processing system provided in an embodiment of this application. For example... Figure 1 As shown, the data processing system may include server 10 and a user terminal cluster. The user terminal cluster may include one or more user terminals; the number of user terminals is not limited here. Figure 1 As shown, it can specifically include user terminal 100a, user terminal 100b, user terminal 100c, ..., user terminal 100n. Figure 1As shown, user terminals 100a, 100b, 100c, ..., 100n can each connect to the server 10 via a network, so that each user terminal can interact with the server 10 through the network connection.

[0038] Each user terminal in this user terminal cluster can include: smartphones, tablets, laptops, desktop computers, wearable devices, smart home devices, head-mounted devices, in-vehicle terminals, and other intelligent terminals with data table processing capabilities. It should be understood that, for example... Figure 1 Each user terminal in the user terminal cluster shown can have an application client installed. When the application client runs on each user terminal, it can interact with the aforementioned... Figure 1 Data interaction occurs between the servers 10 shown. The application clients here can include applications capable of displaying data tables, such as applets, web pages, or applications associated with the data tables.

[0039] Understandably, a data table is a type of spreadsheet in a database. It uses data fields to describe the subject information or value range of a row of data records, or the data fields to describe the subject information or value range of a column of data records, providing a well-organized data structure. A data table includes data content, which includes data records and data fields. The data content also includes metadata (such as the data table ID and data table identifier), and data fields are used to describe the subject information or value range of data records. In one embodiment, data fields in a data table can be arranged in rows, meaning all data fields are arranged in the same row. In this case, a data field in the data table describes the subject information or value range of the data records in the column containing that data field. In another embodiment, data fields in a data table can be arranged in columns, meaning all data fields are arranged in the same column. In this case, a data field in the data table describes the subject information or value range of the data records in the row containing that data field. Understandably, data records and data fields in a data table can also be arranged in other ways, and this application does not limit this arrangement.

[0040] Among them, such as Figure 1 As shown, the server 10 can be an independent physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms.

[0041] For ease of understanding, the embodiments of this application may be described in detail below. Figure 1One user terminal is selected from the multiple user terminals shown as the target user terminal. For example, for ease of understanding, embodiments of this application can... Figure 1 The user terminal 100a shown is the target user terminal. When the target user performs a first update operation task associated with a first data area in the target data table, the target user terminal can obtain the first update operation task associated with the first data area in the target data table. This first update operation task can refer to adjusting the row height and column width of the target data table, adjusting the content of the cell table in the target data table, adjusting the table lines in the target data table, etc. The first data area refers to the area of ​​the target data table affected by the first update operation task. If the first data area includes data content in a visible state and data content in an invisible state, then the first data area is split to obtain a first visible sub-area including data content in a visible state and a first non-visible sub-area including data content in an invisible state. Further, the target user terminal can update the data content in the first visible sub-area according to the first update operation task, that is, calculate the data content in the first visible sub-area according to the first update operation task and convert the data content in the first visible sub-area into data content that can be directly rendered and displayed by the rendering layer. After the target user terminal updates the data content within the first visible sub-region, the updated data content within the first visible sub-region can be directly displayed in the table display interface. This means that when the first data region includes a first visible sub-region containing visible data content, the data content within that sub-region is updated immediately. This reduces lag caused by rendering calculations when the target data table changes, allowing for quick display of the updated data content in the target data table in the table display interface, improving the efficiency of target data table updates, and enhancing the user experience.

[0042] Furthermore, the target user terminal can detect whether it has also obtained a second update operation task associated with the second data area of ​​the target data table. This second update operation task can refer to adjusting the row height and column width of the target data table, adjusting the content of a cell table in the target data table, or adjusting the table lines in the target data table, etc. The second data area can be any area within the target data table, and can be the same as or different from the first data area. If the target user terminal obtains a second update operation task associated with the second data area of ​​the target data table, the target user terminal can send the second data area and the first non-visible sub-area to the server. The server can merge the second data area and the first non-visible sub-area to obtain the area to be updated in the target data table. When the data content within the first visible sub-area has been updated, the area to be updated is returned to the target user terminal, which can then update the data content within the area to be updated according to the first and second update operation tasks. In this way, when a second update operation task associated with the second data area of ​​the target data table is also obtained, the second data area and the first non-visible sub-area are merged, which can reduce the number of updates and the amount of update calculations for the target data table, thereby improving the update efficiency of the target data table.

[0043] For better understanding, please refer to [link / reference]. Figure 2 , Figure 2 This is a schematic diagram illustrating an application scenario for data table processing provided in an embodiment of this application. Wherein, as... Figure 2 The server 20j shown can be the same as the server 10 mentioned above, such as... Figure 2 The target user terminal 20a shown can be the one described above. Figure 1 Any user terminal in the user terminal cluster shown, for example, target user terminal 20a can be the aforementioned user terminal 100b. Figure 2 As shown, when target user 20b performs an operation task to increase the column width of columns 3 and 4 in target data table 20c by 2 cm, target user terminal 20a can obtain the operation task to increase the column width of columns 3 and 4 in target data table 20c by 2 cm. At this time, the area corresponding to columns 3 and 4 in the target data table is the first data area, that is... Figure 2 In the data range 20d, the first update operation task is to increase the column width of columns 3 and 4 by 2 cm. For example... Figure 2As shown, the first data area 20d includes data content 20e in a visible state and data content 20f in an invisible state in the target data table 20c. The target user terminal 20a can execute step 1 to split the first data area 20d to obtain a first visible sub-area 20g including data content in a visible state and a first non-visible sub-area 20h including data content in an invisible state.

[0044] Furthermore, the target user terminal 20a can execute step 2, updating the first visible sub-region 20g according to the first update operation task, that is, increasing the column width of the 3rd and 4th columns in the target data table that are in a visible state by 2 cm, to obtain the updated first visible sub-region 20i. After obtaining the updated first visible sub-region 20i, the target user terminal 20a can immediately display the data content within the updated first visible sub-region 20i on the table display interface, as well as displaying the other visible data content in the target data table besides the data content within the first visible sub-region 20i. In this way, the target user terminal 20a can quickly display the updated data content within the first visible sub-region, allowing the target user 20b to quickly view the updated data content within the first visible sub-region, reducing the amount of data updated in a single update process, reducing the probability of the target data table experiencing lag, and improving the user experience. At the same time, the target user terminal 20a can execute step 3, sending the first non-visible sub-region to the server 20j. If the target user terminal 20a also receives an operation task to shorten the column width of columns 3 and 4 by 2 cm, then the second data area is columns 3 and 4 of the target data table, and the second update operation task is to shorten the column width of columns 3 and 4 by 2 cm. The target user terminal 20a can execute step 4, sending the second data area to the server 20j. The server 20j can execute step 5, merging the first non-visible sub-area and the second data area to obtain the area to be updated. At this time, the area to be updated is columns 3 and 4, i.e. Figure 2 Data area 20d in the middle.

[0045] Further, when the data content within the first visible sub-region is updated, server 20j can execute step 6, returning the area to be updated to target user terminal 20a. Target user terminal 20a can execute step 7, updating the area to be updated according to the first update operation task (i.e., increasing the column width of columns 3 and 4 by 2 cm) and the second update operation task (i.e., shortening the column width of columns 3 and 4 by 2 cm). It is understood that since the second data region also includes both visible and invisible data content, target user terminal 20a can shorten the column width of visible columns 3 and 4 in the target data table by 2 cm according to the second update operation task. Simultaneously, columns 3 and 4 in the target data table that are invisible require the execution of both the first and second update operation tasks, which can cancel each other out. Therefore, no update operation task needs to be performed on columns 3 and 4 in the target data table to obtain the updated target data table 20k. This demonstrates that significantly reducing the computational load of updates improves the efficiency of updating the target data table. It also allows for the rapid display of the updated data content in the target data table to the target user, enabling faster interaction and enhancing the user experience.

[0046] Please see Figure 3 , Figure 3 This is a flowchart illustrating a data table processing method provided in an embodiment of this application. This data table processing method can be... Figure 1 It can be executed by any user terminal in the system, or by... Figure 1 The server in the middle can be used to execute it, or it can be executed by... Figure 1 The method can be executed jointly by any user terminal and server in this application, and the device used to execute the method in this application can be collectively referred to as a computer device. For example... Figure 3 As shown, the data table processing method may include, but is not limited to, the following steps:

[0047] S101, Obtain the first update operation task associated with the first data area of ​​the target data table.

[0048] Specifically, the target user can edit and update the data content in the target data table. When the target user triggers a first update operation task associated with a first data area in the target data table, the computer device can obtain the first update operation task associated with that first data area. The first data area can be any area in the target data table, or it can refer to all areas of the target data table. The first update operation task can be adjusting the row height and column width of the target data table, adjusting the content of a cell table in the target data table, or adjusting the table lines in the target data table, etc. The computer device can specifically determine the first data area in the target data table targeted by the first update operation task at the row and column level. This allows for computational control down to the cell table level, significantly reducing computational load, avoiding redundant calculations, facilitating subsequent rapid updates to the first data area, and improving the update efficiency of the target data table.

[0049] It is understood that the data table in this application can refer to a collaborative data table or a non-collaborative data table. A collaborative data table refers to a data table that supports at least two users simultaneously performing update operations online, while a non-collaborative data table refers to a data table that supports one user simultaneously performing update operations online. The first update operation task and the second update operation task in this application can be generated by the terminal itself or by a collaborative terminal. For example, if the computer device in this application is terminal A, and the target data table is a non-collaborative data table, then the first update operation task and the second update operation task can be generated by terminal A based on the user performing update operations on the target data table on terminal A; if the target data table is a collaborative data table, then the first update operation task and the second update operation task can be generated by terminal A based on the user performing update operations on the target data table on terminal A, or the first update operation task and the second update operation task can be sent to terminal A by a collaborative terminal, which refers to a terminal other than terminal A among the terminals that have editing permissions for the target data table.

[0050] S102, if the first data region includes data content in a visible state and data content in an invisible state in the target data table, then the first data region is split to obtain a first visible sub-region including data content in a visible state and a first non-visible sub-region including data content in an invisible state.

[0051] Specifically, if the first data area only includes visible data, the computer device can immediately update the first data area according to the first update operation task. If the first data area only includes invisible data, the computer device can determine whether there are other pending tasks in the terminal. If there are no other pending tasks, the computer device can immediately update the data content in the first data area according to the first update operation task. If there are other pending tasks, the computer device can execute the pending tasks sequentially according to their respective execution priorities, and then update the data content in the first data area according to the first update operation task. If the first data area includes both visible and invisible data in the target data table, the computer device can split the first data area into a first visible sub-area including visible data and a first non-visible sub-area including invisible data. Understandably, computer devices can divide the area containing visible data within the first data area into a first visible sub-area, and the area containing invisible data within the first data area into a first non-visible sub-area. Visible data refers to data that the target user can see in the table display interface, while invisible data refers to data that the target user cannot see in the table display. By splitting the first data area into a first visible sub-area and a second non-visible sub-area, it is beneficial to update the data content in the first visible sub-area and the data content in the second non-visible sub-area asynchronously. Asynchronous updates here mean that the data content in the first visible sub-area is updated first, and the data content in the first non-visible sub-area is updated only after the data content in the visible sub-area has been updated. This reduces the amount of data updated in a single update, lowers the probability of data table lag, and improves the efficiency of data table updates.

[0052] In this application, the data content displayed in the target data table on the data table platform's display interface is referred to as the visible data content, and the area containing the visible data content in the target data table is called the visible area. In other words, the visible data content refers to the data content that can currently be seen by the user. The data content in the target data table not displayed in the data table platform's display interface is referred to as the invisible data content, and the area containing the invisible data content in the target data table is called the non-visible area. In other words, the invisible data content refers to the data content that cannot currently be seen by the user. The size of the visible and non-visible areas can be determined based on the size of the display interface used to display the target data table and the scaling factor of the target data table. The visible and non-visible areas of the target data table change dynamically with the user's touch operation on the target data table. Specifically, in this application, the first data area is the area used by the first update operation task, the first visible sub-area is the area containing the visible data content in the first data area, and the first non-visible sub-area is the area containing the non-visible data content in the first data area. The first visible sub-region can refer to a sub-region within the visible area of ​​the target data table, and the first non-visible sub-region can refer to a sub-region within the non-visible area of ​​the target data table.

[0053] For example, suppose the target data table has 1000 rows and 50 columns. The data content of each row from row 1 to row 50 is displayed in the data table platform's interface, while the data content of each row from row 51 to row 1000 is not displayed. In this case, the data content in the target data table whose row identifiers are both in the range [1,50] and column identifiers are both in the range [1,50] is considered visible, and the area formed by this data content is called the visible area of ​​the target data table. Conversely, the data content in the target data table whose row identifiers are both in the range [51,1000] and column identifiers are both in the range [1,50] is considered invisible, and the area formed by this data content is called the non-visible area of ​​the target data table. Assuming the first update operation task is to adjust the column width of the 3rd column of the target data table, then the first data area is the area consisting of data in the target data table whose row identifier is in the range [1, 1000] and whose column identifier is 3. The first visible sub-area is the area consisting of data in the target data table whose row identifier is in the range [1, 50] and whose column identifier is 3. The first non-visible sub-area is the area consisting of data in the target data table whose row identifier is in the range [51, 1000] and whose column identifier is 3. It can be seen that the first visible sub-area belongs to the visible area of ​​the target data table, and the size of the first visible sub-area is smaller than the size of the visible area of ​​the target data table; that is, the first visible sub-area is a sub-area of ​​the visible area of ​​the target data table. Similarly, the first non-visible sub-area belongs to the non-visible area of ​​the target data table, and the size of the first non-visible sub-area is smaller than the size of the non-visible area of ​​the target data table; that is, the first non-visible sub-area is a sub-area of ​​the non-visible area of ​​the target data table. Specifically, when the scope of the first update operation task is the visible area of ​​the target data table, the first visible sub-area can refer to the visible area of ​​the target data table, and the first non-visible sub-area can refer to the visible area of ​​the target data table.

[0054] like Figure 4 As shown, Figure 4 This is a schematic diagram of a region segmentation provided in an embodiment of this application, such as... Figure 4 As shown, when a target user wants to shorten the column width of columns 3 and 4 in a target data table by 3 centimeters, the computer device can obtain the target user's adjustment operation on columns 3 and 4 in the target data table, define the area corresponding to columns 3 and 4 in the target data table as the first data area 40a, and define the task of shortening the column width of the first data area 40a by 3 centimeters as the first update operation task associated with the first data area 40a. Figure 4As shown, the first data area includes data content 40b in a visible state and data content 40c in an invisible state. The computer device can divide the first data area to obtain a first visible sub-region containing visible data content and a first non-visible sub-region containing invisible data content. For example... Figure 4 As shown, the column range of the first visible sub-region is from column 3 to column 4, and the row range is from row 1 to row 4; the column range of the first non-visible sub-region is from column 3 to column 4, and the row range is from row 5 to row 11.

[0055] S103, update the data content within the first visible sub-area according to the first update operation task.

[0056] Specifically, the computer device splits the first data area into a first visible sub-area, which includes data content that is visible. Then, it updates the data content within the first visible sub-area according to the first update operation task, resulting in the updated data content within the first visible sub-area. This allows the computer device to quickly display the updated data content within the first visible sub-area, enabling the target user to quickly view the updated target data table, reducing lag caused by updates and improving the user experience.

[0057] Optionally, the computer device can obtain the operation type of the first update operation task. This operation type may include row operation type, column operation type, cell table operation type, border line operation type, etc. Based on the operation type of the first update operation task, the computer device can determine Q cell tables associated with the first update operation task in the first visible sub-region, where Q is a positive integer, such as Q can take values ​​of 1, 23, ... For example, if the operation type of the first update operation task is a replacement operation for data content in a cell table, the computer device can determine the cell tables to be replaced in the first visible sub-region as Q cell tables, and replace the data content in the Q cell tables according to the first update operation task. For example, if the operation type of the first update operation task is a row height adjustment type, the computer device can obtain the target row affected by the first update operation task, determine the cell tables in the first visible sub-region whose row identifiers are the same as the row identifiers of the target row as Q cell tables, and adjust the row height of the Q cell tables according to the first update operation task. In this way, only Q cell tables are updated, reducing the amount of updates and thus improving the update efficiency of the target data table.

[0058] Specifically, the computer device can also identify associated cell tables in the target data that are related to the first update operation task, and update these associated cell tables. These associated cell tables refer to cell tables whose data content has changed due to the first update operation task. For example, if the first update operation task is to add data to cell table A1 in the target data table, and cell table A1 does not have automatic line wrapping, when updating cell table A1 according to the first update operation task, if the updated data content exceeds the width of cell table A1, the content will be expanded to the blank cell table in the alignment direction according to the table alignment of cell table A1. The expanded cell table will be identified as the associated cell table, and the table line between cell table A1 and the expanded cell table will be removed. If cell table A1 does not have automatic line wrapping, when updating cell table A1 according to the first update operation task, if the updated data content exceeds the width of cell table A1, it will automatically wrap, thus changing the row width of the row containing cell table A1. Therefore, the computer device can treat other cell tables in the same row as cell table A1 as related cell tables and update the row width of the related cell tables.

[0059] like Figure 5 As shown, Figure 5 This is a schematic diagram of a data table update provided in an embodiment of this application. As shown in Figure 5, taking a cell table in the target data table that has automatic line wrapping and does not have a fixed row height as an example, when a target user adds data content to cell table 50a, the computer device can determine the area where cell table 50a is located as the first data area and determine the task of adding data content to cell table 50a as the first update operation task. The computer device can update cell table 50a according to the first update operation task, that is, add data content to cell table 50a. Since the cell table in the target data table has automatic line wrapping and no fixed height, when the content added by the target user exceeds the original row height of cell table 50a, the row height of cell table 50a will be increased to display the data content added by the target user. Furthermore, when the row height of cell table 50a is increased, the row height of the row containing cell table 50a also needs to be increased. Therefore, the computer device can obtain the cell table with the same row identifier as cell table 50a from the target data table, and use it as the associated cell table for the first update operation task. The row height of the associated cell table is set to the same row height as that of cell table 50a. That is, the computer device can set the row height of all cell tables in row 50b to the same height.

[0060] like Figure 6 As shown, Figure 6This is a schematic diagram of a data table update provided in an embodiment of this application. As shown in Figure 6, taking the example that the cell tables in the target data table do not have automatic line wrapping, when the target user adds data content to cell tables 60a and 60b, the computer device can determine the area where cell table 60a and cell table 60b are located as the first data area, and determine the task of adding data content to cell tables 60a and 60b as the first update operation task associated with the first data area. The computer device can update the data content in cell table 60a according to the first update operation task to obtain the updated cell table 60c, and update the data content in cell table 60b according to the first update operation task to obtain the updated cell table 60d, that is, adding data content to cell tables 60a and 60b. Since the cell tables in the target data table do not have automatic line wrapping, when adding data content to cell tables 60a and 60b, if the added data content exceeds the column width of the current cell table, the computer device can obtain the table alignment of cell tables 60a and 60b. like Figure 6 As shown, if the table alignment of cell tables 60a and 60b is centered, then the blank cell tables following cell tables 60a and 60b are retrieved as associated cell tables. The computer device can expand the data exceeding the limits of cell tables 60a and 60b to the associated cell tables based on the data added by the target user to cell tables 60a and 60b. For example... Figure 6 As shown, the data content in the updated cell table 60c covers the area of ​​the cell table following cell table 60a, and the data content in the updated cell table 60d covers the areas of the two cell tables following cell table 60b. Simultaneously, the computer device can remove the covered table lines.

[0061] S104, if a second update operation task associated with the second data area of ​​the target data table is obtained, the second data area and the first non-visible sub-area are merged to obtain the area to be updated of the target data table.

[0062] Specifically, after the computer device updates the data content within the first visible sub-area, it can detect whether a second update operation task associated with the second data area of ​​the target data table still exists. The first data area can be any area within the target data table, or it can be the entire target data table. It can also be the same as or different from the first data area. The second data area is the area on which the second update operation task operates within the target data table. Similarly, the second update operation task can refer to adjusting the row height and column width of the target data table, adjusting the content of a cell in the target data table, or adjusting the table lines in the target data table, etc. The triggering time of the second update operation task can be later than the first update operation task. For example, the second update operation task can be an update operation task triggered on the second data area of ​​the target data table after the target user triggers the first update operation task. In this case, the second data area can include data content that is visible or invisible.

[0063] The second update operation task can be triggered earlier than the first update operation task. For example, the second update operation task could be an update operation task triggered on the second data area of ​​the target data table before the target user triggers the first update operation task. In this case, since the computer device immediately updates the changed and visible data content, the second data area only includes the data content that is not visible. The computer device can merge the first invisible sub-area and the second data area to obtain the area to be updated in the target data table. Thus, by merging the second data area and the first invisible sub-area to obtain the area to be updated, the number of updates and the amount of computation for the target data table can be reduced, thereby improving the update efficiency of the target data table.

[0064] Optionally, the specific details of the computer device merging the first non-visible sub-region and the second data region may include: the computer device can obtain the position information of the second data region and the first non-visible sub-region in the target data table. If it is determined based on the position information that the second data region and the first non-visible sub-region have an overlapping relationship, then the second data region and the first non-visible sub-region are merged according to the overlapping relationship to obtain the area to be updated in the target data table. Specifically, if there is a common sub-region between the first non-visible sub-region and the second data region (i.e., there is an intersecting region between the first non-visible sub-region and the second data region), the common sub-region is called the overlapping sub-region between the first non-visible sub-region and the second data region. That is, the common sub-region is a part contained in both the first non-visible sub-region and the second data region. In this case, it can be determined that there is an overlapping relationship between the first non-visible sub-region and the second data region. For example, the first non-visible sub-region is the area consisting of data in the target data table whose row identifier belongs to the range [51, 1000] and column identifier is 3. The second data area is the area consisting of data in the target data table whose row identifier belongs to the range [51, 55] and column identifier belongs to the range [1, 20]. The common sub-region between the first non-visible sub-region and the second data area is the area consisting of data in the target data table whose row identifier belongs to the range [51, 55] and column identifier is 3. It is determined that the first non-visible sub-region and the second data area have an overlapping relationship. Thus, if the second data area and the first non-visible sub-region have an overlapping relationship, if the second data area and the first non-visible sub-region are directly used as the sub-regions to be updated, there will be two identical overlapping sub-regions. In subsequent update calculations, it is necessary to update the two identical overlapping sub-regions separately. Therefore, this application merges the first non-visible sub-region and the second data area, which can reduce the number of updates to the target data table and the amount of update calculations. If the location information determines that the second data area and the first non-visible sub-area do not overlap, then the second data area and the first non-visible sub-area can be identified as the areas to be updated in the target data table.

[0065] Optionally, the specific method by which the computer device merges the second data area and the first non-visible sub-area based on the overlap relationship to obtain the area to be updated in the target data table may include: determining the overlapping sub-area between the second data area and the first non-visible sub-area based on the overlap relationship; removing the overlapping sub-area from the first non-visible sub-area to obtain a first remaining sub-area; removing the overlapping sub-area from the second data area to obtain a second remaining sub-area; and determining the overlapping sub-area, the first remaining sub-area, and the second remaining sub-area as the area to be updated in the target data table.

[0066] Specifically, the computer device can determine the overlapping sub-region between the second data region and the first non-visible sub-region based on the overlap relationship, and remove the overlapping sub-region from the first non-visible sub-region to obtain the first remaining sub-region. Similarly, the computer device can remove the overlapping sub-region from the second data region to obtain the second remaining sub-region. The overlapping sub-region, the first remaining sub-region, and the second remaining sub-region are then identified as the regions to be updated in the target data table. Here, the first remaining sub-region refers to the region in the first non-visible sub-region excluding the overlapping sub-region, and the second remaining sub-region refers to the region in the second data region excluding the overlapping sub-region. In this way, when updating the region to be updated, the calculation of one overlapping sub-region can be reduced, thus reducing the computational load. It is understandable that if there are overlapping sub-regions between the second data region and the first non-visible sub-region, and if the second data region and the first non-visible sub-region are not merged, then the data content in the overlapping sub-region needs to be updated separately according to the first update operation task and the second update operation task. That is to say, the data content in the overlapping sub-region needs to be updated at least twice. By merging the second data region and the first non-visible sub-region in this application, only one update calculation needs to be performed on the data content in the overlapping sub-region according to the target update operation task. The target update operation task is determined according to the first update operation task and the second update operation task, which can reduce the number of updates to the duplicate sub-regions and reduce the amount of update calculation, thereby improving the update efficiency of the target data table.

[0067] like Figure 7 As shown, Figure 7 This is a schematic diagram illustrating the determination of an area to be updated according to an embodiment of this application. 70a is a first non-visible sub-region, and 70b is a second data region. Figure 7 As shown, if there is an overlapping sub-region 70c with the same area range between the first non-visible sub-region 70a and the second data region 70b, then it can be determined that there is an overlapping relationship between the first non-visible sub-region 70a and the second data region 70c. Further, the computer device can determine the overlapping position between the first non-visible sub-region and the second data region based on the overlapping relationship, and define the area where the overlapping position is located as the overlapping sub-region 70c between the second data region and the first non-visible sub-region. Figure 7 As shown, the computer device can remove the overlapping sub-region from the first non-visible sub-region, and determine the area in the first non-visible sub-region excluding the overlapping sub-region as the first remaining sub-region 70d. The computer device can remove the overlapping sub-region from the second data region, and determine the area in the second data region excluding the overlapping sub-region as the second remaining sub-region 70e. Further, the computer device can determine the overlapping sub-region 70c, the first remaining sub-region 70d, and the second remaining sub-region 70e as the area to be updated in the target data table.

[0068] S105, when the data content in the first visible sub-area has been updated, update the data content in the area to be updated according to the first update operation task and the second update operation task.

[0069] Specifically, once the data content in the first visible sub-region has been updated, the computer device can update the data content in the region to be updated according to the first update operation task and the second update operation task. This prioritizes updating the visible data content after the data content in the first visible sub-region has been updated, allowing the target user to quickly view the updated target data table, reducing waiting time, and improving the user experience. Furthermore, updating the data content in the region to be updated according to the first and second update operation tasks can offset each other, significantly reducing computational load and improving the efficiency of updating the target data table. In essence, the computer device can prioritize updating the visible data content, reducing user waiting time and lag caused by updates. Simultaneously, merging the remaining areas to be updated reduces computational load, further improving the efficiency of updating the target data table.

[0070] Optionally, the specific method by which the computer device updates the data content within the area to be updated may include: if the second data area overlaps with the first non-visible sub-area, and the second remaining sub-area consists of the area containing visible data content, then the data content within the second remaining sub-area is updated according to the second update operation task. The data content within the overlapping sub-area and the data content within the first remaining sub-area are stored in a data table management area, and the first and second update operation tasks are merged to obtain a target update operation task. If the data content within the second remaining sub-area has already been updated, the data content within the overlapping sub-area and the data content within the first remaining sub-area are retrieved from the data table management area, and the data content within the overlapping sub-area is updated according to the target update operation task, and the data content within the first remaining sub-area is updated according to the first update operation task.

[0071] Specifically, if the computer device determines that the second data area overlaps with the first non-visible sub-area, and the second remaining sub-area consists of the area containing visible data content, then the data content within the second remaining sub-area can be updated according to the second update operation task. This prioritizes updating visible data content, allowing the target user to quickly view the updated target data table, enabling faster interaction and improving the user experience. The computer device can store the data content within the overlapping sub-area and the data content within the first remaining sub-area in the data table management area, and merge the first and second update operation tasks to obtain the target update operation task. For example, if the first update operation task is to increase the column width by 3 cm, and the second update task is to shorten the column width by 2 cm, then the target update operation task is to increase the column width by 1 cm. In this way, by merging the first and second update operations into a single target update operation, and performing a single update calculation on the data content within the overlapping sub-regions based on the target update operation, the number of updates to the overlapping sub-regions can be reduced, thereby reducing the amount of update computation and improving the update efficiency of the target data table. This is especially true when update operations (such as the first and second update operations) can cancel each other out, significantly reducing the amount of update computation. The data table management area stores the data regions to be updated. This area has region generation, region merging, region retrieval, and region update functions. Thus, when overlapping sub-regions and the first remaining sub-region need to be stored in the data table management area, the area can obtain the position information (such as start row, end row, start column, and end column) of the overlapping sub-regions and the first remaining sub-region in the target data table, and store them based on this information.

[0072] Furthermore, if the data content in the second remaining sub-region has been updated, the data in the overlapping sub-region and the data content in the first remaining sub-region are retrieved from the data table management area, and the data content in the overlapping sub-region is updated according to the target update operation task. In this way, the number of updates to the overlapping sub-region can be reduced through the target update operation task, thereby reducing the update computation and improving the update efficiency of the target data table. The data content in the first remaining sub-region is updated according to the first update operation task. Thus, merging the second data region and the first non-visible sub-region only requires one update calculation for the data content in the overlapping sub-region according to the target update operation task. This reduces the number of updates to the duplicate sub-region and the update computation, improving the update efficiency of the target data table. Furthermore, when update operation tasks can cancel each other out, the computational load can be significantly reduced, further improving the update efficiency of the target data table.

[0073] Optionally, when updating the data content in the first remaining sub-region and the data content in the overlapping sub-region, the computer device can update the data content in both regions simultaneously. Optionally, the computer device can obtain the acquisition time of the first update operation task and the second update operation task, and update the data content in the first remaining sub-region and the data content in the overlapping sub-region respectively according to the order of acquisition time. Optionally, the computer device can obtain the arrangement identifiers of the first remaining sub-region and the overlapping sub-region in the target data table, where the arrangement identifier can be a row identifier or a column identifier. The data content in the first remaining sub-region and the data content in the overlapping sub-region are updated according to the size of the arrangement identifier. For example, if the arrangement identifier of the overlapping sub-region is greater than the arrangement identifier of the first remaining sub-region, the data content in the overlapping sub-region can be updated first according to the target update operation task. Once the data content in the overlapping sub-region is updated, the data content in the first remaining sub-region is updated according to the first update operation task.

[0074] Optionally, the specific method by which the computer device updates the data content within the area to be updated may include: if the second data area overlaps with the first non-visible sub-area, and the second remaining sub-area consists of the area containing data content that is in an invisible state, then the first update operation task and the second update operation task are merged to obtain a target update operation task. According to the target update operation task, the data content within the overlapping sub-area is updated; according to the first update operation task, the data content within the first remaining sub-area is updated; and according to the second update operation task, the data content within the second remaining sub-area is updated.

[0075] Specifically, if the second data area overlaps with the first non-visible sub-area, and the second remaining sub-area consists of areas containing data content that is currently invisible, the computer device can merge the first update operation task and the second update operation task to obtain the target update operation task. Further, the computer device can update the data content within the overlapping sub-area according to the target update operation task, update the data content within the first remaining sub-area according to the first update operation task, and update the data content within the second remaining sub-area according to the second update operation task. Specifically, the computer device can simultaneously update the data content within the overlapping sub-area according to the target update operation task, update the data content within the first remaining sub-area according to the first update operation task, and update the data content within the second remaining sub-area according to the second update operation task.

[0076] Of course, the computer device can also obtain the acquisition time corresponding to the first and second update operation tasks, respectively. Based on the order of acquisition time, it can sequentially update the data content in the overlapping sub-region according to the target update operation task, then update the data content in the first remaining sub-region according to the first update operation task, and finally update the data content in the second remaining sub-region according to the second update operation task. Alternatively, the computer device can obtain the arrangement identifiers of the overlapping sub-region, the first remaining sub-region, and the second remaining sub-region in the target data table. Based on the size of the arrangement identifiers, it can sequentially update the data content in the overlapping sub-region according to the target update operation task, then update the data content in the first remaining sub-region according to the first update operation task, and finally update the data content in the second remaining sub-region according to the second update operation task. By splitting the area to be updated into multiple update tasks, the computational load and update time of each update can be reduced, thereby reducing the waiting time for the target user. This improves the update efficiency of the target data table and enhances the user experience.

[0077] Optionally, the specific method by which the computer device updates the data content within the area to be updated may include: if the second data area overlaps with the first non-visible sub-area, and the second remaining sub-area consists of a second visible sub-area and a second non-visible sub-area, then the data content within the second visible sub-area is updated according to the second update operation task. The second visible sub-area refers to the area within the second remaining sub-area where the data content is visible, and the second non-visible sub-area refers to the area within the second remaining sub-area where the data content is not visible. The first update operation task and the second update operation task are merged to obtain the target update operation task. If the data content within the second visible sub-area has already been updated, then the data content within the overlapping sub-area is updated according to the target update operation task, the data content within the first remaining sub-area is updated according to the first update operation task, and the data content within the second non-visible sub-area is updated according to the second update operation task.

[0078] Specifically, if the second data area overlaps with the first non-visible sub-area, and the second remaining sub-area consists of a second visible sub-area and a second non-visible sub-area, the computer device can update the data content within the second visible sub-area according to the second update operation task. Here, the second visible sub-area refers to the area containing visible data content within the second remaining sub-area, and the second non-visible sub-area refers to the area containing invisible data content within the second remaining sub-area. It can be understood that when the second remaining sub-area includes both visible and invisible data content, the computer device can prioritize updating the visible data content, allowing the target user to quickly view the updated data content and improving the user experience. The computer device can merge the first update operation task and the second update operation task to obtain the target update operation task. If the data content within the second visible sub-area has already been updated, then the data content within the overlapping sub-area is updated according to the target update operation task, the data content within the first remaining sub-area is updated according to the first update operation task, and the data content within the second non-visible sub-area is updated according to the second update operation task.

[0079] Similarly, when the data content in the second visible sub-region has been updated, the computer device can simultaneously update the data content in the overlapping sub-region, the data content in the first remaining sub-region, and the data content in the second non-visible sub-region. Alternatively, updates can be performed based on the acquisition time of the first and second update operation tasks. Or, updates can be performed based on the arrangement identifiers corresponding to the data content in the overlapping sub-region, the first remaining sub-region, and the second non-visible sub-region. In this case, the computer device can immediately update the data content in the second visible sub-region, store the data content in the overlapping sub-region, the first remaining sub-region, and the second non-visible sub-region in the data table management area, and then retrieve the corresponding data content from the data table management area for updating when needed. In this way, the data content in the overlapping sub-region, the data content in the first remaining sub-region, and the data content in the second non-visible sub-region can be updated in stages to reduce the amount of data updated each time, thereby reducing the time spent on each update and making it easier to quickly display the data content in the target data table to the target user.

[0080] like Figure 8 As shown, Figure 8This is a schematic diagram illustrating the updating of an area to be updated, as provided in an embodiment of this application. Figure 8 As shown, when region 1 (i.e., the first non-visible sub-region) and region 2 (i.e., the second data region) have overlapping sub-regions, and region 1 is located above region 2, the computer device can split region 1 and region 2 according to the position of the overlapping sub-regions, resulting in three regions: region 1', region 2', and region 3'. Figure 8 As shown, the computer device can divide the regions in regions 1 and 2 where the row identifier is less than the row identifier of the overlapping sub-region into region 1', the regions in regions 1 and 2 where the row identifier is equal to the row identifier of the overlapping sub-region into region 2', and the regions in regions 1 and 2 where the row identifier is less than the row identifier of the overlapping sub-region into region 3'. Further, based on the first update operation task associated with region 1 and the second update operation task associated with region 2, the data content in regions 1', 2', and 3' is updated sequentially. For example... Figure 8 As shown, the computer device can update the data content in region 1' according to the first update operation task, update the data content in region 2' according to the first update operation task and the second update operation task, and update the data content in region 3' according to the second update operation task. Specifically, when updating the data content in region 2' according to the first and second update operation tasks, the first update operation task can be used to update the data content in the region of region 2' where the column index is smaller than the column index of the overlapping sub-region, and the second update operation task can be used to update the data content in the region of region 2' where the column index is larger than the column index of the overlapping sub-region. The computer device can merge the first and second update operation tasks to obtain a target update operation task, and update the data content in the overlapping sub-region according to the target update operation task. In this way, by dividing the region to be updated into multiple regions and updating them in stages, the amount of data updated each time is reduced, thereby reducing the time spent on each update and facilitating the rapid display of the data content in the target data table to the target user.

[0081] like Figure 9 As shown, Figure 9 This is a schematic diagram illustrating the updating of an area to be updated, as provided in an embodiment of this application. Figure 9 As shown, when region 3 (such as the first non-visible sub-region) and region 4 (such as the second data region) have overlapping sub-regions, the computer device can split region 3 and region 4 according to the position of the overlapping sub-regions to obtain three regions: region 4', region 5', and region 6'. Figure 9As shown, the computer device can divide the regions in regions 3 and 4 where the row identifier is less than the row identifier of the overlapping sub-region into region 4', the regions in regions 3 and 4 where the row identifier is equal to the row identifier of the overlapping sub-region into region 5', and the regions in regions 3 and 4 where the row identifier is less than the row identifier of the overlapping sub-region into region 6'. Further, based on the first update operation task associated with region 3 and the second update operation task associated with region 4, the data content in regions 4', 5', and 6' is updated sequentially. For example... Figure 9 As shown, the computer device can update the data content in region 4' according to the first update operation task, update the data content in region 5' according to the first update operation task and the second update operation task, and update the data content in region 6' according to the first update operation task. Specifically, when updating the data content in region 5' according to the first and second update operation tasks, the computer device can update the data content in the region of region 5' where the column index is smaller than the column index of the overlapping sub-region according to the second update operation task, and update the data content in the region of region 5' where the column index is larger than the column index of the overlapping sub-region according to the second update operation task. The computer device can merge the first and second update operation tasks to obtain the target update operation task, and update the data content in the overlapping sub-region according to the target update operation task. In this way, by dividing the region to be updated into multiple regions and updating them in stages, the amount of data updated each time is reduced, thereby reducing the time spent on each update and facilitating the rapid display of the data content in the target data table to the target user.

[0082] Optionally, the specific method by which the computer device updates the data content within the area to be updated may include: if the second data area and the first non-visible sub-area do not overlap, and the second data area consists of the area containing visible data content, then the data content within the second data area is updated according to the second update operation task. This allows for quick display of the updated data content to the target user, reducing their waiting time and improving their user experience. If the data content within the second data area has already been updated, then the data content within the first non-visible sub-area is updated according to the first update operation task. When updating the data content within the first non-visible sub-area, the computer device may divide the first non-visible sub-area into multiple sub-area fragments, and update these fragments sequentially according to the fragmentation order or the corresponding arrangement identifiers. This divides the first non-visible sub-area into multiple update tasks, facilitating the rapid display of the updated data content to the target user and reducing their waiting time.

[0083] Optionally, the specific method by which the computer device updates the data content within the area to be updated may include: if the second data area and the first non-visible sub-area do not overlap, and the second data area consists of areas containing data content that is currently invisible, then the data content within the first non-visible sub-area is updated according to the first update operation task. If the data content within the first non-visible sub-area has already been updated, then the data content within the second data area is updated according to the second update operation task. Alternatively, the computer device may update the data content within the second data area according to the second update operation task; if the data content within the second data area has already been updated, then the data within the first non-visible sub-area is updated according to the first update operation task. Alternatively, the computer device may update the data content within the second data area and the data content within the first non-visible sub-area sequentially according to the acquisition time of the first update operation task and the second update operation task. Alternatively, the computer device may update the data content within the second data area and the data content within the first non-visible sub-area sequentially according to the arrangement identifier of the data content within the second data area in the target data table, and the arrangement identifier of the data content within the first non-visible sub-area in the target data table.

[0084] Optionally, the specific method by which the computer device updates the data content within the area to be updated may include: if the second data area and the first non-visible sub-area do not overlap, and the second data area consists of the area containing data content in an invisible state, then the terminal's data table update processing performance is obtained; the terminal is the terminal used to update the target data table. The limited data volume for a single update by the terminal is determined based on the data table update processing performance. Based on the limited data volume, the first non-visible sub-area is divided into M non-visible fragments, and the second data area is divided into N data fragments based on the limited data volume; M and N are both positive integers greater than or equal to 2. The arrangement relationship between the first non-visible sub-area, the second data area, and the first visible sub-area is obtained. Based on the arrangement relationship, the data content within the M non-visible fragments is updated sequentially according to the first update operation task, and the data content within the N data fragments is updated according to the second update operation task.

[0085] Specifically, if the second data region does not overlap with the first non-visible sub-region, and the second data region consists of areas containing data content that is not visible, then the computer device can obtain the terminal's data table update processing performance. This terminal refers to the user terminal associated with the target user, such as the user terminal held by the target user, which is the terminal used to update the target data table. The computer device can determine the limited data volume for a single update by the terminal based on the data table update processing performance; this limited data volume can refer to the number of rows. Further, the computer device can divide the first non-visible sub-region into M non-visible sub-regions based on the limited data volume, where M is a positive integer greater than or equal to 2, such as M taking values ​​of 2, 3, 4, ... The computer device can also divide the second data region into N data fragments based on the limited data volume, where N is a positive integer greater than or equal to 2, such as N taking values ​​of 2, 3, 4, ... Furthermore, the computer device can obtain the arrangement relationship between the first non-visible sub-region, the second data region, and the first visible sub-region. Based on this arrangement relationship, it sequentially updates the data content within M non-visible slices according to the first update operation, and updates the data content within N data slices according to the second update operation task. In this way, dividing the second data region and the first non-visible sub-region into multiple slices and dividing them into multiple update tasks to update the data content within the second data region and the data content within the first non-visible sub-region reduces the computational load of each update task. This allows for faster display of updated data content when the visible area in the target data table changes, reducing the waiting time for the target user and improving the user experience.

[0086] Optionally, the specific details of the computer device sequentially updating the data content in M ​​non-visual segments according to the first update operation task, and updating the data content in N data segments according to the second update operation task, may include: if the arrangement relationship indicates that both the first arrangement identifier and the second arrangement identifier are less than the third arrangement identifier, then obtaining the first decreasing direction of the arrangement identifier of the target data table in the target direction. The first arrangement identifier is used to reflect the arrangement identifier of the data content in the M non-visual segments in the target direction of the target data table, the second arrangement identifier is used to reflect the arrangement identifier of the data content in the N data segments in the target direction of the target data table, and the third arrangement identifier is used to reflect the arrangement identifier of the data content in the first visible sub-region in the target direction of the target data table. The data content in the M non-visual segments is updated sequentially according to the first update operation task, and the data content in the N data segments is updated according to the second update operation task, following the first decreasing direction.

[0087] Specifically, if the arrangement relationship indicates that both the first and second arrangement identifiers are less than the third arrangement identifier, it means that both the second data area and the first non-visible sub-area are located above or to the left of the visible data content area in the target data table. The computer device can obtain the first decreasing direction of the arrangement identifiers of the target data table in the target direction. The target direction can be horizontal or vertical. For example, when the target direction is vertical, the first arrangement identifier can refer to the row coordinates of M non-visible segments, the second arrangement identifier can refer to the row coordinates of N data segments, the third arrangement identifier can refer to the row coordinates of the first visible sub-area, and the first decreasing direction can refer to the decreasing direction of the row coordinates. The computer device can update the data content in the M non-visible segments according to the first update operation task, and update the data content in the N data segments according to the second update operation task, following the first decreasing direction. This reduces the computational load of each update task and facilitates the rapid display of corresponding data content when the visible area in the target data table changes, reducing the waiting time for the target user and improving the user experience.

[0088] Optionally, the specific content of the computer device updating the data content in the M non-visible segments according to the first update operation task and updating the data content in the N data segments according to the second update operation task may include: if the arrangement relationship indicates that both the first and second arrangement identifiers are greater than the third arrangement identifier, it means that the second data area and the first non-visible sub-area are located below or to the right of the area where the visible data content is located in the target data table. The computer device can obtain the first increasing direction of the arrangement identifiers of the target data table in the target direction. The first arrangement identifier is used to reflect the arrangement identifiers of the data content in the M non-visible segments in the target direction of the target data table, the second arrangement identifier is used to reflect the arrangement identifiers of the data content in the N data segments in the target direction of the target data table, and the third arrangement identifier is used to reflect the arrangement identifiers of the data content in the first visible sub-area in the target direction of the target data table. For example, when the target direction is vertical, the first arrangement identifier can refer to the row coordinates of the M non-visible segments, the second arrangement identifier can refer to the row coordinates of the N data segments, the third arrangement identifier can refer to the row coordinates of the first visible sub-area, and the first increasing direction can refer to the increasing direction of the row coordinates. Following the first incremental direction, the data content in M ​​non-visible fragments is updated sequentially according to the first update operation task, and the data content in N data fragments is updated according to the second update operation task. This reduces the computational load of each update task and also facilitates the rapid display of corresponding data content when the visible data content in the target data table changes, reducing the waiting time for the target user and improving the user experience.

[0089] Optionally, the specific content of the computer device updating the data content in M ​​non-visual segments according to the first update operation task and updating the data content in N data segments according to the second update operation task may include: if the arrangement relationship indicates that the first arrangement identifier is less than the third arrangement identifier and the second arrangement identifier is greater than the third arrangement identifier, it means that the first non-visual sub-region is located above or to the left of the area where the visible data content is located in the target data table, and the second data region is located below or to the right of the area where the visible data content is located in the target data table. The computer device can obtain the second decreasing direction of the arrangement identifier of the data content in the first non-visual sub-region in the target direction and the second increasing direction of the arrangement identifier of the data content in the second data region in the target direction. The first arrangement identifier is used to reflect the arrangement identifier of the data content in the M non-visual segments in the target direction of the target data table, the second arrangement identifier is used to reflect the arrangement identifier of the data content in the N data segments in the target direction of the target data table, and the third arrangement identifier is used to reflect the arrangement identifier of the data content in the first visible sub-region in the target direction of the target data table. Following a second decreasing direction and a second increasing direction, the data content in M ​​non-visible fragments is updated alternately according to the first update operation task, and the data content in N data fragments is updated according to the second update operation task. This reduces the computational load of each update task and also facilitates the rapid display of corresponding data content when the visible data content in the target data table changes, reducing the waiting time for the target user and improving the user experience.

[0090] It is understandable that alternatingly updating the data content in M ​​non-visual segments according to the first update operation task and updating the data content in N data segments according to the second update operation task can have the following four meanings: 1. First, update the data content in the M non-visual segments sequentially according to the first update operation task in the second decreasing direction; after the data content in the M non-visual segments has been updated, update the data content in the N data segments sequentially according to the second update operation task in the second increasing direction. 2. First, update the data content in the N data segments sequentially according to the second update operation task in the second increasing direction; after the data content in the N data segments has been updated, update the data content in the M non-visual segments sequentially according to the first update operation task in the second decreasing direction. 3. First, following the second decreasing direction, update the G data entries in the M non-visual segments according to the first update operation task; then, following the second increasing direction, update the F data entries in the N data segments according to the second update operation task, and so on, until the data entries in both the M and N data segments are updated. G and F are both positive integers greater than or equal to 1, where G is less than the number of data entries in the M non-visual segments, and F is less than the number of data entries in the N data segments. G and F can be the same or different. 4. First, following the second increasing direction, update the F data entries in the N data segments according to the second update operation task; then, following the second decreasing direction, update the G data entries in the M non-visual segments according to the first update operation task, and so on, until the data entries in both the M and N data segments are updated.

[0091] For example, after updating the data content of the first non-visual segment out of M non-visual segments in a second decreasing direction, the computer device can update the data content of the first data segment out of N data segments in a second increasing direction. Here, the second non-visual segment refers to the non-visual segment with the largest permutation index among the M non-visual segments, and the second data segment refers to the data segment with the smallest permutation index among the N data segments. Further, after updating the first data segment, and after updating the data content of the second non-visual segment out of M non-visual segments in a second decreasing direction, the computer device can update the data content of the second data segment out of N data segments in a second increasing direction. Here, the second non-visual segment refers to the non-visual segment with the smallest permutation index among the non-visual segments excluding the first non-visual segment among the N data segments, and the second data segment refers to the data segment with the smallest permutation index among the data segments excluding the first data segment among the N data segments. In this way, the M non-visible fragments and N data fragments are updated alternately. This allows for the priority updating of areas closer to the visible data content in the target data table. This ensures that when the visible data content in the target data table changes (i.e., when the target user scrolls through the target data table to change the data content within the visible area), the changes can be quickly displayed, thus reducing the target user's waiting time.

[0092] Similarly, if the arrangement relationship indicates that the first arrangement identifier is greater than the third arrangement identifier, and the second arrangement identifier is less than the third arrangement identifier, it means that the first non-visible sub-region is located below or to the right of the area where the visible data content is located in the target data table, and the second data region is located above or to the left of the area where the visible data content is located in the target data table. The computer device can obtain the third increasing direction of the arrangement identifier of the data content in the first non-visible sub-region in the target direction, and the third decreasing direction of the arrangement identifier of the data content in the second data region in the target direction. According to the third decreasing direction and the third increasing direction, the data content in M ​​non-visible segments is updated alternately according to the first update operation task, and the data content in N data segments is updated according to the second update operation task. In this way, the region closer to the area where the visible data content is located in the target data table can be updated preferentially, which is convenient for subsequent changes in the area where the visible data content is located in the target data table (i.e., when the target user slides the target data table to change the data content in the visible area), so as to quickly display the changes and reduce the waiting time of the target user.

[0093] Optionally, if the second data region and the first non-visible sub-region do not overlap, and the second data region consists of a third visible sub-region and a third non-visible sub-region, then the data content within the third visible sub-region is updated according to the second update operation task. Here, the third visible sub-region refers to the area containing visible data content within the second data region, and the third non-visible sub-region refers to the area containing invisible data content within the second data region. This prioritizes updating and rendering visible data content, facilitating rapid display of the updated data content to the target user. If the data content within the third visible sub-region is updated, then the data content within the third non-visible sub-region is updated according to the second update operation task, and the data content within the first non-visible sub-region is updated according to the first update operation task. Specifically, the computer device can divide the third non-visible sub-region and the first non-visible sub-region into multiple region segments, and update these multiple region segments sequentially according to the division order or the arrangement identifier of each region segment, based on the first and second update operation tasks.

[0094] Optionally, if no second update operation task associated with the second data area of ​​the target data table is obtained, then K cell tables associated with the first update operation task are determined in the first non-visible sub-area according to the operation type of the first update operation task; K is a positive integer. When the data content in the first visible sub-area has been updated, the K cell tables are updated according to the first update operation task.

[0095] Specifically, if no second update operation task associated with the second data area of ​​the target data table is obtained, that is, if the computer device does not obtain an update operation task to update the target data table, the computer device can determine K cell tables associated with the first update operation task in the first non-visual sub-area according to the operation type of the first update operation task. K is a positive integer, such as K can take the value 1, 2, 3, ... The specific method of determining the K cell tables associated with the first update operation task in the first non-visual sub-area according to the operation type of the first update operation task can refer to the specific content of determining the Q cell tables associated with the first update operation task in the first visible sub-area according to the operation type of the first update operation task, which will not be repeated here in this embodiment. The data content of the target data table is stored in the data layer of the computer device, which manages and maintains the data content of all cell tables in the target data table. When it is necessary to update the data content of the target data table, the computer device can use the rendering layer to convert the data content stored in the data layer into the required data content and render the final presentation in the table display interface.

[0096] Optionally, when the computer device stores the first non-visible sub-region and the second non-visible sub-region in the second data region to the data table management area of ​​the data layer, it can generate a storage area corresponding to the first non-visible sub-region in the data table management area based on the row and column positions of the first non-visible sub-region in the target data table. The row and column positions corresponding to the first non-visible sub-region can refer to the starting row, ending row, starting column, and ending column of the first non-visible sub-region in the target data table. Similarly, the computer device can generate a storage area corresponding to the first non-visible sub-region in the data table management area based on the row and column positions of the first non-visible sub-region in the target data table. The row and column positions corresponding to the first non-visible sub-region refer to the starting row, ending row, starting column, and ending column of the second non-visible sub-region in the target data table. Specifically, when the rows and columns of the visible data content in the target data table change, such as adding or deleting rows or columns, the computer device can update the row and column positions of the first and second non-visible sub-regions stored in the data table management area based on the changes in the rows and columns of the visible data content in the target data table. This ensures that the corresponding areas can be accurately retrieved and updated from the data table management area in the future.

[0097] like Figure 10 As shown, Figure 10 This is a schematic diagram of a region update in a data table management area provided in an embodiment of this application, such as... Figure 10As shown, the data table management area stores a region 100a to be updated. If a row insertion or deletion operation occurs in region 100b above region 100a, the row position of region 100a to be updated is shifted down or up (i.e., the row identifier of region 100a to be updated is increased or decreased). If a column insertion or deletion operation occurs in region 100b above region 100a, the column position of region 100a to be updated is updated according to the column insertion or deletion operation. Similarly, if a row insertion or deletion operation occurs in region 100c within region 100a to be updated, the computer device can update the row position of region 100a to be updated according to the row insertion or deletion operation. Likewise, if a column insertion or deletion operation occurs in region 100c within region 100a to be updated, the column position of region 100a to be updated is updated according to the column insertion or deletion operation. Specifically, if row insertion or deletion operations occur in area 100d below area 100a to be updated, the row positions of area 100a to be updated will not be affected; that is, the row positions of area 100a to be updated will not be updated. However, if column insertion or deletion operations occur in area 100d below area 100a to be updated, the column positions of area 100a to be updated will be updated according to the column insertion or deletion operations. In this way, when the row and column positions in the target data table change, the row and column positions of the area to be updated in the data table management area are updated, so that the corresponding area can be accurately retrieved and updated subsequently.

[0098] like Figure 11 As shown, Figure 11 This is a schematic diagram of a data table update provided in an embodiment of this application, such as... Figure 11As shown, the computer device can detect in real time whether the target data table has been updated. When the target data table is updated, the area in the target data table where the data update occurred is determined as the first data area, and the first update operation task associated with the first data area is obtained. The computer device can detect whether the first update operation task is a large-scale operation event, that is, whether the first data area includes both visible and invisible data content. If the first update operation task is a large-scale operation event (i.e., the first data area includes both visible and invisible data content), the first data area is split into a first visible sub-area and a first non-visible sub-area. Large-scale operation events include updating cell table content, adjusting row height and column width, hiding rows and columns, and adding / deleting rows and columns. Furthermore, the computer device can immediately perform calculation updates on the first visible sub-area, store the first non-visible sub-area in the data table area management, and when the first visible sub-area update is completed, retrieve the first non-visible sub-area from the first non-visible sub-area for updating. Specifically, when the first update operation event is a row / column change operation event, the computer device can update the target data table according to this operation. Since row / column change operation events occur in the visible areas of the target data table, the computer device can immediately update the data content of the target data table based on these events. Row / column change operation events refer to adjustments to rows or columns in the target data table, including adding rows or columns, deleting rows or columns, and hiding rows or columns.

[0099] Simultaneously, the computer device can detect whether row and column change operation events alter the row and column positions of areas stored in the data table management area. If a row and column change operation event causes a change in the row and column positions of areas stored in the data table management area, the computer device updates the row and column positions of areas stored in the data table management area according to the row and column change operation event. This facilitates obtaining accurate areas to be updated from the data table management area for updating. Furthermore, when there are other areas to be updated associated with other change operation tasks in the data table management area (such as a second data area), the computer device can merge the first non-visible sub-area in the data table management area with the area to be updated. When the first visible sub-area is updated, the computer device can retrieve the calculation task from the data table management area, that is, obtain the area to be updated from the data table management area and perform calculation updates on the task. When updating the area to be updated, the computer device can perform row-by-row calculations, column-by-column calculations, cell table calculations, and table line calculations. Row-by-row calculations refer to updating the row data within the target row if the first or second data area is the target row in the target data table. Row data refers to the horizontal data content in the target data table. Row-by-row calculation refers to updating the target column only if either the first or second data area is a column within the target data table. Column data refers to the vertical data content in the target data table. Row-by-row calculation also refers to updating the target cell table only if either the first or second data area is a target table line only if the first or second data area is a target table line. Therefore, computer equipment can determine the areas in the target data table that need updating by row and column, and updating only these areas can significantly reduce computational load, avoid redundant calculations, and improve the efficiency of updating the target data table.

[0100] In this embodiment, when a first update operation task associated with a first data area of ​​a target data table is obtained, and the first data area includes data content in a visible state and data content in an invisible state in the target data table, the first data area is split into a first visible sub-area including data content in a visible state and a first non-visible sub-area including data content in an invisible state. This facilitates updating the data content in the first visible sub-area and the data content in the first non-visible sub-area separately according to the first update operation task. Simultaneously, during the update of the data content in the first visible sub-area or the first non-visible sub-area, it is not necessary to scan the entire data content of the target data table to determine whether the data content in the first visible sub-area and the first non-visible sub-area has been updated, reducing the computational resource consumption during the data table update process and improving the efficiency of the data table update. Furthermore, by prioritizing the updating of data content within the first visible sub-region according to the first update operation task, if a second update operation task associated with the second data region of the target data table is obtained during the updating of data content within the first visible sub-region, the second data region and the first non-visible sub-region are merged to obtain the area to be updated in the target data table. Then, when the data content within the first visible sub-region has been updated, the data content within the area to be updated is updated according to the first and second update operation tasks. This helps reduce the amount of data updated in a single update, lowers the probability of data table lag, and improves the smoothness and efficiency of data table updates. Simultaneously, merging the second data region and the first non-visible sub-region reduces the number of updates and the amount of computation required for the target data table, thereby improving the update efficiency of the target data table.

[0101] Please see Figure 12 , Figure 12 This is a flowchart illustrating a data table processing method provided in an embodiment of this application. This data table processing method can be... Figure 1 It can be executed by any user terminal in the system, or by... Figure 1 The server in the middle can be used to execute it, or it can be executed by... Figure 1 The method can be executed jointly by any user terminal and server in this application, and the device used to execute the method in this application can be collectively referred to as a computer device. For example... Figure 12 As shown, the data table processing method may include, but is not limited to, the following steps:

[0102] S201, Obtain the first update operation task associated with the first data area of ​​the target data table.

[0103] S202, if the first data region includes data content in a visible state and data content in an invisible state in the target data table, then the first data region is split to obtain a first visible sub-region including data content in a visible state and a first non-visible sub-region including data content in an invisible state.

[0104] S203, Update the data content within the first visible sub-area according to the first update operation task.

[0105] S204, if a second update operation task associated with the second data area of ​​the target data table is obtained, the second data area and the first non-visible sub-area are merged to obtain the area to be updated of the target data table.

[0106] Specifically, the details of steps S201-S204 in this embodiment can be found in the details of steps S101-S104 above, and will not be repeated here.

[0107] S205, when the data content in the first visible sub-area has been updated, in response to the selection operation of the first sub-area to be updated in the area to be updated, a third update operation task associated with the first sub-area to be updated is determined according to the first update operation task and the second update operation task.

[0108] Specifically, when the data content within the first visible sub-region has been updated, if the target user needs to view the data content within the first updated sub-region of the area to be updated, the computer device can receive the target user's selection operation for the first updated sub-region within the area to be updated. The first updated sub-region can be any region within the area to be updated. The computer device can determine a third update operation task associated with the first updated sub-region based on the first update operation task and the second update operation task. The third update operation task may be the first update operation task, the second update operation task, or a combination of the first and second update operation tasks. Specifically, when the first updated sub-region belongs to the first non-visible sub-region, the third update operation task is the first update operation task corresponding to the first non-visible sub-region; if the first updated sub-region belongs to the second data region, the third update operation task is the second update operation task corresponding to the second data region; if the first updated sub-region belongs to the overlapping sub-region between the first non-visible sub-region and the second data region (i.e., the first updated sub-region belongs to both the first non-visible sub-region and the second data region), the third update operation task is an update operation task obtained by combining the first and second update operation tasks.

[0109] S206, Update the data content in the first sub-region to be updated according to the third update operation task.

[0110] Specifically, the computer device can update the data content of the first sub-region to be updated based on the third update operation task. In this way, the first sub-region to be updated within the area to be updated can be updated according to the needs of the target user, thereby quickly obtaining the area that the target user needs to update and updating and rendering the area in a timely manner, realizing the flexibility of updating the area to be updated, and improving the user experience of the target user.

[0111] S207, if the data content in the first sub-region to be updated has been updated, then obtain the second sub-region to be updated from the region to be updated, excluding the first sub-region to be updated.

[0112] S208, Update the second sub-region to be updated according to the first update operation task and the second update operation task.

[0113] Specifically, if the data content in the first sub-region to be updated has been updated, a second sub-region to be updated, excluding the first sub-region, is retrieved from the update area. The computer device can store the update area in a data table management area and retrieve it when an update is needed. Furthermore, the computer device can update the second sub-region according to a first update operation task and a second update operation task. When updating the second sub-region, the computer device can partition it into multiple update fragments. Based on the fragment order of each update fragment or its arrangement identifier in the target data table, these multiple update fragments are updated sequentially according to the first and second update operation tasks. This reduces the amount of data updated each time, facilitating the rapid display of the updated data content to the target user.

[0114] For example, assuming the target data table has 1 million cells, the time required to update the target data table using the update scheme of this application and the time required using the existing update scheme are shown in Table 1. The existing update scheme refers to the scheme that updates all data content in the target data table at once. Table 1 shows that the time required to perform the border line setting operation on the target data table using the update scheme of this application is 26 seconds, while the existing update scheme requires 29 seconds. Therefore, the update scheme of this application reduces the time by 3 seconds, representing a time optimization of 10%. Similarly, the time required to perform the automatic line wrapping operation on the target data table using the update scheme of this application is 16 seconds, while the existing update scheme requires 10 seconds. Therefore, the update scheme of this application reduces the time by 6 seconds, representing a time optimization of 38%. Similarly, the update scheme of this application takes less time to perform full table filtering, set border lines (entire column operation), and set automatic line wrapping on the target data table than to perform the corresponding update operations on the target data table based on the existing update scheme, which can reduce the probability of the target data table experiencing lag.

[0115] Table 1

[0116]

[0117] In this embodiment, when a first update operation task associated with a first data area of ​​a target data table is obtained, and the first data area includes data content in a visible state and data content in an invisible state in the target data table, the first data area is split into a first visible sub-area including data content in a visible state and a first non-visible sub-area including data content in an invisible state. This facilitates updating the data content in the first visible sub-area and the data content in the first non-visible sub-area separately according to the first update operation task. Simultaneously, during the update of the data content in the first visible sub-area or the first non-visible sub-area, it is not necessary to scan the entire data content of the target data table to determine whether the data content in the first visible sub-area and the first non-visible sub-area has been updated, reducing the computational resource consumption during the data table update process and improving the efficiency of the data table update. Furthermore, by prioritizing the updating of data content within the first visible sub-region according to the first update operation task, if a second update operation task associated with the second data region of the target data table is obtained during the updating of data content within the first visible sub-region, the second data region and the first non-visible sub-region are merged to obtain the area to be updated in the target data table. Then, when the data content within the first visible sub-region has been updated, the data content within the area to be updated is updated according to the first and second update operation tasks. This helps reduce the amount of data updated in a single update, lowers the probability of data table lag, and improves the smoothness and efficiency of data table updates. Simultaneously, merging the second data region and the first non-visible sub-region reduces the number of updates and the amount of computation required for the target data table, thereby improving the update efficiency of the target data table. Additionally, the first sub-region to be updated within the area to be updated can be updated according to the needs of the target user, enabling rapid acquisition of the area that the target user needs to update and timely updating and rendering of that area, achieving flexibility in updating the area to be updated and improving the user experience.

[0118] Please see Figure 13 , Figure 13 This is a schematic diagram of the structure of a data table processing device provided in an embodiment of this application. The aforementioned data table processing device can be a computer program (including program code) running on a computer device; for example, the data table processing device is an application software. The data table processing device can be used to execute corresponding steps in the data table processing method provided in the embodiments of this application. Figure 13 As shown, the data table processing device may include an acquisition module 11, a splitting module 12, a first update module 13, a merging module 14, a second update module 15, a determination module 16, and a third update module 17.

[0119] The acquisition module 11 is used to acquire the first update operation task associated with the first data area of ​​the target data table;

[0120] The splitting module 12 is used to split the first data region into a first visible sub-region that includes data content in a visible state and data content in an invisible state in the target data table if the first data region includes data content in a visible state and data content in an invisible state in the target data table.

[0121] The first update module 13 is used to update the data content within the first visible sub-area according to the first update operation task;

[0122] The merging module 14 is used to merge the second data area and the first non-visible sub-area if a second update operation task associated with the second data area of ​​the target data table is obtained, so as to obtain the area to be updated of the target data table.

[0123] The second update module 15 is used to update the data content in the area to be updated according to the first update operation task and the second update operation task when the data content in the first visible sub-area has been updated.

[0124] The merging module 14 includes:

[0125] The first merging unit 1401 is used to merge the second data area and the first non-visual sub-area according to the overlap relationship if there is an overlap relationship between the second data area and the first non-visual sub-area, so as to obtain the area to be updated of the target data table.

[0126] The first determining unit 1402 is used to determine the second data area and the first non-visual sub-area as the area to be updated in the target data table if there is no overlap between the second data area and the first non-visual sub-area.

[0127] Specifically, the first merging unit 1401 is used for:

[0128] Based on the overlap relationship, determine the overlapping sub-region between the second data region and the first non-visible sub-region;

[0129] Remove overlapping sub-regions from the first non-visible sub-region to obtain the first remaining sub-region;

[0130] Remove the overlapping sub-regions from the second data region to obtain the second remaining sub-region;

[0131] The overlapping sub-region, the first remaining sub-region, and the second remaining sub-region are identified as the areas to be updated in the target data table.

[0132] The second update module 15 includes:

[0133] The first update unit 1501 is used to update the data content in the second remaining sub-region according to the second update operation task if there is an overlap between the second data region and the first non-visible sub-region, and the second remaining sub-region is composed of the region where the data content is in a visible state.

[0134] The second merging unit 1502 is used to store the data content in the overlapping sub-region and the data content in the first remaining sub-region into the data table management area, and merge the first update operation task and the second update operation task to obtain the target update operation task.

[0135] The second update unit 1503 is used to, if the data content in the second remaining sub-region has been updated, retrieve the data content in the overlapping sub-region and the data content in the first remaining sub-region from the data table management area, update the data content in the overlapping sub-region according to the target update operation task, and update the data content in the first remaining sub-region according to the first update operation task.

[0136] The second update module 15 includes:

[0137] The third merging unit 1504 is used to merge the first update operation task and the second update operation task to obtain the target update operation task if the second data area and the first non-visible sub-area have an overlapping relationship and the second remaining sub-area is composed of the area where the data content is in an invisible state.

[0138] The third update unit 1505 is used to update the data content in the overlapping sub-region according to the target update operation task, update the data content in the first remaining sub-region according to the first update operation task, and update the data content in the second remaining sub-region according to the second update operation task.

[0139] The second update module 15 includes:

[0140] The fourth update unit 1506 is used to update the data content within the second visible sub-region according to the second update operation task if the second data region and the first non-visible sub-region have an overlapping relationship and the second remaining sub-region is composed of the second visible sub-region and the second non-visible sub-region; the second visible sub-region refers to the area where the data content in the second remaining sub-region is visible, and the second non-visible sub-region refers to the area where the data content in the second remaining sub-region is invisible.

[0141] The fourth merging unit 1507 is used to merge the first update operation task and the second update operation task to obtain the target update operation task.

[0142] The fifth update unit 1508 is used to update the data content in the overlapping sub-region according to the target update operation task if the data content in the second visible sub-region has been updated, update the data content in the first remaining sub-region according to the first update operation task, and update the data content in the second non-visible sub-region according to the second update operation task.

[0143] The second update module 15 includes:

[0144] The sixth update unit 1509 is used to update the data content within the second data area according to the second update operation task if there is no overlap between the second data area and the first non-visible sub-area, and the second data area is composed of the area where the data content is in a visible state.

[0145] The seventh update unit 1510 is used to update the data content in the first non-visible sub-region according to the first update operation task if the data content in the second data region has been updated.

[0146] The second update module 15 includes:

[0147] The eighth update unit 1511 is used to update the data content in the first non-visible sub-region according to the first update operation task if the second data region and the first non-visible sub-region do not overlap and the second data region is composed of the region where the data content is in an invisible state.

[0148] The ninth update unit 1512 is used to update the data content in the second data area according to the second update operation task if the data content in the first non-visible sub-area has been updated.

[0149] The second update module 15 includes:

[0150] The first acquisition unit 1513 is used to acquire the data table update processing performance of the terminal if the second data area and the first non-visible sub-area do not overlap and the second data area is composed of the area where the data content is in an invisible state; the terminal is a terminal used to update the target data table.

[0151] The second determining unit 1514 is used to determine the limited amount of data for a single terminal update based on the data table update processing performance.

[0152] The partitioning unit 1515 is used to partition the first non-visual sub-region into M non-visual fragments according to the limited data volume, and to partition the second data region into N data fragments according to the limited data volume; M and N are both positive integers greater than or equal to 2.

[0153] The second acquisition unit 1516 is used to acquire the arrangement relationship between the first non-visible sub-region, the second data region and the first visible sub-region;

[0154] The tenth update unit 1517 is used to update the data content in M ​​non-visible segments according to the arrangement relationship, in turn according to the first update operation task, and to update the data content in N data segments according to the second update operation task.

[0155] Specifically, the tenth update unit 1517 is used for:

[0156] If the arrangement relationship indicates that both the first and second arrangement identifiers are less than the third arrangement identifier, then the first decreasing direction of the arrangement identifiers of the target data table in the target direction is obtained; the first arrangement identifier is used to reflect the arrangement identifiers of the data content in the M non-visual segments in the target direction of the target data table, the second arrangement identifier is used to reflect the arrangement identifiers of the data content in the N data segments in the target direction of the target data table, and the third arrangement identifier is used to reflect the arrangement identifiers of the data content in the first non-visual sub-region in the target direction of the target data table.

[0157] Following the first decreasing direction, the data content in M ​​non-visible fragments is updated sequentially according to the first update operation task, and the data content in N data fragments is updated according to the second update operation task.

[0158] Specifically, the tenth update unit 1517 is used for:

[0159] If the arrangement relationship indicates that both the first and second arrangement identifiers are greater than the third arrangement identifier, then the first increasing direction of the arrangement identifiers of the target data table in the target direction is obtained; the first arrangement identifier is used to reflect the arrangement identifiers of the data content in the M non-visual segments in the target direction of the target data table, the second arrangement identifier is used to reflect the arrangement identifiers of the data content in the N data segments in the target direction of the target data table, and the third arrangement identifier is used to reflect the arrangement identifiers of the data content in the first non-visual sub-region in the target direction of the target data table.

[0160] Following the first incremental direction, the data content in M ​​non-visible fragments is updated sequentially according to the first update operation task, and the data content in N data fragments is updated according to the second update operation task.

[0161] Specifically, the tenth update unit 1517 is used for:

[0162] If the arrangement relationship indicates that the first arrangement identifier is less than the third arrangement identifier and the second arrangement identifier is greater than the third arrangement identifier, then the second decreasing direction of the arrangement identifier of the data content in the first non-visual sub-region in the target direction and the second increasing direction of the arrangement identifier of the data content in the second data region in the target direction are obtained; the first arrangement identifier is used to reflect the arrangement identifier of the data content in the M non-visual segments in the target direction of the target data table, the second arrangement identifier is used to reflect the arrangement identifier of the data content in the N data segments in the target direction of the target data table, and the third arrangement identifier is used to reflect the arrangement identifier of the data content in the first non-visual sub-region in the target direction of the target data table;

[0163] According to the second decreasing direction and the second increasing direction, the data content in M ​​non-visible fragments is updated alternately according to the first update operation task, and the data content in N data fragments is updated according to the second update operation task.

[0164] The first update module 13 includes:

[0165] The third acquisition unit 1301 is used to acquire the operation type of the first update operation task;

[0166] The third determining unit 1302 is used to determine Q cell tables associated with the first update operation task in the first visible sub-region according to the operation type; Q is a positive integer;

[0167] Table update unit 1303 is used to update Q cell tables according to the first update operation task.

[0168] The data table processing device also includes:

[0169] The determination module 16 is used to determine K cell tables associated with the first update operation task in the first non-visible sub-region according to the operation type of the first update operation task if no second update operation task associated with the second data area of ​​the target data table is obtained; K is a positive integer.

[0170] The third update module 17 is used to update the K cell tables according to the first update operation task when the data content in the first visible sub-area has been updated.

[0171] The second update module 15 includes:

[0172] The fourth determining unit 1518 is used to determine a third update operation task associated with the first sub-region to be updated in response to a selection operation for the first sub-region to be updated in the region to be updated, based on the first update operation task and the second update operation task.

[0173] The first content update unit 1519 is used to update the data content in the first sub-area to be updated according to the third update operation task;

[0174] The fourth acquisition unit 1520 is used to acquire a second sub-region to be updated from the region to be updated, excluding the first sub-region to be updated, if the data content in the first sub-region to be updated has been updated.

[0175] The second content update unit 1521 is used to update the data content in the second sub-area to be updated according to the first update operation task and the second update operation task.

[0176] According to one embodiment of this application, Figure 13 The modules in the data table processing device shown can be individually or entirely combined into one or more units, or some of these units can be further divided into multiple functionally smaller sub-units to achieve the same operation without affecting the technical effects of the embodiments of this application. The above modules are based on logical functional division. In practical applications, the function of one module can be implemented by multiple units, or the function of multiple modules can be implemented by one unit. In other embodiments of this application, the data table processing device may also include other units. In practical applications, these functions can also be implemented with the assistance of other units, and can be implemented collaboratively by multiple units.

[0177] In this embodiment, when a first update operation task associated with a first data area of ​​a target data table is obtained, and the first data area includes data content in a visible state and data content in an invisible state in the target data table, the first data area is split into a first visible sub-area including data content in a visible state and a first non-visible sub-area including data content in an invisible state. This facilitates updating the data content in the first visible sub-area and the data content in the first non-visible sub-area separately according to the first update operation task. Simultaneously, during the update of the data content in the first visible sub-area or the first non-visible sub-area, it is not necessary to scan the entire data content of the target data table to determine whether the data content in the first visible sub-area and the first non-visible sub-area has been updated, reducing the computational resource consumption during the data table update process and improving the efficiency of the data table update. Furthermore, by prioritizing the updating of data content within the first visible sub-region according to the first update operation task, if a second update operation task associated with the second data region of the target data table is obtained during the updating of data content within the first visible sub-region, the second data region and the first non-visible sub-region are merged to obtain the area to be updated in the target data table. Then, when the data content within the first visible sub-region has been updated, the data content within the area to be updated is updated according to the first and second update operation tasks. This helps reduce the amount of data updated in a single update, lowers the probability of data table lag, and improves the smoothness and efficiency of data table updates. Simultaneously, merging the second data region and the first non-visible sub-region reduces the number of updates and the amount of computation required for the target data table, thereby improving the update efficiency of the target data table. Additionally, the first sub-region to be updated within the area to be updated can be updated according to the needs of the target user, enabling rapid acquisition of the area that the target user needs to update and timely updating and rendering of that area, achieving flexibility in updating the area to be updated and improving the user experience.

[0178] Please see Figure 14 , Figure 14 This is a schematic diagram of the structure of a computer device provided in an embodiment of this application. Figure 14As shown, the computer device 1000 may include a processor 1001, a network interface 1004, and a memory 1005. Furthermore, the computer device 1000 may also include a user interface 1003 and at least one communication bus 1002. The communication bus 1002 is used to enable communication between these components. The user interface 1003 may include a display screen and a keyboard; optionally, the user interface 1003 may also include a standard wired interface or a wireless interface. The network interface 1004 may optionally include a standard wired interface or a wireless interface (such as a Wi-Fi interface). The memory 1005 may be high-speed RAM or non-volatile memory, such as at least one disk storage device. Optionally, the memory 1005 may also be at least one storage device located remotely from the processor 1001. Figure 14 As shown, the memory 1005, which is a computer-readable storage medium, may include an operating system, a network communication module, a user interface module, and a device control application program.

[0179] exist Figure 14 In the computer device 1000 shown, the network interface 1004 provides network communication functionality; the user interface 1003 is mainly used to provide an input interface for the user; and the processor 1001 can be used to call the device control application program stored in the memory 1005 to achieve:

[0180] Retrieve the first update operation task associated with the first data area of ​​the target data table;

[0181] If the first data region includes both visible and invisible data content in the target data table, then the first data region is split into a first visible sub-region including visible data content and a first non-visible sub-region including invisible data content.

[0182] Update the data content within the first visible sub-area according to the first update operation task;

[0183] If a second update operation task associated with the second data area of ​​the target data table is obtained, the second data area and the first non-visible sub-area are merged to obtain the area of ​​the target data table to be updated.

[0184] When the data content in the first visible sub-area has been updated, the data content in the area to be updated is updated according to the first update operation task and the second update operation task.

[0185] It should be understood that the computer device 1000 described in the embodiments of this application can perform the foregoing... Figure 3 or Figure 12 The description of the data table processing method in the corresponding embodiment can also be executed as described above. Figure 13 The description of the data table processing device in the corresponding embodiments will not be repeated here. Furthermore, the beneficial effects of using the same method will also not be repeated.

[0186] Furthermore, it should be noted that this application embodiment also provides a computer-readable storage medium, which stores a computer program executed by the aforementioned data table processing device. The computer program includes program instructions, and when the processor executes the program instructions, it can execute the aforementioned... Figure 3 and Figure 12 The description of the data table processing method in the corresponding embodiments will not be repeated here.

[0187] Furthermore, the beneficial effects of using the same method will not be repeated here. For technical details not disclosed in the computer-readable storage medium embodiments involved in this application, please refer to the description of the method embodiments of this application. As an example, program instructions may be deployed and executed on a computer device, or on multiple computer devices located in one location, or on multiple computer devices distributed in multiple locations and interconnected through a communication network. Multiple computer devices distributed in multiple locations and interconnected through a communication network can constitute a blockchain system.

[0188] Furthermore, it should be noted that this application also provides a computer program product or computer program, which may include computer instructions, which may be stored in a computer-readable storage medium. The processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor may execute the computer instructions, causing the computer device to perform the aforementioned actions. Figure 3 and Figure 12 The description of the data table processing method in the corresponding embodiments is already provided and will not be repeated here. Furthermore, the beneficial effects of using the same method will also not be repeated. For technical details not disclosed in the computer program products or computer program embodiments related to this application, please refer to the description of the method embodiments of this application.

[0189] It should be noted that, for the sake of simplicity, the foregoing method embodiments are all described as a series of actions. However, those skilled in the art should understand that this application is not limited to the described order of actions, as some steps may be performed in other orders or simultaneously according to this application. Furthermore, those skilled in the art should also understand that the embodiments described in the specification are preferred embodiments, and the actions and modules involved are not necessarily essential to this application.

[0190] The steps in the method of this application embodiment can be adjusted, combined, or deleted according to actual needs.

[0191] The modules in the device of this application embodiment can be merged, divided, and deleted according to actual needs.

[0192] Those skilled in the art will understand that implementing all or part of the processes in the above embodiments is possible.

[0193] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The program can be stored in a computer-readable storage medium, and when executed, it can include the processes of the embodiments of the methods described above. The storage medium can be a magnetic disk, optical disk, read-only memory (ROM), or random access memory (RAM), etc.

[0194] The above description is merely a preferred embodiment of the present invention and should not be construed as limiting the scope of the invention. Therefore, any equivalent variations made in accordance with the claims of the present invention are still within the scope of the present invention.

Claims

1. A data table processing method, characterized in that, include: Retrieve the first update operation task associated with the first data range of the target data table; If the first data region includes both visible and invisible data content in the target data table, then the first data region is split to obtain a first visible sub-region including visible data content and a first non-visible sub-region including invisible data content. Update the data content within the first visible sub-region according to the first update operation task; If a second update operation task associated with the second data area of ​​the target data table is obtained, the second data area and the first non-visible sub-area are merged to obtain the area of ​​the target data table to be updated. When the data content within the first visible sub-region has been updated, if the second data region does not overlap with the first non-visible sub-region, and the second data region is composed of the region containing the data content that is in an invisible state, then the data table update processing performance of the terminal is obtained; the terminal is a terminal used to update the target data table. The limit on the amount of data that can be updated by the terminal in a single operation is determined based on the data table update processing performance. Based on the limited data volume, the first non-visual sub-region is divided into M non-visual fragments, and based on the limited data volume, the second data region is divided into N data fragments. M and N are both positive integers greater than or equal to 2; Obtain the arrangement relationship between the first non-visible sub-region, the second data region, and the first visible sub-region; According to the arrangement relationship, the data content in the M non-visible segments is updated sequentially according to the first update operation task, and the data content in the N data segments is updated according to the second update operation task.

2. The method according to claim 1, characterized in that, The step of merging the second data region and the first non-visible sub-region to obtain the area to be updated in the target data table includes: If the second data area and the first non-visible sub-area overlap, then according to the overlap, the second data area and the first non-visible sub-area are merged to obtain the area to be updated in the target data table; If the second data area and the first non-visible sub-area do not overlap, then the second data area and the first non-visible sub-area are determined as the areas to be updated in the target data table.

3. The method according to claim 2, characterized in that, The step of merging the second data region and the first non-visible sub-region according to the overlap relationship to obtain the area to be updated in the target data table includes: Based on the overlapping relationship, the overlapping sub-region between the second data region and the first non-visible sub-region is determined; Remove the overlapping sub-region from the first non-visible sub-region to obtain the first remaining sub-region; Remove the overlapping sub-region from the second data region to obtain the second remaining sub-region; The overlapping sub-region, the first remaining sub-region, and the second remaining sub-region are determined as the areas to be updated in the target data table.

4. The method according to claim 3, characterized in that, The method further includes: If the second data area overlaps with the first non-visible sub-area, and the second remaining sub-area is composed of the area where the data content is in a visible state, then the data content in the second remaining sub-area is updated according to the second update operation task. The data content within the overlapping sub-region and the data content within the first remaining sub-region are stored in the data table management area. The first update operation task and the second update operation task are merged to obtain the target update operation task. If the data content in the second remaining sub-region has been updated, then the data content in the overlapping sub-region and the data content in the first remaining sub-region are obtained from the data table management area. The data content in the overlapping sub-region is updated according to the target update operation task, and the data content in the first remaining sub-region is updated according to the first update operation task.

5. The method according to claim 3, characterized in that, The method further includes: If the second data region overlaps with the first non-visible sub-region, and the second remaining sub-region is composed of the region where the data content is in an invisible state, then the first update operation task and the second update operation task are merged to obtain the target update operation task. According to the target update operation task, the data content in the overlapping sub-region is updated; according to the first update operation task, the data content in the first remaining sub-region is updated; and according to the second update operation task, the data content in the second remaining sub-region is updated.

6. The method according to claim 3, characterized in that, The method further includes: If the second data area overlaps with the first non-visible sub-area, and the second remaining sub-area is composed of the second visible sub-area and the second non-visible sub-area, then the data content within the second visible sub-area is updated according to the second update operation task; the second visible sub-area refers to the area where the data content in the second remaining sub-area is visible, and the second non-visible sub-area refers to the area where the data content in the second remaining sub-area is invisible. The first update operation task and the second update operation task are merged to obtain the target update operation task; If the data content in the second visible sub-region has been updated, then the data content in the overlapping sub-region is updated according to the target update operation task, the data content in the first remaining sub-region is updated according to the first update operation task, and the data content in the second non-visible sub-region is updated according to the second update operation task.

7. The method according to claim 2, characterized in that, The method further includes: If the second data area does not overlap with the first non-visible sub-area, and the second data area is composed of the area where the data content is in a visible state, then the data content in the second data area is updated according to the second update operation task. If the data content in the second data area has been updated, then the data content in the first non-visible sub-area is updated according to the first update operation task.

8. The method according to claim 2, characterized in that, The method further includes: If the second data area does not overlap with the first non-visible sub-area, and the second data area is composed of the area where the data content is in an invisible state, then the data content in the first non-visible sub-area is updated according to the first update operation task. If the data content in the first non-visible sub-region has been updated, then the data content in the second data region is updated according to the second update operation task.

9. The method according to claim 1, characterized in that, The step of updating the data content in the M non-visible fragments according to the arrangement relationship, and updating the data content in the N data fragments according to the second update operation task, includes: If the arrangement relationship indicates that both the first arrangement identifier and the second arrangement identifier are less than the third arrangement identifier, then the first decreasing direction of the arrangement identifier of the target data table in the target direction is obtained; the first arrangement identifier is used to reflect the arrangement identifier of the data content in the M non-visible segments in the target direction of the target data table, the second arrangement identifier is used to reflect the arrangement identifier of the data content in the N data segments in the target direction of the target data table, and the third arrangement identifier is used to reflect the arrangement identifier of the data content in the first visible sub-region in the target direction of the target data table; Following the first decreasing direction, the data content within the M non-visible segments is updated sequentially according to the first update operation task, and the data content within the N data segments is updated according to the second update operation task.

10. The method according to claim 1, characterized in that, The step of updating the data content in the M non-visible fragments according to the arrangement relationship, and updating the data content in the N data fragments according to the second update operation task, includes: If the arrangement relationship indicates that both the first arrangement identifier and the second arrangement identifier are greater than the third arrangement identifier, then the first increasing direction of the arrangement identifier of the target data table in the target direction is obtained; the first arrangement identifier is used to reflect the arrangement identifier of the data content in the M non-visible segments in the target direction of the target data table, the second arrangement identifier is used to reflect the arrangement identifier of the data content in the N data segments in the target direction of the target data table, and the third arrangement identifier is used to reflect the arrangement identifier of the data content in the first visible sub-region in the target direction of the target data table. Following the first incremental direction, the data content within the M non-visible segments is updated sequentially according to the first update operation task, and the data content within the N data segments is updated according to the second update operation task.

11. The method according to claim 1, characterized in that, The step of updating the data content in the M non-visible fragments according to the arrangement relationship, and updating the data content in the N data fragments according to the second update operation task, includes: If the arrangement relationship indicates that the first arrangement identifier is less than the third arrangement identifier and the second arrangement identifier is greater than the third arrangement identifier, then the second decreasing direction of the arrangement identifier of the data content in the first non-visible sub-region in the target direction and the second increasing direction of the arrangement identifier of the data content in the second data region in the target direction are obtained; the first arrangement identifier is used to reflect the arrangement identifier of the data content in the M non-visible segments in the target direction of the target data table, the second arrangement identifier is used to reflect the arrangement identifier of the data content in the N data segments in the target direction of the target data table, and the third arrangement identifier is used to reflect the arrangement identifier of the data content in the first visible sub-region in the target direction of the target data table; According to the second decreasing direction and the second increasing direction, the data content in the M non-visible segments is updated alternately according to the first update operation task, and the data content in the N data segments is updated according to the second update operation task.

12. The method according to claim 1, characterized in that, The step of updating the data content within the first visible sub-region according to the first update operation task includes: Obtain the operation type of the first update operation task; Based on the operation type, in the first visible sub-region, Q cell tables associated with the first update operation task are determined; Q is a positive integer. The Q cell tables are updated according to the first update operation task.

13. The method according to claim 1, characterized in that, The method further includes: If no second update operation task associated with the second data area of ​​the target data table is obtained, then according to the operation type of the first update operation task, K cell tables associated with the first update operation task are determined in the first non-visible sub-area; K is a positive integer. When the data content in the first visible sub-area has been updated, the K cell tables are updated according to the first update operation task.

14. The method according to claim 1, characterized in that, The step of updating the data content in the area to be updated according to the first update operation task and the second update operation task includes: In response to the selection operation of the first sub-region to be updated in the region to be updated, a third update operation task associated with the first sub-region to be updated is determined according to the first update operation task and the second update operation task. The data content in the first sub-region to be updated is updated according to the third update operation task; If the data content in the first sub-region to be updated has been updated, then a second sub-region to be updated, other than the first sub-region to be updated, is obtained from the region to be updated. The data content in the second sub-region to be updated is updated according to the first update operation task and the second update operation task.

15. A data table processing device, characterized in that, include: The acquisition module is used to acquire the first update operation task associated with the first data area of ​​the target data table; The splitting module is used to split the first data region into a first visible sub-region including visible data content and a first non-visible sub-region including invisible data content if the first data region includes visible data content and invisible data content in the target data table. The first update module is used to update the data content within the first visible sub-area according to the first update operation task; The merging module is used to merge the second data area and the first non-visible sub-area if a second update operation task associated with the second data area of ​​the target data table is obtained, to obtain the area to be updated of the target data table. The second update module includes a first acquisition unit, a second determination unit, a division unit, a second acquisition unit, and a tenth update unit; The first acquisition unit is configured to, when the data content within the first visible sub-region has been updated, if the second data region does not overlap with the first non-visible sub-region and the second data region is composed of the region containing data content that is in an invisible state, then acquire the data table update processing performance of the terminal; the terminal is a terminal used to update the target data table; The second determining unit is used to determine the limited amount of data that the terminal can update in a single operation based on the data table update processing performance. The partitioning unit is used to partition the first non-visual sub-region into M non-visual fragments according to the limited data volume, and to partition the second data region into N data fragments according to the limited data volume. M and N are both positive integers greater than or equal to 2; The second acquisition unit is used to acquire the arrangement relationship between the first non-visible sub-region, the second data region, and the first visible sub-region; The tenth update unit is used to update the data content in the M non-visible slices according to the arrangement relationship, in turn, according to the first update operation task, and to update the data content in the N data slices according to the second update operation task.

16. A computer device, characterized in that, include: Processor and memory; The processor is connected to a memory, wherein the memory is used to store a computer program, and the processor is used to invoke the computer program to cause the computer device to perform the method according to any one of claims 1-14.

17. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program adapted to be loaded and executed by a processor to cause a computer device having the processor to perform the method of any one of claims 1-14.

18. A computer program product, characterized in that, The computer program product includes computer instructions stored in a computer-readable storage medium, the computer instructions being adapted to be read and executed by a processor to cause a computer device having the processor to perform the method of any one of claims 1-14.

Images