Regional alliance merchant data sharing method and platform

Through hash table technology and fine-grained access control list, combined with differential update algorithm and publish/subscribe model, the data update delay and consistency problems in the automotive industry data sharing platform are solved, and efficient and secure data sharing and synchronization are achieved. in a dynamically changing business environment.

CN118631825BActive Publication Date: 2024-11-19DECHE CHUANGRONG (BEIJING) TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410736144.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-06-07
Publication Date
2024-11-19
Estimated Expiration
2044-06-07

AI Technical Summary

Technical Problem

In the regional alliance merchant data sharing platform of the automotive industry, traditional data management and update methods cannot meet the real-time access, update and security requirements in modern business environments, especially when large-scale distributed data processing has delays. The problem of difficulty in ensuring data consistency and inflexible access control.

Method used

Data index is generated through hash table technology, and combined with fine-grained access control lists and differential update algorithms, synchronize and ensure data consistency, and introduce publish/subscribe models to ensure the timeliness and accuracy of data updates, using a decision tree algorithm Optimize the access control decision process.

Benefits of technology

Improves the efficiency of data index generation and update, improves the security and flexibility of the system, ensures real-time and accuracy of data, significantly improves the stability and reliability of data sharing and synchronization, and is suitable for dynamically changing business environments. .

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118631825B_ABST
    Figure CN118631825B_ABST
Patent Text Reader

Abstract

The present invention discloses a regional alliance merchant data sharing method and platform, which specifically relates to the field of data update, and is used to solve the problems of data update delay and access control. It is a method for generating data indexes through hash table technology, and synchronizing and ensuring data consistency through fine-grained access control lists and differential update algorithms. It not only improves the efficiency of data index generation and update, but also allows different merchant nodes to set access rights according to their own needs by introducing fine-grained access control, greatly improving the security and flexibility of the system. At the same time, by real-time evaluation of the urgency and scope of data updates, and adopting a publish / subscribe model to promptly notify data subscribers, the present invention ensures the timeliness and accuracy of data updates, and effectively solves the problem of data sharing and synchronization in the dynamically changing automotive industry business environment.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of data updating, and more specifically, to a method and platform for sharing data among regional alliance merchants. Background Art

[0002] In the current rapidly evolving data management field, especially in regional alliance merchant data sharing platforms involving the automotive industry, enterprises and organizations are facing the dual challenges of rapid growth in data volume and increasing complexity. Automakers and suppliers often need to share and update huge data sets in real time, including parts inventory, new technology research and development data, and consumer behavior analysis. How to efficiently and securely process, synchronize and share this data has become a core issue. These platform requirements have extremely high requirements for real-time access, updating and security of data. Therefore, traditional data management and update methods often cannot meet the needs of agility and accuracy of data operations in modern business environments.

[0003] Existing technologies mostly rely on centralized data management systems, which simplifies the data processing process, but often face problems such as data update delays, difficulty in ensuring data consistency, and inflexible access control when processing large-scale distributed data. In addition, centralized systems also show their fragility when suffering from data center failures, which can easily cause data access interruptions or data loss.

[0004] Existing solutions to these problems include using replicated databases and periodic synchronization technologies, but these methods have obvious shortcomings in handling real-time data updates and maintaining data consistency. Especially in the automotive industry, when it comes to cross-border supply chains or the sharing of key technologies for new energy vehicles, each node may need to control access to specific data based on its own business needs and security policies, which requires a more flexible and sophisticated data access and control mechanism.

[0005] In order to solve the above problems, a technical solution is now provided. Summary of the invention

[0006] In order to overcome the above-mentioned defects of the prior art, the embodiments of the present invention provide a regional alliance merchant data sharing method and platform, which generates data indexes through hash table technology, and synchronizes and ensures data consistency through fine-grained access control lists and differential update algorithms. Not only is the efficiency of data index generation and update improved, but also by introducing fine-grained access control, different merchant nodes are allowed to set access rights according to their own needs, which greatly improves the security and flexibility of the system. At the same time, by real-time evaluation of the urgency and scope of data updates, and the use of a publish / subscribe model to promptly notify data subscribers, the present invention ensures the timeliness and accuracy of data updates, effectively solves the problem of data sharing and synchronization in the dynamically changing automotive industry business environment, and solves the problems raised in the above-mentioned background technology.

[0007] To achieve the above object, the present invention provides the following technical solutions:

[0008] S1: The central node receives data metadata from merchant nodes, generates data indexes using hash table technology, and regularly synchronizes these indexes with merchant nodes using a differential update algorithm to ensure that the data indexes of all participating nodes are up to date;

[0009] S2: Based on the latest synchronized data index, the merchant node clearly defines the access rights and conditional restrictions of each user category to specific data categories based on a fine-grained access control list;

[0010] S3: The central node uses the index generated in step S1 and the access control list set in step S2 to verify the requester's access rights. Once the verification is passed, the central node uses index retrieval technology to quickly locate the required data and returns the specific storage location of the data to the requester;

[0011] S4: After the merchant node updates the data locally, it reports the new data metadata to the central node. The updated index is used for data retrieval and positioning in step S3. At the same time, the central node evaluates the urgency, wide impact and related risks of the data update, and comprehensively determines whether all relevant data subscribers should be notified in real time to update the data through the publish / subscribe model.

[0012] In a preferred embodiment, S1 includes the following contents:

[0013] The central node receives data metadata from each merchant node, including data type , Update frequency and data size , each merchant node sends its data metadata as a tuple ;

[0014] To generate data indexes, the following complex hash function based on nonlinear transformation is used:

[0015] ;

[0016] in, Functions are used to introduce nonlinear transformations in mathematics;

[0017] Use the difference detection mechanism to determine when to update the index and calculate the difference metric :

[0018] ;

[0019] in, The central node has An index of merchants; is the most recent index received from the same merchant; The function is used to smooth large hash value differences. When the difference metric exceeds the set threshold, an index update is triggered;

[0020] Calculate the cumulative impact value of all indexes that need to be updated, and use the following formula to decide whether to synchronize:

[0021] ;

[0022] in, is the temperature parameter that controls the decay rate.

[0023] In a preferred embodiment, S2 includes the following contents:

[0024] Each merchant node develops an ACLs model based on its business needs and data security policies, including standard user roles and data permission settings as well as condition-based access control, such as the time window for data access, geographic location restrictions, and data processing operation types. Merchants use the following formula to express ACL rules: ;

[0025] in, Indicates the user role, Indicates the data category, To express a compound condition: ;

