A method for dynamic data entry and retrieval in a registration mechanism

The dynamic data entry and retrieval method through the registration mechanism solves the problems of low data processing efficiency and quality risks in non-standard industrial equipment, realizes efficient utilization of storage space and isolation of read and write users, and avoids data corruption and program crashes.

CN123115128APending Publication Date: 2026-11-17AEROSPACE LONG MARCH LAUNCH VEHICLE TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202610989656.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-07-03
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

In the field of industrial production, existing technologies suffer from inefficiencies and quality risks due to differences in data processing during the debugging, development, and testing of non-standard industrial equipment. In particular, there are issues such as data corruption and program crashes caused by cross-operations of multiple read and write users, as well as low storage space utilization efficiency.

Method used

The system employs a registration mechanism for dynamic data entry and retrieval, manages storage space through dynamic data access software, automatically maintains read and write pointers, supports multiple data types and scales, enables efficient allocation and reclamation of data areas, isolates read and write users, and avoids cross-operations.

Benefits of technology

It improved data processing efficiency, reduced quality risks, achieved efficient use of storage space, avoided data corruption and program crashes, and improved development efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123115128A_ABST
    Figure CN123115128A_ABST
Patent Text Reader

Abstract

This invention provides a dynamic data entry and retrieval method for a registration mechanism, including a data area method, a space occupancy method, an admission user registration method, an admission data method, an admission user deregistration method, a retrieval user registration method, a retrieval of a single data entry method, a retrieval of the latest data method, a retrieval of specified data method, a retrieval user deregistration method, and a data area clearing method. The method provided by this invention can be used to build storage space and data access process management tools. It manages read and write permissions through a read / write user registration mechanism and isolates individual read users to avoid pointer crosstalk; it achieves data area recycling and reuse through a storage area allocation and clearing mechanism; the data storage area utilizes fragmented space through an address list; and it maintains user read and write pointers through the admission and retrieval methods, avoiding quality risks caused by improper maintenance of external call pointers, reducing quality risks, and improving development efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of electronic digital data processing technology, specifically to a dynamic data entry and retrieval method with a registration mechanism. Background Technology

[0002] Data acquisition and retrieval are fundamental functions of information systems. However, information systems vary greatly, with significant differences in the types of data acquired, the size of data units, and the frequency of acquisition and retrieval. In industrial production, the debugging, development, and testing of non-standard industrial equipment often require the development of specialized data processing software due to differences in data processing. Different program codes are written for the acquisition and retrieval of data of different scales and types. Inconsistent data acquisition and retrieval can easily lead to problems such as write conflicts from multiple write users, cross-read pointers from multiple read users, and improper maintenance of read pointers, which can cause data corruption and program crashes. At the same time, such software often suffers from low utilization efficiency, such as wasted fragmented space and data areas being allocated but not reclaimed.

[0003] Therefore, there is a need for a data acquisition and retrieval method and corresponding tools that can address quality risks, adapt to various data types, different data unit sizes, different data acquisition and retrieval frequencies, automatically maintain read and write pointers, and efficiently utilize storage space. Summary of the Invention

[0004] This invention addresses the inefficiencies and quality risks caused by specialized data acquisition and retrieval systems for different product types. It provides a dynamic data entry and retrieval method with a registration mechanism that can adapt to various data types, different data unit sizes, and different data acquisition and retrieval frequencies. It also automatically maintains read and write pointers, efficiently utilizing storage space for data acquisition and retrieval.

[0005] This invention provides a method for dynamic data entry and retrieval in a registration mechanism, comprising the following steps: S1. Build dynamic data access software, allocate storage space, bind the storage space to the data area list and the storage unit address list, record the names of the data areas that have been applied for in the storage space in the data area list, and mark the address range occupied by the applied data areas in the storage unit address list as occupied; S2. The data dynamic access software obtains the name of the data area, the size of the data unit and the number of data units of the data area to be applied for and applies for the data area. When it is determined that there is no data area with the same name in the data area list, the storage unit address list is read and the remaining space of the storage space meets the application size. The data area application is successful and proceeds to step S3 to occupy space. S3. Allocate storage space addresses based on the data unit size, the number of data units, and the number of unoccupied space segments in the storage unit address list, and mark the address segments occupied this time as occupied in the storage unit address list; The process is as follows: Registering an admitted user proceeds to step S4; Admission data proceeds to step S5; Admission user cancellation proceeds to step S6; User registration for data retrieval proceeds to step S7; Data retrieval proceeds to step S8; User cancellation for data retrieval proceeds to step S9; Data area clearing proceeds to step S10. S4. The data dynamic access software obtains the name of the applied data area and the name of the admission user to be registered and registers the admission user. Only one admission user can enter data into one data area. After successful registration, the data area is bound to the admission user. S5. Admitted users automatically write data to the registered data area through the data dynamic access software; S6. The data dynamic access software obtains the space name and the username of the admitted user to be cancelled, and unbinds the data area and the admitted user to be cancelled. S7. The data dynamic access software obtains the name of the data area to be registered by the user and the username to be registered, and registers the user. After successful registration, the username is inserted into the user parameter list of the data area to be accessed, and the current access position of the user is initialized. S8. When retrieving data, the data dynamic access software retrieves one piece of data in sequence, or retrieves the latest data, or retrieves the specified data. S9. The data dynamic access software obtains the username to be deregistered and the data area name of the user to be deregistered, and removes the username to be deregistered from the list of user parameters in the data area of ​​the user to be deregistered. S10. The data dynamic access software obtains the name parameter of the data area to be cleared, records the address segment occupied by the data area to be cleared as an unoccupied space segment in the storage unit address list of the storage space, and deletes the data area information to be cleared this time from the data area list.

[0006] In the preferred embodiment of the dynamic data entry and retrieval method of the registration mechanism described in this invention, in step S1, the data dynamic access software obtains the name of the data area to be applied for, accesses the data area list, and determines whether a data area with the same name already exists. If so, the application fails because a data area with the same name already exists. If not, it determines that no data area with the same name exists, reads the storage unit address list, calculates the number of storage units required for this application, and counts the unoccupied space. The number of storage units required for this application is the product of the data unit size and the number of data units. It determines whether the remaining unoccupied space meets the scale of this application. If it does, the data area application is successful, and the process proceeds to step S2. If it does not meet the requirements, the data area application fails. The storage unit address list includes an unoccupied space segment list and an occupied storage space segment list. The storage addresses in the unoccupied space segment list are initially contiguous addresses, but become discontinuous addresses after executing the space occupancy method or the data area clearing method. In step S2, the space occupancy method is fragmented occupancy.

