Data access method and system of power and environment monitoring system, medium and product

Abstract

The invention relates to the technical field of data access management and control, in particular to a data access method and system of a power and environment monitoring system, a medium and a product, and the method comprises the steps: recognizing sensing positions, data collection types and data updating frequencies corresponding to all sensors in the power and environment monitoring system; carrying out region division based on the sensing position and the data acquisition type corresponding to each sensor to obtain at least one sensing region; determining a data bin corresponding to each sensor based on the data updating frequency of each sensor in each sensing area, wherein each data bin corresponds to a data chain table; judging whether a to-be-accessed data bin exists or not based on the storage capacity of the data chain table corresponding to each data bin; and if yes, based on the to-be-accessed data bin and the to-be-accessed data chain table corresponding to the to-be-accessed data bin, updating a polling mechanism of the dynamic environment monitoring system to obtain a new polling mechanism, and performing data access operation based on the new polling mechanism. According to the invention, the timeliness and accuracy of data access can be improved.

Description

Technical Field

[0001] This application relates to the technical field of data access control, and in particular to a data access method, system, medium, and product for a dynamic environment monitoring system. Background Art

[0002] Data access in a dynamic environment monitoring system mainly refers to transmitting real-time data of power equipment and environmental parameters in places such as computer rooms and base stations to the dynamic environment monitoring system through specific interfaces and protocols, so as to timely detect abnormal situations in relevant power equipment or environmental parameters, prevent potential risks, etc. Data access in the dynamic environment monitoring system is a key link to realize real-time monitoring of power equipment and environmental parameters. Therefore, for the dynamic environment monitoring system, the accuracy and timeliness in the data access process are crucial.

[0003] In related technologies, generally, query requests are sent to each sensor node periodically at regular intervals, and the received data is processed after waiting for a response. However, since it is necessary to periodically query whether all sensor nodes need to upload data, the real-time performance during data access may be affected to a certain extent. Especially in the case of large network latency or a large number of sensor nodes, the update speed of data access may become slower. At the same time, since it is necessary to continuously send query instructions to each sensor node in the order of the query period and complete the data upload operation in a timely manner after receiving a response, when the number of sensor nodes is large or widely distributed, frequent data access may lead to network congestion and system performance degradation. Summary of the Invention

[0004] In order to improve the timeliness and accuracy during data access, and reduce the risk of network congestion and system performance degradation caused by data access, this application provides a data access method, system, medium, and product for a dynamic environment monitoring system.

[0005] In a first aspect, this application provides a data access method for a dynamic environment monitoring system, adopting the following technical solution: A data access method for a dynamic environment monitoring system includes: Identifying the sensing positions, data collection types, and data update frequencies corresponding to each sensor in the dynamic environment monitoring system, and performing area division based on the sensing positions and data collection types corresponding to each sensor to obtain at least one sensing area, where each sensing area contains at least two sensors; Based on the data update frequencies of the sensors in each sensing area, determining the data bins corresponding to the sensors from the circular data wheel corresponding to the sensing area, and each data bin corresponds to a data linked list; Determine whether there is a data warehouse to be accessed based on the storage capacity of the data linked list corresponding to each data warehouse. If so, based on the data warehouse to be accessed and the data linked list to be accessed corresponding to the data warehouse to be accessed, update the polling mechanism of the dynamic environment monitoring system to obtain a new polling mechanism, and perform data access operations based on the new polling mechanism.

[0006] By adopting the above technical solution, by analyzing the sensing positions and data acquisition types of each sensor, it is convenient to group sensors with similar sensing positions or similar data acquisition types into one group, so that sensor data can reach the designated area aggregation node faster during the access process, reducing the delay during the sensor data access process. By allocating a data warehouse to each sensor in the sensing area, it is also convenient to reduce the probability of data confusion and errors during the access process. By storing the data that each sensor needs to upload in a circular data wheel and then accessing the data uploaded by the sensor after meeting certain conditions, rather than immediately completing the data upload operation after receiving a response, it is convenient to avoid network congestion or system performance degradation caused by frequent data access. At the same time, using a circular data wheel to temporarily store the data of each sensor, that is, driving data access through events, is convenient to improve the rate during the temporary storage process to cope with the situation of a large number of sensor nodes. Finally, determine whether there is a data warehouse to be accessed that requires access operations based on the storage capacity of the data linked list, rather than always querying whether the sensor needs to perform data access operations in a fixed order, and adjust the data access strategy according to actual needs, which is convenient to avoid invalid queries of the sensor, thus facilitating the timeliness during data access.

[0007] In a possible implementation manner, determining the data warehouse corresponding to each sensor from the circular data wheel corresponding to the sensing area based on the data update frequency of each sensor in the sensing area includes: Sort all the sensors corresponding to the sensing area based on the data update frequency of each sensor, and determine the data warehouse number corresponding to each sensor based on the sorting result; Determine the data importance level corresponding to each sensor based on the historical access record, and determine the linked list length corresponding to each sensor based on the data importance level of each sensor and the preset linked list mapping relationship, where the preset linked list mapping relationship is the corresponding relationship between the data importance level and the linked list length; Determine the data warehouse corresponding to each sensor based on the data warehouse number and the linked list length corresponding to each sensor.