[0026] When receiving a data access request, the central node needs to verify whether the request complies with the ACLs. The verification process uses a matching function to check the legitimacy of the request: ;

[0027] in and It is a role matching and data type matching function, returning a Boolean value; is a function that evaluates a compound condition, determined based on the current request;

[0028] Use decision tree algorithm to optimize access control decision process: Decision tree is pre-classified based on the role and data category of ACLs. The condition of each node is composed of the compound condition defined in the compound condition. The specific process is as follows:

[0029] 1) First, the top nodes of the decision tree are classified based on the user's role, and the second-level nodes are further subdivided according to the data category;

[0030] 2) Under each corresponding role and data category node, add more detailed decision nodes. These nodes are based on the compound conditions defined in the ACLs. Each condition node uses a logical expression to decide whether to allow access; the function that meets the condition is determined based on the current request;

[0031] 3) When an access request is received, starting from the root node of the decision tree, it is first classified by role, and then continues to traverse downward based on the data category. When reaching a specific compound condition node, it evaluates whether the corresponding attributes in the request meet these preset conditions. If all conditions are met, access is allowed. If any condition is not met, access is denied.

[0032] In a preferred embodiment, S3 includes the following contents:

[0033] The requester first sends an access request containing their role, the type of data requested, and additional access conditions;

[0034] The central node uses the ACLs model generated in step S2 to verify the requester's access rights, and uses logical expressions combined with access conditions to verify permissions, where each conditional expression is represented as a composite logical function :

[0035] ;

[0036] in, A classification identifier representing the user or user group requesting access to the data; Refers to the classification of data, distinguishing them according to their purpose or content; It is a set of additional regulations, indicating that data access is allowed only when certain conditions are met; Indicates the evaluation of a particular condition;

[0037] Once the access request is authenticated, the central node uses the hash index generated in step S1 to retrieve the data. Each data item is identified by its unique hash key. To index: ;

[0038] in, It is a unique identifier for a data item, used to uniquely distinguish each data record; Represents the key attributes of a data item; Represents a combination of data identifier and data attributes to ensure the uniqueness of each data item;

[0039] Data location is accomplished by finding the storage location that matches the hash key, and the storage location is determined using a composite function: ;

[0040] in, is a function that maps a hash key to a specific bucket, and is the total number of buckets in the storage system, ensuring that data is evenly distributed across all available buckets.

[0041] In a preferred embodiment, S4 includes the following contents:

[0042] After the merchant node updates the local data, it generates new data metadata, and then packages this information and sends it to the central node;

[0043] After receiving the new data metadata, the central node uses the update algorithm to regenerate the hash index of the data;

[0044] The central node extracts and analyzes the key indicators of the data to be updated, including the latent dynamic difference rate, the correlation impact coefficient and the integrity risk measurement index.

[0045] In a preferred embodiment, the calculation process of the latent dynamic difference rate is:

[0046] Record the timestamp of each data update and the timestamp of the previous update within the most recent unit time;

[0047] Apply Gaussian harmonics to a time interval: ;

[0048] in, and The time intervals The mean and standard deviation of , used to highlight abnormal update frequencies;

[0049] Through nonlinear transformation, the dynamic changes of time intervals are further analyzed, and the latent dynamic difference rate is calculated as: ;

[0050] in, represents the total number of data update events considered; is a small constant introduced to avoid division by zero.

[0051] In a preferred embodiment, the calculation process of the correlation influence coefficient is:

[0052] Identify the key attributes involved in each data update;

[0053] Calculate the number of hops from the source to other nodes. The hop count is the minimum number of forwardings required to get from the data update source to another data node.

[0054] For each hop, an exponential decay function is used to evaluate the weakening of the hop count on the update, as follows: ;

[0055] in, is the number of hops; is the decay constant;

[0056] The total correlation influence coefficient is calculated by combining the update influence values ​​of all hops, using the following formula:

[0057] ;

[0058] in, It is The amount of data affected in the hop.

[0059] In a preferred embodiment, the calculation process of the integrity risk metric index is:

[0060] For each data update, the consistency and integrity of the data before and after the update are first evaluated, which is performed by calculating the checksum of each part of the data;

[0061] The checksum is calculated as:

[0062] ;

[0063] in, The data is in The value of the position; is the length of the data;

[0064] in Represents the position index of the data element;

[0065] Use the checksum to calculate the difference in integrity score before and after the data is updated:

[0066] ;

[0067] Use the exponential decay model to quantify the risk of data updates and calculate the integrity risk metric index: ;

[0068] in, is the attenuation coefficient, which is used to adjust the sensitivity of the risk index; is the base of natural logarithms.

[0069] In a preferred embodiment, the three indicators of latent dynamic difference rate, correlation influence coefficient and integrity risk measurement index are integrated to obtain the data dynamic context cohesion coefficient, and the calculation formula is:

[0070] ;

[0071] in, , and are the latent dynamic difference rate, the correlation influence coefficient and the integrity risk measurement index, respectively. , and They are respectively the preset proportional coefficients of the latent dynamic difference rate, the correlation influence coefficient and the integrity risk measurement index, and all of them are greater than zero;

[0072] Compare the data dynamic context cohesion coefficient with the update release threshold, and generate an immediate release signal when the data dynamic context cohesion coefficient reaches or exceeds the set threshold;

[0073] On the contrary, if the data dynamic context cohesion coefficient is lower than the set threshold, a delayed release signal is generated.

[0074] The regional alliance merchant data sharing platform includes an index generation module, an access policy control module, an authority verification module, a data synchronization scheduling module, and a dynamic update analysis unit;

[0075] The index generation module receives data metadata from merchant nodes and generates corresponding data indexes using hash table technology. It also regularly synchronizes indexes with merchant nodes through a differential update algorithm to ensure that data indexes of all nodes are kept up to date. The generated index data is passed to the access policy control module and the permission verification module.

[0076] The access policy control module is based on the latest synchronized data index. The merchant node sets a fine-grained access control list to define the access rights and conditions of different users to specific data. The updated access control list information is passed to the permission verification module.

[0077] The permission verification module uses the generated data index and the set access control list to verify the access rights of the data requester. Once the verification is passed, the required data is quickly located using index retrieval technology, and the specific storage location of the data is provided. The update status of the data index is fed back to the data synchronization scheduling module;

[0078] The data synchronization scheduling module receives new data metadata after the merchant node updates the local data, and updates the data index of the central node. The updated index is used for subsequent data retrieval and positioning, and the updated data index is transmitted back to the authority verification module and the index generation module;