[0007] The dynamic data entry and retrieval method for the registration mechanism described in this invention, as a preferred embodiment, includes the following steps in step S3: S31. Obtain the number of storage units Num, the size of the data unit BlockSize, the number of data units BlockNum, the number of unoccupied space segments n in the storage unit address list, the starting storage unit address starAdd of the i-th unoccupied space segment, the ending storage unit address endAdd of the i-th unoccupied space segment, and the occupancy index m in the storage unit address list. The number of storage units Num is the product of the size of the data unit BlockSize and the number of data units BlockNum. S32 and m are initialized to 0, and the number of memory units occupied in this operation, occpNum, is initialized to 0. S33. Determine whether sufficient storage units have been occupied based on whether occpNum is greater than or equal to Num. If yes, space occupation is complete, and the space occupation method exits. If not, proceed to step S34: S34. Update the count i to the address of the next segment of storage unit, calculate the number of storage units in the i-th segment itemNum, itemNum=endAdd-starAdd; The system determines whether the free space in this segment is sufficient based on whether the sum of occpNum and itemNum is greater than or equal to the number of storage units Num. If not, the system fills the data area name into the storage unit address list in order, fills the itemNum items, updates occpNum (occpNum = occpNum + itemNum), clears the address information of the unoccupied storage space of the i-th segment, and exits the space occupation method after the space occupation is completed. If so, proceed to step S35; S35. Calculate the number of storage units occupied this time, thisNum, thisNum = Num - occpNum. Calculate the number of remaining storage units after this segment of storage units is occupied, remNum, remNum = itemNum - thisNum. Update the current requested amount of storage units, occpNum = occpNum + Num. Fill the storage unit address list in order, filling thisNum units. Determine whether the i-th segment of space is completely occupied. If not, update the starting address of the i-th segment of space, starAdd, starAdd = starAdd + thisNum. Return to step S33. If yes, clear the unoccupied storage space address information of the i-th segment and return to step S33.

[0008] In the preferred embodiment of the dynamic data entry and retrieval method for the registration mechanism described in this invention, in step S4, when an admitted user registers, the data dynamic storage and retrieval software queries the data area list to see if a data area name exists and determines whether the data area has been registered. If not, it prompts that the admitted user registration failed, and the fault is that the data area name does not exist. If yes, it continues to determine whether the data area has already registered a user. If yes, it prompts that the admitted user registration failed, and the fault is that the data area already has an admitted user. If no, it binds the data area to the admitted user and sets the initial value of the current admission position of the admitted user to zero.

[0009] The dynamic data entry and retrieval method for the registration mechanism described in this invention, as a preferred embodiment, includes the following steps in step S5: S51. The data dynamic access software obtains the data area name, the admitted username and the data to be admitted. It determines whether the data area to be written exists based on the data area name. If not, it prompts that the writing failed and the reason for the failure is that the data area is not defined. If yes, it proceeds to step S52. S52. Determine if the user to be admitted has registered. If not, indicate that the write failed and the reason for the failure is that the user has not registered. If yes, proceed to step S53. S53. The data dynamic access software reads the data unit size, data unit quantity, and currently entered item number of the data area, calculates the current admission sequence number to be written to the data area, which is the product of the data unit size of the data area and the currently entered item number, reads the address of the storage unit of the data area at the currently entered item number, fills the data content to be admitted into the data area in sequence, and updates the entered item number. After writing is complete, check if the current entry number has reached the boundary of the pending admission data area. If it has, the current admission entry is reset to zero; otherwise, the admission data is complete. The process of admitting a data entry in step S5 does not require manual updating or maintenance of the write pointer.

[0010] In the preferred embodiment of the dynamic data entry and retrieval method for the registration mechanism described in this invention, in step S6, the data dynamic access software obtains the data area name and the username of the user to be deregistered, and determines whether the username has been registered. If not, it prompts that the deregistration failed, indicating that the user has not been registered. If so, it unbinds the data area and the user to be deregistered, and clears the current admission position of the user to be deregistered. In step S9, the data dynamic access software obtains the username to be deregistered and the data area name of the user information to be deregistered, and determines whether the username to be deregistered has been registered. If not, it prompts that the deregistration failed and the fault is that it is not registered; if so, it finds the username to be deregistered and the current access position from the access user parameter list of the data area of ​​the user information to be deregistered and removes them.

[0011] The dynamic data entry and retrieval method for the registration mechanism described in this invention, as a preferred embodiment, includes the following steps in step S7: S71. The data dynamic access software obtains the name of the data area to be accessed, the user name of the user, and the current access location. It then determines whether the application for the data area to be accessed has been completed. If not, it prompts that the registration failed and the fault is that the data area name does not exist. If yes, it proceeds to step S72. S72. Determine whether the user has been registered. If not, prompt that registration failed and the fault is that a user with the same name has been registered. If yes, insert the user name into the user parameter list of the data area to be retrieved, and initialize the current retrieval position UsrReadPnt of the user in the user parameter list. In step S7, multiple users retrieve data asynchronously and independently. Step S10 includes the following steps: S101. The data dynamic access software obtains the parameters of the data area to be cleared, including the name of the data area to be cleared, the size of the data unit to be cleared, and the number of data units to be cleared; it determines whether a data area with the same name already exists. If not, it prompts that the application failed because the data area does not exist; if so, it records the storage space segment of the data area to be cleared in the storage unit address list as an unoccupied space segment list and deletes the name of the data area to be cleared from the data area list.