[0008] By adopting the above technical solution, by sorting all the sensors in the sensing area according to the data update frequency, it is convenient to allocate the sensors with relatively close update frequencies to adjacent or nearby areas, thereby facilitating the reduction of the moving path of the data pointer in the circular data wheel. In addition, by analyzing the importance of the data of each sensor, it is convenient to process data of different importance more accurately, ensuring that important data is preferentially accessed. By analyzing and determining the data warehouse position and linked list length of each sensor, it is convenient to improve the adaptability between the data warehouse and the actual data access requirements, thereby facilitating the maintenance of efficient data access and processing capabilities.

[0009] In a possible implementation manner, after determining the data warehouse corresponding to the preset sensor, the method further includes: Determining the data type of the data to be stored corresponding to the preset sensor based on the historical access record, and allocating corresponding linked list spaces for different data types; Integrating the historical storage records within the first preset time period to determine the storage frequency of each linked list space within the first preset time period; Adjusting the linked list space corresponding to the preset sensor in the second preset time period based on the storage frequency.

[0010] By adopting the above technical solution, by analyzing the historical storage records, it is convenient to understand the access frequency of different types of data to be stored to each linked list space during the temporary storage process. When a storage requirement is detected, by analyzing the storage requirement, it is convenient to timely and accurately determine the linked list space to be stored, and the linked list pointer can be directly moved from the current pointing position to the linked list space to be stored for data storage, thereby facilitating the improvement of the flexibility and efficiency during the data storage process. In addition, by adjusting the linked list spaces corresponding to different data types according to the access frequency of each linked list space during the temporary storage process, it is convenient to reduce the moving path of the linked list pointer during the data storage process, thereby facilitating the improvement of the data storage rate.

[0011] In a possible implementation manner, the method further includes: If a storage requirement is detected within the second preset time period, determining the linked list space to be stored based on the storage requirement, and moving the linked list pointer from the current pointing position to the linked list space to be stored for data storage; When it is detected that the storage in the linked list space to be stored is completed, determining the next pointing position of the linked list pointer based on the storage frequency.

[0012] By adopting the above technical solution, by analyzing the access frequency of each linked list space in the temporary storage process within the historical time period, the next pointing position of the linked list pointer is determined, which is convenient for further reducing the moving path of the original pointer when completing the storage operation of the next storage requirement, and is also convenient for improving the data storage rate when completing the next storage requirement.

[0013] In a possible implementation manner, the method further includes: Recording the data storage amount and the remaining space amount of each linked list space, and determining the real-time space occupancy rate corresponding to each linked list space; Determining the display coverage rate of the corresponding data warehouse based on each real-time space occupancy rate, and determining the real-time covered area of the corresponding data warehouse based on the display coverage rate; Determining the covered display color of each data warehouse based on the data importance level corresponding to each data warehouse and the preset color mapping relationship, where the preset color mapping relationship is the corresponding relationship between the data importance level and the covered display color; Based on the real-time covered area and the covered display color corresponding to each data warehouse, updating the corresponding display area in real time to obtain a mapped data wheel.

[0014] By adopting the above technical solution, by mapping the storage quantity of the data linked list corresponding to the data warehouse to the display area of the data warehouse, it is convenient to provide an intuitive display index for relevant management personnel, so as to facilitate relevant management personnel to understand the current storage status of the data linked list corresponding to each data warehouse in a timely and accurate manner. At the same time, when the covered area is large, the access resources required for the data access operation can also be prepared in advance.

[0015] In a possible implementation manner, when the number of data to be accessed in the data warehouse to be accessed is higher than the preset quantity threshold, the method further includes: Determining the buffer parameter corresponding to the number of data to be accessed based on the number of data to be accessed in the data warehouse to be accessed and the preset buffer parameter mapping relationship, where the preset buffer parameter mapping relationship is the corresponding relationship between the number of data to be accessed and the buffer parameter; Optimizing the display coverage rate of the display area corresponding to each data warehouse based on the buffer parameter.

[0016] By adopting the above technical solution, when there are many data warehouses to be accessed, through the preset buffer parameter mapping relationship, the required buffer parameters are determined in advance, and the uncovered area is optimized based on the buffer parameters, which is convenient for realizing the optimization process of the display coverage rate, so as to facilitate relevant management personnel to discover abnormal storage situations in advance, and further facilitate relevant management personnel to reserve and plan access resources before the corresponding data warehouse needs to perform access operations, ensuring that there are sufficient access processing resources to handle the data access operations of the data warehouse.

[0017] In a second aspect, the present application provides an access system, adopting the following technical solution: An access system, the access system comprising: At least one processor; A memory; At least one application program, wherein the at least one application program is stored in the memory and is configured to be executed by the at least one processor, and the at least one application program is configured to: execute the data access method of the above-mentioned dynamic environment monitoring system.

[0018] In a third aspect, the present application provides a computer-readable storage medium, adopting the following technical solution: A computer-readable storage medium, comprising: a computer program stored therein that can be loaded and executed by a processor to execute the data access method of the above-mentioned dynamic environment monitoring system.

[0019] In a fourth aspect, the present application provides a computer program product, adopting the following technical solution: A computer program product, comprising a computer program, where the computer program, when executed by a processor, implements the data access method of the above-mentioned dynamic environment monitoring system.