[0079] The dynamic update analysis unit evaluates the urgency, widespread impact, and related risks of data updates, and based on these evaluation results, comprehensively determines whether all relevant data subscribers should be notified of data updates in real time through a publish / subscribe model.

[0080] The technical effects and advantages of the regional alliance merchant data sharing method and platform of the present invention are as follows:

[0081] 1. The present invention utilizes fine-grained access control lists combined with decision tree algorithms to optimize the data access control process and improve security and efficiency. Merchant nodes formulate access control lists that include user roles, data categories, and diversified composite conditions based on their own business needs and data security policies. These access control lists are pre-classified through decision trees, quickly narrowing the scope of applicable rules based on roles and data types, and further accurately filtering and processing data access requests through composite conditions defined in the nodes. It is beneficial to improve the processing speed of access control and reduce the number of rules that need to be evaluated in the decision-making process. At the same time, the error rate is reduced through structured preprocessing, making the system more efficient and easy to maintain. It is suitable for processing complex access permission models and a large number of dynamic access requests, significantly improving the security and response efficiency of data sharing, ensuring the security and compliance of data, and providing business alliances with sufficient flexibility to respond to different business strategies and regulatory requirements.

[0082] 2. The present invention uses fine-grained access control lists (ACLs) and hash-based indexing technology to implement permission verification and rapid location of data access requests. It aims to ensure that only authorized users can access specific data resources, while ensuring rapid and accurate data access. It improves the security and response speed of the data management system, especially in an environment where large amounts of data are processed and multiple users access, ensuring data confidentiality and availability.

[0083] 3. The present invention effectively improves the efficiency and security of the data update process by generating new data metadata after the merchant node updates the local data and sending it to the central node for processing. This step enables the central node to receive and process the latest data changes in real time, and regenerate the hash index of the data using advanced algorithms to ensure the accuracy of data retrieval and positioning. The central node further constructs a comprehensive data update evaluation framework by analyzing key indicators such as latent dynamic difference rate, correlation influence coefficient and integrity risk measurement index. This not only helps the data management system to comprehensively evaluate the impact of each data update from three key dimensions: time sensitivity, impact breadth and integrity risk, but also supports the update and release of scientific decision-making data. Through this comprehensive evaluation method, the system can quickly respond to important updates when necessary, while avoiding unnecessary resource consumption, optimizing system performance, and ensuring data consistency and integrity. In addition, through a real-time publish / subscribe model, it is ensured that all participants obtain the latest data in a timely manner, which is crucial for data-intensive and dynamically changing business environments, effectively avoiding the problem of data obsolescence or synchronization failure, and improving the stability and reliability of the data sharing platform. This systematic improvement has a long-term and important impact on maintaining a high-quality and efficient data environment, and is the key to achieving data-driven decision-making and operational optimization. BRIEF DESCRIPTION OF THE DRAWINGS

[0084] Figure 1 It is a flow chart of the regional alliance merchant data sharing method of the present invention;

[0085] Figure 2 It is a structural diagram of the regional alliance merchant data sharing platform of the present invention. DETAILED DESCRIPTION

[0086] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention. Example 1

[0087] Figure 1 The present invention provides a regional alliance merchant data sharing method, including:

[0088] S1: The central node receives data metadata from merchant nodes, generates data indexes using hash table technology, and regularly synchronizes these indexes with merchant nodes using a differential update algorithm to ensure that the data indexes of all participating nodes are up to date;

[0089] S2: Based on the latest synchronized data index, the merchant node clearly defines the access rights and conditional restrictions of each user category to specific data categories based on a fine-grained access control list;

[0090] S3: The central node uses the index generated in step S1 and the access control list set in step S2 to verify the requester's access rights. Once the verification is passed, the central node uses index retrieval technology to quickly locate the required data and returns the specific storage location of the data to the requester;

[0091] S4: After the merchant node updates the data locally, it reports the new data metadata to the central node. The updated index is used for data retrieval and positioning in step S3. At the same time, the central node evaluates the urgency, wide impact and related risks of the data update, and comprehensively determines whether all relevant data subscribers should be notified in real time to update the data through the publish / subscribe model.

[0092] In an alliance platform involving multiple merchant nodes, the traditional data synchronization and retrieval methods are difficult to effectively cope with the dynamic and diverse nature of data, as the data type, update frequency, and data volume of each node may vary. This can lead to slow data retrieval, increased system response delays, and the inability to quickly reflect data updates to all nodes, which affects the operational efficiency and user experience of the entire system. By using hash table technology to generate data indexes and using a differential update algorithm, the central node can efficiently manage and synchronize the data metadata of each merchant node. This approach not only optimizes the data storage structure, but also significantly improves the efficiency of data processing and the overall response speed of the system by quickly locating and updating changed data.

[0093] S1 includes the following:

[0094] The central node receives data metadata from each merchant node, including data type , Update frequency and data size Each merchant node sends its data metadata as a tuple ;

[0095] To generate data indexes, the following complex hash function based on nonlinear transformation is used:

[0096] ;

[0097] in, Functions are used to introduce mathematical nonlinear transformations to increase the complexity of the hashing process and the randomness of the index. Trigonometric functions are used to avoid predictability and increase the uniqueness and security of the index generation process.

[0098] Maintaining efficient data access and ensuring data consistency in distributed systems is critical. Using a hash table to generate a unique index for each piece of data can greatly improve the speed of data retrieval, because the hash table structure can provide near-constant time search efficiency, which is especially important for application environments with large amounts of data and frequent queries. The differential update algorithm further optimizes the data synchronization process, effectively reducing network bandwidth usage and data synchronization costs by only synchronizing the changed data. This processing not only improves the efficiency of data access, but also reduces the complexity and cost of system operations, especially in commercial environments, such as e-commerce platforms, financial services, etc. This method can provide more real-time service responses and stronger data processing capabilities.

[0099] Use a more sophisticated difference detection mechanism to determine when to update the index and calculate the difference metric :

[0100] ;

[0101] in, The central node has An index of merchants; is the most recent index received from the same merchant; The function is used to smooth large hash value differences to ensure that the difference update algorithm remains robust even in the case of large-scale data updates. When the difference metric exceeds the set threshold, the index update is triggered.

[0102] Calculate the cumulative impact value of all indexes that need to be updated, and use the following formula to decide whether to synchronize:

[0103] ;