[0012] In the preferred embodiment of the dynamic data entry and retrieval method of the registration mechanism described in this invention, in step S8, one piece of data is retrieved sequentially to step S81, the latest data is retrieved to step S82, and the specified data is retrieved to step S83. S81 includes the following steps: S811. Obtain the name of the data area to be retrieved, the username to be retrieved, and the storage address of the data to be retrieved. Determine whether the data area to be retrieved exists. If not, prompt that the write failed and the fault is that the data area is not defined. If yes, proceed to step S812. S812. Determine if the user is registered. If not, indicate that the user failed to register, and the reason for the failure is that the user is not registered. If yes, proceed to step S813. S813. Read the data unit size, data unit quantity and current admission entry of the data area to be used. Read the current admission entry corresponding to the user. Determine whether there is unread data by comparing the current admission entry and the current admission entry. If not, the use ends. If so, proceed to step S814. S814. Calculate the current read sequence number of the data area. The current read sequence number of the data area is the product of the current read item and the size of the data unit. Sequentially retrieve one piece of data from the address pointed to by the current read sequence number in the data area and put it into the data storage address. Update the current read item of the user name. Determine whether the current retrieval position has reached the boundary of the data area. If yes, the outPoint of the current admission item is set to zero. If no, retrieve one piece of data sequentially to complete the process. S82, including the following steps: S821. Obtain the name of the data area to be retrieved, the username to be retrieved, and the storage address of the data to be retrieved. Determine whether the data area to be retrieved exists. If not, prompt that the retrieval failed and the fault reason is that the data area is not defined. If yes, proceed to step S822. S822. Determine if the user is registered. If not, indicate that the user failed to register, and the reason for the failure is that the user is not registered. If yes, proceed to step S823. S823. Read the data unit size, number of data units, and current admission entries of the data area; read the current admission entry corresponding to the user; calculate the latest data position, which is the current admission entry minus 1; determine whether the latest data position exceeds the boundary of the data area; if so, set the latest data position to zero; calculate the retrieval sequence number, which is the product of the latest data position and the data unit size; starting from the retrieval sequence number of the data area, retrieve data in sequence from a space of length equal to the data unit size and place it into the data storage address. Retrieving specified data in S83 includes the following steps: S831, Obtain the name of the data area to be retrieved, the username to be retrieved, the specified location to be retrieved, and the storage address of the retrieved data; Determine if the data area exists. If not, indicate that the data area has failed to be defined. If it does exist, proceed to step S832. S832. Determine if the user is registered. If not, indicate that the user failed to register, and the reason for the failure is that the user is not registered. If yes, proceed to step S833. S833. Determine whether the specified location is reasonable. If not, indicate that the location failed to be used, and the reason for the failure is that the specified location parameters are unreasonable. If yes, proceed to step S834. S834. Read the size and number of data units in the data area, calculate the retrieval sequence number, which is the product of the specified retrieval location and the size of the data unit. Starting from the retrieval sequence number in the data area, retrieve a segment of space with a data unit size of length and put the data into the retrieval data storage address.

[0013] The dynamic data entry and retrieval method of the registration mechanism described in this invention, as a preferred embodiment, involves applying for multiple data areas in step S1 according to the operation of the data dynamic storage and retrieval software. The data area elements include: data area name, data unit size, number of data units, storage unit address list, registered user information, and retrieval user parameter list. The registration information for admitted users includes the user's name and current admission location; The list of users accessing the service includes registration information for one or more users, including the user's name and current location. The data dynamic access software is created and packaged after being edited using a programming language, and the storage space is a non-differentiated data cache area.

[0014] This invention provides a dynamic data entry and retrieval method with a registration mechanism. The dynamic data access software manages storage space and the dynamic data access process, forming a data management tool. Data is divided into multiple data areas through application, and data areas are recycled and reused through data area application and data area clearing methods. For each data area, read and write permissions are managed through user registration and retrieval methods, and individual retrieval users are isolated to avoid read pointer overlap. The data storage area utilizes fragmented space through storage unit address columns. The user's read and write pointers are automatically maintained through the data entry and retrieval methods.

[0015] The present invention has the following advantages: (1) The present invention provides a data warehouse and its management method based on a dynamic registration mechanism. The data warehouse components include undifferentiated data storage space, a data area list and an occupied storage space segment list. The data warehouse management method includes a data area application method, a user registration method, a user deregistration method, a user registration retrieval method, a user deregistration retrieval method, a method for admitting one piece of data, a method for retrieving the next piece of data, a method for retrieving the latest data, a method for retrieving specified data, and a storage area clearing method.

[0016] (2) This invention upgrades the data storage area into a data storage tool through a data storage management method that is compatible with the storage space. It manages read and write permissions through a read and write user registration mechanism and isolates individual read users to avoid pointer crossover. It realizes the recycling and reuse of the data area through a storage area application and clearing mechanism. The data storage area realizes fragmented space utilization through an address list. It maintains the user's read and write pointers through an admission and retrieval method to avoid quality risks caused by improper maintenance of external call pointers, thereby reducing quality risks and improving development efficiency. Attached Figure Description

[0017] Figure 1 A flowchart illustrating a dynamic data entry and retrieval method for a registration mechanism; Figure 2 A schematic diagram of the data storage space for a dynamic data entry and retrieval method of a registration mechanism; Figure 3 A schematic diagram of a data management tool component for a dynamic data entry and retrieval method based on a registration mechanism; Figure 4 A flowchart illustrating the data area application method for a dynamic data entry and retrieval mechanism under a registration mechanism; Figure 5 A flowchart of a data area clearing method for a dynamic data entry and retrieval method under a registration mechanism; Figure 6 This is a flowchart illustrating the execution of a dynamic data entry and retrieval method for a registration mechanism. Figure 7 A flowchart of a dynamic data entry and retrieval method for a registration mechanism, including the method for updating the list of unoccupied workpiece segments; Figure 8 A flowchart illustrating the user registration method for a dynamic data entry and retrieval mechanism; Figure 9 A flowchart illustrating the user registration and deregistration process for a dynamic data entry and retrieval mechanism. Figure 10 This is a flowchart illustrating the user registration method for a dynamic data entry and retrieval mechanism. Figure 11 A flowchart illustrating the user cancellation method for a dynamic data entry and retrieval method within a registration mechanism; Figure 12 A flowchart of a data entry and retrieval method for a dynamic data entry and retrieval mechanism under a registration system; Figure 13 A flowchart illustrating a method for sequentially retrieving a single data entry from a dynamic data entry and retrieval system, as part of a registration mechanism. Figure 14A flowchart illustrating the sequential retrieval of the latest data method for a dynamic data entry and retrieval mechanism in a registration mechanism; Figure 15 This is a flowchart illustrating the sequential retrieval of specified data method for a dynamic data entry and retrieval method within a registration mechanism. Detailed Implementation