[0020] In summary, the present application includes at least one of the following beneficial technical effects: By analyzing the sensing positions and data acquisition types of each sensor, it is convenient to group sensors with similar sensing positions or similar data acquisition types, so that sensor data can reach the designated area aggregation node faster during the access process, reducing the delay in the sensor data access process. By allocating a data bin for each sensor in the sensing area, it is also convenient to reduce the probability of data confusion and errors during the access process. By storing the data that each sensor needs to upload in a circular data wheel and then accessing the data uploaded by the sensor after meeting certain conditions, rather than immediately completing the data upload operation after receiving a response, it is convenient to avoid network congestion or system performance degradation caused by frequent data access. At the same time, using a circular data wheel to temporarily store the data of each sensor, that is, through event-driven data access, it is convenient to improve the rate during the temporary storage process to cope with the situation of a large number of sensor nodes. Finally, by judging whether there is a data bin to be accessed that requires an access operation based on the storage capacity of the data linked list, rather than always querying whether the sensor needs to perform a data access operation in a fixed order, and adjusting the data access strategy according to actual needs, it is convenient to avoid invalid queries of the sensor, thereby facilitating the timeliness of data access.

[0021] By mapping the storage quantity of the data linked list corresponding to the data warehouse to the display area of the data warehouse, it is convenient to provide an intuitive display index for relevant management personnel, so as to facilitate relevant management personnel to timely and accurately understand the current storage status of the data linked list corresponding to each data warehouse. At the same time, when the area of the covered area is large, the access resources required for data access operations can also be prepared in advance. Brief Description of the Drawings

[0022] Figure 1 is a schematic flowchart of a data access method for a dynamic environment monitoring system in an embodiment of the present application; Figure 2 is a schematic flowchart of a process for determining a mapped data round in an embodiment of the present application; Figure 3 is a schematic structural diagram of an access system in an embodiment of the present application. Detailed Description of the Embodiment

[0023] The following will further describe the present application in detail with reference to the Figures 1 to 3 drawings.

[0024] Those skilled in the art can make modifications to this embodiment without creative contributions according to needs after reading this specification, but as long as they are within the scope of the claims of the present application, they are protected by the Patent Law.

[0025] To make the objectives, technical solutions, and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are some, but not all, of the embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without making creative efforts belong to the scope of protection of the present application.

[0026] It should be noted that in the optional embodiments of the present application, for relevant data such as object information, when the embodiments in the present application are applied to specific products or technologies, object permission or consent needs to be obtained, and the collection, use, and processing of relevant data need to comply with the relevant laws, regulations, and standards of relevant countries and regions. That is to say, if the embodiments in the present application involve data related to objects, they need to be obtained under the authorization and consent of the objects, the authorization and consent of relevant departments, and in compliance with the relevant laws, regulations, and standards of relevant countries and regions. If personal information is involved in the embodiments, the acquisition of all personal information needs to obtain the consent of the individual. If sensitive information is involved, the separate consent of the information subject needs to be obtained, and the embodiments also need to be implemented under the authorization and consent of the object.

[0027] Specifically, the embodiment of the present application provides a data access method for a moving ring monitoring system, which is executed by an access system. The access system can be a server or a terminal device. Among them, the server can be an independent physical server, a server cluster or a distributed system composed of multiple physical servers, or a cloud server providing cloud computing services. The terminal device can be a smart phone, a tablet computer, a laptop computer, a desktop computer, etc., but is not limited thereto. The terminal device and the server can be directly or indirectly connected through wired or wireless communication methods, and the embodiment of the present application does not make any restrictions here.

[0028] Reference Figure 1 , Figure 1 is a schematic flow chart of a data access method for a moving ring monitoring system in the embodiment of the present application. The method includes steps S110 - S140, where: Step S110: Identify the sensing positions, data collection types, and data update frequencies corresponding to each sensor in the moving ring monitoring system, and perform area division based on the sensing positions and data collection types corresponding to each sensor to obtain at least one sensing area, and each sensing area contains at least two sensors.

[0029] Specifically, the sensors set in the moving ring monitoring system are used to collect the operating parameters of relevant power equipment or relevant environmental parameters. The sensors can be temperature and humidity sensors, smoke sensors, water immersion sensors, power parameter sensors, etc. The sensing position of the sensor is the installation position of the sensor. For example, the temperature and humidity sensor needs to be installed at a position where the temperature and humidity of the computer room environment can be stably reflected to ensure the accuracy and reliability of the collected temperature and humidity data. The smoke sensor needs to be installed at a position where smoke is easily detected so as to issue an alarm in time when a fire occurs, etc. The position identifier representing the sensing position can be identified from the sensing data collected by each sensor according to a preset feature recognition algorithm. The specific preset feature recognition algorithm is not specifically limited in the embodiment of the present application. Different types of sensors have different working principles and measurement principles, so the data collection types and data update frequencies corresponding to different sensors are different. The data collection types and data update frequencies corresponding to the sensors can be determined by relevant staff based on historical collection data and uploaded to the access system in advance.

[0030] By analyzing the sensing positions and data acquisition types corresponding to each sensor, all sensors are partitioned to obtain at least one sensing area. At least two sensors within the same sensing area have similar sensing positions and similar data acquisition types. All sensors can be classified based on a preset sensing distance and a preset type similarity. When the distance between the sensing positions corresponding to two sensors is less than the preset sensing distance, it can be determined that the two sensors have similar sensing positions. When the type similarity between the data acquisition types corresponding to two sensors is higher than the preset type similarity, it can be determined that the data acquisition types of the two sensors are similar. Specifically, the specific preset sensing interval and preset type similarity are not specifically limited in the embodiments of the present application.