[0104] in, is the temperature parameter, which controls the decay rate and introduces The purpose is to give lower priority to the index with smaller update, so as to optimize the utilization of network resources. If the cumulative impact value is greater than the synchronization threshold, the central node will perform the synchronization operation.

[0105] The temperature parameter actually borrows a familiar concept from physics to control a variable in a mathematical model. In this context, the temperature parameter does not represent the actual temperature, but a metaphorical term used to control the degree of decay rate, which is similar to the concept of temperature in the simulated annealing algorithm. Specifically, the temperature parameter in this formula affects the decay rate of the function, that is, how the impact of data updates weakens over time or other factors. A higher temperature parameter value means a slower decay process and a longer-lasting impact; a lower temperature parameter value means a rapid decay and a shorter-lived impact. This is very useful when dealing with data updates and synchronization, especially when a quantitative assessment of the ongoing impact of data is required. By adjusting the value of the temperature parameter, the update strategy can be flexibly controlled to ensure that the data synchronization process is neither too fast to cause data instability nor too slow to cause information obsolete. This approach allows the design of the algorithm to adjust the decay rate according to actual application scenarios and needs, optimize system performance, and improve the efficiency and responsiveness of data processing.

[0106] Hash table technology is used to generate unique indexes for the data metadata collected from each merchant node. These indexes are synchronized with each merchant node regularly in combination with the difference update algorithm to keep the data up to date. Through the efficient index generation and intelligent difference synchronization mechanism of the central node, the data retrieval speed and system response efficiency are improved, while ensuring the consistency of data and the overall reliability of the system. It not only greatly improves the efficiency of data processing, but also enhances the data security and stability of the platform. This is extremely important for data security, especially in business transactions involving sensitive information. In addition, it also promotes information sharing and collaborative work among merchants, helping to better utilize collective data resources for market analysis, customer behavior research, and product service optimization, thereby enhancing the accuracy and efficiency of business decisions. In today's increasingly competitive market, the advantages of this data sharing and collaboration mechanism can help merchant alliances improve their overall competitiveness and market adaptability, thereby promoting business growth and innovation.

[0107] S2 includes the following:

[0108] Each merchant node develops an ACLs model based on its business needs and data security policies, including standard user roles and data permission settings as well as condition-based access control, such as the time window for data access, geographic location restrictions, and data processing operation types. Merchants use the following formula to express ACL rules: ;

[0109] in, Indicates the user role, Indicates the data category, Indicates a compound condition, which can be a logical expression: ;

[0110] This expression allows data access to be restricted based on time or location.

[0111] The construction of compound conditions is intended to provide flexibility and precision for data access control, allowing merchant nodes to set diversified access restrictions based on specific business needs and security policies. By introducing parameters such as time windows and geographic location restrictions, compound conditions combine multiple sub-conditions in the form of logical expressions to achieve diversified configuration of conditional logic. It can be seen from the calculation formula that the dual restrictions on data access in terms of time and geographic location increase the dimension of access control and improve the granularity of security management. This method can be customized according to the needs of actual application scenarios, such as allowing data access only during working hours or at specific locations, thereby ensuring data security and compliance, while providing sufficient flexibility to respond to different business strategies and regulatory requirements.

[0112] When receiving a data access request, the central node needs to verify whether the request complies with the ACLs. The verification process uses a matching function to check the legitimacy of the request: ;

[0113] in and It is a role matching and data type matching function, returning a Boolean value; It is a function that evaluates a compound condition, determined based on the current request (such as the time and location of the request).

[0114] Use decision tree algorithm to optimize access control decision process: Decision tree is pre-classified based on the role and data category of ACLs, and the condition of each node is composed of compound conditions defined in compound conditions. Such structure reduces the number of rules that need to be evaluated in the access decision process, thereby improving the processing speed. The specific process is as follows:

[0115] 1) First, the top nodes of the decision tree are classified based on the user's role, such as supplier, distributor, and internal analyst. This step quickly narrows the scope of ACL rules that may be applicable;

[0116] The second layer of nodes is further subdivided according to data categories, such as inventory data, sales data, and customer data. This layer helps quickly locate relevant permission rules for specific data types;

[0117] 2) Under each corresponding role and data category node, add more detailed decision nodes based on compound conditions defined in ACLs, such as time window, geographic location, etc.;

[0118] 3) When an access request is received, it starts from the root node of the decision tree and first classifies it by role, and then continues to traverse downward based on the data category;

[0119] When reaching a specific compound condition node, the corresponding attributes in the request are evaluated to see if they meet these preset conditions. If all conditions are met, access is allowed; if any condition is not met, access is denied.

[0120] The main innovation and advantage of using decision tree algorithm to optimize the access control decision process is that this method quickly reduces the scope of applicable ACL rules by pre-classifying roles and data types, and then accurately filters access requests through compound conditions layer by layer. This structured preprocessing significantly improves the evaluation speed of access control and reduces the error rate, making the system more efficient and easy to maintain. It is particularly suitable for processing complex access rights models and a large number of dynamic access requests, thereby significantly improving the security and response efficiency of data sharing, and meeting the needs of business alliances in real-time data processing and decision support.

[0121] The present invention utilizes fine-grained access control lists combined with decision tree algorithms to optimize the data access control process and improve security and efficiency. Merchant nodes formulate access control lists containing user roles, data categories and diversified composite conditions based on their own business needs and data security policies. These access control lists are pre-classified by decision trees, quickly narrowing the scope of applicable rules based on roles and data types, and further accurately filtering and processing data access requests through composite conditions defined in the nodes. It is beneficial to improve the processing speed of access control and reduce the number of rules that need to be evaluated in the decision-making process. At the same time, the error rate is reduced through structured preprocessing, making the system more efficient and easy to maintain. It is suitable for processing complex access permission models and a large number of dynamic access requests, significantly improving the security and response efficiency of data sharing, ensuring the security and compliance of data, and providing business alliances with sufficient flexibility to respond to different business strategies and regulatory requirements.

[0122] S3 includes the following:

[0123] The requester first sends an access request containing his role, the type of data requested, and additional access conditions (such as time, location, etc.);

[0124] The central node uses the ACLs model generated in step S2 to verify the requester's access rights, and uses logical expressions combined with access conditions to verify permissions, where each conditional expression is represented as a composite logical function :

[0125] ;

[0126] in:

[0127] A classification identifier that represents a user or user group requesting access to data. This is usually based on the user's responsibilities and permission levels; roles are used to determine the scope of data types and permission levels that a user or user group can access. In ACLs, roles are used to specify which operations are allowed (such as read, write, modify, delete, etc.) and which data categories these operations can be applied to. For example, within a company, users may be divided into roles such as "internal analyst", "supplier" and "distributor", and each role will have different data access permissions.