[0018] The technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Example 1

[0019] like Figures 1-15 As shown, a dynamic data entry and retrieval method based on a registration mechanism is described. This method and tool are applied to data generation and consumption nodes. Its components include a non-differentiated data storage space, a data area list, and a list of occupied storage space segments. The methods include: a data area application method, a user registration method, a user deregistration method, a user registration retrieval method, a user deregistration method, a method for registering one piece of data, a method for retrieving the next piece of data, a method for retrieving the latest data, a method for retrieving specified data, and a storage area clearing method.

[0020] The data area elements include: data area name, storage unit address list, data unit size, number of data units, registration information of admitted users, and a list of users who have accessed the data. The user access list contains the registration information of each user. The registration information of admitted users includes their username and current location. The registration information of users who have accessed the data includes their username and current location.

[0021] Includes the following steps: S1. Build dynamic data access software, allocate storage space, bind the storage space to the data area list and the storage unit address list, record the names of the data areas that have been applied for in the storage space in the data area list, and mark the address range occupied by the applied data areas in the storage unit address list as occupied; S2, Method for applying for a data area Input parameters include data area name, data cell size, and number of data cells; Check if a data area with the same name already exists. If it does, indicate that the application failed because a data area with the same name already exists. If not, read the list of currently unused space fields avlblList[] and calculate the remaining space; calculate the number of storage units required for this application; check if the remaining space meets the application size. If it does, execute space occupancy (step S2); if it does not, indicate failure because the space is insufficient.

[0022] Step S3 space occupancy method includes: S31. Obtain the following data: Number of storage units required for this application: Num, BlockSize, BlockNum, number of unoccupied space segments: n, starting storage unit address of segment i: starAdd, ending storage unit address of segment i: endAdd, and storage unit address list occupancy number m.

[0023] S32. Initialize the sequence number of the memory unit address list to m=0. Initialize the number of memory units occupied this time to occpNum=0.

[0024] S33. Determine if enough storage units occpNum ≥ Num have been occupied. If yes, exit; otherwise, proceed with the following steps: S34. Update the counter i to the address of the next segment, and calculate the number of storage units in the i-th segment: itemNum = endAdd - starAdd. Determine if the free space in this segment is sufficient (occpNum + itemNum ≥ Num). If not, fill the BuffName storage unit address list buffNameMemCellAddList in order, filling it with itemNum units. Update the current requested usage amount (occpNum = occpNum + itemNum), clear the unoccupied storage space address information of the i-th segment, and then jump to step S26. If sufficient, execute the following steps.

[0025] S35. Calculate the number of storage units occupied this time: thisNum = Num - occpNum. Calculate the number of remaining storage units after this segment is occupied: remNum = itemNum - thisNum. Update the current requested storage unit occcpNum = Num. Fill the BuffName storage unit address list buffNameMemCellAddList in order, filling thisNum units. Determine whether the i-th segment of space is fully occupied. If not, update the starting address of the i-th segment of space starAdd = starAdd + thisNum. If so, clear the unoccupied storage space address information of the i-th segment.

[0026] S36. Repeat step S33.

[0027] The process is as follows: User registration proceeds to step S4; admission data proceeds to step S5; user cancellation proceeds to step S6; user registration proceeds to step S7; data retrieval proceeds to step S8; user cancellation proceeds to step S9; and data area clearing proceeds to step S10.

[0028] S4. User Registration Method Obtain the data zone name (BuffName) and the registered username (WriteUsrName). Determine if the data zone application has been completed. If not, indicate registration failure, the error being that the data zone name does not exist. If yes, proceed with the following steps.

[0029] Check if the data area has already been registered with admitted users. If so, indicate a registration failure, indicating that the data area already has admitted users. Otherwise, bind the admitted user to the data area name BuffName with WriteUsrName and set the corresponding user's current admission position m_BuffInputPoint to its initial value.

[0030] The advantage of the admission user registration mechanism is that it can manage access permissions and avoid multiple admissions from different devices, which can cause data chaos and damage.

[0031] S5, Method for admitting one data point Obtain the data area name (BuffName), the admission username (WriteUsrName), and the data content to be admitted (data). Check if the data area exists. If it does not exist, indicate a write failure, the reason being that the data area is undefined. If it exists, execute the following steps.

[0032] Check if the user is registered. If not, indicate a write failure, the reason being that the user is not registered. If registered, proceed with the following steps.

[0033] Read the data unit size BlockSize of the corresponding data area (BuffName). Read the number of data units BlockNum of the corresponding data area (BuffName). Read the currently entered item number inputPoint. Calculate the current admission sequence number m = inputPoint * BlockSize in the data area buffNameMemCellAddList to be written. Read the address add of the storage unit of the sequence number inputPoint in the corresponding data area buffNameMemCellAddList, and fill the corresponding content of the data to be admitted into buffNameMemCellAddList in sequence. Update the entered item number inputPoint++. Check if the current entered item number inputPoint has reached the boundary of the data area. If so, the current admission item is zeroed out, inputPoint = 0.

[0034] The advantage of using this method for admission data is that users of this tool do not need to maintain the read pointer themselves, thus reducing quality risks.

[0035] S6. Method for canceling the registration of admitted users Obtain the data area name (BuffName) and the admission username (WriteUsrName). Check if the username is registered; if not, indicate a failed cancellation, indicating an unregistered status. If registered, unbind the data area name (BuffName) and the admission username (WriteUsrName), and clear the corresponding user's current admission position (m_BuffInputPoint) to its initial value.

[0036] S7. Retrieve User Registration Method S71. Obtain the data area name (BuffName) and the username (ReadName). Determine if the data area application has been completed. If not, indicate registration failure, indicating the data area name does not exist. If yes, proceed with the following steps.

[0037] S72. Determine if the username has already been registered. If not, indicate registration failure, indicating that a user with the same name has already been registered. If yes, insert the user ReadUsrName into the user parameter list of BuffName in the data area, and initialize the current position UsrReadPnt of the corresponding user ReadUsrName in the user parameter list of BuffName in the data area.

[0038] The advantage of using the user registration mechanism is that multiple users can access data asynchronously and independently.