[0031] Step S120: Based on the data update frequencies of the sensors within each sensing area, determine the data bins corresponding to each sensor from the circular data wheel corresponding to the sensing area. Each data bin corresponds to a data linked list.

[0032] Specifically, by partitioning multiple sensors into areas, it is convenient to centrally manage sensors with similar sensing positions and similar data acquisition types. A corresponding temporary storage space can be set for each sensing area according to the number of sensors within each sensing area, which is used to temporarily store the data collected by each sensor, rather than uploading the data immediately after each sensor's collection. Frequent data uploads may increase the processing pressure on the access system, which may in turn affect the execution efficiency of other tasks. Further, in order to avoid crashes or instability caused by data overload or untimely processing, the temporary storage space corresponding to each sensing area can be set as a circular data wheel. The read and write operations of the circular data wheel only involve the movement of pointers and do not require the moving of elements or memory copying. The read and write pointers move at a fixed step size and do not need to frequently update the pointer positions, thus facilitating the reduction of the complexity of temporary storage operations.

[0033] Each sensing area corresponds to a circular data wheel, and the circular data wheel contains multiple data bins. For the convenience of management, a data bin can be allocated to each sensor to temporarily store the data collected by the corresponding sensor. Since the circular data wheel is the temporary storage space for the sensors within the sensing area, once it is detected that the data linked list corresponding to a certain data bin in the circular data wheel is full, a data access operation can be performed on this data bin.

[0034] For any circular data wheel, based on the data update frequencies of the sensors within the sensing area, determining the data bins corresponding to each sensor from the circular data wheel corresponding to the sensing area may specifically include: Sort all sensors corresponding to the sensing area based on the data update frequency of each sensor, and determine the data bin number corresponding to each sensor based on the sorting result; determine the data importance level corresponding to each sensor based on the historical access record, and determine the linked list length corresponding to each sensor based on the data importance level of each sensor and the preset linked list mapping relationship, where the preset linked list mapping relationship is the corresponding relationship between the data importance level and the linked list length; determine the data bin corresponding to each sensor based on the data bin number and the linked list length corresponding to each sensor.

[0035] Specifically, since there are at least two sensors in a sensing area, a random allocation method can be used to allocate data bins to different sensors, or data bins can be allocated to different sensors according to the data update frequency of each sensor. Among them, first, at least two sensors included in the sensing area can be sorted according to the data update frequency of each sensor to obtain an update sequence, and the data update frequencies of the sensors in the update sequence are sorted from high to low or from low to high. After determining the update sequence, the data bin number can be determined based on the update sequence, and the data bin number corresponding to each sensor can be determined based on the update sequence, which can ensure that the data bins corresponding to the sensors with similar data update frequencies are adjacent.

[0036] The historical access record contains the data of each sensor completing the data access operation within the historical time period. The access frequency corresponding to each sensor can be determined according to the historical access record. The higher the access frequency, the higher the corresponding data importance level. There is a corresponding relationship between the access frequency and the data importance level, and this corresponding relationship can be uploaded to the access system in advance by relevant staff. Then, based on the preset linked list mapping relationship, the corresponding linked list length is determined for sensors with different data importance levels. The preset linked list mapping relationship is the corresponding relationship between the data importance level and the linked list length. The higher the data importance level, the shorter the corresponding linked list length, that is, the faster the frequency of data access operations needs to be executed. The specific content of the preset linked list mapping relationship is not specifically limited in the embodiments of this application and can be determined by relevant staff according to historical experimental data and then uploaded to the access system. Finally, based on the linked list lengths corresponding to each sensor, the data linked list of the corresponding data bin is determined, and the data bin number is bound to each sensor, so that the data bin corresponding to each sensor can be obtained. According to the above method, the data bin corresponding to each sensor can be determined.

[0037] By analyzing the importance of the data of each sensor, it is convenient to process data of different importance more accurately, ensure that important data is preferentially accessed, and by analyzing and determining the data bin position and linked list length of each sensor, it is convenient to improve the adaptability between the data bin and the actual data access requirements, so as to facilitate maintaining an efficient data access and processing ability.

[0038] Step S130: Determine whether there is a data warehouse to be accessed based on the storage capacity of the data linked list corresponding to each data warehouse.

[0039] Step S140: If so, based on the data warehouse to be accessed and the data linked list to be accessed corresponding to the data warehouse to be accessed, update the polling mechanism of the power environment monitoring system to obtain a new polling mechanism, and perform data access operations based on the new polling mechanism.

[0040] Specifically, the storage ratio between the storage capacity of the data linked list corresponding to the data warehouse and the storage space can be recorded in real time, and the data warehouse with a storage ratio higher than the preset ratio is determined as the data warehouse to be accessed. Among them, the specific preset ratio is not specifically limited in the embodiments of the present application and can be determined by relevant staff according to historical experimental data and then uploaded to the access system. When there is a data warehouse to be accessed, the data linked list corresponding to the data warehouse to be accessed can be determined as the data linked list to be accessed.