[0128] Refers to the classification of data, distinguishing it based on its purpose or content. The distinction between data types allows ACLs to fine-tune access rights to different types of data. This helps protect sensitive information while ensuring that users can access the information necessary to perform their duties. Data categories may include "inventory data", "sales data", "customer data", "financial data", etc., each of which may involve different privacy and security requirements.

[0129] It is a set of additional rules that define data access that is allowed only when certain conditions are met. These conditions may include time restrictions, geographic location, specific events, or any other business logic. By introducing additional access conditions, you can more finely control the security and adaptability of data, ensuring that data access is both secure and meets business needs. Conditions can be set to "only allow access between 9:00AM and 5:00PM on weekdays" or "only allow access to specific data when the user is inside the company network."

[0130] Represents the evaluation of specific conditions that are validated against roles, data types, and other access criteria.

[0131] This composite logic function ensures that each access request is strictly evaluated, and only requests that fully meet the set security standards can obtain access to the required data. This approach provides a strong guarantee for data security and is particularly suitable for application environments that have extremely high requirements for data privacy and security.

[0132] Once the access request is authenticated, the central node uses the hash index generated in step S1 to retrieve the data. Each data item is identified by its unique hash key. To index:

[0133] ;

[0134] in:

[0135] It is a unique identifier for a data item, used to uniquely distinguish each data record. Data attributes are used to enhance the amount of information in the data index so that data retrieval can be performed based on content attributes, thereby providing more accurate and efficient data retrieval capabilities.

[0136] Represents the key attributes of a data item. Data attributes are used to enhance the information content of the data index so that data retrieval can be performed based on content attributes, thereby providing more accurate and efficient data retrieval capabilities.

[0137] Represents a combination of data identifier and data attributes to ensure the uniqueness of each data item.

[0138] Data location is accomplished by finding the storage location that matches the hash key, and the storage location is determined using a composite function: ;

[0139] in, is a function that maps a hash key to a specific bucket, and is the total number of buckets in the storage system, ensuring that data is evenly distributed across all available buckets.

[0140] The composite function is used to map hash keys to specific buckets to achieve fast data location. This mapping process uses modular operations to ensure that data is evenly distributed across all buckets, thereby optimizing the speed and efficiency of data retrieval. In this way, regardless of the size or complexity of the data set, the central node can quickly respond to data access requests, reducing access latency and improving the overall performance of the system. This data location strategy is particularly suitable for large-scale distributed storage systems, which can significantly reduce the time complexity of data access and improve the load balancing and scalability of the system by reducing hotspot access.

[0141] The present invention uses fine-grained access control lists (ACLs) and hash-based indexing technology to implement permission verification and rapid location of data access requests. It aims to ensure that only authorized users can access specific data resources, while ensuring rapid and accurate data access. It improves the security and response speed of the data management system, especially in an environment where large amounts of data are processed and multiple users access, ensuring data confidentiality and availability.

[0142] The main reason for evaluating and analyzing the urgency, broad impact, and associated risk profile of data updates when publishing updated data to subscribers is to ensure that the release of data updates is both timely and necessary, and to avoid placing unnecessary burdens on the system. By evaluating the urgency of data updates, the priority and processing speed of updates can be determined, ensuring a rapid response to critical data changes. At the same time, analyzing the broad impact of data updates helps understand the potential impact of these changes on the entire system or other nodes in the network, thereby preventing possible chain reactions or error propagation. In addition, considering the associated risk profile allows for the evaluation of security and integrity issues that may arise from data updates, ensuring that the accuracy and security of data are not compromised. This comprehensive evaluation process ensures that data updates meet real-time and accuracy requirements without excessively consuming resources or inducing unnecessary operations, thereby optimizing the overall data management strategy and enhancing the stability and efficiency of the system. This practice is critical to supporting data-intensive and highly dynamic business environments, and can significantly improve the quality of decision-making and the responsiveness of operations.

[0143] S4 includes the following:

[0144] After the merchant node updates the local data, it generates new data metadata, including data identifier, update time, data type, etc. Then, this information is packaged and sent to the central node.

[0145] After receiving the new data metadata, the central node uses the update algorithm to regenerate the hash index of the data.

[0146] The central node extracts and analyzes the key indicators of the data to be updated, including the latent dynamic difference rate, the correlation impact coefficient and the integrity risk measurement index, forming a comprehensive data update evaluation framework, which helps the data management system to comprehensively evaluate the impact of each data update from three key dimensions: time sensitivity, impact breadth and integrity risk, and ensure the scientificity and effectiveness of data update and release decisions. This evaluation framework is crucial to maintaining a high-quality and efficient data environment, especially in data-intensive and dynamically changing business scenarios.

[0147] The three key indicators, namely the latent dynamic difference rate, the correlation impact coefficient and the integrity risk measurement index, evaluate the impact of data updates from different perspectives. The latent dynamic difference rate evaluates the frequency and time interval of data updates, focusing on the urgency of updates; the correlation impact coefficient quantifies how a data update affects other non-directly related data nodes in the system, measuring the broad impact of updates; and the integrity risk measurement focuses on maintaining data integrity and potential risks after data updates to ensure data quality. Together, these indicators help data management systems make scientific decisions on data updates and releases, optimize resource allocation, improve system stability and data processing efficiency, and are key tools for maintaining high-quality data standards in data-intensive environments.

[0148] The calculation process of the latent dynamic difference rate is:

[0149] Record the timestamp of each data update and the timestamp of the previous update within the most recent unit time;

[0150] Apply Gaussian harmonics to the time interval to increase its sensitivity to extreme values: ;

[0151] in, and The time intervals The mean and standard deviation of , used to highlight abnormal update frequencies.

[0152] Through nonlinear transformation, the dynamic changes of time intervals are further analyzed, and the latent dynamic difference rate is calculated as: ;

[0153] in, represents the total number of data update events considered; is a small constant introduced to avoid division by zero.

[0154] The Gaussian harmonic part strengthens the recognition of abnormal values ​​of update frequency, making the formula more sensitive to sudden changes. The nonlinear transformation part increases the complexity of calculation and the ability to capture subtle changes, so that the latent dynamic difference rate can more accurately describe the dynamic characteristics of data update.