[0039] S8. Data retrieval method: S81. Method for retrieving one data item in sequence S811. Obtain the data area name (BuffName), retrieve the username (ReadUsrName), and the data storage address (data). Check if the data area exists. If it does not exist, indicate a read failure, the reason being that the data area is not defined. If it exists, execute the following steps.

[0040] S812. Determine if the user is registered. If not registered, indicate that the retrieval failed, and the reason for the failure is that the user is not registered. If registered, proceed with the following steps.

[0041] S813. Read the data unit size BlockSize of the corresponding data area (BuffName), read the data unit quantity BlockNum of the corresponding data area (BuffName), read the current admission entry inputPoint of the corresponding data area (BuffName), and read the current access entry outPoint corresponding to the current user ReadUsrName. Compare inputPoint and outPoint to determine if there is any unread data. If not, end; otherwise, execute the following steps.

[0042] S814. Calculate the current access sequence number m = outPoint * BlockSize of the data area buffNameMemCellAddList. Retrieve data sequentially from the address pointed to by sequence number m in the buffNameMemCellAddList list and place it into data. Update the current access entry outPoint++ of ReadUsrName. Check if the current access position has reached the boundary of the data area; if so, reset the current access entry outPoint to zero.

[0043] The advantage of using this method to retrieve data is that users of this tool do not need to maintain the read pointer themselves, reducing quality risks.

[0044] S82. Method for obtaining the latest data S821. Obtain the data area name (BuffName), retrieve the username (ReadUsrName), and the data storage address (data). Check if the data area exists. If it does not exist, indicate a write failure, the reason being that the data area is not defined. If it exists, execute the following steps.

[0045] S822. Determine if the user is registered. If not registered, indicate that the retrieval failed, and the reason for the failure is that the user is not registered. If registered, execute the following steps.

[0046] S823. Read the data unit size BlockSize of the corresponding data area (BuffName), read the number of data units BlockNum of the corresponding data area (BuffName), and read the current admission position inputPoint of the corresponding data area (BuffName). Calculate the latest data position lastIntem = inputPoint - 1, and determine whether the calculated value exceeds the data area boundary. If so, revert the latest position value to a reasonable value. Calculate the access index m = lastIntem * BlockSize, and extract data from a space of length BlockSize starting from index m in buffNameMemCellAddList in the data area, and put it into data.

[0047] S83, Retrieve specified data Obtain the data area name (BuffName), the username (ReadUsrName), the specified retrieval location (SepecificPoint), and the data storage address (data). Check if the data area exists. If it does not exist, indicate a write failure, the reason being that the data area is undefined. If it exists, execute the following steps.

[0048] Determine if the user is registered. If not, indicate a failure to retrieve the data, the reason being that the user is not registered. If registered, proceed with the following steps.

[0049] Determine if the specified data location is valid. If not, indicate a failure to retrieve the data, the cause being that the specified retrieval parameters are invalid. If valid, proceed with the following steps.

[0050] Read the data unit size BlockSize of the corresponding data area (BuffName), read the number of data units BlockNum of the corresponding data area (BuffName), calculate the retrieval index m=SepecificPoint*BlockSize, and retrieve data from a space of length BlockSize starting from index m of buffNameMemCellAddList in the data area, and put the data into data.

[0051] S9. Use the user logout method Obtain the data area name (BuffName) and retrieve the username (ReadUsrName). Check if the username is registered; if not, indicate a failed deregistration, indicating a registration failure. If registered, find the corresponding username (ReadUsrName) and current access position (UsrReadPnt) from the user parameter list in the data area (BuffName), and remove the corresponding username and current access position from the user parameter list in the data area (BuffName).

[0052] S10. Data Area Clearing Method S101. Input parameters, including data area name, data cell size, and number of data cells; Check if a data area with the same name already exists. If not, indicate that the application failed because the data area does not exist. If it does exist, follow steps S102 to S105 to sequentially write the storage space segments of the BuffName storage unit address list into the unoccupied space segment list, and delete the BuffName information from the data area list.

[0053] S102, Initialize the sequence number m=0 S103. Determine whether the statistics of all unoccupied space segments (buffNameMemCellAddList) have been completed. If yes, exit; otherwise, proceed with the following steps: S104. Assign the starting address of the first address segment: starAdd = buffNameMemCellAddList[m] S105. Determine whether the current sequence number indicates the memory cell address and the next sequence number indicates the memory cell address are adjacent. If they are adjacent, update the current sequence number m++ and repeat S105.

[0054] S106. If they are not adjacent, assign the index address to the end address of this field: endAdd = buffNameMemCellAddList[m].

[0055] S107. Add both the start address and the end address to the list of unoccupied space segments, and increment the number of unoccupied space segments by 1.

[0056] S108. Record a starting address starAdd = buffNameMemCellAddList[m+1], update the current index m++, and repeat S105.

[0057] The specific details of this embodiment are as follows: A communications management center initiates a periodic testing task to analyze communication parameters and store information. It requests a data area from the data warehouse. Storage space is sufficient, with n = 2^64 unused segments and an unused space list avlblList[]. The data area name is ComCentBuff, the data unit size is BlockSize = 592 bytes, the number of data units is BlockNum = 100, and the storage unit address list is ComCentCellAddList[]. The required number of storage units is Num = BlockSize * BlockNum = 59200. Initially, the number of occupied storage units is occpNum = 0. The k=1 address of the unoccupied storage space is found. avlblList[1].starAdd=0x00006842(26690), avlblList[1].endAdd=0x00006A92(27284). The storage unit itemNum1 of this address is calculated as avlblList[1].endAdd - avlblList[1].starAdd = 594. If the storage of this segment is accumulated, occpNum=occpNum+itemNum1=594; occpNum is less than Num, so ComCentCellAddList[1]=0x00006842; ComCentCellAddList[2]=0x00006843…ComCentCellAddList[itemNum1]=0x00006A92. The number of unoccupied segments n = n-1, so the k-th segment address is removed from avlblList[]. Continue searching for the next space segment until Num reaches 59200. Create a ComCentCellAddList [Num], and the space allocation is successful.

[0058] The communication control center registered the admitted user of the aforementioned data area ComCentBuff with the username ComTunnel in the external link management module. The registration was successful, and the current admission position m_BuffInputPoint=0 was initialized.