[0041] The polling mechanism of the power environment monitoring system can be pre-entered by relevant staff. Among them, the polling mechanism of the power environment monitoring system can be to regularly and sequentially ask each sensor in each sensing area whether it needs to perform data access operations. For example, the order of asking the sensing areas is sensing area a, sensing area b, and sensing area c. Therefore, it is necessary to sequentially ask the circular data wheels corresponding to sensing area a, sensing area b, and sensing area c according to the asking order. When there is a data linked list to be accessed in the circular data wheel, directly perform data access operations on the data linked list to be accessed. Updating the polling mechanism means promoting the data linked list to be accessed that appears at the current moment to the polling queue. For example, currently, the inquiry and access operations corresponding to sensing area b are being performed, and the inquiry order is data warehouse b1, data warehouse b2, data warehouse b3. The data warehouse being inquired at the current moment is b1. At this time, data warehouse a2 is detected as the data warehouse to be accessed in sensing area a. At this time, the polling mechanism can be updated based on data warehouse a2. The updated new polling mechanism is data warehouse b1, data warehouse a2, data warehouse b2, data warehouse b3. That is, after inquiring data warehouse b1, first perform the data access operation of data warehouse a2, and then perform the inquiry operations on data warehouse b2 and data warehouse b3 according to the original polling order.

[0042] For the embodiments of the present application, by analyzing the sensing positions and data acquisition types of each sensor, it is convenient to group sensors with similar sensing positions or similar data acquisition types, so that sensor data can reach the designated area aggregation node faster during the access process, reducing the delay in the sensor data access process. By allocating a data bin for each sensor in the sensing area, it is also convenient to reduce the probability of data confusion and errors during the access process. The data to be uploaded by each sensor is stored in a circular data wheel and the sensor-uploaded data is accessed only after certain conditions are met, rather than immediately completing the data upload operation after receiving a response, which is convenient to avoid network congestion or system performance degradation caused by frequent data access. At the same time, using a circular data wheel to temporarily store the data of each sensor, that is, event-driven data access, is convenient to improve the rate during the temporary storage process to cope with the situation of a large number of sensor nodes. Finally, the storage amount of the data linked list is used to determine whether there is a data bin to be accessed that requires an access operation, rather than always querying in a fixed order whether a sensor needs to perform a data access operation, and adjusting the data access strategy according to actual needs is convenient to avoid invalid queries of sensors, thus facilitating the timeliness during data access.

[0043] Further, after determining the data bin corresponding to the preset sensor, the method provided by the embodiments of the present application further includes: Determine the data type of the data to be stored corresponding to the preset sensor based on the historical access record, and allocate corresponding linked list spaces for different data types; integrate the historical storage records within the first preset time period to determine the storage frequency of each linked list space within the first preset time period; based on the storage frequency, adjust the linked list space corresponding to the preset sensor in the second preset time period.

[0044] Specifically, the preset sensor can be an intelligent sensor, and an intelligent sensor can collect data of multiple data types at the same time. For example, some intelligent sensors can collect temperature, humidity, light, and gas concentration at the same time. When temporarily storing the data to be stored corresponding to the intelligent sensor, different data types included in the data to be stored can be identified first according to a preset feature recognition algorithm, and then different linked list spaces can be allocated for different data types to facilitate classified storage. The specific preset feature recognition algorithm is not specifically limited in the embodiments of the present application. When temporarily storing based on the determined linked list space, the data types included in the data to be stored can be identified first, and then the data to be stored can be divided based on the data types. Finally, the linked list spaces corresponding to each divided data can be located by traversing the linked list, and the divided data can be stored in the corresponding linked list space by moving the linked list pointer.

[0045] The first preset time period is a period after temporary storage according to the determined linked list space. The duration corresponding to the first preset time period can be 30 minutes or 60 minutes. The specific duration is not specifically limited in the embodiments of the present application. The historical storage records corresponding to the first preset time period include the access frequencies of each linked list space within the first preset time period, that is, the storage frequency of each linked list space. Multiple linked list spaces are sorted according to the storage frequency of each linked list space to obtain a storage sequence. The storage frequencies of the linked list spaces in the storage sequence are sorted from high to low. Then, based on the storage sequence, the positions of each linked list space in the data linked list are adjusted to obtain a target data linked list, so as to set the linked list spaces with higher storage frequencies at adjacent or close positions. The second preset time period is a period after the target data linked list is determined. The duration corresponding to the second preset time period can be 24 hours or 48 hours. The specific duration is not specifically limited in the embodiments of the present application and can be set by relevant staff according to actual needs. Using the target data linked list for data storage operations within the second preset time period is convenient for reducing the movement path of the linked list pointer, thereby facilitating the improvement of the data storage rate. Since each linked list space is allocated based on the data type, even if the position of the linked list space in the data linked list is adjusted, it will not cause deviation when temporarily storing and dividing data.

[0046] Further, to facilitate improving the data storage rate when completing the next storage requirement, the method provided in the embodiments of the present application further includes: If a storage requirement is detected within the second preset time period, determine the linked list space to be stored based on the storage requirement, and move the linked list pointer from the current pointing position to the linked list space to be stored for data storage; when it is detected that the storage in the linked list space to be stored is completed, determine the next pointing position of the linked list pointer based on the storage frequency.