[0155] The latent dynamic difference rate can more accurately identify and reflect the urgency and dynamic changes of data updates, so that the data management system can allocate and prioritize resources more effectively. This not only improves the system's response speed and efficiency, but also enhances the system's ability to handle sudden data updates, ensuring the stability and reliability of the entire data sharing platform.

[0156] The latent dynamic difference rate is used to evaluate and reflect the urgency and frequency changes of data updates, thereby helping to make decisions on whether data update releases should be triggered. Specifically, when the latent dynamic difference rate value is large, it means that data updates occur very frequently or the update time interval is very short, indicating that the data changes quickly and may be very important, so all relevant data subscribers need to be notified quickly. On the contrary, if the latent dynamic difference rate value is small, it means that data updates are sparse or the time interval is long, and the data changes slowly, which may mean that the data is less urgent and does not require immediate and extensive update releases. In this way, using the latent dynamic difference rate can help data management systems allocate network and computing resources more intelligently and efficiently, ensuring that data update notifications are only made when necessary, thereby optimizing the performance and response speed of the overall system.

[0157] The calculation process of the correlation influence coefficient is:

[0158] Identify the key attributes of each data update, such as data type, update size (change in data volume), update frequency, etc.

[0159] Calculate the number of hops it takes for data updates to propagate from the source to other nodes. The hop count is the minimum number of forwardings required from the data update source to another data node;

[0160] For each hop, an exponential decay function is used to evaluate the weakening of the hop count on the update, as follows: ;

[0161] in, is the number of hops, is the attenuation constant, which is adjusted according to the specific application scenario of the system.

[0162] The total correlation influence coefficient is calculated by combining the update influence values ​​of all hops, using the following formula: ;

[0163] in, It is The amount of data affected in a jump is adjusted by a logarithmic function to adjust the contribution of the amount of data in each jump to the total impact, ensuring that updates with large amounts of data contribute appropriately to the coefficient.

[0164] Exponential decay reflects the natural weakening of the influence of information as it propagates, while logarithmic adjustment is intended to balance the influence of data updates of different sizes, preventing large amounts of data updates from completely dominating the impact coefficient, and ensuring that the calculation of the coefficient reflects both the scope of the update and the "quality" of the update.

[0165] The correlation impact coefficient is used to quantify the spread and impact of a data update event within the system, especially how this update indirectly affects other data nodes that are not directly associated with the original data point. The value of this coefficient provides a quantitative measure of the importance and urgency of the data update. When the correlation impact coefficient value is large, it means that the data update has a wide impact and may affect multiple data nodes or cause important changes to other data in the system. In this case, it is usually necessary to release the update quickly to ensure the overall consistency of the system and the real-time nature of the data. On the contrary, if the correlation impact coefficient value is small, it means that the impact of the data update is more limited, and may only affect a limited number of data nodes or the impact is not significant. In this case, you can choose not to broadcast the update immediately, thereby saving resources and reducing unnecessary interference to the system. In this way, the correlation impact coefficient helps the data management system make more accurate decisions, optimize the timing and scope of data update releases, ensure efficient use of resources, and maintain the stability of the system and the accuracy of the data.

[0166] The calculation process of the integrity risk measurement index is:

[0167] For each data update, the consistency and integrity of the data before and after the update are first evaluated by calculating the checksum of each part of the data.

[0168] The checksum is calculated as: ;

[0169] in, The data is in The value of the position, Is the length of the data.

[0170] In the formula is to introduce a position-based weighting mechanism, where Represents the position index of a data element. This allows each data element to have a different weight depending on its position in an array or string, thereby increasing the sensitivity of the calculation results to changes in the data content and its structure. Position weighting ensures that even a simple rearrangement of data will result in a change in the checksum, thereby enhancing the ability to detect data changes.

[0171] Mod256 is used to ensure that the checksum calculation result can be kept within a reasonable range, avoid integer overflow, and simplify the calculation process. Mod256 was chosen because it is a common byte size that is suitable for a variety of data formats and systems. Modulo arithmetic also helps to map a large amount of data changes to a fixed range of values, which is especially useful when comparing checksums of different data states.

[0172] By using a position-weighted approach, the formula is very sensitive to any modification of the data, whether it is a change in content or order. This sensitivity makes the checksum an effective tool for initially determining whether the data has been modified without authorization.

[0173] The checksum calculation method does not depend on the specific type of data and can be widely applied to text, binary data or any data item that can be represented in digital form.

[0174] Use the checksum to calculate the difference in integrity score before and after the data is updated: ;

[0175] By calculating the checksum difference before and after the data is updated, the degree of data change can be directly reflected.

[0176] Use the exponential decay model to quantify the risk of data updates and calculate the integrity risk metric index: ;

[0177] in, is the attenuation coefficient, which is used to adjust the sensitivity of the risk index. is the base of natural logarithms.

[0178] The exponential decay model is introduced to smooth the impact of checksum changes on integrity risk assessment, so that the risk index is not overly sensitive to small checksum changes, but significantly increases the risk assessment value when the checksum changes are significant.

[0179] The integrity risk measurement index is used to quantify the risk of integrity loss or increased errors that may be caused by data updates, thereby guiding whether data update releases should be triggered. When the integrity risk measurement index value is large, it indicates that the integrity changes introduced by the data update are significant, which may cause data corruption or errors, so it needs to be handled with caution, which may include re-verifying the data or delaying release for further inspection. On the contrary, if the integrity risk measurement index value is small, this indicates that the data update has a small impact on integrity and low risk, and the data update can be safely released without posing a significant threat to the overall data integrity of the system. Therefore, by accurately calculating the integrity risk measurement index, the data management system can make more informed decisions, optimize the data release process, ensure the security and accuracy of data, avoid possible data quality issues, and improve the reliability of the system and user trust.

[0180] The data dynamic context cohesion coefficient is obtained by integrating the three indicators of latent dynamic difference rate, correlation influence coefficient and integrity risk measurement index. The calculation formula is: ;

[0181] in, , and are the latent dynamic difference rate, the correlation influence coefficient and the integrity risk measurement index, respectively. , and They are the preset proportional coefficients of the latent dynamic difference rate, the correlation influence coefficient and the integrity risk measurement index, and all of them are greater than zero.

[0182] The data dynamic context cohesion coefficient is used to represent the overall risk and importance of data updates. It quantifies the urgency of data updates, their possible wide-ranging impact, and the integrity risks associated with them, providing a single metric to determine whether data updates should be prioritized or require special attention.