[0059] The information storage module of the communication control center registered the user for accessing the aforementioned data area ComCentBuff, with the username InfoStrg. Registration was successful, the current access position UsrReadPnt=0 was initialized, and InfoStrg was inserted into the user parameter list for accessing the data area ComCentBuff.

[0060] The communication control center's statistical analysis module registered the user for accessing the aforementioned data area ComCentBuff, with the username InfoAnls. Registration was successful, the current access position UsrReadPnt=0 was initialized, and InfoAnls was inserted into the ComCentBuff user parameter list.

[0061] The real-time monitoring module of the communication control center registered the user who would access the aforementioned data area ComCentBuff. The username was InfoMnt. Registration was successful. The current access position UsrReadPnt=0 was initialized. InfoAnls was inserted into the user parameter list of the data area ComCentBuff.

[0062] The following is a list of users accessed in the ComCentBuff data area.

[0063]

[0064] The communication control center initiates data reception for the external link management module. Each received data item is entered into the ComCentBuff data area using the "enter data one at a time" method. The data area name (ComCentBuff), the user name (ComTunnel), and the data to be entered (data={0x100258586…FFCDA}) are obtained. The existence of the ComCentBuff data area is confirmed. The user (ComTunnel) is confirmed to be registered. The data unit size (BlockSize=592, BlockNum=100) of the ComCentBuff data area (BuffName) is read. The currently entered item number (inputPoint) is read. The current entry number (m = inputPoint*BlockSize=0) in the ComCentCellAddList data area to be written is calculated. The corresponding content of the data to be entered (data) is sequentially filled into the 592 addresses starting from ComCentCellAddLis[m] to ending at ComCentCellAddLis[m+591]. The entry number (inputPoint++) is updated. Determine if the current entry number (inputPoint) has reached the data area boundary. If so, the current admission entry is zeroed out, and inputPoint = 0. This enables real-time admission data processing.

[0065] The communication control center's information storage module periodically retrieves all unread entries and stores them, using a sequential retrieval method. It obtains the data area name ComCentBuff, retrieves the username InfoStrg, and after retrieving a piece of data, stores it in the null referenced by data. It verifies that the data area ComCentBuff exists and that the user InfoStrg is registered. It reads the data unit size of the ComCentBuff data area (BlockSize=592, BlockNum=100). It reads the currently entered entry number inputPoint of the ComCentBuff data area. It reads the currently retrieved entry outPoint of the ComCentBuff data area. It checks for unread data; if so, it calculates the current read sequence number m = outPoint * BlockSize in the ComCentCellAddList. It retrieves data sequentially from the address pointed to by sequence number m in the ComCentCellAddList and places it into data. It updates InfoStrg with the currently retrieved entry outPoint++. It checks if the current position has reached the data area boundary; if so, it resets the currently retrieved entry outPoint to zero.

[0066] The communication control center's statistical analysis module is configured to retrieve specified data based on user operations, providing the required retrieval sequence number 53. It obtains the data area name ComCentBuff, the retrieval username InfoAnls, the specified retrieval location SepecificPoint=53, and the data storage address data. It verifies that the data area ComCentBuff exists and that the retrieval user InfoAnls is registered. It reads the data unit size of the ComCentBuff data area: BlockSize=592, BlockNum=100. The specified data location SepecificPoint < BlockNum, which is reasonable. It calculates the retrieval sequence number m = SepecificPoint * BlockSize, and retrieves data sequentially from a space of length BlockSize starting from sequence number m in the ComCentCellAddList of the data area, placing the data into data.

[0067] The real-time monitoring module of the communication control center is configured to retrieve the latest data. It obtains the data area name ComCentBuff, the retrieval username InfoMnt, and the data storage address data. It verifies that the data area ComCentBuff exists and that the retrieval user InfoMnt is registered. It reads the data unit size of the ComCentBuff data area: BlockSize=592, BlockNum=100. It reads the currently entered item number inputPoint of the ComCentBuff data area. It calculates the latest data position lastIntem = inputPoint-1, and checks if the current position has reached the data area boundary. If so, the current entry's lastIntem is returned to a reasonable position. It calculates the retrieval sequence number m = lastIntem * BlockSize, and retrieves data from a space of length BlockSize starting from sequence number m in the ComCentCellAddList of the data area, placing the data into data.

[0068] Upon completion of the test, the communication control center deregisters the admitted user from the external link management module, obtaining the data area name ComCentBuff and the admitted username ComTunnel. It confirms that the data area ComCentBuff exists and that the admitted user ComTunnel is registered. The admitted username and location information are then removed from the ComCentBuff data area.

[0069] The test task concludes. The communication control center's information storage module deregisters the user and obtains the data area name ComCentBuff and the user name InfoStrg. It verifies that the data area ComCentBuff exists and that the user InfoStrg is registered. It then retrieves the corresponding user's username ReadUsrName and current access position UsrReadPnt from the user parameter list of the data area BuffName. Finally, it removes the corresponding username and current access position from the user parameter list of the data area BuffName.

[0070] After completing the analysis and monitoring tasks, the real-time monitoring module and the statistical analysis module of the communication control center shall deregister the users in accordance with the above method.

[0071] The ComCentBuff data area is no longer in use; therefore, it is cleared. The data area name, ComCentBuff, is obtained. The data unit size of the ComCentBuff data area is read as BlockSize=592 and BlockNum=100, confirming the existence of the ComCentBuff data area. The sequence number is initialized to m=0. If the ComCentCellAddList is not completely cleared, a continuous address segment is searched starting from sequence number m. The start address and end address of this continuous address segment are added to the unoccupied space segment list avlblList[], and the number of unoccupied space segments n is incremented by 1. The ComCentCellAddList is traversed until all address segments are found, and the unoccupied space segment list avlblList[] is returned, completing the clearing process.

[0072] The above description is only a preferred embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any equivalent substitutions or modifications made by those skilled in the art within the scope of the technology disclosed in the present invention, based on the technical solution and inventive concept of the present invention, should be covered within the scope of protection of the present invention.

Claims