[0047] Specifically, when performing data storage according to the target data linked list within the second preset time period, a storage requirement will be generated when it is detected that the sensor has completed data acquisition. The storage requirement includes the sensor and the data to be stored. When a storage requirement is detected, the linked list space to be stored corresponding to the storage requirement can be determined through a preset feature recognition algorithm, and at the same time, the current pointing position of the linked list pointer needs to be located. Control the linked list pointer to move from the current pointing position to the linked list space to be stored, and the data to be stored can be directly written into the linked list space to be stored.

[0048] After the storage of the linked list space to be stored is completed, that is, all the data to be stored is written into the linked list space to be stored, detection and judgment can be performed based on the data volume and the written volume of the data to be stored. After the data to be stored is completely written into the corresponding linked list space to be stored, the pointing position of the linked list pointer needs to be adjusted according to the storage frequency determined in the above embodiments, that is, the linked list pointer stays in the linked list space with a higher storage frequency. For example, the linked list spaces of the target data linked list are successively linked list space 1, linked list space 2, linked list space 3, and linked list space 4. At this time, it is detected that the storage of linked list space 3 is completed, and the linked list pointer needs to be adjusted from the current pointing to linked list space 3 to pointing to linked list space 1, and the storage frequency of linked list space 1 is higher than that of linked list space 3.

[0049] By analyzing the access frequencies of each linked list space during the temporary storage process in the historical time period, the next pointing position of the linked list pointer is determined, which is convenient for further reducing the moving path of the original pointer when completing the storage operation of the next storage requirement, and is also convenient for improving the data storage rate when completing the next storage requirement.

[0050] Furthermore, to facilitate relevant management personnel to timely and accurately understand the current storage status of the data linked list corresponding to each data warehouse, the method provided in the embodiments of the present application further includes steps S210 - step S240, as Figure 2 shown, where: Step S210: Record the data storage volume and the remaining space volume of each linked list space, and determine the real-time space occupancy rate corresponding to each linked list space.

[0051] Specifically, the real-time space occupancy rate is the ratio between the data storage volume and the total storage space. The total storage space is the sum of the data storage volume and the remaining space volume, and it can be recorded or traced when the data to be stored is written into the linked list space in real time to record the data storage volume and the remaining space volume. The faster the real-time space occupancy rate, the faster the remaining space volume of the corresponding linked list space decreases. Through the above method, the space usage conditions of each linked list space can be determined. After integrating the real-time space occupancy rates of multiple linked list spaces, the real-time overall space occupancy rate corresponding to all linked list spaces can be obtained.

[0052] Step S220: Determine the display coverage rate of the corresponding data warehouse based on each real-time space occupancy rate, and determine the real-time covered area of the corresponding data warehouse based on the display coverage rate.

[0053] Specifically, for any annular data wheel, the annular data wheel can be mapped to the data layer to obtain the annular data wheel image corresponding to the annular data wheel. The display area of each data bin and the area of the corresponding display area are identified from the annular data wheel image, and the total storage space of the data linked list corresponding to the data bin is bound to the area, that is, the area mapping relationship between the total storage space and the area is established. The used storage space corresponds to the covered area. Based on this mapping relationship and each real-time space occupancy rate, that is, based on this mapping relationship and the real-time overall space occupancy rate, the display coverage rate of the corresponding data bin can be determined. The faster the display coverage rate, the faster the growth rate of the covered area, the faster the reduction rate of the uncovered area, and the smaller the total storage space. The specific method for establishing the area mapping relationship between the total storage space and the area is not specifically limited in the embodiments of the present application, as long as the real-time overall space occupancy rate can be reflected in the form of the change in the covered area. Based on the display coverage rate, the covered area can be updated in real time, so as to realize the real-time update of the covered area.

[0054] Step S230: Based on the data importance level corresponding to each data bin and the preset color mapping relationship, determine the coverage display color of each data bin. The preset color mapping relationship is the corresponding relationship between the data importance level and the coverage display color.

[0055] Specifically, the coverage display color corresponding to each data bin can be determined based on the preset color mapping relationship, that is, the covered area and the uncovered area are distinguished by using the coverage display color. The preset color mapping relationship is the corresponding relationship between the data importance level and the coverage display color. The coverage display colors corresponding to different data importance levels are not specifically limited in the embodiments of the present application, as long as the to-be-stored data of different data importance levels can be distinguished by the coverage display color. The specific content of the preset color mapping relationship is not specifically limited in the embodiments of the present application and can be determined by relevant staff according to historical experimental data and then uploaded to the access system.

[0056] Step S240: Based on the real-time covered area and the coverage display color corresponding to each data bin, update the corresponding display area in real time to obtain the mapped data wheel.

[0057] Specifically, when updating the real-time covered area corresponding to each data bin based on the real-time space occupancy rate, the corresponding coverage display color is used to cover the real-time covered area in a timely manner, so as to obtain the mapped data wheel corresponding to the display area in real-time change.

[0058] By mapping the storage quantity of the data linked list corresponding to the data warehouse to the display area of the data warehouse, it is convenient to provide an intuitive display index for relevant management personnel, so as to facilitate relevant management personnel to timely and accurately understand the current storage status of the data linked list corresponding to each data warehouse. At the same time, when the area of the covered area is large, the access resources required for data access operations can be prepared in advance.