[0183] When the data dynamic context cohesion coefficient value is high, it means that the urgency of data update is high (LDDR is high), the impact range is wide (IEIC is high), and the integrity risk is also high (IRMI is low). This indicates that the data update is very important or critical and needs to be processed or released immediately to ensure the continuity of the system and the accuracy of the data.

[0184] When the data dynamic context cohesion coefficient value is low, it indicates that the data update is not particularly urgent, its impact is limited, and the associated integrity risk is low. In this case, the data update may not need to be processed immediately and can be scheduled at a time that will not affect system performance.

[0185] Compare the data dynamic context cohesion coefficient with the update release threshold. When the data dynamic context cohesion coefficient reaches or exceeds the set threshold, it indicates that the urgency, scope of impact and integrity risk of the data update are significant after comprehensive consideration. This means that the data update is very important or critical, and its content may involve major changes or have a significant impact on the operation of the system. Therefore, it should be processed or released immediately to ensure the stable operation of the system and the accuracy of the data, while avoiding broader problems that may arise due to delayed processing, and generating an immediate release signal;

[0186] On the contrary, if the data dynamic context cohesion coefficient is lower than the set threshold, it means that although the data update is necessary, the urgency is low, the impact is limited, and the integrity risk is also small. In this case, the data update can be deferred or scheduled without affecting the overall performance and stability of the system. Such decisions help optimize resource utilization and avoid possible non-urgent updates when the system is under high load, thereby maintaining system performance and user experience, and generating delayed release signals.

[0187] The present invention effectively improves the efficiency and security of the data update process by generating new data metadata after the merchant node updates the local data and sending it to the central node for processing. This step enables the central node to receive and process the latest data changes in real time, regenerate the hash index of the data using advanced algorithms, and ensure the accuracy of data retrieval and positioning. The central node further constructs a comprehensive data update evaluation framework by analyzing key indicators such as latent dynamic difference rate, correlation influence coefficient and integrity risk measurement index. This not only helps the data management system to comprehensively evaluate the impact of each data update from three key dimensions of time sensitivity, impact breadth and integrity risk, but also supports the update and release of scientific decision-making data. Through this comprehensive evaluation method, the system can quickly respond to important updates when necessary, while avoiding unnecessary resource consumption, optimizing system performance, and ensuring data consistency and integrity. In addition, through a real-time publish / subscribe model, it is ensured that all participants obtain the latest data in a timely manner, which is crucial for data-intensive and dynamically changing business environments, effectively avoiding the problem of data obsolescence or synchronization failure, and improving the stability and reliability of the data sharing platform. This systematic improvement has a long-term and important impact on maintaining a high-quality and efficient data environment, and is the key to achieving data-driven decision-making and operational optimization. Example 2

[0188] Figure 2 The regional alliance merchant data sharing platform of the present invention is provided, including an index generation module, an access policy control module, an authority verification module, a data synchronization scheduling module and a dynamic update analysis unit;

[0189] The data synchronization scheduling module includes a dynamic update analysis unit;

[0190] The index generation module receives data metadata from merchant nodes and generates corresponding data indexes using hash table technology. It also regularly synchronizes indexes with merchant nodes through a differential update algorithm to ensure that data indexes of all nodes are kept up to date. The generated index data is passed to the access policy control module and the permission verification module.

[0191] The access policy control module is based on the latest synchronized data index. The merchant node sets a fine-grained access control list to define the access rights and conditions of different users to specific data. The updated access control list information is passed to the permission verification module.

[0192] The permission verification module uses the generated data index and the set access control list to verify the access rights of the data requester. Once the verification is passed, the required data is quickly located using index retrieval technology, and the specific storage location of the data is provided. The update status of the data index is fed back to the data synchronization scheduling module;

[0193] The data synchronization scheduling module receives new data metadata after the merchant node updates the local data, and updates the data index of the central node. The updated index is used for subsequent data retrieval and positioning, and the updated data index is transmitted back to the authority verification module and the index generation module;

[0194] The dynamic update analysis unit evaluates the urgency, widespread impact, and related risks of data updates, and based on these evaluation results, comprehensively determines whether all relevant data subscribers should be notified of data updates in real time through a publish / subscribe model.

[0195] The above formulas are all dimensionless and numerical calculations. The formula is a formula for the most recent real situation obtained by collecting a large amount of data and performing software simulation. The preset parameters and thresholds in the formula are set by technicians in this field according to actual conditions.

[0196] The above embodiments may be implemented in whole or in part by software, hardware, firmware or any other combination thereof. When implemented by software, the above embodiments may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, the process or function described in the embodiment of the present application is generated in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium, or may be transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from one website, computer, server or data center to another website, computer, server or data center by wired (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server or data center that contains one or more available media sets. The available medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium. The semiconductor medium may be a solid-state hard disk.

[0197] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0198] In the several embodiments provided in the present application, it should be understood that the disclosed systems and devices can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0199] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0200] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0201] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk, and other media that can store program codes.

