A method for computing spatiotemporal big data based on bitmap groups
The original spatiotemporal data is stored in the form of a bitmap group through the bitmap group tool set, and the binary information values in the basic bitmap are used to solve the problem of insufficient information expression capabilities of traditional bitmap methods, and more efficient storage and computing resource utilization are achieved .
Patent Information
- Application Number
- CN202410078460.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-01-19
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2044-01-19
AI Technical Summary
The traditional bitmap method has weak information expression capabilities when storing big data and requires a large storage space.
Using a spatiotemporal big data calculation method based on bitmap groups, the original spatiotemporal data is stored in the form of a bitmap group through the bitmap tool set, and the same position values in the basic bitmap are used to form binary information values, breaking through the limitations of the bit value field , improve information expression ability.
Store more information in limited storage space, save storage space, while maintaining the advantages of computing resources, and expanding bitmap application scenarios.
Smart Images

Figure CN117591520B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of data processing technology, and in particular to a method for calculating spatiotemporal big data based on a bitmap group. Background Art
[0002] In the field of big data, it is usually necessary to store a large amount of basic data for the above applications. For example, the currently commonly used method for storing data is the bitmap method, which uses bitmaps to store information. For example, suppose the data stored in a bitmap is 1, 0, 0, 0, 0, 0, different positions represent different objects, and the value at any position represents the information of the object corresponding to the position. However, since the value at any position only includes two types, 0 and 1. Therefore, the traditional bitmap method has weak information expression ability when storing data, especially in the scenario of storing a large amount of data, it needs to occupy a large storage space. Summary of the invention
[0003] The main purpose of this application is to provide a spatiotemporal big data calculation method based on bitmap groups, aiming to solve the technical problem that the traditional bitmap method has weak information expression ability when storing data and requires a large storage space.
[0004] To achieve the above object, the present application provides a method for calculating spatiotemporal big data based on a bitmap group, wherein the bitmap group is configured with a bitmap group toolset, and the method comprises:
[0005] Based on the bitmap group toolset, the original spatiotemporal data is stored in the form of a bitmap group, wherein the bitmap group includes a basic bitmap, and the basic bitmap values at the same relative position in each basic bitmap constitute the information data of the record object corresponding to the relative position, wherein the information data is a binary information value.
[0006] To achieve the above-mentioned purpose, the present application also provides a device for a bitmap group-based spatiotemporal big data calculation method, and the device for a bitmap group-based spatiotemporal big data calculation method comprises: a memory, a processor, and a bitmap group-based spatiotemporal big data calculation program stored in the memory and executable on the processor, and when the bitmap group-based spatiotemporal big data calculation program is executed by the processor, the steps of the working method of the bitmap group-based spatiotemporal big data calculation method are implemented as described above.
[0007] To achieve the above-mentioned objectives, the present application also provides a readable storage medium, on which a bitmap group-based spatiotemporal big data calculation program is stored. When the bitmap group-based spatiotemporal big data calculation program is executed by a processor, the steps of the working method of the bitmap group-based spatiotemporal big data calculation method are implemented as described above.
[0008] A method for calculating spatiotemporal big data based on a bitmap group is proposed in an embodiment of the present application. The present application will store the original spatiotemporal data in the form of a bitmap group based on a bitmap group tool set, wherein the bitmap group includes a basic bitmap, and the basic bitmap values at the same relative position in each basic bitmap constitute the information data of the record object corresponding to the relative position, wherein the information data is a binary information value. It can be understood that since the information data composed of the basic bitmap values at the same position on different basic bitmaps in the bitmap group is a binary information value, compared with whether the two states are expressed in the traditional bitmap method, the binary information value of the present application can break through the limitation of the bit value domain, greatly improve the information expression ability of the data, and can store more information in a limited storage space, thereby achieving the purpose of saving storage space. At the same time, since the information expression ability of the data in the bitmap group is improved, the expansion of the bitmap application scenario can be achieved while maintaining the original advantage of the bitmap in saving computing resources. BRIEF DESCRIPTION OF THE DRAWINGS
[0009] Figure 1 It is a schematic diagram of the device structure of the hardware operating environment involved in the embodiment of the present application;
[0010] Figure 2 This is a schematic diagram of the original bitmap of the original spatiotemporal data in the spatiotemporal big data calculation method based on the bitmap group of this application;
[0011] Figure 3 This is a flow chart of the first embodiment of the spatiotemporal big data calculation method based on bitmap groups of the present application;
[0012] Figure 4 A schematic diagram of a bitmap group in the bitmap group-based spatiotemporal big data calculation method of the present application;
[0013] Figure 5 This is a flow chart of a second embodiment of the spatiotemporal big data calculation method based on bitmap groups of the present application;
[0014] Figure 6 This is a flow chart of a third embodiment of the spatiotemporal big data calculation method based on bitmap groups of the present application;
[0015] Figure 7 This is an application scenario diagram of the bitmap group addition tool in the bitmap group-based spatiotemporal big data calculation method of this application;
[0016] Figure 8 This is a flow chart of a fourth embodiment of the bitmap group-based spatiotemporal big data calculation method of the present application;
[0017] Fig. 9 This is an application scenario diagram of the bitmap group subtraction tool in the bitmap group-based spatiotemporal big data calculation method of this application;
[0018] Fig.10 A mapping table for binary subtraction operation scenarios in the bitmap group-based spatiotemporal big data calculation method of this application;
[0019] Fig.11 This is a flowchart of a fifth embodiment of the bitmap group-based spatiotemporal big data calculation method of the present application;
[0020] Fig.12 This is a schematic diagram of the granularity of the bitmap group in the crowd residence scene in the spatiotemporal big data calculation method based on the bitmap group of this application;
[0021] Fig.13 This is a schematic diagram of the binary indicator values in the spatiotemporal big data calculation method based on bitmap groups in this application.
[0022] The realization of the purpose, functional features and advantages of this application will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION
[0023] It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.
[0024] like Figure 1 As shown, Figure 1 It is a schematic diagram of the device structure of the hardware operating environment involved in the embodiment of the present application.
[0025] The device in the embodiment of the present application can be an electronic terminal device such as a PC, a smart phone, a tablet computer, a portable computer, etc.
[0026] like Figure 1 As shown, the device may include: a processor 1001, such as a CPU, a network interface 1004, a user interface 1003, a memory 1005, and a communication bus 1002. Among them, the communication bus 1002 is used to realize the connection and communication between these components. The user interface 1003 may include a display screen (Display), an input unit such as a keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface and a wireless interface. The network interface 1004 may optionally include a standard wired interface and a wireless interface (such as a WI-FI interface). The memory 1005 may be a high-speed RAM memory, or a stable memory (non-volatile memory), such as a disk memory. The memory 1005 may also be a storage device independent of the aforementioned processor 1001.
[0027] Optionally, the device may also include a camera, an RF (Radio Frequency) circuit, a sensor, an audio circuit, a WiFi module, and the like. Among them, sensors include light sensors, motion sensors, and other sensors. Specifically, the light sensor may include an ambient light sensor and a proximity sensor, wherein the ambient light sensor may adjust the brightness of the display screen according to the brightness of the ambient light, and the proximity sensor may turn off the display screen and / or backlight when the mobile terminal is moved to the ear. As a type of motion sensor, the gravity acceleration sensor can detect the magnitude of acceleration in each direction (generally three axes), and can detect the magnitude and direction of gravity when stationary. It can be used for applications that identify the posture of the mobile terminal (such as horizontal and vertical screen switching, related games, magnetometer posture calibration), vibration recognition related functions (such as pedometer, tapping), etc.; of course, the mobile terminal can also be equipped with other sensors such as gyroscopes, barometers, hygrometers, thermometers, infrared sensors, etc., which will not be repeated here.
[0028] Those skilled in the art will understand that Figure 1 The device structure shown in the figure does not constitute a limitation of the device, and may include more or less components than shown in the figure, or combine certain components, or arrange the components differently.
[0029] like Figure 1 As shown, the memory 1005 as a computer storage medium may include an operating system, a network communication module, a user interface module, and a spatiotemporal big data calculation program based on a bitmap group.
[0030] exist Figure 1 In the device shown, the network interface 1004 is mainly used to connect to the backend server and perform data communication with the backend server; the user interface 1003 is mainly used to connect to the client (user end) and perform data communication with the client; and the processor 1001 can be used to call the spatiotemporal big data calculation program based on the bitmap group stored in the memory 1005, and the bitmap group is configured with a bitmap group tool set, and performs the following operations:
[0031] Based on the bitmap group toolset, the original spatiotemporal data is stored in the form of a bitmap group, wherein the bitmap group includes a basic bitmap, and the basic bitmap values at the same relative position in each basic bitmap constitute the information data of the record object corresponding to the relative position, wherein the information data is a binary information value.
[0032] Furthermore, the bitmap group toolset includes at least one or more of a bitmap group addition tool, a bitmap group subtraction tool, and a bitmap group segment acquisition tool, wherein the bitmap group addition tool is used for binary addition operations between bitmaps and bitmap groups, and between bitmap groups and bitmap groups, and the bitmap group subtraction tool is used for binary subtraction operations between bitmap groups and bitmap groups.
[0033] Further, the processor 1001 may call the spatiotemporal big data calculation program based on the bitmap group stored in the memory 1005, and further perform the following operations:
[0034] Different digits in the binary information value correspond to different basic bitmaps in the bitmap group, the bitmap group participating in the binary addition includes a first bitmap group and a second bitmap group, the first bitmap group includes a first basic bitmap, and the second bitmap group includes a second basic bitmap;
[0035] In the process of performing binary addition operation between bitmap groups based on the bitmap group addition tool, the method includes:
[0036] For any one of the recording objects and any one of the digits in the binary information value of the recording object, an XOR operation is performed on the target first basic bitmap value of the recording object at the corresponding relative position in the first basic bitmap representing the digit and the first addition object, to obtain the local result of the binary addition operation on the digit, wherein the first addition object is the target second basic bitmap value at the corresponding relative position of the recording object in the second basic bitmap representing the digit, or is the carry result of the binary addition operation on the adjacent low-order bits of the digit in the binary information value and the target second basic bitmap value;
[0037] Perform an AND operation on the target first basic bitmap value and the target second basic bitmap value to obtain a first result, perform an OR operation on the target first basic bitmap value and the target second basic bitmap value to obtain a second result, perform an AND operation on the second result and the carry result of the binary addition operation on the adjacent low-order bits to obtain a third result, and perform an OR operation on the first result and the third result to obtain the carry result of the binary addition operation on the bits.
[0038] Further, the processor 1001 may call the spatiotemporal big data calculation program based on the bitmap group stored in the memory 1005, and further perform the following operations:
[0039] Different digits in the binary information value correspond to different basic bitmaps in the bitmap group, the bitmap group involved in the binary subtraction includes a third bitmap group and a fourth bitmap group, the third bitmap group includes a third basic bitmap, and the fourth bitmap group includes a fourth basic bitmap;
[0040] In the process of performing a binary subtraction operation between bitmap groups based on a bitmap group subtraction tool, the method includes:
[0041] For any one of the recording objects and any one of the digits in the binary information value of the recording object, an XOR operation is performed on the target third basic bitmap value at the corresponding relative position of the recording object in the third basic bitmap representing the digit and the subtraction object to obtain a local result of the binary subtraction operation on the digit, wherein the subtraction object is the target fourth basic bitmap value at the corresponding relative position of the recording object in the fourth basic bitmap representing the digit, or is a borrow result of the subtraction operation on the adjacent low-order bits of the digit in the binary information value and the target third basic bitmap value;
[0042] An AND operation is performed on the negative of the target third basic bitmap value and the borrow result of the subtraction operation on the adjacent low-order bit to obtain a fourth result, an XOR operation is performed on the target third basic bitmap value and the borrow result of the subtraction operation on the adjacent low-order bit to obtain a fifth result, an AND operation is performed on the negative of the fifth result and the target fourth basic bitmap value to obtain a sixth result, and an OR operation is performed on the fourth result and the sixth result to obtain the borrow result of the subtraction operation on the bit.
[0043] Further, the processor 1001 may call the spatiotemporal big data calculation program based on the bitmap group stored in the memory 1005, and further perform the following operations:
[0044] The original spatiotemporal data is an original bitmap, and the original bitmap includes an original bitmap value;
[0045] The step of storing the original spatiotemporal data in the form of a bitmap group based on the bitmap group toolset comprises:
[0046] For any record object recorded in the bitmap group, based on the bitmap group addition tool in the bitmap group toolset, the target original bitmap value corresponding to the record object in the original spatiotemporal data is binary accumulated to obtain the target basic bitmap value corresponding to the record object in the basic bitmap of the bitmap group, so as to store the original spatiotemporal data in the form of a bitmap group.
[0047] Further, the processor 1001 may call the spatiotemporal big data calculation program based on the bitmap group stored in the memory 1005, and further perform the following operations:
[0048] Different digits in the binary information value correspond to different basic bitmaps in the bitmap group;
[0049] The step of performing binary accumulation of the target original bitmap values corresponding to the record object in the original spatiotemporal data based on the bitmap group addition tool in the bitmap group toolset to obtain the target basic bitmap value corresponding to the record object in the basic bitmap of the bitmap group comprises:
[0050] For any binary addition operation in the accumulation process, and any base bitmap of the bitmap group in the binary addition, an XOR operation is performed on the current base bitmap value of the record object at the corresponding relative position in the base bitmap and the second addition object to obtain the target base bitmap value of the record object at the relative position in the base bitmap, wherein, in the case where the base bitmap represents the lowest digit in the binary information value, the second addition object is the target original bitmap value, and in the case where the base bitmap represents the non-lowest digit in the binary information value, the second addition object is the carry result obtained by binary addition of the relevant bitmap values at the relative position in the adjacent low-order base bitmap of the base bitmap;
[0051] An AND operation is performed on the current basic bitmap value and the second addition object to obtain a carry result of binary addition of the relevant bitmap values at the relative position in the basic bitmap.
[0052] Further, the processor 1001 may call the spatiotemporal big data calculation program based on the bitmap group stored in the memory 1005, and further perform the following operations:
[0053] The method further comprises:
[0054] After receiving the acquisition instruction, determining the sub-indicator range based on the target indicator range in the acquisition instruction;
[0055] Based on the bitmap group segment acquisition tool in the bitmap group tool set, the basic data pointed to by the sub-indicator range is acquired from the database in segments, wherein the data in the database is stored in the form of the bitmap group;
[0056] The basic data is operated based on the bitmap group addition tool and / or the bitmap group subtraction tool in the bitmap group tool set to obtain the target data pointed to by the target indicator range.
[0057] Further, the processor 1001 may call the spatiotemporal big data calculation program based on the bitmap group stored in the memory 1005, and further perform the following operations:
[0058] The step of obtaining the basic data pointed to by the sub-indicator range from the database in segments includes:
[0059] For any sub-index range, segmenting is performed based on the highest digit of the binary index value in the sub-index range to obtain search segments, wherein the highest digit initially determined in the binary index value is the highest non-zero digit in the binary index value, and when initially segmenting, the binary index values with the same highest digit position are assigned to one search segment;
[0060] For any search segment, if the search segment is a complete search segment, searching for matches from the database based on the numerical characteristics of the binary indicator value in the complete search segment to obtain the sub-basic data pointed to by the complete search segment;
[0061] The obtained sub-basic data are merged into the basic data based on the bitmap group addition tool in the bitmap group tool set.
[0062] Further, the processor 1001 may call the spatiotemporal big data calculation program based on the bitmap group stored in the memory 1005, and further perform the following operations:
[0063] The types of the search segments include complete search segments and incomplete search segments;
[0064] After the step of segmenting to obtain search segments based on the highest digit of the binary indicator value in the sub-indicator range, the method comprises:
[0065] The length of the search segment is compared with the complete length corresponding to the highest digit of the binary index value in the search segment, wherein the calculation formula of the complete length is complete length = 2 n-1 , where n is the position of the highest digit;
[0066] If the length of the search segment is less than the complete length corresponding to the highest digit, the search segment is an incomplete search segment;
[0067] If the length of the search segment is equal to the complete length corresponding to the highest digit, the search segment is a complete search segment.
[0068] Further, the processor 1001 may call the spatiotemporal big data calculation program based on the bitmap group stored in the memory 1005, and further perform the following operations:
[0069] Before the step of searching for a match from the database based on the numerical feature of the binary indicator value in the complete search segment to obtain the sub-basic data pointed to by the complete search segment, the method includes:
[0070] If the search segment is a complete search segment, for any binary indicator value of the complete search segment, the digit determined to be the highest digit in the binary indicator value and the bitmap value of each highest digit, and the high-order bitmap value after the highest digit initially determined in the binary indicator value are all zero as the numerical feature;
[0071] If the search segment is an incomplete search segment, the adjacent lower bits of the highest digit in the binary index value are used as the new highest digit;
[0072] Segmenting the incomplete search segment based on the new highest bitmap value to obtain new search segments, wherein binary indicator values having the same new highest bitmap value are classified as the same new search segment;
[0073] Based on the new highest bit and the new search segment, return to the step of comparing the length of the search segment with the complete length corresponding to the highest digit of the binary indicator value in the search segment until there are no incomplete search segments in the segmented search segments.
[0074] Further, the processor 1001 may call the spatiotemporal big data calculation program based on the bitmap group stored in the memory 1005, and further perform the following operations:
[0075] The step of searching for matches from the database based on the numerical features of the binary index values in the complete search segment to obtain the sub-basic data pointed to by the complete search segment comprises:
[0076] Searching for a match from a database based on the bitmap value of the highest digit to obtain a preliminary match result;
[0077] For any candidate binary index value in the preliminary matching result, performing an OR operation on the high-order bitmap value after the highest digit initially determined in the binary index value to obtain a seventh result;
[0078] If the seventh result is not one, taking the candidate binary index value as the target binary index value;
[0079] The bitmap group data pointed to by the target binary indicator value in the database is used as the sub-basic data.
[0080] Further, the processor 1001 may call the spatiotemporal big data calculation program based on the bitmap group stored in the memory 1005, and further perform the following operations:
[0081] The database includes bitmap groups of different granularities, wherein the granularity represents the size of a segment unit corresponding to information data in the bitmap group;
[0082] The step of determining the sub-indicator range based on the target indicator range in the acquisition instruction comprises:
[0083] According to the segment units included in the target indicator range and with the goal of minimizing the number of operations, the sub-indicator range of the target indicator range and the operation formula associated with the sub-indicator range are determined, wherein, for any sub-indicator range, the granularity of the bitmap group pointed to by each binary indicator value in the sub-indicator range is the same, and the operation formula is used for the operation of the basic data.
[0084] In order to clearly illustrate the present application solution, a data storage scenario is taken as an example.
[0085] For example, in a scenario where the spatiotemporal data of a group of people is stored, the spatiotemporal data is whether a user (a person in the group) resides at a base station at a certain location during a certain period of time. Figure 2 , is a schematic diagram of the original bitmap in the original spatiotemporal data of this application. The original bitmap values stored in the original bitmap in the figure are 1, 0, 0, 1, 1, ..., N in sequence. Assume that the original bitmap is a five-minute snapshot result of a base station at a certain moment, and 0 represents non-residence, and 1 represents residence. As shown in the figure, the 4th bit in the original bitmap is bitmap value 1, and the 4th bit corresponds to user 4, and the bitmap value 1 represents that the base station corresponding to the original bitmap and the corresponding five minutes of user 4 are in a resident state. It can be seen that the original bitmap is equivalent to the detailed situation representing the resident state of the crowd. If each five-minute detailed data is stored, in practical applications, a huge storage space is required. Therefore, in view of the above situation, this application proposes a spatiotemporal big data calculation method of a bitmap group tool set, that is, storing data in the form of a bitmap group. Compared with the traditional bitmap method, the bitmap group of this application can improve the information expression ability of the bitmap value, so that more data can be stored using a limited bitmap to achieve the purpose of saving storage space.
[0086] Reference Figure 3 , which is the first embodiment of the spatiotemporal big data calculation method based on the bitmap group of the present application, wherein the bitmap group is configured with a bitmap group tool set, and the method comprises:
[0087] Step S10, based on the bitmap group toolset, the original spatiotemporal data is stored in the form of a bitmap group, wherein the bitmap group includes a basic bitmap, and the basic bitmap values at the same relative position in each basic bitmap constitute the information data of the recording object corresponding to the relative position, wherein the information data is a binary information value.
[0088] It should be noted that the above-mentioned bitmap group tool set includes bitmap group tools, and different bitmap group tools can realize different functions. For example, the types of bitmap group tools include bitmap group addition tools. The bitmap group addition tools are used to perform binary accumulation of the original bitmap values of the original bitmaps in the original spatiotemporal data to obtain the basic bitmap values of the basic bitmaps in the bitmap group. Exemplarily, the bitmap group includes a basic bitmap. Usually, there are multiple basic bitmaps in a bitmap group (there may also be only one basic bitmap in a basic bitmap). The basic bitmap values at the same relative position in each basic bitmap will constitute the information data of the recording object corresponding to the relative position. Taking the above-mentioned resident crowd scene as an example, the recording object can be a user, and the bitmap values at different positions (i.e., different relative positions, for example, the nth bit in a bitmap) in the bitmap (which can be a basic bitmap or an original bitmap) correspond to different users, and the same position (i.e., the above-mentioned same relative position) in different bitmaps corresponds to the same user. For example, in the basic position Figure 1 The second and base positions in Figure 2 The second bit in corresponds to the same user. However, it should be noted that the information data composed of the basic bitmap values in this application is a binary information value. For example, a binary information value can be 1101. Based on the above example, the binary information value can represent the number of times the user stays in a time period, rather than just whether the user stays. Figure 4 , is a schematic diagram of a bitmap group in this application. As shown in the figure, the bitmap group includes a base bit Figure 1 To the basic position Figure 4 The third bit of each basic bitmap corresponds to user 3, and the corresponding information data of user 3 is 1101 (it should be noted that in actual applications, the corresponding order of each basic bitmap and the binary information value in the information data can be set by the technician according to actual needs, that is, Figure 4The information data of user 3 in the bitmap is 1101 or 1011, which can be set freely). It can be understood that since the binary information value can represent the number of residence times, which is equivalent to the statistics of whether the residence data is retained, the binary information value stored in the bitmap group can represent more information, thereby saving storage space. For example, in practical applications, it is necessary to understand the residence status of personnel at a certain location, which is usually counted in hours or days (no need to be refined to minutes). Assuming that each original bitmap corresponds to a 5-minute period, in the traditional bitmap method, if you want to determine the residence status of a certain person in one hour, you need to store 12 bitmaps (original bitmaps) to determine whether the person is retained in each five-minute time period in one hour. It is understandable that if the snapshot frequency is once every five minutes, the person can stay at most 12 times in one hour, each time for five minutes. If the maximum number of stays in one hour is 12 times, and it is converted into a binary value of 1100, each data in 1100 is stored in a different basic bitmap, so 4 basic bitmaps are required, that is, the bitmap group for the above scenario needs to be composed of 4 basic bitmaps. Therefore, in the above information expression scenario, for the same person residence information, the traditional bitmap method requires at least 12 bitmaps (original bitmaps) to complete the storage of information, while the present application requires at most 4 bitmaps (basic bitmaps) to complete the storage of information. It can be seen that the storage of data in the form of bitmap groups in the present application can reduce the space required for data storage in scenarios where a large amount of information data needs to be stored.
[0089] In this embodiment, the original spatiotemporal data is stored in the form of a bitmap group based on a bitmap group tool set, wherein the bitmap group includes a basic bitmap, and the basic bitmap values at the same relative position in each basic bitmap constitute the information data of the record object corresponding to the relative position, wherein the information data is a binary information value. It can be understood that since the information data composed of the basic bitmap values at the same position on different basic bitmaps in the bitmap group is a binary information value, compared with whether the two states are expressed in the traditional bitmap method, the binary information value of the present application can break through the limitation of the bit value domain, greatly improve the information expression ability of the data, and store more information in a limited storage space, thereby achieving the purpose of saving storage space. At the same time, since the information expression ability of the data in the bitmap group is improved, the expansion of the bitmap application scenario can be achieved while maintaining the original advantage of the bitmap in saving computing resources.
[0090] In a feasible implementation, the bitmap group toolset includes at least one or more of a bitmap group addition tool, a bitmap group subtraction tool, and a bitmap group segment acquisition tool, wherein the bitmap group addition tool is used for binary addition operations between bitmaps and bitmap groups, and between bitmap groups and bitmap groups, and the bitmap group subtraction tool is used for binary subtraction operations between bitmap groups and bitmap groups.
[0091] Exemplarily, the bitmap group tool set includes at least one or more of a bitmap group addition tool, a bitmap group subtraction tool, and a bitmap group segment acquisition tool. For any bitmap group tool, it can be a method that encapsulates the underlying bitmap technology and logical algebra, which can be called by upper-level applications. For example, the bitmap group addition tool can be used for binary addition operations between bitmaps and bitmap groups, and between bitmap groups and bitmap groups. For example, multiple bitmap groups can be merged. For example, if there are 24 bitmap groups with statistical unit hours, and each bitmap group corresponds to the personnel residence situation under one hour in a certain day, the bitmap group addition tool can be used to merge the 24 bitmap groups with statistical unit hours, so as to obtain the personnel residence situation of one day. The bitmap group subtraction tool is used for binary subtraction between bitmap groups and bitmap groups. The bitmap group segment acquisition tool can be used to match data (i.e., match bitmap groups) according to specified matching conditions.
[0092] In addition, the bitmap group toolset can also include a bitmap group to array tool, an array to bitmap group tool, a bitmap group and tool, a bitmap group single value acquisition tool, a bitmap group target value query tool, a bitmap group target group value query tool, a bitmap group setting target value tool, a bitmap group setting target group value tool, etc. If it is also based on the example of the above-mentioned population residence situation (residence duration), the input of the bitmap group to array tool is the bitmap group, the output is the user bitmap index value, and the usage scenario is duration data decoding; the input of the array to bitmap group tool is the user bitmap index value, the output is the bitmap group, and the usage scenario is duration data encoding; the input of the bitmap group and tool is the bitmap group and the user index bitmap, the output is the bitmap group, and the usage scenario is the duration of filtering the specified population; the input of the bitmap group single value acquisition tool is the bitmap group and the search value, the output is the index bitmap of the matching user, and the usage scenario is the population matching the specified duration interval; the input of the bitmap group target value query tool is the bitmap group and the user bitmap index list, the output is the user bitmap index value, and the usage scenario is to obtain the duration of multiple specified users; the input of the bitmap group set target value tool is the bitmap group, the user bitmap index, and the value, and the usage scenario is to update the duration of the specified user; the input of the bitmap group set target group value tool is the bitmap group and the user bitmap index value, and the usage scenario is to update the duration of multiple specified users.
[0093] Reference Figure 5 , is a second embodiment of the present application proposed based on the first embodiment of the present application, and the same or similar contents in this embodiment as those in the above embodiment can be referred to the above introduction, and will not be repeated later. In this embodiment, the original spatiotemporal data is an original bitmap, and the original bitmap includes an original bitmap value.
[0094] The step of storing the original spatiotemporal data in the form of a bitmap group based on the bitmap group toolset comprises:
[0095] Step S100, for any record object recorded in the bitmap group, based on the bitmap group addition tool in the bitmap group tool set, the target original bitmap value corresponding to the record object in the original spatiotemporal data is binary accumulated to obtain the target basic bitmap value corresponding to the record object in the basic bitmap of the bitmap group, so as to store the original spatiotemporal data in the form of a bitmap group.
[0096] In this embodiment, the scenario of the residence status of the crowd (which may be the residence duration, the number of residence times, etc.) is also used as an example for explanation. The above-mentioned original spatiotemporal data may be an original bitmap generated by a 5-minute snapshot of the base station, and the bitmap value in the original bitmap is the original bitmap. It can be understood that any original bitmap value in the original bitmap can represent the residence status of the corresponding recording object (for example, a user of a mobile communication network). For the basic bitmap value of any basic bitmap in the bitmap group, the basic bitmap value represents the value of a certain digit in the information data (binary information value) of the corresponding recording object. Therefore, it is necessary to process the original spatiotemporal data in order to obtain the data stored in the form of a bitmap group.
[0097] Exemplarily, for any record object recorded in a bitmap group (e.g., the nth bit in the base bitmap), the target original bitmap value corresponding to the record object in the original spatiotemporal data (e.g., the original bitmap value at the nth bit in the original bitmap) can be binary accumulated by the bitmap group addition tool in the bitmap group tool set, thereby obtaining the target basic bitmap value corresponding to the record object in the base bitmap of the bitmap group. For example, for a 5-minute snapshot data scenario generated by a base station in one hour, and taking the first bit as an example, assuming that the initial bitmap group includes the base bitmap. Figure 1 , and the base position Figure 1 The first bitmap value of the base bitmap is 0, the first bitmap value of the original bitmap generated by the base station is set to 1 (the first accumulated target original bitmap value), and the first bitmap value of the original bitmap in the first original bitmap is added to the base bitmap. Figure 1 The first bitmap value of the basic bitmap is added (according to the binary addition principle). At this time, the basic bitmap value of the basic bitmap is Figure 1 The base bitmap value of the first bit in the first original bitmap is changed to 1 (i.e., the first accumulated target base bitmap value). Further, the base station generates a second original bitmap, and the original bitmap value of the first bit in the second original bitmap is 1, and the original bitmap value of the first bit in the second original bitmap is compared with the current base bitmap. Figure 1 The first bitmap value of the basic bitmap is added (according to the binary addition principle), and the corresponding binary value is 10 (where 0 is the first bit in the binary value, which is the value of the basic bitmap). Figure 1 representation, and 1 is the second digit in the binary value), so a new basic bit can be added to the bitmap group Figure 2, used to represent 1 in binary value, so the basic bit in the bitmap group is Figure 1 The first bit of the basic bitmap value is 0, the basic bit Figure 2 The base bitmap value of the first bit in the third original bitmap is 1. Further, the base station generates a third original bitmap, and the original bitmap value of the first bit in the third original bitmap is 1, and compares the original bitmap value of the first bit in the third original bitmap with the current basic bitmap. Figure 1 The basic bitmap value of the first bit in the bitmap group is added, and the corresponding binary value is 11. Figure 1 The first basic bitmap value of is changed to 1. In addition, in actual use, after accumulating the original bitmap of a certain data, the original bitmap values corresponding to the same position are binary accumulated to obtain the binary value, and then the values of each digit in the binary value are saved in each basic bitmap in the bitmap group. The record objects that need to be recorded in the bitmap group can be stored in the above manner, that is, the original spatiotemporal data can be stored in the form of a bitmap group by the above binary accumulation method.
[0098] In addition, the segment unit for storing each bitmap group data can also be set by the technician according to the needs. For example, the segment unit can be hours, days, etc., and in addition to the time dimension, the segment unit can also be divided from the space dimension.
[0099] In a feasible implementation manner, different digits in the binary information value correspond to different basic bitmaps in the bitmap group; the step of performing binary accumulation on the target original bitmap value corresponding to the record object in the original spatiotemporal data based on the bitmap group addition tool in the bitmap group tool set to obtain the target basic bitmap value corresponding to the record object in the basic bitmap of the bitmap group includes:
[0100] Step S101, for any binary addition operation in the accumulation process, and for any base bitmap of the bitmap group in the binary addition, an XOR operation is performed on the current base bitmap value of the record object at the corresponding relative position in the base bitmap and the second addition object, to obtain the target base bitmap value of the record object at the relative position in the base bitmap, wherein, in the case where the base bitmap represents the lowest digit in the binary information value, the second addition object is the target original bitmap value, and in the case where the base bitmap represents the non-lowest digit in the binary information value, the second addition object is the carry result obtained by performing binary addition on the relevant bitmap values at the relative position in the adjacent low-order base bitmap of the base bitmap;
[0101] Step S102, performing an AND operation on the current basic bitmap value and the second addition object to obtain a carry result of binary addition of the relevant bitmap values at the relative position in the basic bitmap.
[0102] It should be noted that, in the binary accumulation process, the method of each binary addition operation is basically the same, so in this embodiment, one binary addition operation is taken as an example for description.
[0103] Exemplarily, for any binary addition operation, and for any base bitmap of the bitmap group in the binary addition operation. An XOR operation is performed on the current base bitmap value of the above-mentioned record object at the corresponding relative position in the base bitmap (for example, the nth bit corresponding to the record object) and the second addition object, and the target base bitmap value of the above-mentioned record object at the same relative position in the base bitmap can be obtained. It is worth noting that if the base bitmap represents the lowest digit in the binary information value (for example, if a binary information value is 110, the digit where the value 0 is located is the lowest data), then the second addition object is the target original bitmap value. If the base bitmap represents a non-lowest digit in the binary information value, the second addition object is the carry result obtained by binary addition of the relevant bitmap values at the same relative position in the adjacent low-order base bitmap of the base bitmap. For example, if the binary information value is 10 and the relative position is the 1st bit, the digit where 0 is located is determined by the base bit. Figure 1 Representation, the digit where 1 is located is represented by the base bit Figure 2 Characterization, then the basic position Figure 2 Represents the non-lowest digit in the binary information value, and the base digit Figure 1 As the basic Figure 2 The adjacent low-level basic bitmap, if in the basic position Figure 1 The binary addition of the relevant bitmap value on the first bit of is 1+1=10, so the basic bit Figure 1 The carry result is 1.
[0104] It should be noted that the result of the XOR operation of the current basic bitmap value and the second added object is the result of the operation of the local bit at the relative position in the basic bitmap (where the current basic bitmap value may take the value of 1 or 0, and similarly, the second added object may take the value of 1 or 0, and the XOR operation is specifically 0+0=0, 0+1=1, 1+0=1, 1+1=0). However, there is actually the possibility of carry. For example, if the current basic bitmap value and the second added object are both 1, according to the binary operation rules, the binary result of 1+1 should be 10, the local bitmap value should be 0 (that is, the result of the XOR operation is 1+1=0), and the carry bitmap value should be 1. Therefore, the current basic bitmap value is further ANDed with the second addition object (wherein the AND operation may specifically include 0+0=0, 0+1=0, 1+0=0, 1+1=1) to obtain a carry result of binary addition of the relevant bitmap values at the same relative position in the basic bitmap. For example, based on the above example, the current basic bitmap value and the second addition object are both 1, and the carry result obtained by the AND operation is 1.
[0105] It can be understood that in this embodiment, different logical algebras are used for calculations on the base and carry bits, so that the single yes / no information data is counted as binary information data, that is, the original bitmap is saved in the form of a bitmap group, which greatly reduces the storage space required for the information data.
[0106] Reference Figure 6 , the third embodiment of the present application is proposed based on the first embodiment and the second embodiment of the present application. The same or similar contents as the above embodiments in this embodiment can be referred to the above description, and will not be described in detail later. In this embodiment, different digits in the binary information value correspond to different basic bitmaps in the bitmap group, and the bitmap group participating in the binary addition includes a first bitmap group and a second bitmap group, the first bitmap group includes a first basic bitmap, and the second bitmap group includes a second basic bitmap;
[0107] In the process of performing binary addition operation between bitmap groups based on the bitmap group addition tool, the method includes:
[0108] Step S111, for any record object and any digit in the binary information value of the record object, perform an XOR operation on the target first basic bitmap value of the record object at the corresponding relative position in the first basic bitmap representing the digit and the first addition object, to obtain a local result of the binary addition operation on the digit, wherein the first addition object is the target second basic bitmap value at the corresponding relative position of the record object in the second basic bitmap representing the digit, or is the carry result of the binary addition operation on the adjacent low-order bits of the digit in the binary information value and the target second basic bitmap value;
[0109] Step S112, performing an AND operation on the target first basic bitmap value and the target second basic bitmap value to obtain a first result, performing an OR operation on the target first basic bitmap value and the target second basic bitmap value to obtain a second result, performing an AND operation on the second result and the carry result of the binary addition operation on the adjacent low-order bits to obtain a third result, and performing an OR operation on the first result and the third result to obtain the carry result of the binary addition operation on the bits.
[0110] It should be noted that the bitmap group addition tool can be used for binary addition operations between bitmap groups. For example, when it comes to merging statistical (or cumulative) data in a bitmap group, the bitmap group addition tool can be used to perform binary addition operations on two bitmap groups. In the process of performing binary addition operations between bitmap groups based on the bitmap group addition tool, if the bitmap groups involved in the binary addition include a first bitmap group and a second bitmap group, and the base bitmap of the first bitmap group is the first base bitmap, the base bitmap of the second bitmap group is the second base bitmap.
[0111] Exemplarily, for any record object and any digit in the binary information value of the record object, an XOR operation is performed on the target first basic bitmap value at the corresponding relative position of the record object in the first basic bitmap representing the digit and the first addition object, thereby obtaining the local result of the binary addition operation on the digit. Figure 7 This is the application scenario diagram of the bitmap group addition tool in this application. As shown in the figure, the first bitmap group includes the first basic bitmap group. Figure 1 To the first base Figure 4 , the second bitmap group includes the second basic bitmap Figure 1 To the second base Figure 4 . Assume that the recording object is user 1 (i.e. the first bit of the basic bitmap), the binary information data corresponding to user 1 in the first bitmap group and the second bitmap group are 1111 and 1011 respectively. Based on the binary operation rule, 1111+1011=11010. Take the second digit in the binary information value of the recording object as an example. The first basic bit represents the second digit in the first bitmap group. Figure 2 , in the first basic position Figure 2 The first digit in the target first basic bitmap group (that is, the relative position corresponding to the recording object user 1) is 1, and the second digit in the second bitmap group is the second basic bitmap group. Figure 2 , in the second basic position Figure 2The first target second basic bitmap value is 1 (that is, the first addition object), and the target first basic bitmap value and the target second basic bitmap value are XORed, that is, the result of the XOR operation of 1 and 1 is 0. Since there is a carry in the binary addition operation on the adjacent low-order digit of the second digit, that is, the first digit (such as 1+1 needs a carry for binary operation, and the carry result is 1), the result of the XOR operation of 0 and 1 is 1, which is consistent with the value of the second digit in the binary information value 11010. It should be noted that if there is no carry in the adjacent low-order digit, only the target first basic bitmap value and the target second basic bitmap value can be XORed, or the carry result can be used as 0 to participate in the XOR operation of the current result.
[0112] Further, after obtaining the local result of the above digit in the binary information value, the carry result of the digit is determined. The target first basic bitmap value obtained by the above process is ANDed with the target second basic bitmap value to obtain the first result, the target first basic bitmap value is ORed with the target second basic bitmap value to obtain the second result, the second result is ANDed with the carry result of the binary addition operation on the above adjacent low-order bits to obtain the third result, and the first result is ORed with the third result to obtain the carry result of the binary addition operation on the digit. For example, based on the above example, the binary information data corresponding to user 1 in the first bitmap group and the second bitmap group are 1111 and 1011 respectively. The target first basic bitmap value and the target second basic bitmap value are both 1, and the result of the AND operation of 1 and 1 is 1, that is, the first result. The result of the OR operation of 1 and 1 is 1, that is, the second result. The result of the AND operation of the second result (1) with the carry result (1) of the binary addition operation on the above adjacent low-order bits is 1, that is, the third result. The first result (1) and the third result (1) are ORed together to obtain a carry result of 1 for the binary addition operation on the digit.
[0113] In addition, it should be noted that in the process of binary addition operation, the calculation formula for the base and carry of any digit in the calculated binary information value is as follows:
[0114] The digit is the first (least significant) digit in the binary information value:
[0115] The base k[1] = a[1]⊕ b[1]
[0116] Carry m[1] = a[1] · b[1]
[0117] In the formula, the base k[1] is the base result of the addition of the first digit, a[1] is the target first base bitmap value of the first digit, b[1] is the target second base bitmap value of the first digit, the carry m[1] is the carry result of the first digit, ⊕ is the exclusive-or operation, and · is the AND operation.
[0118] The digit is the nth digit in the binary information value (n is greater than 1):
[0119] Base k[n] = a[n]⊕ b[n] ⊕ m[n-1]
[0120] Carry m[n] = (a[n] · b[n]) + ((a[n]+ b[n]) · m[n-1])
[0121] In the formula, the base k[n] is the base result of the addition of the n-th digit, a[n] is the target first basic bitmap value of the n-th digit, b[n] is the target second basic bitmap value of the n-th digit, the carry m[n] is the carry result of the n-th digit, ⊕ is an exclusive-OR operation, · is an AND operation, and + is an OR operation.
[0122] Reference Figure 8 , based on the first embodiment, the second embodiment, and the third embodiment of the present application, the fourth embodiment of the present application is proposed. The same or similar contents in this embodiment as those in the above embodiments can be referred to the above description, and will not be described in detail later. In this embodiment, different digits in the binary information value correspond to different basic bitmaps in the bitmap group, and the bitmap group involved in the binary subtraction includes a third bitmap group and a fourth bitmap group, the third bitmap group includes a third basic bitmap, and the fourth bitmap group includes a fourth basic bitmap;
[0123] In the process of performing a binary subtraction operation between bitmap groups based on a bitmap group subtraction tool, the method includes:
[0124] Step S121, for any one of the record objects and any one of the digits in the binary information value of the record object, an XOR operation is performed on the target third basic bitmap value at the corresponding relative position of the record object in the third basic bitmap representing the digit and the subtraction object, to obtain a local result of the binary subtraction operation on the digit, wherein the subtraction object is the target fourth basic bitmap value at the corresponding relative position of the record object in the fourth basic bitmap representing the digit, or is a borrow result of the subtraction operation on the adjacent low-order bits of the digit in the binary information value and the target third basic bitmap value;
[0125] Step S122, performing an AND operation on the negative of the target third basic bitmap value and the borrow result of the subtraction operation on the adjacent low-order bit to obtain a fourth result, performing an XOR operation on the target third basic bitmap value and the borrow result of the subtraction operation on the adjacent low-order bit to obtain a fifth result, performing an AND operation on the negative of the fifth result and the target fourth basic bitmap value to obtain a sixth result, and performing an OR operation on the fourth result and the sixth result to obtain the borrow result of the subtraction operation on the bit.
[0126] It should be noted that the bitmap group subtraction tool can be used for binary subtraction operations between bitmap groups. For example, when it comes to the splitting method of statistical (or cumulative) data in the bitmap group, the bitmap group subtraction tool can be used to perform binary subtraction operations on two bitmap groups. In the process of performing binary subtraction operations between bitmap groups based on the bitmap group subtraction tool, if the bitmap groups involved in the binary subtraction include the third bitmap group and the fourth bitmap group, the third bitmap group includes the third basic bitmap, and the fourth bitmap group includes the fourth basic bitmap.
[0127] Exemplarily, for any record object and any digit in the binary information value of the record object, an XOR operation is performed between the target third basic bitmap value at the corresponding relative position of the record object in the third basic bitmap representing the digit and the subtraction object to obtain the local result of the binary subtraction operation on the digit. Fig. 9 As shown in the figure, the third bitmap group includes the third basic bitmap Figure 1 To the third base Figure 4 , the fourth bitmap group includes the fourth basic bitmap Figure 1 To the fourth basic position Figure 4 , assuming that the recording object is user 1 (i.e. the first bit of the basic bitmap), the binary information data corresponding to user 1 in the third bitmap group and the fourth bitmap group are 1110 and 1011 respectively. Based on the binary operation rule, 1110-1011=0011. Take the second digit in the binary information value of the recording object as an example. The third basic bit represents the second digit in the third bitmap group. Figure 2 , in the third base position Figure 2 The target third basic bitmap value of the first digit in the fourth bitmap group (that is, the relative position corresponding to the recording object user 1) is 1, and the fourth basic bitmap value representing the second digit in the fourth bitmap group is Figure 2 , in the fourth basic position Figure 2The first target fourth basic bitmap value is 1 (i.e., the subtraction object), and the target third basic bitmap value is XORed with the target fourth basic bitmap value, i.e., the result of the XOR operation of 1 and 1 is 0. However, since there is a borrow bit in the binary subtraction operation on the adjacent low-order bit of the second digit, i.e., the first digit (e.g., when performing a binary operation of 0-1, 0 needs to be borrowed, and the borrow result is 1), the result of the XOR operation of 0 and 1 is 1, which is consistent with the value of the second digit in the binary information value 0011. It should be noted that if there is no borrow bit in the adjacent low-order bit, the target third basic bitmap value and the target fourth basic bitmap value can be XORed only, or the borrow result can be used as 0 to participate in the XOR operation of the original bit result.
[0128] Further, after obtaining the local result of the above-mentioned digit in the binary information value, the borrow result of the digit is determined. The borrow result of the subtraction operation on the adjacent low-order digit of the target third basic bitmap value obtained above is ANDed to obtain the fourth result, the borrow result of the subtraction operation on the target third basic bitmap value and the adjacent low-order digit is XORed to obtain the fifth result, the non of the fifth result is ANDed with the target fourth basic bitmap value to obtain the sixth result, and finally the fourth result is ORed with the sixth result to obtain the borrow result of the subtraction operation on the digit. For example, also based on the above-mentioned example that the binary information data corresponding to user 1 in the third bitmap group and the fourth bitmap group are 1110 and 1011 respectively. The target third basic bitmap value and the target fourth basic bitmap value on the second digit are both 1, and the borrow result of the binary subtraction operation on the adjacent low-order digit of the second digit (i.e., the first digit) is 1. The target third basic bitmap value is not 0, the fourth result obtained by AND operation of 0 and 1 is 0, the fifth result obtained by XOR operation of 1 and 1 is 0, the fifth result is not 1, the sixth result obtained by AND operation of 1 and 1 is 1, the fourth result (0) and the sixth result (1) are ORed to obtain the borrow result of the subtraction operation on the above digit, and the borrow result is 1. It is worth noting that if the values of the high-order bits after the above digit are all 0, that is, the borrow result of the above digit cannot be borrowed, then the result of this binary subtraction operation can be marked as a negative number.
[0129] In addition, it should be noted that in the process of binary subtraction operation, the calculation formula for the base and borrow of any digit in the calculated binary information value is as follows:
[0130] The digit is the first (least significant) digit in the binary information value:
[0131] K[1] = A[1]⊕ B[1]
[0132] Borrow M[1] = A[1]′· B[1]
[0133] Wherein, the base bit K[1] is the base bit result of the subtraction of the first digit, A[1] is the target third base bitmap value of the first digit, B[1] is the target fourth base bitmap value of the first digit, the carry bit M[1] is the borrow result of the first digit, ′ represents negation (the negation of 0 is 1, and the negation of 1 is 0), ⊕ is the exclusive-or operation, and · is the AND operation.
[0134] The digit is the nth digit in the binary information value (n is greater than 1):
[0135] Base K[n] = A[n]⊕ M[n-1] ⊕ B[n]
[0136] Borrow M[n] = (A[n]′·M[n-1]) + ((A[n]⊕ M[n-1])′·B[n])
[0137] Wherein, the base K[n] is the base result of the subtraction of the n-th digit, A[n] is the target third base bitmap value of the n-th digit, B[n] is the target fourth base bitmap value of the n-th digit, the borrow M[n] is the borrow result of the n-th digit, ′ represents negation (the negation of 0 is 1, and the negation of 1 is 0), ⊕ is the exclusive-or operation, · is the and operation, and + is the or operation.
[0138] It should also be noted that in practical applications, for binary addition operations and binary addition operations, the addition result, addition carry result, subtraction result, and subtraction borrow result on any digit can be obtained by mapping. Fig.10 , is a mapping table for the binary subtraction scenario in this application. When A[n], M[n-1] and B[n] are known, Fig.10 The mapping table can directly obtain M[n], that is, when the target third basic bitmap value of the n-th digit, the target fourth basic bitmap value of the n-th digit and the borrow result of the n-1-th digit are known, the borrow result of the n-th digit can be directly obtained by looking up the table.
[0139] Reference Fig.11 , based on the first embodiment, the second embodiment, the third embodiment, and the fourth embodiment of the present application, the fifth embodiment of the present application is proposed. The same or similar contents in this embodiment as those in the above embodiments can be referred to the above introduction, and will not be described in detail later. In this embodiment, the method further includes:
[0140] Step S20, after receiving the acquisition instruction, determining the sub-indicator range based on the target indicator range in the acquisition instruction;
[0141] Step S30, based on the bitmap group segmentation acquisition tool in the bitmap group tool set, segmentally acquire the basic data pointed to by the sub-indicator range from the database, wherein the data in the database is stored in the form of the bitmap group;
[0142] Step S40, operating the basic data based on the bitmap group addition tool and / or the bitmap group subtraction tool in the bitmap group tool set to obtain the target data pointed to by the target indicator range.
[0143] It should be noted that in actual applications, after the data is stored in the form of a bitmap group, there is still a need for data acquisition. According to the data acquisition need, the corresponding target data is obtained from the database, and the data in the database is stored in the form of a bitmap group.
[0144] Exemplarily, after receiving the acquisition instruction sent by the acquisition party, the sub-indicator range will be determined according to the target indicator range in the acquisition instruction. The indicator in the target indicator range can refer to the dimension of the query, such as the time dimension and the space dimension. If the indicator is the time dimension, the target indicator range can be a certain time period. If the indicator is the space dimension, the target indicator range can be a certain area.
[0145] In a feasible implementation manner, the database includes bitmap groups of different granularities, and the granularity represents the size of the segment unit corresponding to the information data in the bitmap group;
[0146] The step of determining the sub-indicator range based on the target indicator range in the acquisition instruction comprises:
[0147] Step S210, based on the segment units included in the target indicator range and with the goal of minimizing the number of operations, determine the sub-indicator range of the target indicator range and the operation expression associated with the sub-indicator range, wherein for any sub-indicator range, the granularity of the bitmap group pointed to by each binary indicator value in the sub-indicator range is the same, and the operation expression is used for the operation of the basic data.
[0148] It should be noted that the database includes bitmap groups of different granularities, and the granularity of the bitmap group represents the segment unit size corresponding to the information data stored in the bitmap group. Fig.12, is a schematic diagram of the granularity of the bitmap group in the crowd residence scenario in this application. As shown in the figure, the minimum granularity of the data is a five-minute base station residence bitmap generated by a base station. From the time dimension, statistics of 12 five-minute base station residence bitmaps can obtain an hourly base station residence bitmap group, and statistics of 24-hour base station residence bitmap groups can obtain a one-day base station residence bitmap group. From the spatial dimension, the five-minute base station residence bitmaps generated by each base station in a custom area are counted to obtain a five-minute custom area residence bitmap group, and so on to form bitmap groups of different granularities.
[0149] For example, based on the above-mentioned scenario of the flow of people staying, if the acquisition instruction is to obtain the number of people staying in a certain business district and their duration from 21:00 on September 28 to 21:00 on September 29, the target indicator range can be from 21:00 on September 28 to 21:00 on September 29, and the range actually includes the granularity of days and hours, that is, it spans different segment units. At this time, the target indicator range can be decomposed into sub-indicator ranges. It should be noted that for the determination of the sub-indicator range, the target indicator range can be decomposed to determine the sub-indicator range with the minimum number of calculations as the goal. For example, traverse each possible decomposition, and then select the sub-indicator range corresponding to the calculation formula with the least number of calculations. For example, from 21:00 on September 28 to 21:00 on September 29 can be decomposed into September 29, September 28, 21 to September 29 0 o'clock 3 hours, September 29 21 to September 30 0 o'clock 3 hours. The basic data pointed to by each sub-indicator range is obtained from the database through the bitmap group segment acquisition tool in the bitmap group tool set. For example, the basic data pointed to on September 29 is bitmap group 1, the basic data pointed to from September 28, 21st to September 29, 00:00, 3 hours is bitmap group 2, and the basic data from September 29, 21st to September 30, 00:00, 3 hours is bitmap group 3. Then, the basic data is calculated by the bitmap group addition tool and / or the bitmap group subtraction tool in the bitmap group tool set. For example, the calculation method can be bitmap group 1 + bitmap group 2 - bitmap group 3, so as to obtain the target data pointed to by the target indicator range.
[0150] In a feasible implementation manner, the step of obtaining the basic data pointed to by the sub-indicator range from the database in segments includes:
[0151] Step S310, for any sub-index range, segmenting is performed based on the highest digit of the binary index value in the sub-index range to obtain search segments, wherein the highest digit initially determined in the binary index value is the highest non-zero digit in the binary index value, and when initially segmenting, the binary index values with the same highest digit position are assigned to one search segment;
[0152] Step S320, for any search segment, if the search segment is a complete search segment, searching for a match from the database based on the numerical characteristics of the binary index value in the complete search segment, to obtain the sub-basic data pointed to by the complete search segment;
[0153] Step S330 : merging the obtained sub-basic data into the basic data based on the bitmap group addition tool in the bitmap group tool set.
[0154] It should be noted that the method for obtaining the basic data pointed to by each sub-indicator range is the same, so in this embodiment, a sub-indicator range will be used as an example for explanation. It is also worth noting that the data represented by the bitmap group in the database is a binary value. The relevant range value in the acquisition instruction sent by the acquirer is usually a decimal value. When obtaining the basic data pointed to by the sub-indicator range, the decimal value of the sub-indicator range can be converted to a binary value through the bitmap group to array tool.
[0155] Exemplarily, for any sub-indicator range, the sub-indicator range is first segmented, and the search segments are obtained by segmenting the highest digit of the binary indicator value in the sub-indicator range, wherein the highest digit initially determined in the binary indicator value is the highest non-zero digit in the binary indicator value, and when the initial segmentation is performed, the binary indicator values with the same highest digit position are assigned to one search segment. For example, assuming that the value of the sub-indicator range is 7 to 27, the sub-indicator range is converted into a binary indicator value of 111 to 11011. The basic data of the sub-indicator range is the binary information value pointed to by the binary indicator values 111 to 11011. Further, referring to Fig.13 , is a schematic diagram of binary indicator values. The figure shows the binary indicator values corresponding to values 0 to 31. When segmenting the sub-indicator range, the segmentation starts from the binary indicator value 111 corresponding to the value 7. It can be seen from the figure that the highest non-zero digit in the binary indicator value 111 is bit3 (that is, the highest digit is bit3). Further, the highest digit of the binary indicator value 1000 corresponding to the value 8 is bit4, so the binary indicator value 111 is a separate search segment. In this way, the search segments obtained by segmenting 111 to 11011 include 111 as a search segment, 1000 to 1111 as a search segment, and 10000 to 11011 as a search segment.
[0156] For any search segment, if the search segment is a complete search segment, the database is searched for matches based on the numerical characteristics of the binary index value in the complete search segment to obtain the sub-basic data pointed to by the complete search segment. The judgment condition for a complete search segment is that if the length of the search segment is equal to 2 n-1In the formula, n is the position of the highest digit, and the search segment can be determined to be a complete search segment. It should be noted that for a complete search segment, matching data can be searched based on the numerical characteristics of the binary indicator value in the complete search segment. Among them, the data characteristics are the common and unique characteristics of each binary indicator value in a complete search segment. It can be understood that by matching through numerical characteristics, part of the data in the binary indicator value can be ignored, thereby avoiding data matching based on each specific binary indicator value, increasing the speed of data matching, and improving the performance of data acquisition.
[0157] In a feasible implementation manner, the types of the search segments include complete search segments and incomplete search segments;
[0158] After the step of segmenting to obtain search segments based on the highest digit of the binary indicator value in the sub-indicator range, the method comprises:
[0159] Step S311, compare the length of the search segment with the complete length corresponding to the highest digit of the binary index value in the search segment, wherein the calculation formula of the complete length is complete length = 2 n-1 , where n is the position of the highest digit;
[0160] Step S312, if the length of the search segment is less than the complete length corresponding to the highest digit, the search segment is an incomplete search segment;
[0161] Step S313: If the length of the search segment is equal to the complete length corresponding to the highest digit, the search segment is a complete search segment.
[0162] For example, after obtaining any search segment by segmentation, the length of the search segment is compared with the complete length corresponding to the highest digit of the binary indicator value in the search segment. The length of the search segment refers to the number of binary indicator values included in the search segment, and the calculation formula of the complete length is complete length = 2 n-1 , where n is the position of the highest digit. For example, refer to Fig.13 , when the first segmentation is performed, the binary index values 1000 to 1111 will be divided into a search segment. The number of binary index values in the search segment is 8, that is, the length of the search segment is 8. At this time, the highest digit is bit5, that is, the fifth digit. Substitute n=5 into 2 n-1 The complete length of the search segment is 8, so the length of the search segment is equal to the complete length corresponding to its highest digit, so the search segment is an incomplete search segment. On the contrary, if the length of the search segment is less than the complete length corresponding to its highest digit, it means that the search segment is an incomplete search segment.
[0163] In a feasible implementation manner, before the step of searching for a match from the database based on the numerical feature of the binary indicator value in the complete search segment to obtain the sub-basic data pointed to by the complete search segment, the method includes:
[0164] Step S321, if the search segment is a complete search segment, for any binary index value of the complete search segment, the digit determined to be the highest digit in the binary index value and the bitmap value of each highest digit, and the high-order bitmap value after the highest digit determined initially in the binary index value are all zero as the numerical feature;
[0165] Step S322, if the search segment is an incomplete search segment, taking the adjacent lower bits of the highest digit in the binary index value as the new highest digit;
[0166] Step S323, segmenting the incomplete search segment based on the new highest bitmap value to obtain new search segments, wherein the binary indicator values with the same new highest bitmap value are classified as the same new search segment;
[0167] Step S324, based on the new highest bit and the new search segment, return to execute the step of comparing the length of the search segment with the complete length corresponding to the highest digit of the binary indicator value in the search segment, until there are no incomplete search segments in the segmented search segments.
[0168] Exemplarily, the search segment is determined to be a complete search segment, and for any binary index value of the complete search segment, the bitmap value determined to be the highest digit in the binary index value and the high-order bitmap value after the highest digit determined initially in the binary index value are both zero as the numerical feature of the complete search segment. Fig.13 , when segmented for the first time, the binary index values 1000 to 1111 will be divided into a search segment, where bit4 is the highest digit that has been determined, and the bitmap value is 1. At the same time, bit4 is also the highest digit that has been determined for the first time, and the high bits after it include bit5 to bit8, and the bitmap values of bit5 to bit8 are all zero. Therefore, for the search segment with binary index values of 1000 to 1111, its numerical features include bit4 value 1, and bit5 to bit8 are all 0. When searching and matching based on this numerical feature, the values on bit1 to bit3 can be ignored, thereby reducing the features that need to be matched each time and improving the matching speed.
[0169] On the contrary, if the search segment is an incomplete search segment, the adjacent low-order bits of the highest bit in the binary index value are used as the new highest bit. Fig.13, in the initial segmentation, the binary index values 10000 to 11011, a total of 12, are divided into a search segment, among which the highest digit initially determined is bit5, n=5 is substituted into 2 n-1 The complete length of the search segment is 16, so the search segment from 10000 to 11011 is an incomplete search segment, and then the adjacent low-order bit of bit5, that is, bit4, is used as the new highest digit. When segmenting the incomplete search segment by the new highest digit, it is worth noting that when segmenting the incomplete search segment, the binary indicator value with the same bitmap value of the new highest bit is classified as the same new search segment. For example, for the incomplete search segment from 10000 to 11011, after segmenting based on the new highest bit bit4, the new search segments obtained are 10000 to 10111, and 11000 to 11011. After obtaining the new search segment, based on the new search segment and the new highest bit, the step of comparing the length of the search segment with the complete length corresponding to the highest digit of the binary indicator value in the search segment is returned. For example, for the new search segment from 10000 to 10111, the new highest digit is bit4 at this time, and n=4 is substituted into 2 n-1 The complete length of the search segment is 8, and the length of the new search segment 10000 to 10111 is 8. Therefore, the new search segment 10000 to 10111 will be regarded as a complete search segment. It is worth noting that at this time, the complete search segment is determined to have the highest digits including bit4 and bit5, and the corresponding numerical features include the value of bit5 being 1 and the value of bit4 being 0. This cycle is repeated until there is no incomplete search segment in the search segments obtained by segmentation.
[0170] In a feasible implementation manner, the step of searching for a match from the database based on the numerical feature of the binary index value in the complete search segment to obtain the sub-basic data pointed to by the complete search segment includes:
[0171] Step S325, searching and matching from a database based on the digit determined to be the highest digit and the bitmap value of each highest digit to obtain a preliminary matching result;
[0172] Step S326, for any candidate binary index value in the preliminary matching result, perform an OR operation on the high-order bitmap value after the highest digit initially determined in the binary index value to obtain a seventh result;
[0173] Step S327, if the seventh result is not one, taking the candidate binary index value as the target binary index value;
[0174] Step S328: Use the bitmap group data pointed to by the target binary indicator value in the database as the sub-basic data.
[0175] Exemplarily, the binary indicator value in the database that matches the numerical feature is used as the target binary indicator value. For example, based on the above example, the numerical features of the binary indicator values 1000 to 1111 include that the bitmap value on bit4, which has been determined to be the highest digit, is 1, so the binary indicator value whose bitmap value on bit4 is 1 is searched from the database to obtain a preliminary matching result. Further, the binary indicator values of bit5 to bit8 that are all 0 are selected from the preliminary matching results as the target binary indicator value. The screening process can be determined by the calculation results of logical algebra. For example, suppose the values obtained on bit5 to bit8 are A, B, C, and D, respectively, that is, the high-order bitmap values after the highest digit initially determined in the binary indicator value, and solve A'·B'·C'·D', where · is an AND operation and ' is a negation. If the solution result is 1, it represents that the values on bit5 to bit8 are all 0.
[0176] It should also be noted that in the field of computer bitmap processing, the process of negation is relatively difficult. In order to reduce the number of operations and the number of negations, this application converts the solution of A'·B'·C'·D' into (A + B + C + D)', thereby further improving the matching performance. In the formula, · is an AND operation, ' is a negation, and + is an OR operation. That is, the high-order bitmap value after the highest digit initially determined in the binary indicator value is ORed to obtain the seventh result, and then the seventh result is negated. If the negation of the seventh result is 1, the candidate binary indicator value corresponding to the preliminary matching result can be used as the target binary indicator value. Then the bitmap group data pointed to by the target binary indicator value in the database can be used as the sub-basic data.
[0177] In addition, an embodiment of the present application also proposes a bitmap group-based spatiotemporal big data computing device, which includes: a memory, a processor, and a bitmap group-based spatiotemporal big data computing program stored in the memory and executable on the processor, wherein the bitmap group-based spatiotemporal big data computing program implements the steps of the bitmap group-based spatiotemporal big data computing method as described above when executed by the processor.
[0178] The specific implementation of the spatiotemporal big data computing device based on bitmap groups in the present application is basically the same as the above-mentioned embodiments of the spatiotemporal big data computing method based on bitmap groups, and will not be repeated here.
[0179] In addition, an embodiment of the present application also proposes a readable storage medium, on which a bitmap group-based spatiotemporal big data calculation program is stored. When the bitmap group-based spatiotemporal big data calculation program is executed by a processor, the steps of the bitmap group-based spatiotemporal big data calculation method as described above are implemented.
[0180] The specific implementation method of the medium of the present application is basically the same as the above-mentioned embodiments of the spatiotemporal big data calculation method based on bitmap groups, and will not be repeated here.
[0181] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or system including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or system. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or system including the element.
[0182] The serial numbers of the above-mentioned embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.
[0183] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application is essentially or the part that contributes to the prior art can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) as described above, and includes a number of instructions for a terminal device (which can be a computer, server, or network device, etc.) to execute the methods described in each embodiment of the present application.
[0184] The above are only preferred embodiments of the present application, and are not intended to limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the present application specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present application.
Claims
1. A spatiotemporal big data computing method based on bitmap groups, It is characterized in that The bitmap group is configured with a bitmap group toolset, and the method comprises: Based on the bitmap group toolset, the original spatiotemporal data is stored in the form of a bitmap group, wherein the bitmap group includes a basic bitmap, and the basic bitmap values at the same relative position in each basic bitmap constitute information data of the recording object corresponding to the relative position, wherein the information data is a binary information value, and different digits in the binary information value correspond to different basic bitmaps in the bitmap group, and the binary information value is a wide-range value; The original spatiotemporal data is an original bitmap, and the original bitmap includes an original bitmap value; the step of storing the original spatiotemporal data in the form of a bitmap group based on the bitmap group toolset includes: For any record object recorded in the bitmap group, based on the bitmap group addition tool in the bitmap group tool set, the target original bitmap value corresponding to the record object in the original spatiotemporal data is binary accumulated to obtain the target basic bitmap value corresponding to the record object in the basic bitmap of the bitmap group, so as to store the original spatiotemporal data in the form of a bitmap group; Among them, different digits in the binary information value correspond to different basic bitmaps in the bitmap group; the step of performing binary accumulation on the target original bitmap value corresponding to the record object in the original spatiotemporal data based on the bitmap group addition tool in the bitmap group tool set to obtain the target basic bitmap value corresponding to the record object in the basic bitmap of the bitmap group includes: For any binary addition operation in the accumulation process, and any base bitmap of the bitmap group in the binary addition, an XOR operation is performed on the current base bitmap value of the record object at the corresponding relative position in the base bitmap and the second addition object to obtain the target base bitmap value of the record object at the relative position in the base bitmap, wherein, in the case where the base bitmap represents the lowest digit in the binary information value, the second addition object is the target original bitmap value, and in the case where the base bitmap represents the non-lowest digit in the binary information value, the second addition object is the carry result obtained by binary addition of the relevant bitmap values at the relative position in the adjacent low-order base bitmap of the base bitmap; An AND operation is performed on the current basic bitmap value and the second addition object to obtain a carry result of binary addition of the relevant bitmap values at the relative position in the basic bitmap.
2. The method for calculating spatiotemporal big data based on bitmap groups as claimed in claim 1, It is characterized in that The bitmap group toolset includes at least one or more of a bitmap group addition tool, a bitmap group subtraction tool, and a bitmap group segment acquisition tool, wherein the bitmap group addition tool is used for binary addition operations between bitmaps and bitmap groups, and between bitmap groups and bitmap groups, and the bitmap group subtraction tool is used for binary subtraction operations between bitmap groups and bitmap groups.
3. The spatiotemporal big data calculation method based on bitmap groups as claimed in claim 2, It is characterized in that The bitmap group participating in the binary addition includes a first bitmap group and a second bitmap group, the first bitmap group includes a first basic bitmap, and the second bitmap group includes a second basic bitmap; In the process of performing binary addition operation between bitmap groups based on the bitmap group addition tool, the method includes: For any one of the recording objects and any one of the digits in the binary information value of the recording object, an XOR operation is performed on the target first basic bitmap value of the recording object at the corresponding relative position in the first basic bitmap representing the digit and the first addition object, to obtain the local result of the binary addition operation on the digit, wherein the first addition object is the target second basic bitmap value at the corresponding relative position of the recording object in the second basic bitmap representing the digit, or is the carry result of the binary addition operation on the adjacent low-order bits of the digit in the binary information value and the target second basic bitmap value; Perform an AND operation on the target first basic bitmap value and the target second basic bitmap value to obtain a first result, perform an OR operation on the target first basic bitmap value and the target second basic bitmap value to obtain a second result, perform an AND operation on the second result and the carry result of the binary addition operation on the adjacent low-order bits to obtain a third result, and perform an OR operation on the first result and the third result to obtain the carry result of the binary addition operation on the bits.
4. The method for calculating spatiotemporal big data based on bitmap groups as claimed in claim 2, It is characterized in that Different digits in the binary information value correspond to different basic bitmaps in the bitmap group, the bitmap group involved in the binary subtraction includes a third bitmap group and a fourth bitmap group, the third bitmap group includes a third basic bitmap, and the fourth bitmap group includes a fourth basic bitmap; In the process of performing a binary subtraction operation between bitmap groups based on a bitmap group subtraction tool, the method includes: For any one of the recording objects and any one of the digits in the binary information value of the recording object, an XOR operation is performed on the target third basic bitmap value at the corresponding relative position of the recording object in the third basic bitmap representing the digit and the subtraction object to obtain a local result of the binary subtraction operation on the digit, wherein the subtraction object is the target fourth basic bitmap value at the corresponding relative position of the recording object in the fourth basic bitmap representing the digit, or is a borrow result of the subtraction operation on the adjacent low-order bits of the digit in the binary information value and the target third basic bitmap value; An AND operation is performed on the negative of the target third basic bitmap value and the borrow result of the subtraction operation on the adjacent low-order bit to obtain a fourth result, an XOR operation is performed on the target third basic bitmap value and the borrow result of the subtraction operation on the adjacent low-order bit to obtain a fifth result, an AND operation is performed on the negative of the fifth result and the target fourth basic bitmap value to obtain a sixth result, and an OR operation is performed on the fourth result and the sixth result to obtain the borrow result of the subtraction operation on the bit.
5. The method for calculating spatiotemporal big data based on bitmap groups as claimed in claim 1, It is characterized in that The method further comprises: After receiving the acquisition instruction, determining the sub-indicator range based on the target indicator range in the acquisition instruction; Based on the bitmap group segment acquisition tool in the bitmap group tool set, the basic data pointed to by the sub-indicator range is acquired from the database in segments, wherein the data in the database is stored in the form of the bitmap group; The basic data is operated based on the bitmap group addition tool and / or the bitmap group subtraction tool in the bitmap group tool set to obtain the target data pointed to by the target indicator range.
6. The method for calculating spatiotemporal big data based on bitmap groups as claimed in claim 5, It is characterized in that The step of obtaining the basic data pointed to by the sub-indicator range from the database in segments includes: For any sub-index range, segmenting is performed based on the highest digit of the binary index value in the sub-index range to obtain search segments, wherein the highest digit initially determined in the binary index value is the highest non-zero digit in the binary index value, and when initially segmenting, the binary index values with the same highest digit position are assigned to one search segment; For any search segment, if the search segment is a complete search segment, searching for matches from the database based on the numerical characteristics of the binary indicator value in the complete search segment to obtain the sub-basic data pointed to by the complete search segment; The obtained sub-basic data are merged into the basic data based on the bitmap group addition tool in the bitmap group tool set.
7. The method for calculating spatiotemporal big data based on bitmap groups as claimed in claim 6, It is characterized in that The types of the search segments include complete search segments and incomplete search segments; After the step of segmenting to obtain search segments based on the highest digit of the binary indicator value in the sub-indicator range, the method comprises: The length of the search segment is compared with the complete length corresponding to the highest digit of the binary index value in the search segment, wherein the calculation formula of the complete length is complete length = 2 n-1 , where n is the position of the highest digit; If the length of the search segment is less than the complete length corresponding to the highest digit, the search segment is an incomplete search segment; If the length of the search segment is equal to the complete length corresponding to the highest digit, the search segment is a complete search segment.
8. The method for calculating spatiotemporal big data based on bitmap groups as claimed in claim 7, It is characterized in that Before the step of searching for a match from the database based on the numerical feature of the binary indicator value in the complete search segment to obtain the sub-basic data pointed to by the complete search segment, the method includes: If the search segment is a complete search segment, for any binary indicator value of the complete search segment, the digit determined to be the highest digit in the binary indicator value and the bitmap value of each highest digit, and the high-order bitmap value after the highest digit initially determined in the binary indicator value are all zero as the numerical feature; If the search segment is an incomplete search segment, the adjacent lower bits of the highest digit in the binary index value are used as the new highest digit; Segmenting the incomplete search segment based on the new highest bitmap value to obtain new search segments, wherein binary indicator values having the same new highest bitmap value are classified as the same new search segment; Based on the new highest bit and the new search segment, return to the step of comparing the length of the search segment with the complete length corresponding to the highest digit of the binary indicator value in the search segment until there are no incomplete search segments in the segmented search segments.
9. The method for calculating spatiotemporal big data based on bitmap groups as claimed in claim 8, It is characterized in that The step of searching for matches from the database based on the numerical features of the binary index values in the complete search segment to obtain the sub-basic data pointed to by the complete search segment comprises: Searching for a match from a database based on the bitmap value of the highest digit to obtain a preliminary match result; For any candidate binary index value in the preliminary matching result, performing an OR operation on the high-order bitmap value after the highest digit initially determined in the binary index value to obtain a seventh result; If the seventh result is not one, taking the candidate binary index value as the target binary index value; The bitmap group data pointed to by the target binary indicator value in the database is used as the sub-basic data.
10. The method for calculating spatiotemporal big data based on bitmap groups as claimed in claim 5, It is characterized in that The database includes bitmap groups of different granularities, wherein the granularity represents the size of a segment unit corresponding to information data in the bitmap group; The step of determining the sub-indicator range based on the target indicator range in the acquisition instruction comprises: According to the segment units included in the target indicator range and with the goal of minimizing the number of operations, the sub-indicator range of the target indicator range and the operation formula associated with the sub-indicator range are determined, wherein, for any sub-indicator range, the granularity of the bitmap group pointed to by each binary indicator value in the sub-indicator range is the same, and the operation formula is used for the operation of the basic data.
11. A spatiotemporal big data computing device based on bitmap groups, It is characterized in that The bitmap group-based spatiotemporal big data computing device comprises: a memory, a processor, and a bitmap group-based spatiotemporal big data computing program stored in the memory and executable on the processor. When the bitmap group-based spatiotemporal big data computing program is executed by the processor, the steps of the bitmap group-based spatiotemporal big data computing method as described in any one of claims 1 to 10 are implemented.
12. A readable storage medium, It is characterized in that The readable storage medium is a computer-readable storage medium, and a spatiotemporal big data calculation program based on a bitmap group is stored on the readable storage medium. When the spatiotemporal big data calculation program based on a bitmap group is executed by a processor, the steps of the spatiotemporal big data calculation method based on a bitmap group are implemented as described in any one of claims 1 to 10.