[0059] Further, when the quantity of data to be accessed in the data warehouse to be accessed is higher than a preset quantity threshold, the method provided by the embodiments of the present application further includes: Based on the mapping relationship between the quantity of data to be accessed in the data warehouse to be accessed and the preset buffer parameter, determine the buffer parameter corresponding to the quantity of data to be accessed. The preset buffer parameter mapping relationship is the corresponding relationship between the quantity of data to be accessed and the buffer parameter; optimize the uncovered area of the display area corresponding to each data warehouse based on the buffer parameter, and determine the real-time covered area of the corresponding data warehouse based on the optimized uncovered area.

[0060] Specifically, when the quantity of data to be accessed in the data warehouse to be accessed is higher than a preset quantity threshold, it indicates that there are more data warehouses to be accessed. The specific preset quantity threshold is not specifically limited in the embodiments of the present application and can be determined by relevant staff according to historical experimental data. When the access system executes the data access operation corresponding to the data warehouse to be accessed, queuing may occur. At this time, the data access efficiency may be affected. In order to avoid queuing when processing data access operations, the coverage strategy can be adjusted in a timely manner according to the data to be accessed. First, the buffer parameter corresponding to the quantity of data to be accessed can be determined according to the preset buffer parameter mapping relationship. The preset buffer parameter mapping relationship is the corresponding relationship between the quantity of data to be accessed and the buffer parameter, and the specific content is not specifically limited in the embodiments of the present application.

[0061] The calculation formula of the space occupancy rate is: data storage quantity / (data storage quantity + space remaining quantity), where the buffer parameter is used to optimize and adjust the space remaining quantity. For example, when the quantity of data to be accessed is small, the calculation formula of the space occupancy rate is: data storage quantity / (data storage quantity + space remaining quantity); when the quantity of accessed data is large, the calculation formula of the space occupancy rate is: data storage quantity / (data storage quantity + space remaining quantity - buffer parameter). Since the space occupancy rate corresponds to the display coverage rate, by increasing the display coverage rate, it is convenient for relevant management personnel to understand the data storage situation in advance before the data access operation needs to be performed on the corresponding data warehouse. At this time, after being optimized by the buffer parameter, the optimized covered area is relatively large, which is convenient for relevant management personnel to reserve and plan access resources before the access operation needs to be performed on the corresponding data warehouse, ensuring that there are sufficient access processing resources to handle the data access operation of the data warehouse.

[0062] An access system is provided in the embodiments of the present application, as Figure 3 shown Figure 3The access system 300 shown includes: a processor 301 and a memory 303. Among them, the processor 301 and the memory 303 are connected, such as through a bus 302. Optionally, the access system 300 may further include a transceiver 304. It should be noted that in practical applications, the transceiver 304 is not limited to one, and the structure of the access system 300 does not constitute a limitation on the embodiments of the present application.

[0063] The processor 301 may be a CPU (Central Processing Unit), a general-purpose processor, a DSP (Digital Signal Processor), an ASIC (Application Specific Integrated Circuit), an FPGA (Field Programmable Gate Array), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It can implement or execute various exemplary logical blocks, modules, and circuits described in connection with the disclosure of the present application. The processor 301 may also be a combination that implements computing functions, such as a combination including one or more microprocessors, a combination of a DSP and a microprocessor, etc.

[0064] The bus 302 may include a path for transmitting information between the above components. The bus 302 may be a PCI (Peripheral Component Interconnect) bus or an EISA (Extended Industry Standard Architecture) bus, etc. The bus 302 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 3 only one line is shown in the figure, but it does not mean that there is only one bus or one type of bus.

[0065] The memory 303 can be a ROM (Read Only Memory), or other types of static storage devices that can store static information and instructions, a RAM (Random Access Memory), or other types of dynamic storage devices that can store information and instructions. It can also be an EEPROM (Electrically Erasable Programmable Read Only Memory), a CD-ROM (Compact Disc Read Only Memory), or other optical disc storage, optical disc storage (including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media, or other magnetic storage devices, or any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0066] The memory 303 is used to store the application program code for implementing the solution of this application and is controlled by the processor 301 for execution. The processor 301 is used to execute the application program code stored in the memory 303 to implement the content shown in the foregoing method embodiments.