[0202] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0203] Finally: The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A regional alliance merchant data sharing method, characterized by: S1: The central node receives data metadata from merchant nodes, generates data indexes using hash table technology, and regularly synchronizes these indexes with merchant nodes using a differential update algorithm to ensure that the data indexes of all participating nodes are up to date; S2: Based on the latest synchronized data index, the merchant node clearly defines the access rights and conditional restrictions of each user category to specific data categories based on a fine-grained access control list; S3: The central node uses the index generated in step S1 and the access control list set in step S2 to verify the requester's access rights. Once the verification is passed, the central node uses index retrieval technology to quickly locate the required data and returns the specific storage location of the data to the requester; S4: After the merchant node updates the data locally, it reports the new data metadata to the central node. The updated index is used for data retrieval and positioning in step S3. At the same time, the central node evaluates the urgency, wide impact and related risks of the data update, and comprehensively determines whether to notify all relevant data subscribers in real time to update the data through the publish / subscribe model; S4 includes the following: After the merchant node updates the local data, it generates new data metadata, and then packages this information and sends it to the central node; After receiving the new data metadata, the central node uses the update algorithm to regenerate the hash index of the data; The central node extracts and analyzes the key indicators of the data to be updated, including the latent dynamic difference rate, the correlation influence coefficient and the integrity risk measurement index; The calculation process of the latent dynamic difference rate is: Record the timestamp of each data update and the timestamp of the previous update within the most recent unit time; Apply Gaussian harmonics to a time interval: ; in, and The time intervals The mean and standard deviation of , used to highlight abnormal update frequencies; Through nonlinear transformation, the dynamic changes of time intervals are further analyzed, and the latent dynamic difference rate is calculated as: ; in, represents the total number of data update events considered; is a small constant introduced to avoid division by zero; The calculation process of the correlation influence coefficient is: Identify the key attributes involved in each data update; Calculate the number of hops from the source to other nodes. The hop count is the minimum number of forwardings required to get from the data update source to another data node. For each hop, an exponential decay function is used to evaluate the degree to which the impact of the hop number on the update is weakened. The formula is as follows: ; in, is the number of hops; is the decay constant; The total correlation influence coefficient is calculated by combining the update influence values ​​of all hops, using the following formula: ; in, It is The amount of data affected in the hop; The calculation process of the integrity risk measurement index is: For each data update, the consistency and integrity of the data before and after the update are first evaluated, which is performed by calculating the checksum of each part of the data; The checksum is calculated as: ; in, The data is in The value of the position; is the length of the data; in Represents the position index of the data element; Use the checksum to calculate the difference in integrity score before and after the data is updated: ; Use the exponential decay model to quantify the risk of data updates and calculate the integrity risk metric index: ; in, is the attenuation coefficient, which is used to adjust the sensitivity of the risk index; is the base of natural logarithms; The data dynamic context cohesion coefficient is obtained by integrating the three indicators of latent dynamic difference rate, correlation influence coefficient and integrity risk measurement index. The calculation formula is: ; in, , and are the latent dynamic difference rate, the correlation influence coefficient and the integrity risk measurement index, respectively. , and They are respectively the preset proportional coefficients of the latent dynamic difference rate, the correlation influence coefficient and the integrity risk measurement index, and all of them are greater than zero; Compare the data dynamic context cohesion coefficient with the update release threshold, and generate an immediate release signal when the data dynamic context cohesion coefficient reaches or exceeds the set threshold; On the contrary, if the data dynamic context cohesion coefficient is lower than the set threshold, a delayed release signal is generated.

2. The regional alliance merchant data sharing method according to claim 1, characterized in that: S1 includes the following: The central node receives data metadata from each merchant node, including data type , Update frequency and data size , each merchant node sends its data metadata as a tuple ; To generate data indexes, the following complex hash function based on nonlinear transformation is used: ; in, Functions are used to introduce nonlinear transformations in mathematics; Use the difference detection mechanism to determine when to update the index and calculate the difference metric : ; in, The central node has An index of merchants; is the most recent index received from the same merchant; The function is used to smooth large hash value differences. When the difference metric exceeds the set threshold, an index update is triggered; Calculate the cumulative impact value of all indexes that need to be updated, and use the following formula to decide whether to synchronize: ; in, is the temperature parameter that controls the decay rate.

3. The regional alliance merchant data sharing method according to claim 2, characterized in that: S2 includes the following: Each merchant node develops an ACLs model based on its business needs and data security policies, including standard user roles and data permission settings and condition-based access control. Merchants use the following formula to express ACL rules: ; in, Indicates the user role, Indicates the data category, To express a compound condition: ; When receiving a data access request, the central node needs to verify whether the request complies with the ACLs. The verification process uses a matching function to check the legitimacy of the request: ; in and It is a role matching and data type matching function, returning a Boolean value; is a function that evaluates a compound condition, determined based on the current request; Use decision tree algorithm to optimize access control decision process: Decision tree is pre-classified based on the role and data category of ACLs. The condition of each node is composed of the compound condition defined in the compound condition. The specific process is as follows: 1) First, the top nodes of the decision tree are classified based on the user's role, and the second-level nodes are further subdivided according to the data category; 2) Under each corresponding role and data category node, add more detailed decision nodes based on the compound conditions defined in the ACLs. Each condition node uses a logical expression to decide whether to allow access; 3) When an access request is received, starting from the root node of the decision tree, it is first classified by role, and then continues to traverse downward based on the data category. When reaching a specific compound condition node, it evaluates whether the corresponding attributes in the request meet these preset conditions. If all conditions are met, access is allowed. If any condition is not met, access is denied.

4. The regional alliance merchant data sharing method according to claim 3, characterized in that: S3 includes the following: The requester first sends an access request containing their role, the type of data requested, and additional access conditions; The central node uses the ACLs model generated in step S2 to verify the requester's access rights, and uses logical expressions combined with access conditions to verify permissions, where each conditional expression is represented as a composite logical function : ; in, A classification identifier representing the user or user group requesting access to the data; Refers to the classification of data, distinguishing them according to their purpose or content; It is a set of additional regulations, indicating that data access is allowed only when certain conditions are met; Indicates the evaluation of a particular condition; Once the access request is verified, the central node uses the hash index generated in step S1 to retrieve the data. Each data item is identified by its unique hash key. To index: ; in, It is a unique identifier for a data item, used to uniquely distinguish each data record; Represents the key attributes of a data item; Represents a combination of data identifier and data attributes to ensure the uniqueness of each data item; Data location is accomplished by finding the storage location that matches the hash key, and the storage location is determined using a composite function: ; in, is a function that maps a hash key to a specific bucket, and is the total number of buckets in the storage system, ensuring that data is evenly distributed across all available buckets.

5. A regional alliance merchant data sharing platform, used to implement the regional alliance merchant data sharing method according to any one of claims 1 to 4, comprising an index generation module, an access policy control module, an authority verification module, a data synchronization scheduling module and a dynamic update analysis unit; The index generation module receives data metadata from merchant nodes and generates corresponding data indexes using hash table technology. It also regularly synchronizes indexes with merchant nodes through a differential update algorithm to ensure that data indexes of all nodes are kept up to date. The generated index data is passed to the access policy control module and the permission verification module. The access policy control module is based on the latest synchronized data index. The merchant node sets a fine-grained access control list to define the access rights and conditions of different users to specific data. The updated access control list information is passed to the permission verification module. The permission verification module uses the generated data index and the set access control list to verify the access rights of the data requester. Once the verification is passed, the required data is quickly located using index retrieval technology, and the specific storage location of the data is provided. The update status of the data index is fed back to the data synchronization scheduling module; The data synchronization scheduling module receives new data metadata after the merchant node updates the local data, and updates the data index of the central node. The updated index is used for subsequent data retrieval and positioning, and the updated data index is transmitted back to the authority verification module and the index generation module; The dynamic update analysis unit evaluates the urgency, widespread impact, and related risks of data updates, and based on these evaluation results, comprehensively determines whether all relevant data subscribers should be notified of data updates in real time through a publish / subscribe model.