1. A method for dynamic data entry and retrieval in a registration mechanism, characterized in that: Includes the following steps: S1. Build dynamic data access software and allocate storage space. The storage space is bound to a data area list and a storage unit address list. The data area list records the names of the data areas that have been applied for in the storage space. The address range occupied by the data areas that have been applied for in the storage unit address list is marked as occupied. S2. The data dynamic access software obtains the data area name, data unit size and number of data units of the data area to be applied for and applies for the data area. When it is determined that there is no data area with the same name in the data area list, the storage unit address list is read and the remaining space of the storage space meets the application scale. The data area application is successful and proceeds to step S3 to occupy space. S3. Allocate storage space addresses according to the size of the data unit, the number of data units, and the number of unoccupied space segments in the storage unit address list, and mark the address segments occupied this time as occupied in the storage unit address list; The process is as follows: Registering an admitted user proceeds to step S4; Admission data proceeds to step S5; Admission user cancellation proceeds to step S6; User registration for data retrieval proceeds to step S7; Data retrieval proceeds to step S8; User cancellation for data retrieval proceeds to step S9; Data area clearing proceeds to step S10. S4. The data dynamic access software obtains the name of the applied data area and the name of the admission user to be registered and registers the admission user. Only one admission user can enter data into one data area. After successful registration, the data area is bound to the admission user. S5. Admitted users automatically write data to the registered data area through the data dynamic access software; S6. The data dynamic access software obtains the space name and the username of the admitted user to be cancelled, and unbinds the data area and the admitted user to be cancelled. S7. The data dynamic access software obtains the name of the data area to be registered by the user and the user name to register the user. After successful registration, the user name is inserted into the user parameter list of the data area to be accessed, and the current access position of the user is initialized. S8. When retrieving data, the data dynamic access software retrieves one piece of data in sequence, or retrieves the latest data, or retrieves specified data. S9. The data dynamic access software obtains the username to be deregistered and the data area name of the user to be deregistered, and removes the username to be deregistered from the user parameter list of the data area of ​​the user to be deregistered. S10. The data dynamic access software obtains the name parameter of the data area to be cleared, records the address segment occupied by the data area to be cleared as an unoccupied space segment in the storage unit address list of the storage space, and deletes the data area information to be cleared this time from the data area list.

2. The method for dynamic data entry and retrieval in a registration mechanism according to claim 1, characterized in that: In step S1, the data dynamic access software obtains the name of the data area to be applied for, accesses the data area list, and determines whether a data area with the same name already exists. If so, it prompts that the application failed because a data area with the same name already exists. If not, it determines that no data area with the same name exists, reads the storage unit address list, calculates the number of storage units required for this application, and counts the unoccupied space. The number of storage units required for this application is the product of the data unit size and the number of data units. It determines whether the remaining unoccupied space meets the application scale. If it does, the data area application is successful, and the process proceeds to step S2. If it does not meet the requirements, it prompts that the data area application failed. The storage unit address list includes an unoccupied space segment list and an occupied storage space segment list. The storage addresses in the unoccupied space segment list are initially contiguous addresses, but become discontinuous addresses after executing the space occupation method or the data area clearing method. In step S2, the space occupation method is fragmented occupation.

3. The method for dynamic data entry and retrieval in a registration mechanism according to claim 1, characterized in that: Step S3 includes the following steps: S31. Obtain the number of storage units Num, the size of the data unit BlockSize, and the number of data units BlockNum of the data area to be applied for. The number of unoccupied space segments n, the starting storage unit address starAdd of the i-th unoccupied space segment, the ending storage unit address endAdd of the i-th unoccupied space segment, and the occupancy index m of the storage unit address list are also obtained. The number of storage units Num is the product of the size of the data unit BlockSize and the number of data units BlockNum. S32 and m are initialized to 0, and the number of memory units occupied in this operation, occpNum, is initialized to 0. S33. Determine whether sufficient storage units have been occupied based on whether occpNum is greater than or equal to Num. If yes, space occupation is complete, and the space occupation method exits. If not, proceed to step S34: S34. Update the count i to the address of the next segment of storage unit, calculate the number of storage units in the i-th segment itemNum, itemNum=endAdd-starAdd; The system determines whether the free space in this segment is sufficient based on whether the sum of occpNum and itemNum is greater than or equal to the number of storage units Num. If not, the system fills the data area name into the storage unit address list in order, fills the itemNum items, updates occpNum (occpNum = occpNum + itemNum), clears the address information of the unoccupied storage space of the i-th segment, and exits the space occupation method after the space occupation is completed. If so, proceed to step S35; S35. Calculate the number of storage units occupied this time, thisNum, thisNum=Num-occpNum. Calculate the number of remaining storage units after this segment of storage units is occupied, remNum, remNum=itemNum –thisNum. Update the current application's occupied amount, occpNum = occpNum+Num. Fill the storage unit address list in sequence, filling thisNum units. Determine whether the i-th segment of space is completely occupied. If not, update the starting address of the i-th segment of space, starAdd, starAdd= starAdd+thisNum. Return to step S33. If yes, clear the unoccupied storage space address information of the i-th segment and return to step S33.

4. The method for dynamic data entry and retrieval in a registration mechanism according to claim 1, characterized in that: In step S4, when an admitted user registers, the data dynamic access software queries the data area list to see if the data area name exists and determines whether the data area has been registered. If not, it prompts that the admitted user registration failed, and the fault is that the data area name does not exist. If yes, it continues to determine whether the data area has already registered a user. If yes, it prompts that the admitted user registration failed, and the fault is that the data area already has an admitted user. If no, it binds the data area to the admitted user and sets the initial value of the admitted user's current admission position to zero.

5. The method for dynamic data entry and retrieval in a registration mechanism according to claim 1, characterized in that: Step S5 includes the following steps: S51. The data dynamic access software obtains the data area name, the admitted user name and the data to be admitted. It determines whether the data area to be written exists based on the data area name. If not, it prompts that the writing failed and the fault is that the data area is not defined. If yes, it proceeds to step S52. S52. Determine if the user to be admitted has registered. If not, indicate that the write failed and the reason for the failure is that the user has not registered. If yes, proceed to step S53. S53. The data dynamic access software reads the data unit size, data unit quantity and currently entered item number of the data area, calculates the current admission sequence number of the data area to be written, the current admission sequence number of the data area to be written is the product of the data unit size of the data area and the currently entered item number, reads the address of the storage unit of the data area at the currently entered item number, fills the data content to be admitted into the data area in sequence and updates the entered item number. After writing is complete, check if the current entry number has reached the boundary of the pending admission data area. If it has, the current admission entry is reset to zero; otherwise, the admission data is complete. The process of admitting a data entry in step S5 does not require manual updating or maintenance of the write pointer.