[0067] Among them, the access system includes but is not limited to: mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Tablet Computers), PMPs (Portable Multimedia Players), in-vehicle terminals (such as in-vehicle navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. It can also be a server, etc. Figure 3 The access system shown is merely an example and should not impose any limitations on the functions and usage scope of the embodiments of this application.

[0068] The embodiments of this application provide a computer-readable storage medium on which a computer program is stored. When it runs on a computer, it enables the computer to execute the corresponding content in the foregoing method embodiments.

[0069] An embodiment of the present application provides a computer program product, which includes a computer program that, when executed by a processor, implements the method in any of the above embodiments. Compared with the related art, in the embodiment of the present application, by analyzing the sensing positions and data acquisition types of each sensor, it is convenient to group sensors with similar sensing positions or similar data acquisition types, so that sensor data can reach the designated area aggregation node faster during the access process, reducing the delay in the sensor data access process. By allocating a data bin for each sensor in the sensing area, it is also convenient to reduce the probability of data confusion and errors during the access process. The data to be uploaded by each sensor is stored in a circular data wheel and the sensor-uploaded data is accessed only after certain conditions are met, rather than immediately completing the data upload operation after receiving a response, which is convenient to avoid network congestion or system performance degradation caused by frequent data access. At the same time, using a circular data wheel to temporarily store the data of each sensor, that is, event-driven data access, is convenient to improve the rate during the temporary storage process to cope with the situation of a large number of sensor nodes. Finally, it is judged whether there is a data bin to be accessed that requires an access operation based on the storage capacity of the data linked list, rather than always querying in a fixed order whether the sensor needs to perform a data access operation, and adjusting the data access strategy according to actual needs, which is convenient to avoid invalid queries of the sensor and thus convenient to improve the timeliness during data access.

[0070] It should be understood that although the steps in the flowchart of the accompanying drawings are shown in sequence according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless there is a clear indication in this article, the execution of these steps has no strict order limit and can be executed in other orders. Moreover, at least some of the steps in the flowchart of the accompanying drawings may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily executed at the same time, but can be executed at different times, and their execution order is not necessarily sequential, but can be executed alternately or alternately with at least a part of other steps or sub-steps or stages of other steps.

[0071] The above are only some embodiments of the present application. It should be noted that for those of ordinary skill in the art, without departing from the principle of the present application, several improvements and refinements can be made, and these improvements and refinements should also be regarded as the protection scope of the present application.

Claims

1. A data access method for a dynamic environment monitoring system, characterized in that: include: Identify the sensor position, data collection type and data update frequency corresponding to each sensor in the dynamic environment monitoring system, and divide the area based on the sensor position and data collection type corresponding to each sensor to obtain at least one sensor area, each of which contains at least two sensors; Based on the data update frequency of each sensor in each sensing area, the data bin corresponding to each sensor is determined from the annular data wheel corresponding to the sensing area, and each data bin corresponds to a data linked list; Based on the storage capacity of the data linked lists corresponding to each data warehouse, determine whether there is a data warehouse to be accessed; if so, based on the data warehouse to be accessed and the data linked lists to be accessed corresponding to the data warehouse to be accessed, update the polling mechanism of the dynamic environment monitoring system to obtain a new polling mechanism, and perform data access operations based on the new polling mechanism.

2. The data access method of a dynamic environment monitoring system according to claim 1, characterized in that: Based on the data update frequency of each sensor in the sensing area, the data bin corresponding to each sensor is determined from the annular data wheel corresponding to the sensing area, including: Based on the data update frequency of each sensor, all sensors corresponding to the sensing area are sorted, and the data bin number corresponding to each sensor is determined based on the sorting result; Determine the data importance level corresponding to each sensor based on the historical access record, and determine the length of the linked list corresponding to each sensor based on the data importance level of each sensor and a preset linked list mapping relationship, wherein the preset linked list mapping relationship is a corresponding relationship between the data importance level and the linked list length; Based on the data bin number and linked list length corresponding to each sensor, the data bin corresponding to each sensor is determined.

3. The data access method of a dynamic environment monitoring system according to claim 2 is characterized in that: After determining the data bin corresponding to the preset sensor, the method further includes: Determine the data type of the data to be stored corresponding to the preset sensor based on the historical access record, and allocate corresponding linked list spaces for different data types; Integrate historical storage records within a first preset time period to determine the storage frequency of each linked list space within the first preset time period; Based on the storage frequency, the linked list space corresponding to the preset sensor in the second preset time period is adjusted.

4. The data access method of a dynamic environment monitoring system according to claim 3 is characterized in that: Also includes: If a storage demand is detected within a second preset time period, a linked list space to be stored is determined based on the storage demand, and a linked list pointer is moved from a current pointing position to the linked list space to be stored for data storage; When it is detected that the storage in the to-be-stored linked list space is completed, the next pointing position of the linked list pointer is determined based on the storage frequency.

5. The data access method of a dynamic environment monitoring system according to claim 3 is characterized in that: Also includes: Record the data storage capacity and remaining space of each linked list space, and determine the real-time space occupancy rate corresponding to each linked list space; Determine a display coverage rate of a corresponding data bin based on each real-time space occupancy rate, and determine a real-time covered area of ​​the corresponding data bin based on the display coverage rate; Determine the overlay display color of each data bin based on the data importance level corresponding to each data bin and a preset color mapping relationship, wherein the preset color mapping relationship is a correspondence between the data importance level and the overlay display color; Based on the real-time covered area and coverage display color corresponding to each data bin, the corresponding display area is updated in real time to obtain a mapping data wheel.

6. The data access method of a dynamic environment monitoring system according to claim 5, characterized in that: When the number of data warehouses to be accessed is higher than a preset number threshold, the method further includes: Determine the buffer parameter corresponding to the number of data bins to be accessed based on the mapping relationship between the number of data bins to be accessed and the preset buffer parameter, wherein the preset buffer parameter mapping relationship is a corresponding relationship between the number of data bins to be accessed and the buffer parameter; The display coverage rate of the display area corresponding to each data bin is optimized based on the buffer parameters.

7. An access system, characterized in that: The access system includes: at least one processor; Memory; At least one application, wherein the at least one application is stored in a memory and configured to be executed by at least one processor, and the at least one application is configured to: execute a data access method for a dynamic environment monitoring system according to any one of claims 1-6.

8. A computer-readable storage medium, characterized in that: include: A computer program is stored which can be loaded by a processor and execute a data access method for a dynamic environment monitoring system as described in any one of claims 1-6.

9. A computer program product, characterized in that It includes a computer program, which, when executed by a processor, implements the steps of a data access method for a dynamic environment monitoring system according to any one of claims 1 to 6.

Images