6. The method for dynamic data entry and retrieval in a registration mechanism according to claim 1, characterized in that: In step S6, the data dynamic access software obtains the data area name and the username of the user to be deregistered, and determines whether the username has been registered. If not, it prompts that the deregistration failed, and the fault is that the user has not been registered. If so, it unbinds the data area and the user to be deregistered, and clears the current admission position of the user to be deregistered. In step S9, the data dynamic access software obtains the data area name of the username to be deregistered and the user information to be deregistered, and determines whether the username to be deregistered has been registered. If not, it prompts that the deregistration failed and the fault is that it is not registered. If so, find the username to be deregistered and the current access location from the access user parameter list in the data area of ​​the user information to be deregistered, and remove them.

7. The method for dynamic data entry and retrieval in a registration mechanism according to claim 1, characterized in that: Step S7 includes the following steps: S71. The data dynamic access software obtains the name of the data area to be accessed, the user name of the user, and the current access location, and determines whether the application for the data area to be accessed has been completed. If not, it prompts that the registration failed and the fault is that the data area name does not exist; if yes, it proceeds to step S72. S72. Determine whether the user has been registered. If not, prompt that registration failed and the fault is that a user with the same name has been registered. If yes, insert the user name into the user parameter list of the data area to be retrieved, and initialize the current retrieval position UsrReadPnt of the user in the user parameter list. In step S7, multiple users retrieve data asynchronously and independently. Step S10 includes the following steps: S101. The data dynamic access software obtains the parameters of the data area to be cleared, including the name of the data area to be cleared, the size of the data unit to be cleared, and the number of data units to be cleared; it determines whether there is already a data area with the same name. If not, it prompts that the application failed because the data area does not exist; if so, it records the storage space segment of the data area to be cleared in the storage unit address list as an unoccupied space segment list and deletes the name of the data area to be cleared from the data area list.

8. The method for dynamic data entry and retrieval in a registration mechanism according to claim 1, characterized in that: In step S8, one piece of data is retrieved sequentially to step S81, the latest data is retrieved to step S82, and the specified data is retrieved to step S83. S81 includes the following steps: S811. Obtain the name of the data area to be retrieved, the username to be retrieved, and the storage address of the data to be retrieved. Determine whether the data area to be retrieved exists. If not, prompt that the write failed and the fault is that the data area is not defined. If yes, proceed to step S812. S812. Determine if the user is registered. If not, indicate that the user failed to register, and the reason for the failure is that the user is not registered. If yes, proceed to step S813. S813. Read the data unit size, data unit quantity and current admission entry of the data area to be used. Read the current admission entry corresponding to the user. Determine whether there is unread data by comparing the current admission entry and the current admission entry. If not, the use ends. If so, proceed to step S814. S814. Calculate the current read sequence number of the data area. The current read sequence number of the data area is the product of the current read item and the size of the data unit. Sequentially retrieve one piece of data from the address pointed to by the current read sequence number in the data area and put it into the data storage address. Update the current read item of the user name. Determine whether the current retrieval position has reached the boundary of the data area. If yes, the outPoint of the current admission item is set to zero. If no, retrieve one piece of data sequentially to complete the process. S82, including the following steps: S821. Obtain the name of the data area to be retrieved, the username to be retrieved, and the storage address of the data to be retrieved. Determine whether the data area to be retrieved exists. If not, prompt that the retrieval failed and the fault reason is that the data area is not defined. If yes, proceed to step S822. S822. Determine if the user is registered. If not, indicate that the user failed to register, and the reason for the failure is that the user is not registered. If yes, proceed to step S823. S823. Read the data unit size, data unit quantity, and current admission entry of the data area; read the current admission entry corresponding to the user; calculate the latest data position, which is the current admission entry minus 1; determine whether the latest data position crosses the boundary of the data area; if so, set the latest data position to zero; calculate the retrieval sequence number, which is the product of the latest data position and the data unit size; starting from the retrieval sequence number of the data area, retrieve a segment of space with a length equal to the data unit size and place it into the data storage address. Retrieving specified data in S83 includes the following steps: S831, Obtain the name of the data area to be retrieved, the username to be retrieved, the specified location to be retrieved, and the storage address of the retrieved data; Determine if the data area exists. If not, indicate that the data area has failed to be defined. If it does exist, proceed to step S832. S832. Determine if the user is registered. If not, indicate that the user failed to register, and the reason for the failure is that the user is not registered. If yes, proceed to step S833. S833. Determine whether the specified location is reasonable. If not, indicate that the location failed to be used, and the reason for the failure is that the specified location parameters are unreasonable. If yes, proceed to step S834. S834. Read the size and number of data units in the data area to be retrieved, calculate the retrieval sequence number, wherein the retrieval sequence number is the product of the designated retrieval position and the size of the data unit, and retrieve data in sequence from the retrieval sequence number of the data area, taking out a space of length equal to the size of the data unit and placing it into the data storage address.

9. The method for dynamic data entry and retrieval in a registration mechanism according to claim 1, characterized in that: In step S1, multiple data areas are requested according to the operation of the data dynamic access software. The data area elements include: data area name, data unit size, number of data units, storage unit address list, registered user information and user parameter list. The registered user information includes the user's name and current admission location; The list of users accessing the service includes registration information for one or more users, and the registration information includes the user's name and current location. The data dynamic access software is created and packaged after being edited using a programming language, and the storage space is a non-differentiated data cache area.

10. A method for dynamic data entry and retrieval in a registration mechanism according to any one of claims 1 to 9, characterized in that: The data dynamic access software forms a data management tool that manages storage space and the data dynamic access process. It divides the data into multiple data areas through application and recycles and reuses data areas through data area application and data area clearing methods. For each data area, it manages read and write permissions through user registration and user access methods and isolates individual access users to avoid read pointer crossover. The data storage area utilizes fragmented space through storage unit address columns; it automatically maintains the user's read and write pointers through data acquisition and retrieval methods.