CN111930838B

CN111930838B - Time-oriented distributed archive management method

Info

Publication number: CN111930838B
Application number: CN202010716096.7A
Authority: CN
Inventors: 郭婧
Original assignee: Jinling Institute of Technology
Current assignee: Jinling Institute of Technology
Priority date: 2020-07-23
Filing date: 2020-07-23
Publication date: 2023-05-16
Anticipated expiration: 2040-07-23
Also published as: CN111930838A

Abstract

The invention discloses a time-oriented distributed archive management method, which is characterized in that the content which is required to be recorded when a user wants to obtain the right of operating a record archive on a system is related to labels set by archive bars, when the user does not want to enjoy the right of recording or arbitrates the right of the user to cancel the record of the user, the record can be reserved on the archive bars, and the time selection is controlled in the whole process, namely, the time between the archive bars and the system adopts a timing mode which is respectively set.

Description

Time-oriented distributed archive management method

Technical Field

The invention relates to a method for recording distributed files of a blockchain system on the Internet, in particular to a time-oriented distributed file management method.

Background

The archives now also present an internet model, and data construction faces the dual challenges of information security and privacy protection. The prior information technology encounters a great bottleneck for large-scale archival records of a centralized and relational database. The method indicates that the blockchain technology can transfer information from data to value, and on the basis of analyzing the blockchain technology, the application of the blockchain technology in the aspects of decentralization and privacy protection also contemplates application scenes, so that a new research thought is brought to file construction. Blockchain (blockchain) is the leading edge technology in the current security arts. The blockchain is a data blockchain structure arranged according to time sequence, and is essentially a tamper-proof distributed database for realizing the security of each link by cryptography through a decentralization mode. The blockchain has the characteristics of decentralization, tamper resistance, anonymity, verifiability, traceability, code open source and the like.

At present, in most blockchain platforms, any node can access all data on the blockchain, so that the problem of blockchain privacy security is particularly prominent, and the problem is an important research topic in the blockchain field. Current blockchain privacy techniques are primarily developed around blockchain-based verifiable computing, blockchain data privacy, blockchain transaction address privacy, and blockchain transaction amount privacy. First, the combination of blockchains with secure multiparty computing and verifiable homomorphic secret sharing has an inherent advantage because blockchains, secure multiparty computing and verifiable homomorphic secret sharing are all issues of how to work in concert between untrusted parties. Most of the existing homomorphic secret sharing and secure multiparty computing have the problems of multiple communication rounds and large communication traffic. However, in a blockchain environment, multiple rounds of communication and large amounts of communication data tend to result in reduced efficiency of the algorithm itself and the blockchain platform. In addition, since the nodes in the blockchain are not trusted, the large amount of communication data can place a heavy verification burden on the nodes. Thus, studying homomorphic verifiable secret sharing and secure multiparty computing for low-round communications is of great importance to blockchain-based verifiable computing. Second, problems of revealing data privacy and difficulty in supporting homomorphic computing are prevalent in existing blockchain-based applications. Therefore, the research is safe and efficient, and the decentralised outsourcing computing mechanism supporting homomorphic computing can effectively solve the problem that homomorphic computing and privacy disclosure are difficult to support in the blockchain application system. Finally, the blockchains can be categorized into UTXO-based blockchains and account-based blockchains in a billing manner. Thus, the blockchain platform that currently provides the amount hiding function is UTXO-based blockchain, and the account-based blockchain platform records all transactions in plaintext.

Disclosure of Invention

Aiming at the defects of the prior art, the invention provides a archive management method based on a block chain, which comprises the following steps: a classification transfer system is established, and the classification transfer system comprises a class transfer module, a block parallel module, a global distribution center and a pre-questioning module;

the class transferring module is used for checking whether the ordinary user is given the right of becoming a temporary user, namely checking whether the ordinary user has the right of recording files in the classifying and transferring system;

the block parallel module is used for storing and recording files of users and performing management service of the files, and comprises N file strips and a memory strip, wherein the file strips are block chains used for recording files required to be recorded by temporary users, and the memory strip is a universal identifier used for recording all atomic events and a block chain of nouns represented by the atomic events corresponding to the universal identifier; n is a natural number; one memory bar is only used for recording universal identifiers used by all atomic events and nouns represented by the atomic events corresponding to the universal identifiers;

the global distribution center is used for setting a checking condition of whether the ordinary user is given the authority of the temporary user or not and detecting the authority; the global distribution center comprises a bidirectional pointer comparison area and an event storage area, wherein the bidirectional pointer comparison area is a storage area for storing atomic events extracted from an atomic event sequence and used for comparison; the event storage area stores an output time variable et sent by a temporary user ₂ And the output time variable et stored in the event memory area ₂ The values of (2) must be different;

the pre-questioning module is used for sorting the time validity periods of the time valid atomic events contained in all valid atomic event combinations.

The users in the classifying and transferring system comprise more than two resident users, more than two temporary users and more than two common users, wherein the resident users comprise an arbitrating user;

the arbitration user is a user for detecting and setting the authority of a temporary user of the user and managing the classifying and transferring system, and is responsible for managing the memory strips for recording the atom event complete set sigma;

the resident users are users which are fixedly active on the classifying and transferring system, and the number of the resident users is determined to be N ₁ N, N ₁ N is determined by the arbitrating user as a positive integer ₁ In addition to arbitrating that each resident user of the user is responsible for managing one archive bar, serving temporary users who need to record archives on the managed archive bar;

the temporaryThe users are temporarily allocated users in the classifying and transferring system, the temporary users have the right to record files on file bars, the common users apply to become the temporary users and change from the temporary users to the common users to be arbitrated by the global allocation center, and the number of the temporary users is 5 XN ₁ The classifying and transferring system calculates the number of the vacant temporary users in real time, namely the number of the vacant temporary users is 5 XN ₁ Subtracting the number of temporary users currently in the classification and transportation system;

the common users are users except resident users and temporary users on the classifying and transferring system, the common users have no rights to record files on the file strips, and if the files need to be recorded, the common users have to apply for becoming the temporary users;

setting a total clock on the classifying and transferring system, wherein the total clock starts to count time after the classifying and transferring system starts to operate, and the counted time unit is microsecond;

setting an atomic event corpus sigma in the classifying and transporting system, wherein the atomic event corpus sigma is a set containing all atomic events, the atomic events are universal identifiers expressed by nouns involved in the classifying and transporting system, users in the classifying and transporting system can supplement the atomic event corpus sigma, and after the users in the classifying and transporting system inquire a memory bar, the nouns required to be used are found not to be expressed in the atomic event corpus sigma, and the atomic event corpus sigma is supplemented; the process of supplementing the atom event corpus sigma is that the universal identifier which is not used in the atom event corpus sigma is used for representing nouns, the universal identifier which is represented by nouns is added into the atom event corpus sigma, the atom events which are supplemented into the atom event corpus sigma and nouns represented by corresponding atom events are recorded into a memory bar in the block parallel module by arbitration users, the universal identifier which is used by the atom events of the atom event corpus sigma and nouns represented by the atom events which are corresponding to the universal identifier are broadcast to all users in the classification transportation system at regular time, and the users in the classification transportation system can inquire the memory bar about the nouns represented by the universal identifier which is used by the atom events;

The universal identifier is composed of a plurality of fixed up to M characters, the characters comprise capital letters, lowercase letters, numbers and underlines, the order of the characters composing the universal identifier is different, the characters are different, the universal identifier is set to be different, and the universal identifier cannot start with the underlines, and is used for representing atomic events; m is a positive integer, and the value of M can be increased by an arbitration user when the number of characters in the universal identifier is insufficient to represent an atomic event;

all resident users start to operate in the classifying and transferring system, and the valid word set E is updated in advance every time length epsilon _Σ Valid word set E _Σ The set of valid words E is a subset of the atomic event corpus Sigma _Σ The method comprises the steps of representing the tags of all the archives as universal identifiers, representing the tags of the archives as universal identifiers, checking whether the tags of the archives are recorded on a memory strip or not, if the tags of the archives are not recorded, the archives cannot be recorded on the archives corresponding to the tags, and the tags of each archives must be distinguished from the tags of other archives, each archives is provided with a tag, and the tags of each archives are different, and the tags of all the archives are represented as universal identifiers summarized in a valid word set E _Σ The method comprises the steps of carrying out a first treatment on the surface of the The length of time epsilon is determined by the arbitrating user in microseconds;

when the valid word set E is updated each time _Σ Arbitrating users to re-group valid words E _Σ Dividing into five sub-valid word sets, wherein the five sub-valid word sets are valid word set E _Σ Is respectively a first equivalent effective word set, a second equivalent effective word set, a third equivalent effective word set, a fourth equivalent effective word set and a fifth equivalent effective word set, and is divided according to files corresponding to labelsThe number of files stored in the last time length epsilon is from more to less, and the sub-valid word set is used for storing the divided valid word set E _Σ The ratio of the number of the stored files to the number of the files recorded in all file strips is more than or equal to

The universal identifier expressed by the label corresponding to the blockchain chain is put into the first equivalent word set, and the stored file quantity is more than or equal to +.>

The universal identifier of the tag representation corresponding to the blockchain chain is placed into the second equivalent valid word set, and then the number of files stored is more than or equal to +.>

The universal identifier of the tag representation corresponding to the blockchain chain is put into a third set of valid words, and then the number of files stored is more than or equal to +. >

The fourth equivalent valid word set of the general identifier Fu Fangru represented by the tag corresponding to the blockchain chain, and finally, the number of the stored files is more than or equal to +.>

A fifth equivalent valid word set of the universal identifier Fu Fangru represented by the tag corresponding to the blockchain chain;

the common identifiers expressed by the labels stored in the first equivalent effective word set, the second equivalent effective word set, the third equivalent effective word set, the fourth equivalent effective word set and the fifth equivalent effective word set are arranged according to the number of files stored in the corresponding file strips from more to less;

the universal identifiers of the labels corresponding to each archive bar are divided according to the sequence of the first equivalent effective word set, the second equivalent effective word set, the third equivalent effective word set, the fourth equivalent effective word set and the fifth equivalent effective word set, once the universal identifier of the label corresponding to each archive bar is put into one sub-effective word set, the universal identifier of the label corresponding to each archive bar is not put into other sub-effective word sets, and when the universal identifiers of the label corresponding to all archive bars are put into the sub-effective word sets, the division is stopped, and the five sub-effective word sets can be empty sets.

The global distribution center is used for setting a checking condition of whether the ordinary user is given the authority of the temporary user or not, and detecting the authority, and specifically comprises the following steps: the global distribution center sets a pair of authority inlets and authority outlets as checking conditions, wherein the checking conditions are used for checking whether to give the authority of the common user and cancel the authority of the temporary user, the authority inlets are used for measuring whether the common user can obtain the authority which becomes the temporary user, and the authority outlets are used for measuring whether to cancel the authority of the temporary user of the common user after the common user becomes the temporary user;

The authority is imported as

The export of the authority is

Inlet representation of rights

And (d=t (ein E) _Σ ) All are true, and the import of the rights satisfies the condition; Λ represents that both end-connected formulas are established;

wherein ,

representing the input time variable +.>

The value range of (2) is>

And (3) with

Between, function->

Representing the time variable +.>

Taking a function of time in the total clock in the categorizing and transporting system, function +.>

Direct assignment generates the input time variable +.>

Time on the total clock, t represents time on the total clock; />

Representing the generation of the input time variable +.>

Time taken on the total clock plus time delay epsilon _t Is of the value epsilon _t And epsilon both represent the length of time epsilon _t The units of epsilon and the time units of the total clock are consistent, the time units are microseconds, and the length of epsilon expressed time is at least 5 Xepsilon or more _t ；ε _t The value of epsilon is determined by the arbitrating user; d is a Boolean variable that is equal to true; f represents a function of time taken on the total clock; output event e _out An act of ending the temporary user right; function->

Representing when an output is generatedInter-variable->

Taking the function of time from the total clock in the classifying and transferring system, directly assigning value to generate output time variable +. >

The current time of the total clock is taken as a function +.>

Is a value of (2);

if the common user needs to apply for the temporary user in the classified transportation system, the method specifically comprises the following steps:

step a1, a common user firstly sends an input time variable to an arbitration user

Input time variable +.>

For any time on the total clock that the user can send, the input time variable sent when the ordinary user applies to become a temporary user +.>

The value of (2) represents that the average user wishes to be able to run at the categorization transfer system until the time equals the input time variable +.>

Starting the authority of the temporary user when the value of (a) is equal to the value of (b); when the ordinary user needs to apply for the authority of the temporary user, an input time variable is generated>

And is the input time variable +.>

Assignment, generating the input time variable +.>

At the same time produce a function->

The value of (2), i.e. in generating the input time variable +.>

The input time variable is taken from the total clock in the classifying and transferring system>

Time assignment of time to->

The ordinary user first sends an input time variable +.>

To an arbitration user, the arbitration user detects the input time variable +.>

Whether or not the value of (2) satisfies->

The value of (2) and->

Between the values of (1), i.e. detect->

Whether or not to establish; if the input time variable sent at the time of application +. >

The value of (2) satisfies->

The value of (2) and->

Between the values of (2) to allow the average user to send an input event e _in Otherwise, the applied ordinary user is refused to become the temporary user, and the ordinary user sends the input event e _in Is taken at the same time f (e _in ) Is a value of (2); input event e _in Input event e as an atomic event or a compound event _in When the atomic event is an atomic event, the nouns expressed by the universal identifiers represent the most important nouns in files which are applied by the ordinary users to be needed to be recorded by the temporary users, and the ordinary users are assigned; input event e _in In the case of a compound event, event e is input _in For sentences containing more than two nouns, representing the most important sentences in files which are applied by the ordinary user to be the temporary user to record, and designating the sentences by the ordinary user; f (e) _in ) Representing a send input event e _in When the input event e is fetched and transmitted on the total clock _in A function of time at that time;

step a2, arbitrating user detection d=t (e _in ∈E _Σ ) Whether or not it is true, T (e _in ∈E _Σ ) Representing judgment e _in ∈E _Σ Whether or not it is true, i.e. judge the input event e _in Whether or not it belongs to the valid word set E _Σ When e _in In the case of an atomic event, the judgment result can be directly given, if the event e is input _in Is included in the valid word set E _Σ In the first valid word set, T (e _in ∈E _Σ ) Is true, and d=t (e _in ∈E _Σ ) Whether or not it is true, if the event e is input _in Not included in the set of valid words E _Σ In the first valid word set, T (e _in ∈E _Σ ) Is false, and determines that d=t (e _in ∈E _Σ ) Not true; if f (e) _in ) The value of (2) is within the first time length epsilon after the running of the total clock, the user is not allowed to send an input event e _in Is a composite event;

step a3, when inputting event e _in For compound event, representing input event e _in To describe sentences of more than two nouns, the compound event is uncertain whether it belongs to the valid word set E _Σ Is set to T (e _in ∈E _Σ ) Is uncertain; when T (e) _in ∈E _Σ ) As a result of uncertainty, it is necessary to arbitrate users to determine and give T (e _in ∈E _Σ ) Assignment, first, the general user sends an input event e _in For the arbitrating user, the arbitrating user receives the input event e _in For input event e _in Searching and extracting atomic events, delivering the atomic events to a common user for sorting, and forming an input event e after sorting by the common user _in An atomic event sequence comprising a common user ordered input event e _in Extracted atomic events from (a) and comparing the extracted atomic events to determine T (e _in ∈E _Σ ) The specific process is as follows:

Arbitrating user input event e _in Representative sentences are searched and event e is input _in All nouns contained in the representative sentence are extracted, and if the extracted nouns can be queried in the memory bar, i.e. the extracted nouns are already represented by using the universal identifier in the atomic event corpus sigma, the universal identifier represented by the extracted nouns in the atomic event corpus sigma is directly used as the input event e _in Atomic events represented by the extracted nouns, if the extracted nouns are not represented in the atomic event corpus Σ by using the universal identifier, the ordinary user represents the extracted nouns by using the universal identifier as an input event e _in The extracted nouns are expressed as atomic events and are supplemented into an atomic event complete set sigma, the process of supplementing the atomic event complete set sigma is completed, and the common user inputs an event e _in The atomic events expressed by the extracted nouns are ordered in descending order of importance to form an atomic event sequence, namely, the input event e _in The extracted nouns are expressed as universal identifiers and placed in order of common user ordering to form an atomic event sequence, and the global distribution center sequentially orders atoms in the atomic event sequence in order of ordering in the atomic event sequence The method comprises the steps of extracting events into a bi-directional pointer comparison area for comparison, sequentially increasing the number of the extracted atomic events each time, extracting one atomic event from an atomic event sequence for the first time, extracting two atomic events from the atomic event sequence for the second time, extracting r atomic events from the atomic event sequence for the r th time, wherein the r value is a natural number and represents the maximum number of times of extraction from the atomic event sequence, each atomic event can only be extracted once, and stopping extraction if all the atomic events contained in the atomic event sequence are already extracted;

the global distribution center stores labels in each sub-valid word set into a small storage area with the number of 1, a small storage area with the number of 2, a small storage area with the number of 3, a small storage area with the number of 4 and a small storage area with the number of 5 according to the sequence of the first valid word set, the second valid word set, the third valid word set, the fourth valid word set and the fifth valid word set;

the small storage area with the number of 1, the small storage area with the number of 2, the small storage area with the number of 3, the small storage area with the number of 4 and the small storage area with the number of 5 form a coding storage area, the coding storage area is a storage space for storing labels, and each small storage area is used for storing all labels in one sub-valid word set;

The global distribution center establishes a double-head pointer which is a pointer containing two pointer heads, one pointer head points to one small storage area in the coding storage area, the pointer head points to one small storage area each time the comparison is carried out, the pointer head points to the small storage area which is one larger than the number of the small storage area which is currently pointed to, and the other pointer head points to a bidirectional pointer comparison area, when the atomic event extracted for the first time is equal to one universal identifier in the universal identifiers represented by the labels contained in the small storage area with the number of 1, the comparison is immediately ended, and the T (e _in ∈E _Σ ) If true, remove atomic events in the bi-directional pointer comparison region, otherwise continue the comparison, when all atomic events extracted a second time are equal to two of the universal identifiers represented by the tags in the small memory region numbered 2,immediately ending the comparison, setting T (e _in ∈E _Σ ) If only one of the atomic events extracted for the second time is equal to one of the universal identifiers represented by the tags in the small memory area numbered 2, removing the atomic event in the bi-directional pointer comparison area for which the comparison result is equal, and continuing the next comparison, if more than two of the atomic events extracted for the third time are equal to the universal identifier represented by the tag in the small memory area numbered 3, setting T (e _in ∈E _Σ ) If the atomic event extracted for the third time is equal to one of the common identifiers represented by the tags in the small memory area numbered 3, then the comparison is continued, if none of the atomic events extracted for the second time is equal to one of the common identifiers represented by the tags in the small memory area numbered 2, then the atomic event extracted for the third time is all equal to the common identifier represented by the tag in the small memory area numbered 3, then T (e _in ∈E _Σ ) The results of (2) are true..compare until a small memory area number 5 is compared; once set T% _ei n∈E _Σ ) As a result of true, removing atomic events in the bi-directional pointer comparison field; during extraction, skipping the extraction and comparison of the sub-active sets of the empty set until all the sub-active sets are extracted and compared; at the time of the above comparison, atomic events equal to the common identifier represented by the tag in the small memory area are removed from the bi-directional pointer comparison area; if the atomic events in the atomic event sequence are not extracted enough during extraction, allowing a user to select the atomic events to supplement the extracted atomic events in a bi-directional pointer comparison area to participate in comparison with the universal identifier represented by the tag of the small storage area again, wherein each atomic event participates in the comparison at most twice, and when the comparison cannot be performed, stopping the comparison; in the comparison, if more than half of the single-extracted atomic events are equal to the common identifier represented by the tag in the small storage area, or if more than half of the single-extracted atomic events are equal to the common identifier represented by the tag in the small storage area and more than one third of the single-extracted atomic events are present The common identifier represented by the tag in the event and small memory area is equal to each other, and T (e _in ∈E _Σ ) The result of (2) is true; d=t (e _in ∈E _Σ ) Representation T (e) _in ∈E _Σ ) Is true when the result of (a) is equal to the variable d, which is a constant true boolean variable, T (e _in ∈E _Σ ) The result of (a) is true, the value of variable d is equal to T (e _in ∈E _Σ ) Is equal, d=t (e _in ∈E _Σ ) Establishment; if an input event e provided by a common user _in For an atomic event, directly sending a universal identifier represented by the atomic event to an arbitration user; variable d is assigned in advance for verification of T (e _in ∈E _Σ ) Whether or not a boolean variable is established; when the above-described determination process is passed, d=t (e _in ∈E _Σ ) The method comprises the steps that (1) the right of a temporary user of a common user granted with an application is refused;

when d=t (e _in ∈E _Σ ) After being established, the global distribution center checks whether the number of the current temporary users reaches 5 XN ₁ If the number of the spare temporary users is greater than or equal to one, locking the seat of one temporary user, subtracting one from the current number of the spare temporary users, giving the applied ordinary users permission to become temporary users when the total clock reaches the value of the input time variable set by the ordinary users, and if the number of the current temporary users reaches 5 XN ₁ Detecting whether there is an output time variable with a value less than or equal to the input time variable transmitted by the applying ordinary user in the event memory area, deleting the output time variable less than or equal to the input time variable transmitted by the ordinary user from the event memory area if there is only one output time variable with a value less than or equal to the input time variable transmitted by the applying ordinary user in the event memory area, and subtracting one from the number of spare temporary users when the total clock reaches the ordinary user to set the input time variable

Is given to the ordinary user of the application as the authority of the temporary user, and is temporarily usedThe number of the users is increased by one; if the time variable stored in the event memory area is equal to or less than the normal user input time variable +.>

More than one output time variable in the event memory area, selecting to delete the smallest output time variable in the event memory area from the event memory area, and subtracting one from the number of spare temporary users, when the total clock reaches the normal user setting input time variable +.>

Giving the applied ordinary users the authority of temporary users, and adding one to the number of temporary users; and when the ordinary user refuses the right granted to the temporary user because the condition of the import of the right is not satisfied, the refused ordinary user is not allowed to apply for the temporary user for the epsilon time period from the time of refusing the right granted to the temporary user.

The global distribution center is responsible for detecting the condition of the export of the temporary user rights

Representing an output event e _out Produce or->

V is established, and V represents that one of the formulas with two ends connected is established;

when the temporary user finishes recording files in the system or the temporary user does not record files on the file strips for a continuous epsilon time, the temporary user applies for the arbitrated user, and outputs an output event e after the arbitrated user arbitrates _out Immediately ending the authority of the temporary user and outputting an event e _out Arbitrating for the arbitrating user an action for ending the temporary user right; the number of the current temporary users is reduced by one, and the number of the spare temporary users is increased by one; if the temporary user needs to stop the authority of the temporary user by itself, the temporary user selects to send an output time variable to the arbitrating user

And at the same time is the output time variable +.>

Assignment, taking the generate output time variable +.>

The time value at time is assigned to +.>

Output time variable transmitted by temporary user +.>

Indicating that the temporary user wants to run at the total clock to the output time variable +.>

Stopping authority of the temporary user when the value of (2) is set, detecting output time variable +.>

Whether the time value of (2) is greater than or equal to +.>

After the value condition of the output time variable is met, the global distribution center transmits the output time variable +. >

Placed within an event store;

if the time variable is output

Is stored in the event memory area until the total clock runs to output time variable

The value of (2) has not been deleted before, when the total clock is reachedLine-to-output time variable +.>

When the value of (2) is the output time variable +.>

Deleting from the event storage area; when the total clock is running to the output time variable +.>

When the value of (2) is the value, stopping the authority of the temporary user and changing the authority into the common user; />

Output time variable representing temporary user transmission +.>

The time value of (2) is greater than or equal to +.>

Function->

Representing the variable +.>

Taking the function of time from the total clock in the classifying and transferring system, directly assigning value to generate output time variable +.>

Time on the total clock is taken as a function +.>

Value of->

Representing the generation of output time variable

Time taken on the total clock plus twice the time delay epsilon _t Is a value of (2); t1 is a starting time point when the import of the verification authority is taken from the master clock when the import of the verification authority is imported; t is t ₂ To take the starting point in time at the time of the exit of the authentication right on the master clock at the time of the exit of the authentication right.

The block parallel module comprises N archives and a memory bar, wherein each archives comprises more than two connected blocks, each archives has an asynchronous time clock, namely, each asynchronous time clock corresponds to one archives and is used for timing the corresponding archives, only one block in the archives corresponding to the asynchronous time clock can be recorded at the same time in each same asynchronous time clock, and for the classifying and transferring system, more than two archives are allowed to be recorded at the same time in the total clock, and only one block can be recorded in the same archives; n is a natural number, determined by the arbitration user; except for the memory strips, each file strip is maintained by a resident user, condition constraint and label are set for each file strip, the labels are broadcast to all temporary users, the labels of each file strip are different, the labels are modified from each epsilon time length, the time is counted when the classification transfer system starts running, and the time of epsilon time length is counted on a total clock; the condition constraint is invisible to all temporary users, the condition constraint set by the archive recorded by the temporary users can be recorded in the archive bar, namely the condition constraint is used for limiting whether the archive can be recorded on the archive bar corresponding to the condition constraint, the condition constraint comprises satisfaction constraint and isolation constraint, the condition constraint is met only if the satisfaction constraint and the isolation constraint are met, wherein the satisfaction constraint is described as the connection of a time effective atomic event and a symbol, and the symbol of the satisfaction constraint comprises

Delta two, ignoring the time marked on the time-efficient atomic eventEffective period of (I) herba Cinchi Oleracei>

The nouns corresponding to the time-effective atomic events of the connection are symbolically contained in the user record file, and the nouns corresponding to one or more than two time-effective atomic events in the time-effective atomic events of the connection are symbolically contained in the user record file; the nouns corresponding to the time effective atomic events are nouns represented by atomic events corresponding to the time effective atomic events which are ignored for the time effective period;

the time effective atomic event is an atomic event marked with a time effective period, the time effective atomic event indicates that the atomic event is effective only within the marked time effective period, the timing using condition of the marked time effective period on the atomic event constrains the asynchronous time clock of the corresponding archive strip, when the block on the archive strip starts to record, the asynchronous time clock of the archive strip starts to count time, the timing starts from zero, and the unit for starting to count time of each asynchronous time clock is determined by a resident user for managing the archive strip; the time validity period is a time interval and is used for marking the valid time of the atomic event;

The isolated constraint of each archive bar contains atomic events which are not allowed to be contained in the archive recorded in the archive bar, and nouns represented by one atomic event contained in the isolated constraint in the archive cannot be recorded on the archive bar corresponding to the isolated constraint.

The block parallel module establishes a block effective event set, wherein the general identifier expressed by nouns contained in record files in all file strips is used as an atomic event to form the block effective event set, the block effective event set is formed by supplementing each resident user, and the block effective event set comprises an effective word set E _Σ Meanwhile, the block effective event set is a subset of the atom event complete set sigma; the resident user of the archive bar ignores the time validity period marked on top of the time valid atomic events in the satisfaction constraint, each atomic event in the valid word set must be contained in one satisfaction constraint, and sets all time valid atomic eventsThe time validity period marked above must cover the period of asynchronous clock operation of all archive strips, i.e. each time point from the start of the block parallel module to the stop of the block parallel module must be contained in the time validity period of one time valid atomic event, and the atomic event set contained in each isolation constraint must be different;

Each atomic event in the set of valid words must be included in a satisfaction constraint, and the time validity period marked on all time-valid atomic events must be set to cover the period of asynchronous time clock operation of all archives, i.e., each point in time from the start of the block parallel module to the stop of the block parallel module must be included in the time validity period of one time-valid atomic event, the set of atomic events included in each isolation constraint must be different;

the method for checking satisfaction constraint is as follows: taking the time from the time when the user receives the transaction as a constraint detection interval from the beginning to the end with the average delay epsilon 1, wherein the constraint detection interval is used for detecting whether the time validity period marked on the time validity atomic event in the satisfaction constraint is met when the user needs to record the file; the block parallel module extracts the time effective atomic events contained in the satisfied constraint, removes empty time effective atomic events, checks whether the time effective period marked on the time effective atomic events contains any time point in the constraint detection time interval, extracts the time effective atomic events corresponding to the time effective period containing any time point in the constraint detection time interval, removes the time effective period marked on the extracted time effective atomic events to become atomic events, and extracts a universal identifier expressed by nouns contained in files recorded by a temporary user as the extracted atomic events, and obtains an intersection with a set formed by the extracted atomic events, if the intersection is empty, directly cancels the right of the temporary user currently applying for recording on file strips, and if the intersection exists, still adds the removed original marked time effective period on the obtained intersection to serve as a useful time effective atomic event set;

Then, the resident user searches all the effective atomic event combinations from the satisfaction constraint, and the method for searching the effective atomic event combinations comprises the following steps: satisfying constraint on the file bar to be recorded is checked from left to right, the time-effective atomic event is marked, the first time-effective atomic event is marked with 1, and then if the symbol is marked from left to right

And symbol->

The label of the next time-effective atomic event on the right of the connection is marked with the same symbol +.>

The label of the left previous time effective atomic event connected is added by one on the basis of the label of the left previous time effective atomic event connected with the label delta, the label of the right next time effective atomic event connected with the label delta is equal to the value of the label of the left previous time effective atomic event connected with the same label delta, and the brackets in the satisfaction constraint are not nested, the brackets are considered as a whole, if the two satisfaction constraint sub-formulas are connected by the label delta, and the two satisfaction constraint sub-formulas are both placed in brackets, the label of the left first time effective atomic event contained in the satisfaction constraint sub-formulas in the right brackets connected with the label delta is the same as the minimum value in the label values of all time effective atomic events in the satisfaction constraint sub-formulas in the other brackets on the left connected with the same label delta; if the two satisfied constraint subforms are signed +. >

Connected and both satisfactory constrained subforms are placed in brackets, with the symbol +.>

In the subforms of satisfactory constraint description in brackets to the right of the connectionThe first time-effective atomic event from left to right is numbered as compared to the same symbol +.>

The largest value of the index values of all time-effective atomic events in the sub-set of the satisfaction constraint description in the other bracket to the left connected is incremented by one, and the sub-set of satisfaction constraint in the bracket repeats the above-described process of checking the equation of the satisfaction constraint description from left to right until the last time-effective atomic event on the right of the satisfaction constraint is checked;

when all the effective atomic event combinations are the files recorded by the temporary user and meet the satisfaction constraint, searching for the combinations of all possible time effective atomic event combinations which are met by the files recorded by the temporary user under the condition of meeting the satisfaction constraint, wherein all the effective atomic event combinations are used for detecting whether the files recorded by the user meet the satisfaction constraint, and the specific effective atomic event combination forming process is as follows: checking the labels of all time effective atomic events in the satisfaction constraint, wherein one time effective atomic event is respectively taken from the beginning of 1 to the numerical value of the label of the largest positive integer, namely, the time effective atomic event is respectively taken from the beginning of 1 to the numerical value of each label corresponding to the largest label to form an effective atomic event combination, all possible effective atomic event combinations are listed one by one, and the largest label in the effective atomic event combination is the largest numerical value in the labels of all time effective atomic events in the satisfaction constraint; the sub-formulas in the satisfaction constraint are placed in brackets, no nesting representation of more than two brackets is allowed, and the signs of the connection between the brackets in the satisfaction constraint are the same, if delta connection is used between the brackets, the number of time-effective atomic events contained in the sub-formulas in the two brackets is equal, the placement of empty time-effective atomic events is allowed, the sign of the empty time-effective atomic events is denoted as tau, no noun is represented, and the time validity period marked on the empty time-effective atomic events is +'s, which indicates that the empty time-effective atomic events are always valid during the operation of the categorizing and transferring system;

The resident user is able to modify the satisfaction constraint of the profile of the setup management, which must satisfy two conditions, the first one: the satisfaction constraint must contain a tag that manages the archive bar, the second condition: any time after the archive bar begins recording, all atomic events that must be included in the satisfied constraints of the current archive bar setting are combined with the active atomic events within the original noted time validity period.

The class transferring module is used for checking whether the temporary user is given the right to record files in the classifying and transferring system, and comprises the following steps: the class conversion module compares all time effective atomic events in the extracted useful time effective atomic event set with all effective atomic event combinations one by one, if the extracted useful time effective atomic event set contains all time effective atomic events in the effective atomic event combination except for empty time effective atomic events, the intersection of time effective periods marked on all time effective atomic events in each contained effective atomic event combination is obtained and used as an intersection, if the constraint detection interval has intersection with any intersection, the right recorded on a file bar corresponding to satisfied satisfaction constraint is given to a temporary user, and if the constraint detection interval does not have intersection with any intersection, the right recorded on the file bar corresponding to satisfied satisfaction constraint by the temporary user is refused; if the set of useful time-effective atomic events contains all time-effective atomic events in more than one combination of effective atomic events, and the constraint detection interval has intersections with more than one intersection interval, the temporary user is given the right to reserve the record of the archive on the archive strip once, and all direct use symbols are set

The time validity period of the connected time validity atomic event label is kept consistent; neglecting empty time effective atomic events in the comparison performed by the class conversion module, namely, not participating in the comparison, and only comparing whether other time effective atomic events meet the condition; and, all valid atomic event combinations includeThe time validity period of the time-valid atomic events of (a) is also used to temporally limit the number of times a temporary user subscribes to write a dossier.

The pre-questioning module is used for sorting time validity periods marked on time valid atomic events contained in all valid atomic event combinations, and is used for limiting the times of temporary user reservation write files in time, and comprises the following steps:

when a temporary user applies for reservation for file writing service, the pre-inquiring module starts to sort out the time validity period, which comprises the following steps: when the asynchronous clock of each file strip starts to time, namely the first file is recorded on the file strip, the pre-inquiring module takes time on the total clock of the classifying and transferring system, namely takes the time of the first file recorded on the file strip under the operation of the total clock;

the pre-inquiring module adds the starting time point and the ending time point of the time validity period marked on the time validity atom events contained in all the valid atom event combinations to the time of taking the corresponding file bar to record the first file under the operation of the total clock respectively as the starting time point and the ending time point of the adjusted time validity period, so as to obtain the adjusted time validity period; the adjusted time validity period is a time period represented by the time validity period under the running of the total clock;

The pre-consulting module calculates the applicable periods of all the effective atomic event combinations so as to serve a temporary user to reserve the write files, wherein the minimum unit of time at the reserved time is the maximum value in the minimum units of asynchronous time clocks of all file strips, the applicable periods are intersections of the adjusted time effective periods of the time effective periods marked on all the time effective atomic events contained in each effective atomic event combination, the pre-consulting module counts the applicable periods of all the effective atomic event combinations, marks all the applicable periods on a time axis, the minimum unit of the time axis is the maximum value in the minimum units of the asynchronous time clocks of all the file strips, the left end point and the right end point of each applicable period are marked on a time axis, the units of the applicable periods are adjusted to be the maximum value in the minimum units of the asynchronous time clocks of all file strips, the starting point of the time axis is the minimum value of the starting timing points of all asynchronous time clocks, the left end point and the right end point of the applicable period marked on the time axis are collectively called as end points along the increasing direction of the time axis from left to right along the time axis, the origin of the time axis is the first end point, the time interval between every two end points is used as a partition interval, and the partition interval is used for limiting the number of reserved time points which can be reserved in the time interval represented by the partition interval; if the partition is not an intersection of any pot life, the level of the partition is marked as 1, if the partition is an intersection of two pot lives, the level of the partition is marked as 2, if the partition is an intersection of three pot lives, the level of the partition is marked as 3, and so on, if the partition is an intersection of all pot lives, the level of the partition is marked as d+1, d is the number of all pot lives, and is a positive integer;

The class conversion module reserves more than less reserved time points in the partition section corresponding to the partition level from low to high according to the partition level of the partition section, the number of reserved time points in the partition section with the level of 1 can be reserved in the partition section with the level of 1 is d+1, the number of reserved time points in the partition section with the level of 2 can be reserved in the partition section with the level of 2 is d, and the like, and the number of reserved time points in the partition section with the level of d+1 can be reserved in the partition section with the level of 1 is 1; the number of times the user reserves the write file is limited in time, namely, the time point capable of reserving is scheduled in time, and after the reservation, the temporary user can reserve the service.

The resident user receives reservation service of the temporary user, the reservation service is responsible for writing files on file strips for reservation time of the temporary user, each temporary user is provided with three reservation rights, the temporary user selects the file strips for reservation and writing of the files according to the labels, reservation is only started in a reservation time period, the reservation time period is a time period taken by a total clock in the classification and transportation system, the unit is microsecond, and modification is not allowed to meet constraint in the reservation time period; from the tube The method comprises the steps that a user specifies the length of a reserved time period and a specific value of the reserved time period; the temporary user sends the file to be recorded for reservation, the resident user receives the file to be recorded for reservation, and invokes the local timestamp function J (t _b ) First, t is _b To obtain a local time stamp function J (t) _b ) At t _b When the value of =0, the local timestamp function J (t _b ) At t _b Values at=0; removing the time validity period marked on the time valid atomic event contained in the block valid event set by the resident user, changing the time validity period into an atomic event, extracting the atomic event to form the block valid atomic event set, representing nouns contained in files to be recorded when the resident user searches for reservation of the temporary user as atomic events and combining the atomic events into an atomic event set, solving an intersection with the block valid atomic event set, and ignoring the time validity period and the empty time valid atomic event when searching for the block valid atomic event set; then, searching for the effective atomic event combination satisfied by the searched atomic event set, namely, the searched atomic event set contains all time effective atomic events in one effective atomic event combination, if the contained effective atomic events are the satisfied effective atomic event combination, notifying the temporary user of the intersection of the marked time effective periods on all time effective atomic events in all satisfied effective atomic event combinations, wherein the temporary user provides the reserved value tb which must be within the intersection of the time effective periods of all time effective atomic events in the satisfied effective atomic event combination, and the value on the file mark of the temporary user must be smaller than the value of the left end point of the intersection of the time effective periods of all time effective atomic events in the satisfied effective atomic event combination; and t _b >0, find the local timestamp function J (t _b ) Will find the local timestamp function J (t _b ) The obtained value is compared with the value stored in the time usage space, if the local timestamp function J (t _b ) The obtained value is equal to or is found from the value stored in the time usage spaceLocal timestamp function J (t _b ) The obtained value plus the sum of the time of the first file recorded on the reserved file strip and the number of reserved time points in the partition interval are completely used up, and the temporary user is notified to modify t _b Is modified by the temporary user to provide the reserved value t again _b Is three times, if the temporary user modification is not notified, the local timestamp function J (t _b ) The resulting values are put into the time usage space and the local timestamp function J (t _b ) The obtained value and the file to be recorded during reservation are written into the intelligent contract, and the contents of the intelligent contract are as follows: asynchronous local clock of the temporary user reserved archive bar goes to step the local timestamp function J (t _b ) The obtained value is automatically written into the file bar reserved by the temporary user when the file to be recorded is reserved, and then the local time stamp function J (t _b ) The sum of the obtained value plus the time of the first file recorded on the reserved file strip and the time point at which the reserved reservation can be reserved in the partition is reduced by one, if the local time stamp function J (t _b ) The sum of the obtained value plus the time of the first archive recorded on the reserved archive strip is not in any partition, the reserved service cannot be provided, and the condition constraint is modified by the resident user or the t is modified by the temporary user _b After the value of (2), it is checked whether the reservation service can be provided.

The local timestamp function J (t _b ) To take a function of time over the asynchronous time clock of each archive bar, J (t _b ) Is defined as follows:

where b is the time stamp of the local timestamp function J (t _b ) The number of the file strips is increased according to the time ascending sequence of the first file recorded in each file strip, the number is a positive integer, and the value of b is less than or equal to N; t is t _b For a time length, the unit of time of the non-local clock of the archive bar with the number b is the reservation value provided by the temporary user when reserving, which isWhen the time is taken on the asynchronous time clock of the file bar with the number b, the local time stamp function J (t _b ) The time of the time is also the current call to the local timestamp function J (t _b ) Time at t _b =0, take the current call local timestamp function J (t _b ) Time at t _b >0, fetch the current call local timestamp function J (t _b ) A later time; at the same time t _b >0，t _b Reserving time and q of recording file for user on asynchronous time clock of file bar numbered b _b The difference in time between t _b The units of the asynchronous time clock of the file strip with the number b are consistent; q _b Is a point in time equal to the time when the local timestamp function J (t _b ) When the time taken on the asynchronous time clock of the archive bar numbered b, i.e. the local timestamp function J (t) _b ) The value of the time at that time is taken as the time point q _b Is a value of (2); the local timestamp function J (t _b ) At t _b Equal to time point q when=0 _b At t _b >0 is equal to time q _b The value of (2) plus t _b A sum of values obtained from (a); and sets a local timestamp function J (t _b ) The value of greater than or equal to the call local timestamp function J (t _b ) Takes the value of time on an asynchronous time clock and sets each time the local timestamp function J (t _b ) The obtained function values are different, when t _b =0, call the local timestamp function J (t _b ) When the function is executed, the local time stamp function J (t _b ) The value of the function, when t _b >0 will call the local timestamp function J (t _b ) The value of the function is recorded in a time use space, and each archive strip has a time use space, wherein the time use space is a storage space for storing a time point reserved by a temporary user when the archive is recorded on the archive strip with the number b, and the reserved time point is time taken from an asynchronous time clock of the reserved archive strip.

The defect that the existing blockchain technology center lacks a balance hiding mechanism can be overcome by researching the blockchain balance hiding mechanism. From the perspective of blockchain privacy, the technology development is developed in three aspects of one round of communication capable of verifying homomorphic secret sharing and secure multiparty computation, a blockchain-based decentralization outsourcing computing mechanism and a blockchain balance hiding mechanism. The invention has the following beneficial effects:

(1) In the aspect of low-round communication verifiable homomorphic secret sharing and secure multiparty computing, three verifiable password schemes are provided in a progressive manner based on a Shamir secret sharing algorithm for solving the problem that blockchains are severely limited by communication round numbers and communication traffic, wherein the three verifiable password schemes are a round of communication verifiable homomorphic secret sharing scheme (NVHSS), a round of communication verifiable homomorphic secret sharing scheme (NVFHSS) and a round of communication secure multiparty computing scheme (AntNest).

(2) In the aspect of an outsourcing computing mechanism based on a blockchain, in order to solve the problems of privacy leakage and difficulty in supporting homomorphic computing in a blockchain application system, the working principle of the blockchain is combined. The NVHSS algorithm and the NVFHSS algorithm provide a decentralised outsourcing computing mechanism (DOC) supporting efficient homomorphic multiplication. In the machine, on the premise of ensuring data privacy, the decentralizing node can provide verifiable outsourcing computing service for users, and can greatly reduce data verification burden and storage space of the users and the server nodes.

Drawings

The foregoing and other advantages of the invention will become more apparent from the following detailed description of the invention when taken in conjunction with the accompanying drawings and detailed description.

Fig. 1 is a flow chart of the method of the present invention.

Detailed Description

The invention will be further described with reference to the accompanying drawings and examples.

Example 1: as shown in fig. 1, the present embodiment provides a blockchain-based archive management method, including: a classification transfer system is established, and the classification transfer system comprises a class transfer module, a block parallel module, a global distribution center and a pre-questioning module;

the resident users are users which are fixedly active on the classifying and transferring system, and the number of the resident users is determined to be N ₁ N, N ₁ Is a positive integer, determined by the arbitrating userN is fixed ₁ In addition to arbitrating that each resident user of the user is responsible for managing one archive bar, serving temporary users who need to record archives on the managed archive bar; the universal identifier is composed of a fixed number of no more than M characters, the characters are capital letters, lowercase letters, numbers and underlines, the sequence of the characters composing the universal identifier is different, the characters are different, the universal identifier is different, and the universal identifier is specified to not start with the underlines; m is a positive integer, the value of M is determined by an arbitrating user, and when the number of characters in the universal identifier is insufficient to represent an atomic event, the arbitrating user can increase the value of M; for example, the value of M is determined by the arbitrating user as 5, and the universal identifier may be ab_12, ab_13, etc.; the nouns represented by the universal identifiers may be added to the atomic event corpus Σ to supplement the atomic event corpus Σ; users, resident users, temporary users, arbitrating users can supplement the atomic event corpus Σ, such as users joining the atomic event corpus Σ using books represented by ab_12; the universal identifier ab_12 represents a book on the system and may not represent other nouns; the value of N is between 50 and 100, and the value of N can be modified and increased, namely the number of the file strips is expanded; n in the invention ₁ Equal to N plus one, the initial value of M is 10; in the invention, a variable q is a time point taken by an asynchronous time clock;

the global distribution center is used for setting a pair of authority inlets and authority outlets, wherein the authority inlets are used for measuring whether a user can obtain the authority of a temporary user, and the authority outlets are used for measuring whether the authority of the temporary user of the user is cancelled after the user becomes a temporary user; if the user needs to apply to become a temporary user in the classified transfer system, the user becomes the temporary user and has the right to record files in the system, and firstly, the input time variable et is sent to the arbitrating user ₁ Inputting a time variable

Input time variable +.>

Equal to 1050 μs, representing that the user wants to be able to equal the input time variable +.>

Opening the authority of the temporary user at 10500 microseconds; and when the user needs to apply for the authority of the temporary user, an input time variable is generated +.>

And is the input time variable +.>

Assignment, in generating the input time variable +.>

The time value is assigned to the +.>

Generating an input time variable +.>

The time on the total clock is 10000 microseconds, thus +. >

Is 10000 microseconds; input time variable +.>

Equal to 10500 microseconds, the value of εt is set to 2000 microseconds, arbitrating the user to detect the input time variable et ₁ The value 10500 μs satisfies at +.>

Microsecond and->

Between microseconds; user transmission inputEvent e _in Thereafter, d=t (e _in ∈E _Σ ) Whether or not it is true, T (e _in ∈E _Σ ) Representing judgment e _in ∈E _Σ Whether or not it is true, i.e. judge the input event e _in Whether or not it belongs to the active event set E _Σ First equivalent set of words, when e _in In the case of an atomic event, the judgment result can be directly given, if the event e is input _in Is included in the active event set E _Σ In the first valid word set, T (e _in ∈E _Σ ) Is true, and d=t (e _in ∈E _Σ ) Establishment; e.g. user sending input event e _in Equal to AB_12, input event e _in Active event set E for atomic events _Σ The first set of valid words in (a) comprises ab_12, t (e _in ∈E _Σ ) The result of (2) is true; assume that the time length epsilon is 10000 microseconds, input event e _in The resulting f (e _in ) Equal to 10100 microseconds, so that during a second time period, a compound event can be entered; assume that event e is input _in For compound event, representing input event e _in To describe sentences containing more than two keywords, the compound event is uncertain whether it belongs to the active event set E _Σ Then T (e _in ∈E _Σ ) Is uncertain; when T (e) _in ∈E _Σ ) As a result of uncertainty, it is necessary to arbitrate users to determine and give T (e _in ∈E _Σ ) Assignment, first, the user sends an input event e _in For the arbitrating user, the arbitrating user receives the input event e _in Arbitrating user input event e _in Representative sentences are searched and event e is input _in All nouns contained in the representative sentence are extracted and the event e is input _in Extracting two nouns, namely books and textbooks, for my books, finding that the textbooks are not in the atomic event corpus sigma, using a universal identifier Cv0_l to represent the textbooks, and adding the textbooks into the atomic event corpus sigma;

resident user updates the valid word set E in advance every time length epsilon of classifying and transferring system _Σ Valid word set E _Σ Is as the originSubset of the total subset of sub-events Σ, the valid word set E _Σ The labels comprising all the file strips are denoted as universal identifiers, provided that three file strips and a single block chain are provided, the labels of the first file strip are AB_12 and dV0_l, the labels of the second file strip are aa_12 and dd0_l, the labels of the third file strip are aa_13 and dd0_2, wherein AB_12 represents a book, dV0_l represents a foundation, aa_12 represents medical treatment, dd0_l represents medicine, aa_13 represents makeup, and dd0_2 represents whitening; the memory bar is used for storing the atomic event corpus sigma and the nouns corresponding to the atomic event corpus sigma;

All tags are represented as universal identifiers put into the valid word set E _Σ = { ab_12, dv0_l, aa_12, dd0_l, aa_13, dd0_2}; dividing according to the number of files stored in the file bar corresponding to the tag in the last time length epsilon, and assuming that the number of files recorded in the first file bar accounts for 35% of the number of files recorded in all file bars in the last time length epsilon, the number of files recorded in the second file bar accounts for 20% of the number of files recorded in all file bars, and the number of files recorded in the third file bar accounts for 45% of the number of files recorded in all file bars, so that a universal identifier of the tag corresponding to the first file bar and a universal identifier of the tag corresponding to the third file bar are placed in a first equivalent valid word set, and a universal identifier of the tag corresponding to the second file bar is placed in a third equivalent valid word set; thus, the first set of valid words is { AB_12, dV0_l, aa_13, dd0_2}, and the third set of valid words is { aa_12, dd0_l };

the user orders the importance levels to form an atomic event sequence { AB_12, CV0_l }, comprising two atomic events, wherein one atomic event is extracted for the first time, and the atomic event AB_12 extracted for the first time is in the effective event set E _Σ In the first valid word set in (a), d=t (e _in ∈E _Σ ) Is true;

the global distribution center checks whether the number of the current temporary users reaches 5N ₁ Suppose here that two application scenarios, the number of temporary users in an application scenario finds that 5N is not reached ₁ The number of individual and spare temporary users is largeThe management user locks the seat of one temporary user, the number of the current vacant temporary users is set to be 2N, and the number of the current vacant temporary users is reduced by one; when the total clock reaches the user set input time variable

Is 10500 microseconds, giving the applied user the authority of the temporary user; the number of the current temporary users in the application scene II reaches 5N, whether the input time variable transmitted by the user with the value of the stored output time variable smaller than or equal to the value of the applied output time variable exists in the event storage area is detected, if only one output time variable with the value smaller than or equal to the input time variable transmitted by the user applied to the event storage area exists in the event storage area, the output time variable smaller than or equal to the input time variable transmitted by the user is deleted from the event storage area, the number of the spare temporary users is reduced by one, and when the total clock reaches the user set input time variable- >

The authority of the temporary user is given to the applied user, and the number of temporary users is increased by one; if the user input time variable stored in the event memory area is equal to or less +.>

More than one output time variable of (2), selecting the least median of the output time variables to delete from the event store, and subtracting one from the number of spare temporary users, when the total clock reaches the user-set input time variable +.>

The authority of the temporary user is given to the applied user, and the number of temporary users is increased by one;

When it is temporaryAfter the user finishes recording files in the system, or the temporary user does not record files on the file strips for a continuous epsilon time, the user applies for the arbitrated user, and the arbitrated user decides and then outputs an output event eo _ut Immediately ending the authority of the temporary user; the number of the currently vacant temporary users is increased by one, and the number of the temporary users is decreased by one; if the temporary user needs to stop the authority of the temporary user by himself, the temporary user selects to send an output time variable to the arbitrating user>

The casual user generates an output time variable

And assign the output time variable +. >

Microsecond, assume that the output time variable +.>

At the same time->

Assignment, taking the generate output time variable +.>

Has a value of 10000 μs, i.e. +.>

Is 10000 microseconds; output time variable transmitted by temporary user +.>

Indicating the desire to run at the total clock to the output time variable +.>

Stopping authority of the temporary user at the time of the value of time stored in the memory while detecting the output time variable +.>

Whether the value of (2) is greater than or equal to +.>

Output time variable +.>

Is 10200 μs, < >>

Has a value of 14000 microseconds, satisfies a condition of greater than or equal to

The value of εt is set to 2000 microseconds; after meeting the condition, the global distribution center sends the output time variable of the temporary user +.>

Is placed in the event memory area, in which the input/output time variable is stored +.>

Is 10200 microseconds; and the time variable +.>

The values of (2) must be different; if the output time variable +.>

Is always stored in the event memory area when the total clock is reached and runs to the output time variable +.>

When the value of (2) is the output time variable +.>

Deleting from the event storage area;

when the temporary user needs to record on one archive bar, the temporary user selects the archive bar to record according to the label, for example, the user selects the first archive bar to record, any transaction is sent to the resident user managing the first archive bar, no content needs to be recorded in the transaction, the resident user records the time of receiving the transaction, the time of receiving the transaction is taken as the time of receiving the transaction by the user on the asynchronous time clock of the archive bar, the time of receiving the transaction on the asynchronous time clock is recorded as 1000 microseconds, the time of receiving the transaction on the global clock is recorded, the time of receiving the transaction on the global clock is assumed to be 11100 microseconds, the time of receiving the transaction on the asynchronous time clock of the first archive bar to be recorded is 1000 microseconds, namely, the first archive bar starts to record the first archive after running to 9100 microseconds on the global clock; the method comprises the steps that a file to be recorded is sent to a resident user managing a file bar, the file to be recorded is 'My language book is green', the resident user firstly extracts three nouns in the file recorded by a temporary user, the three nouns are Chinese, book and green, the Chinese is represented by a universal identifier bn & lt02+ & gt, the book is represented by AB & lt12 & gt, the green is represented by a universal identifier BHTRy, and if the noun is not in an atomic event corpus sigma, the atomic event corpus sigma is supplemented;

The block effective event set comprises all atom events which are set by a resident user and do not consider the time effective period in all satisfaction constraints, the label of a first archive bar is AB_12 and dV0_l, the atom set contained in the isolation constraint is { ebert, rtyui }, ebert and rtyui respectively represent mathematics and electric lamps, the resident user is put into the atom event corpus sigma, a universal identifier which is expressed by nouns in archives which are required to be recorded by the user is firstly detected, whether the atom events are the same as those in the isolation constraint of the first archive bar or not is detected, and the atom events which are not coincident with those in the isolation constraint are detected continuously; detecting that the time of the asynchronous clock on the archive bar is 1105 microseconds when the isolation constraint is finished; the constraint detection interval is [1100,1105], the time effective atomic events in the constraint detection interval are extracted from the satisfaction constraint, the time effective period is ignored, the set is { abc_3, abl_3, AB_12}, the intersection is obtained between the time effective atomic events { AB_12, BHTRy, bn02} in the block effective event set contained in the file of the extracted temporary user record, the set { AB_12}, and the time effective period is marked, so that the time effective atomic set is obtained;

Satisfaction constraints of the first archive bar are described as

And will be within the constraint detection interval [1100,1105 ]]The noun extraction processing of (a) is that the time validity period of abc_3 and abl_3 is [500,6000]]The time validity period of the AB_12 mark is [300,6000]]The method comprises the steps of carrying out a first treatment on the surface of the Searching all effective atomic event combinations from satisfaction constraint, wherein the reference number of abc_3 is 1, the reference number of abl_3 is 2, the reference number of AB_12 is 1, the time validity period of two empty time effective atomic events tau is ≡, the reference numbers of the two empty time effective atomic events tau are 2 and 3 respectively, and the effective atomic event combinations are { abc_3, abl_3} and { AB_12, tau and tau }; the time effective atomic event set is { AB_12}, except for the empty time effective atomic event, checking whether all the atomic events in one effective atomic event combination are contained, including other time effective atomic events except for the empty time effective atomic event in the effective atomic event combination { AB_12, tau }, and checking a constraint detection interval [1100,1105 ]]Whether any of the times in (a) is included in the time validity period marked on ab_12, and after checking, giving the user the right to record on the blockchain;

example 2: performing reservation write file service of the system, assuming that a first file strip is still selected for reservation service, calculating the pot life of all the active atomic event combinations, { abc_3, abl_3} and { AB_12, τ, τ }, { abc_3, abl_3} with the adjusted pot life of [500,6000], { AB_12, τ, τ } with the adjusted pot life of the remaining file strips [300,6000], with the adjusted pot life of the remaining file strip [500,600], with the adjusted pot life of one active atomic event combination [700,5000], with the left and right end points of each pot life marked on the time axis, starting from the point of the start operation of the total clock, with the first end point 300 as a first reservation section [0,300], with the intersection of any pot life, with the grade of any pot life marked 1 as a reservation, with the grade 2 as a reservation 2, with the extension of the grade 2 as a reservation 2, with the grade 2 as a reservation 2, with the extension of the four end points as a reservation 2, with the four reservation 2 as a reservation 2, the grade of the partition is marked as 4, the sixth partition is marked as [1000,5000], the grade of the partition is marked as 3, the number of reserved time points is 3, the seventh partition is marked as [5000,6000], the grade of the partition is marked as 2, and the number of reserved time points is 4;

The pre-inquiring module is used for arranging the time validity periods of the time valid atomic events contained in all valid atomic event combinations, when a user applies for reservation service, the pre-inquiring module starts arranging the time validity periods, and the method comprises the following steps: when the asynchronous clock of each file strip starts to time, namely the first file is recorded on the file strip, taking time from the total clock of the classifying and transferring system, and taking the file strip to record the time of the first file under the operation of the total clock; the pre-inquiring module adds the starting time point and the ending time point of the validity period of all the time to the time of taking the corresponding file bar to record the first file under the running of the total clock, and the adjusted time validity period is obtained; the adjusted time validity period is a time period represented by the time validity period under the running of the total clock; calculating the applicable periods of all the effective atomic event combinations so as to serve a temporary user to reserve a write file, wherein the minimum unit of time in reservation is the maximum value in the minimum unit of all the asynchronous time clocks, the applicable periods are intersections of time effective periods contained in all the time effective atomic events contained in each effective atomic event combination, statistics is carried out on the applicable periods of all the effective atomic event combinations, all the applicable periods are marked on a time axis, the minimum unit of the time axis is the maximum value in the minimum unit of all the asynchronous time clocks, the left end point and the right end point of each applicable period are marked on the time axis in rounding when the left end point and the right end point of each applicable period are marked on the time axis, the starting point of the time axis is the minimum value of the starting timing point of all the asynchronous time clocks, the left end point of the minimum value of all applicable periods is started, the left end point and the right end point of the applicable periods marked on the time axis are all the end points along the time axis in the increasing direction of time from left to right, the time axis is marked on the left end point and the first end point, the two end points between the two end points of each time axis are all the time points which can be used for dividing the interval in advance; if the divided section is not an intersection of any applicable periods, the level of the divided section is marked as 1, if the divided section is an intersection of two applicable periods, the level of the divided section is marked as 2, if the divided section is an intersection of three applicable periods, the level of the divided section is marked as 3, and so on, if the divided section is an intersection of all applicable periods, the level of the divided section is marked as d+1, d is the number of all applicable periods;

The class conversion module allows reservation of more than less reserved time points in a partition section corresponding to the partition level from low to high according to the partition level of the partition section, the number of reserved time points in a partition section with the level of 1 of the partition section is d+1, the number of reserved time points in a partition section with the level of 2 of the partition section is d, the class conversion module sequentially decreases, and the like, and the number of reserved time points in a partition section with the level of d+1 of the partition section is 1.

Resident in the buildingThe user receives the intelligent reservation service provided by the temporary users, each temporary user has the right of three reservations, the temporary users select reserved archives according to the labels, and the local timestamp function J (t _b ) At t _b The value obtained when=0 is 50 microseconds, namely, the time when the archive bar starts to run is immediately taken when reservation is carried out, the my language book is blue when reservation is carried out, three terms of language, book and blue are used, the language is represented by a universal identifier bn02_and is represented by AB_12, the blue is represented by a universal identifier BH5Ry, and if the term is not in an atomic event corpus sigma, the atomic event corpus sigma is supplemented;

The block effective event set comprises all atom events which are set by a resident user and do not consider the time effective period in all satisfaction constraints, the current labels of a first archive bar are AB_12 and dV0_l, the atom sets contained in the isolation constraints are { eber7, rtyu8}, eber7 and rtyu8 respectively represent chemistry and a table lamp, the resident user is put into an atom event corpus sigma, general identifiers which are expressed by nouns in archives which are needed to be recorded by the user are firstly detected, whether the atom events have the same atom events in the isolation constraints of the first archive bar or not are detected, and the atom events which do not coincide with the atom events in the isolation constraints are detected continuously; the atomic events { AB_12, BH5Ry, bn02} in the block active event set contained in the file of the extracted temporary user record are taken as an active atomic event set, the contained active atomic event combination is { AB_12, tau }, and the intersection of time validity periods is [300,6000 ]]Temporary user provides reserved value t _b Must be within the intersection of the time validity periods of all time valid atomic events in the satisfied valid atomic event combination, and t _b >0, 1000 at [300,6000 ]]The value 50 marked on the file is also less than 300, the first file strip with the number of 1 accords with the condition; thus, b is equal to 1, local timestamp function J (1000) =q _b +1000，q _b To call J (t) _b ) When call J (t) is fetched on asynchronous clock of first file strip _b ) Time at time, assume q at this time _b The value on the asynchronous clock is 100 microseconds, so call J (t _b ) The resulting value is 1100 microseconds, assuming the first file bar records that the time taken by the first file on the total clock is 50 microseconds, J (t _b ) The sum of the obtained values plus 50 microseconds is [1000,5000 ] in the sixth partition]In the three-phase intersection, the level of the partition is marked as 3, the number of reserved time points is 3, whether the reserved time points are used up or not is checked, and if not, the local timestamp function J (t _b ) The obtained value is 1100 microseconds and the file of the user is written into the intelligent contract, and the content of the intelligent contract is as follows: the asynchronous local clock goes to step the local timestamp function J (t _b ) The obtained value is 1100 microseconds, the file of the temporary user is automatically written into the file reserved by the temporary user, namely the first file, and then the local timestamp function J (t _b ) The sum of the obtained value plus the time of the first file recorded on the reserved file strip and the time point at which reservation can be reserved in the partition section is reduced by one.

Setting a first sub-valid word set input event e _in Containing one of the valid words to be given possession of the input event e _in The second sub-valid word set inputs event e _in Comprising a case in which two valid words can be given possession of the input event e _in The fifth sub-valid word set inputs event e _in Containing five valid words therein capable of giving possession of the input event e _in The authority of the temporary user of the user; when the user meets the condition of authority import and the number of the current temporary users is less than 5N ₁ The user is given the right to become a temporary user if the current number of temporary users is already 5N full ₁ Queuing and distributing the rights of the temporary users from front to back according to the time sequence of the users applying for becoming the temporary users, and canceling the rights of the temporary users when the temporary users meet the condition of the export of the rights, and canceling the rights of the temporary users when the users become the temporary users and meet the condition of the export of the rights; if t _b =0, local timestamp function J (t _b ) Is equal to time q _b Is a value of (2); if t _b >0, local timeStamp function J (t) _b ) Is equal to q _b The value of (2) plus t _b A sum of values obtained from (a);

the method comprises the following steps:

firstly, the file management method firstly establishes a module of a classifying and transferring system, wherein the classifying and transferring system comprises a class transferring module, a block parallel module and a global distribution center, and a pre-inquiring module;

Secondly, setting a plurality of resident users and temporary users in the classified transfer system, wherein the resident users comprise arbitration users; setting a total clock on the classifying and transferring system to time the system;

third, the global distribution center sets a pair of authority inlets and authority outlets for the user to obtain the authority which becomes the temporary user, namely, detects the condition that the user becomes the temporary user and the condition that the user is no longer the temporary user, and sets the detection process;

fourth, set up the condition constraint of the file strip, the file that the user records meets the condition constraint that the file strip sets up can be recorded on the file strip;

fifth, a process of setting a reservation write profile of the temporary user.

As described above, according to the time-oriented distributed archive management method of the embodiment of the present application, the method may be implemented in various terminal devices, for example, a server of a distributed computing system. In one example, a time-oriented distributed archive management method according to embodiments of the present application may be integrated into the terminal device as a software module and/or hardware module. For example, the method may be a software module in the operating system of the terminal device, or may be an application developed for the terminal device.

The present embodiment also provides an electronic device 10, including:

one or more processors 11 and a memory 12, the processor 11 may be a Central Processing Unit (CPU) or other form of processing unit having data processing and/or instruction execution capabilities, and may control other components in the electronic device 10 to perform desired functions.

Memory 12 may include one or more computer program products that may include various forms of computer-readable storage media, such as volatile memory and/or non-volatile memory. The volatile memory may include, for example, random Access Memory (RAM) and/or cache memory (cache), and the like. The non-volatile memory may include, for example, read Only Memory (ROM), hard disk, flash memory, and the like. One or more computer program instructions may be stored on the computer readable storage medium that can be executed by the processor 11 to implement a time-oriented distributed archive management method and/or other desired functions of the various embodiments of the present application described above.

In one example, the electronic device 10 may also include an input device 13 and an output device 14, which are interconnected by a bus system and/or other form of connection mechanism (not shown).

For example, the input device 13 may be a keyboard, a mouse, or the like.

The output device 14 can output various information to the outside, including outputting the result of a time-oriented distributed archive management method, etc. The output means 14 may comprise, for example, a display, speakers, a printer, and a communication network and remote output devices connected thereto, etc.

According to another aspect of the present application, there is also provided a computer readable storage medium having stored thereon computer program instructions which, when executed by a computing device, are operable to perform a time-oriented distributed archive management method as described above.

The present invention provides a time-oriented distributed archive management method, and the method and the way for implementing the technical scheme are numerous, the above is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, several improvements and modifications can be made without departing from the principles of the present invention, and these improvements and modifications should also be regarded as the protection scope of the present invention. The components not explicitly described in this embodiment can be implemented by using the prior art.

Claims

1. A method for time-oriented distributed archive management, comprising: a classification transfer system is established, and the classification transfer system comprises a class transfer module, a block parallel module, a global distribution center and a pre-questioning module;

the block parallel module is used for storing and recording files of users and performing management service of the files, and comprises N file strips and a memory strip, wherein the file strips are block chains used for recording files required to be recorded by temporary users, and the memory strip is a universal identifier used for recording all atomic events and a block chain of nouns represented by the atomic events corresponding to the universal identifier; n is a natural number;

the pre-questioning module is used for finishing the time validity periods of the time valid atomic events contained in all valid atomic event combinations;

The pre-consulting module calculates the applicable periods of all the effective atomic event combinations so as to serve a temporary user to reserve the write files, wherein the minimum unit of time at the reserved time is the maximum value in the minimum units of asynchronous time clocks of all file strips, the applicable periods are intersections of the adjusted time effective periods of the time effective periods marked on all the time effective atomic events contained in each effective atomic event combination, the pre-consulting module counts the applicable periods of all the effective atomic event combinations, marks all the applicable periods on a time axis, the minimum unit of the time axis is the maximum value in the minimum units of the asynchronous time clocks of all the file strips, the left end point and the right end point of each applicable period are marked on a time axis, the unit of the applicable period is adjusted to be the maximum value in the minimum unit of the asynchronous time clocks of all archive bars, the starting point of the time axis is the minimum value of the starting timing points of all asynchronous time clocks, the left end point and the right end point of the applicable period marked on the time axis are collectively called as end points along the increasing direction of the time from left to right along the time axis from the left end point with the minimum value of all applicable periods, the origin of the time axis is the first end point, the time interval between every two end points is used as a partition interval, and the partition interval is used for limiting the partition interval in time The number of reserved time points which can be reserved in the represented time interval; if the partition is not an intersection of any of the pot ages, the level of the partition is marked 1, if the partition is an intersection of two pot ages, the level of the partition is marked 2, if the partition is an intersection of three pot ages, the level of the partition is marked 3, and so on, if the partition is an intersection of all pot ages, the level of the partition is marked d ₁ +1，d ₁ The number of all the pot life is a positive integer;

the class conversion module allows reservation time points from more to less to be reserved in the partition section corresponding to the partition level from low to high according to the partition level of the partition section, and the number of reserved time points can be reserved in the partition section with the partition level of 1 of the partition section is d ₁ +1, d number of reserved time points in the partition with level 2 ₁ And, similarly, the level of the divided section is d ₁ The number of reserved time points in the partition interval of +1 is 1; the number of times the user reserves the write file is limited in time, namely, the time point capable of reserving is scheduled in time, and after the reservation, the temporary user can reserve the service.

2. The method of claim 1, wherein the users in the categorization and transportation system comprise more than two resident users, more than two temporary users, and more than two general users, wherein a resident user comprises an arbitrating user;

the arbitration user is a user for detecting and setting the authority of a temporary user of the user and managing the classifying and transferring system, and is responsible for managing the memory strip for recording the atom event corpus sigma;

the resident users are users which are fixedly active on the classifying and transferring system, and the number of the resident users is determined to be N ₁ N, N ₁ N is determined by the arbitrating user as a positive integer ₁ In addition to arbitrating the value of a profile, each resident user of the user is responsible for managing a profile, as neededTemporary user service of recording files on the managed file strips;

the temporary users are users temporarily allocated in the classifying and transferring system, the temporary users have the right to record files on file bars, the common users apply to become the temporary users and change from the temporary users to the common users to be arbitrated by the global allocation center, and the number of the temporary users is 5 XN ₁ The classifying and transferring system calculates the number of the vacant temporary users in real time, namely the number of the vacant temporary users is 5 XN ₁ Subtracting the number of temporary users currently in the classification and transportation system;

setting an atomic event corpus sigma in the classifying and transporting system, wherein the atomic event corpus sigma is a set containing all atomic events, the atomic events are universal identifiers expressed by all involved nouns in the classifying and transporting system, users in the classifying and transporting system can supplement the atomic event corpus sigma, and after the users in the classifying and transporting system inquire about memory bars, the nouns required to be used are found not to be expressed in the atomic event corpus sigma, and the atomic event corpus sigma is supplemented; the process of supplementing the atom event corpus sigma is that the universal identifier which is not used in the atom event corpus sigma is used for representing nouns, the universal identifier which is represented by nouns is added into the atom event corpus sigma, the atom events which are supplemented into the atom event corpus sigma and nouns represented by corresponding atom events are recorded into a memory strip in the block parallel module by an arbitration user, the universal identifier which is used by the atom events of the atom event corpus sigma and nouns represented by the atom events which are corresponding to the universal identifier are broadcast to all users in the classification transportation system at regular time, and the users in the classification transportation system can inquire the universal identifier which is used by the atom events and nouns represented by the universal identifier in the memory strip;

all resident users start to operate in the classifying and transferring system, and the valid word set E is updated in advance every time length epsilon _Σ Valid word set E _Σ The set of valid words E is a subset of the atomic event corpus Sigma _Σ The method comprises the steps of representing the tags of all the archives as universal identifiers, representing the tags of the archives as the necessary containing nouns of the archives recorded on each archives set by a resident user, representing the tags of the archives as universal identifiers, checking whether the tags of the archives are already recorded on a memory strip, if not, recording the tags and the universal identifiers representing the tags on the memory strip, if the archives do not contain the tags of the archives, the archives cannot be recorded on the archives corresponding to the tags, and the tags of each archives must be distinguished from the tags of other archives, each archives is set with the tags, and the tags of each archives are different, and the tags of all the archives are represented as universal identifiers and put into a valid word set E _Σ The method comprises the steps of carrying out a first treatment on the surface of the The length of time epsilon is determined by the arbitrating user in microseconds;

when the valid word set E is updated each time _Σ Arbitrating users to re-group valid words E _Σ Dividing into five sub-valid word sets, wherein the five sub-valid word sets are valid word set E _Σ Is respectively a first equivalent effective word set, a second equivalent effective word set, a third equivalent effective word setCombining the fourth equivalent effective word set and the fifth equivalent effective word set, wherein the dividing basis is that the number of files stored in the last time length epsilon according to the file strip corresponding to the label is more or less, and the sub effective word sets are used for storing the divided effective word sets E _Σ The ratio of the number of the stored files to the number of the files recorded in all file strips is more than or equal to

the universal identifiers of the labels corresponding to each archive bar are judged according to the sequence of the first equivalent effective word set, the second equivalent effective word set, the third equivalent effective word set, the fourth equivalent effective word set and the fifth equivalent effective word set, once the universal identifier of the label corresponding to each archive bar is put into one sub-effective word set, the universal identifier of the label corresponding to each archive bar is not put into other sub-effective word sets, and when the universal identifiers of the label corresponding to all archive bars are put into the sub-effective word sets, the division is stopped, and the five sub-effective word sets can be empty sets.

3. The method according to claim 2, wherein the global distribution center is configured to set a check condition for whether the ordinary user is given authority to be a temporary user, and perform authority detection, and specifically includes: the global distribution center sets a pair of authority inlets and authority outlets as checking conditions, wherein the checking conditions are used for checking whether to give the authority of the common user and cancel the authority of the temporary user, the authority inlets are used for measuring whether the common user can obtain the authority which becomes the temporary user, and the authority outlets are used for measuring whether to cancel the authority of the temporary user of the common user after the common user becomes the temporary user;

The authority is imported as

The export of the authority is

Inlet representation of rights

And (d=t (e _in ∈E _Σ ) All are true, and the import of the rights satisfies the condition; inverted V-shaped means both ends of which are connectedEstablishment;

wherein ,

representing the input time variable +.>

The value range of (2) is>

And->

Between, function->

Representing the time variable +.>

Direct assignment generates the input time variable +.>

Time on the total clock, t represents time on the total clock; />

Representing the generation of the input time variable +.>

Time taken on the total clock plus time delay epsilon _t Is of the value epsilon _t And epsilon both represent the length of time epsilon _t The units of ε are kept consistent with the time units of the total clock, are microseconds, andthe length of time represented by ε is at least 5 ∈ _t ；ε _t The value of epsilon is determined by the arbitrating user; d is a Boolean variable that is equal to true; f represents a function of time taken on the total clock; output event e _out An act of ending the temporary user right; function of

Representing the variable +.>

Time on the total clock is taken as a function +.>

Is a value of (2);

Input time variable +.>

And as input time variable

Assignment, generating the input time variable +.>

At the same time produce a function->

The value of (2), i.e. in generating the input time variable +.>

Time assignment of time to->

The ordinary user first sends an input time variable +.>

Whether or not the value of (2) satisfies the condition in

The value of (2) and->

Between the values of (1), i.e. detect->

Whether or not to establish; if the input time variable sent at the time of application +.>

The value of (2) satisfies- >

The value of (2) and->

step a2, arbitrating user detection d=t (e _in ∈E _Σ ) Whether or not it is true, T (e _in ∈E _Σ ) Representing judgment e _in ∈E _Σ Whether or not it is true, i.e. judge the input event e _in Whether or not it belongs to the valid word set E _Σ When e _in In the case of atomic events, the judgment result can be directly given, if the event is inputPiece e _in Is included in the valid word set E _Σ In the first valid word set, T (e _in ∈E _Σ ) Is true, and d=t (e _in ∈E _Σ ) If it is true, if event e is input _in Not included in the set of valid words E _Σ In the first valid word set, T (e _in ∈E _Σ ) Is false, and determines that d=t (e _in ∈E _Σ ) Not true; if f (e) _in ) The value of (2) is within the first time length epsilon after the running of the total clock, the user is not allowed to send an input event e _in Is a composite event;

arbitrating user input event e _in Representative sentences are searched and event e is input _in All nouns contained in the representative sentence are extracted, and if the extracted nouns can be queried in the memory bar, namely the extracted nouns are already represented by using the universal identifier in the atom event corpus sigma, the universal identifier expressed by the extracted nouns in the atom event corpus sigma is directly used as the input event e _in Atomic events expressed as extracted nouns, ifThe extracted nouns are not represented by the universal identifier in the atomic event corpus sigma, and the common user uses the universal identifier to represent the extracted nouns as an input event e _in The extracted nouns are expressed as atomic events and are supplemented into an atomic event corpus sigma, the process of supplementing the atomic event corpus sigma is completed, and a common user inputs an event e _in The atomic events expressed by the extracted nouns are ordered in descending order of importance to form an atomic event sequence, namely, the input event e _in The method comprises the steps that extracted nouns are expressed as universal identifiers and are placed in a sequence ordered by a common user to form an atomic event sequence, the global distribution center sequentially extracts atomic events in the atomic event sequence into a bi-directional pointer comparison area for comparison according to the sequence ordered in the atomic event sequence, the number of the extracted atomic events is sequentially increased each time, one atomic event is extracted from the atomic event sequence for the first time, two atomic events are extracted from the atomic event sequence for the second time, the r-th time is used for extracting r atomic events from the atomic event sequence, the r value is a natural number, the maximum number of times of extraction from the atomic event sequence is indicated, each atomic event can be extracted only once, and if all the atomic events contained in the atomic event sequence are already extracted, the extraction is stopped;

the global distribution center establishes a double-head pointer which is a pointer comprising two pointer headsOne pointer head points to one small storage area in the coded storage area, the pointer head points to one small storage area each time the comparison is carried out, and after the comparison is finished, points to one small storage area which is larger than the number of the small storage area currently pointed to, and the other pointer head points to a bidirectional pointer comparison area, when the atomic event extracted for the first time is equal to one universal identifier in the universal identifiers represented by the labels contained in the small storage area with the number of 1, immediately finishing the comparison, setting T (e) _in ∈E _Σ ) If the result of (a) is true, atomic events in the bi-directional pointer comparison region are removed, otherwise the comparison is continued, and when all atomic events extracted a second time are equal to two of the universal identifiers represented by the tags in the small memory region numbered 2, the comparison is immediately ended, setting T (e _in ∈E _Σ ) If only one of the atomic events extracted for the second time is equal to one of the universal identifiers represented by the tags in the small memory area numbered 2, removing the atomic event in the bi-directional pointer comparison area for which the comparison result is equal, and continuing the next comparison, if more than two of the atomic events extracted for the third time are equal to the universal identifier represented by the tag in the small memory area numbered 3, setting T (e _in ∈E _Σ ) If more than one atomic event of the third extracted atomic event is equal to the universal identifier represented by the tag in the small memory area numbered 3, continuing the comparison; if none of the atomic events of the second extraction is equal to one of the universal identifiers represented by the tags in the small memory area numbered 2, then the atomic event of the third extraction is all equal to the universal identifier represented by the tag in the small memory area numbered 3, then T (e _in ∈E _Σ ) Is true, and comparing until a small memory area number 5 is compared; once T (e) is set _in ∈E _Σ ) As a result of true, removing atomic events in the bi-directional pointer comparison field; during extraction, skipping the extraction and comparison of the sub-active sets of the empty set until all the sub-active sets are extracted and compared; in the comparison, the slave bi-directional pointer will be small in comparison areaAtomic event removal with equal universal identifier represented by the tag in the storage area; if the atomic events in the atomic event sequence are not extracted enough during extraction, allowing a user to select the atomic events to supplement the extracted atomic events in a bi-directional pointer comparison area to participate in comparison with the universal identifier represented by the tag of the small storage area again, wherein each atomic event participates in the comparison at most twice, and when the comparison cannot be performed, stopping the comparison; in the above comparison, if more than half of the single-extracted atomic events are equal to the common identifier indicated by the tag in the small memory area, or if more than half of the single-extracted atomic events are equal to the common identifier indicated by the tag in the small memory area, and more than one third of the single-extracted atomic events are equal to the common identifier indicated by the tag in the small memory area, T (e _in ∈E _Σ ) The result of (2) is true;

d＝T(e _in ∈E _Σ ) Representation T (e) _in ∈E _Σ ) Is true when the result of (a) is equal to the variable d, which is a constant true boolean variable, T (e _in ∈E _Σ ) The result of (a) is true, the value of variable d is equal to T (e _in ∈E _Σ ) Is equal, d=t (e _in ∈E _Σ ) Establishment; if an input event e provided by a common user _in For an atomic event, directly sending a universal identifier represented by the atomic event to an arbitration user; variable d is assigned in advance for verification of T (e _in ∈E _Σ ) Whether or not a boolean variable is established; when the above-described determination process is passed, d=t (e _in ∈E _Σ ) The method comprises the steps that (1) the right of a temporary user of a common user granted with an application is refused;

when d=t (e _in ∈E _Σ ) After being established, the global distribution center checks whether the number of the current temporary users reaches 5 XN ₁ If the number of the spare temporary users is greater than or equal to one, locking the seat of one temporary user, subtracting one from the current number of the spare temporary users, giving the applied ordinary user permission to become the temporary user when the total clock reaches the value of the input time variable set by the ordinary user, and if the current number is not greater than the firstThe number of temporary users reaches 5 XN ₁ Detecting whether there is an output time variable with a value less than or equal to the input time variable transmitted by the applying ordinary user in the event memory area, deleting the output time variable less than or equal to the input time variable transmitted by the ordinary user from the event memory area if there is only one output time variable with a value less than or equal to the input time variable transmitted by the applying ordinary user in the event memory area, and subtracting one from the number of spare temporary users when the total clock reaches the ordinary user to set the input time variable

Giving the applied ordinary users the authority of temporary users, and adding one to the number of temporary users; if the time variable stored in the event memory area is equal to or less than the normal user input time variable +.>

Giving the applied ordinary users the authority of temporary users, and adding one to the number of temporary users; and when the ordinary user refuses the right to grant the temporary user because the condition of the import of the right is not satisfied, the refused ordinary user is not allowed to reapply the temporary user for the epsilon time length from the time of refusing the right to grant the temporary user.

4. A method according to claim 3, wherein the global distribution center is responsible for detecting the condition of the outlet of temporary user rights

Representing an output event e _out Produce or->

And at the same time is the output time variable +.>

Assignment, taking the generate output time variable +.>

The time value at time is assigned to +.>

Output time variable transmitted by temporary user +.>

Whether the time value of (2) is greater than or equal to +.>

After the value condition of the output time variable is met, the global distribution center transmits the output time variable +.>

Placed within an event store;

if the time variable is output

Is always stored in the event memory area, and runs to output time variable in the total clock>

The value of (2) has not been deleted before when the total clock is running to the output time variable +.>

When the value of (2) is the output time variable +. >

Output time variable representing temporary user transmission

The time value of (2) is greater than or equal to +.>

Function->

Representing the variable +.>

Time on the total clock is taken as a function +.>

Value of->

Representing the output time variable +.>

5. The method of claim 4, wherein the block parallel module comprises N stripes and a memory stripe, wherein each stripe comprises more than two consecutive blocks, each stripe has an asynchronous time clock, i.e., each asynchronous time clock corresponds to a stripe for clocking the corresponding stripe, and each stripe is identical The same time in the step time clock can only record one block in the file strips corresponding to the asynchronous time clock, and for the classifying and transferring system, more than two file strips at the same time of the total clock are allowed to be recorded at the same time, and the same file strip can only be recorded in one block; n is a natural number, determined by the arbitration user; except for the memory strips, each file strip is maintained by a resident user, condition constraint and label are set for each file strip, the labels are broadcast to all temporary users, the labels of each file strip are different, the labels are modified from each epsilon time length, the time is counted when the classification transfer system starts running, and the time of epsilon time length is counted on a total clock; the condition constraint is invisible to all temporary users, the condition constraint set by the archive recorded by the temporary users can be recorded in the archive bar, namely the condition constraint is used for limiting whether the archive can be recorded on the archive bar corresponding to the condition constraint, the condition constraint comprises satisfaction constraint and isolation constraint, the condition constraint is met only if the satisfaction constraint and the isolation constraint are met, wherein the satisfaction constraint is described as the connection of a time effective atomic event and a symbol, and the symbol of the satisfaction constraint comprises

Delta, ignoring the time validity period marked on the time valid atomic event, and ++>

The isolated constraint of each archive bar contains atomic events which are not allowed to be contained in the archive recorded in the archive bar, and nouns represented by one atomic event in the isolated constraint contained in the archive cannot be recorded on the archive bar corresponding to the isolated constraint.

6. The method of claim 5, wherein the block parallelization module establishes a block valid event set, which is formed by supplementing each resident user with a universal identifier expressed by nouns contained in record files in all file strips, thereby forming a block valid event set as an atomic event, the block valid event set including valid word set E _Σ Meanwhile, the block effective event set is a subset of the atomic event complete set sigma; the resident user of the archive bar ignores the time validity period marked on the time valid atomic event in the satisfaction constraint, each atomic event in the valid word set must be contained in one satisfaction constraint, and sets that the time validity period marked on all the time valid atomic events must cover the period of the asynchronous time clock work of all archive bars, namely, each time point from the start of the running of the block parallel module to the stop of the running of the block parallel module must be contained in the time validity period of one time valid atomic event, and the atomic event set contained in each isolation constraint must be different;

When the temporary user needs to record on a file bar, the temporary user selects the file bar to record files according to the labels, any transaction is sent to a resident user managing the file bar corresponding to the labels, no content is needed to be recorded in the transaction, the resident user receives the transaction, the time of receiving the transaction is taken as the time of receiving the transaction by the user on an asynchronous time clock of the file bar, the resident user sends files needing to be recorded to the resident user managing the file bar, the resident user firstly extracts nouns in the files recorded by the temporary user, checks whether the nouns are expressed as universal identifiers in a memory bar, extracts atomic events expressed as universal identifiers if the extracted nouns are expressed as universal identifiers, supplements the atomic event total set sigma of atomic events if the extracted nouns are not expressed as universal identifiers, records the atomic events into the memory bar, judges whether the extracted nouns are coincident with the atomic events contained in the isolation constraint set by the selected file bar or not, if the coincidence is present, directly refuses to record the temporary user, and checks whether the coincidence is satisfied by the atomic events contained in the block of the atomic event total set in the file bar if the coincidence is not satisfied with the constraint set in the effective time clock set in the file bar; the block parallel module takes the time after the detection of the isolation constraint as average delay epsilon 1 on the asynchronous clock on the selected record file strip;

And symbol->

The first time-efficient atomic event from left to right contained in the subforms of the satisfied constraint description in brackets to the right of the connection is numbered +.>

The resident user is able to modify the satisfaction constraint of the profile of the setup management, which must satisfy two conditions, the first one: the satisfaction constraint must contain a tag for the managed archive stripe, the second condition: any time after the archive bar begins recording, all atomic events that must be included in the satisfied constraints of the current archive bar setting are combined with the active atomic events within the original noted time validity period.

7. The method of claim 6, wherein the categorization module is configured to check whether the user is given the right to record the profile in the categorization and transportation system for the temporary user, comprising: the class conversion module compares all time effective atomic events in the extracted useful time effective atomic event set with all effective atomic event combinations one by one, if the extracted useful time effective atomic event set contains all time effective atomic events in the effective atomic event combination except for empty time effective atomic events, the intersection of time effective periods marked on all time effective atomic events in each contained effective atomic event combination is obtained and used as an intersection, if the constraint detection interval has intersection with any intersection, the right recorded on a file bar corresponding to satisfied satisfaction constraint is given to a temporary user, and if the constraint detection interval does not have intersection with any intersection, the right recorded on the file bar corresponding to satisfied satisfaction constraint by the temporary user is refused; if the set of useful time-effective atomic events contains all time-effective atomic events in the combination of more than one effective atomic event, and the constraint detection interval has intersections with more than one intersection interval, multiple Reservation of a temporary user for recording a file on a file strip at a time, and setting of all direct use symbols

The time validity period of the connected time validity atomic event label is kept consistent; neglecting empty time effective atomic events in the comparison performed by the class conversion module, namely, not participating in the comparison, and only comparing whether other time effective atomic events meet the condition; and, the time validity period of the time valid atomic events contained in all valid atomic event combinations is also used to temporally limit the number of times the temporary user subscribes to the write profile.

8. The method of claim 7, wherein the resident user receives a reservation service for the temporary users, the reservation service being responsible for writing a profile on a profile for a temporary user reservation time, providing each temporary user with three reservation rights, the temporary user selecting a profile for reservation of a write profile based on the tag, the reservation being only opened for a reservation time period, the reservation time period being a time period taken by a total clock in the categorization and transfer system in microseconds, no modification being allowed to satisfy a constraint during the reservation time period; designating, by a management user, a length of the reserved period and a specific value of the reserved period; the temporary user sends the file to be recorded for reservation, the resident user receives the file to be recorded for reservation, and invokes the local timestamp function J (t _b ) First, t is _b To obtain a local time stamp function J (t) _b ) At t _b When the value of =0, the local timestamp function J (t _b ) At t _b Values at=0; the resident user removes the time validity period marked on the time valid atomic event contained in the block valid event set, changes the time validity period into atomic event extraction, and the extracted atomic event forms the block valid atomic event set, and the resident user needs to search the reservation of the temporary user when the resident user searches the reservationNouns contained in the recorded files are expressed as atomic events and combined into an atomic event set, intersections are obtained with the block effective atomic event set, the obtained intersections are used as the searched atomic event set, and the time effective period and the empty time effective atomic event are ignored during searching; then, searching the effective atomic event combination satisfied by the searched atomic event set, namely, the searched atomic event set contains all time effective atomic events in one effective atomic event combination, and if the contained effective atomic event is the satisfied effective atomic event combination, notifying the temporary user of the intersection of the time validity periods marked on all time effective atomic events in all satisfied effective atomic event combinations, and providing the reserved value t by the temporary user _b The value on the file label of the temporary user must be smaller than the value of the left end point of the intersection of the time validity periods of all the time valid atomic events in the satisfied valid atomic event combination; and t _b >0, find the local timestamp function J (t _b ) Will find the local timestamp function J (t _b ) The obtained value is compared with the value stored in the time usage space, if the local timestamp function J (t _b ) The resulting value is equal to the value stored in the time usage space or the local timestamp function J (t _b ) The obtained value plus the sum of the time of the first file recorded on the reserved file strip and the number of reserved time points in the partition interval are completely used up, and the temporary user is notified to modify t _b Is modified by the temporary user to provide the reserved value t again _b Is three times, if the temporary user modification is not notified, the local timestamp function J (t _b ) The resulting values are put into the time usage space and the local timestamp function J (t _b ) The obtained value and the file to be recorded during reservation are written into the intelligent contract, and the contents of the intelligent contract are as follows: asynchronous local clock of the temporary user reserved archive bar goes to step the local timestamp function J (t _b ) The obtained value automatically writes the file to be recorded in reservation into the file bar reserved by the temporary user, and thenThen, a local time stamp function J (t _b ) The sum of the obtained value plus the time of the first file recorded on the reserved file strip and the time point at which the reserved reservation can be reserved in the partition is reduced by one, if the local time stamp function J (t _b ) The sum of the obtained value plus the time of the first archive recorded on the reserved archive strip is not in any partition, the reserved service cannot be provided, and the condition constraint is modified by the resident user or the t is modified by the temporary user _b After the value of (2), it is checked whether the reservation service can be provided.

9. The method according to claim 8, wherein the local timestamp function J (t _b ) To take a function of time over the asynchronous time clock of each archive bar, J (t _b ) Is defined as follows:

where b is the time stamp of the local timestamp function J (t _b ) The number of the file strips is increased according to the time ascending sequence of the first file recorded in each file strip, the number is a positive integer, and the value of b is less than or equal to N; t is t _b For a time length, the time unit of the non-local clock of the archive bar with the unit of b is provided by a temporary user when reserving, and the reservation value is used for distinguishing that when taking time on the non-synchronous clock of the archive bar with the unit of b, the local timestamp function J (t _b ) The time of the time is also the current call to the local timestamp function J (t _b ) Time at t _b =0, take the current call local timestamp function J (t _b ) Time at t _b >0, fetch the current call local timestamp function J (t _b ) A later time; at the same time t _b >0，t _b Reserving time and q of recording file for user on asynchronous time clock of file bar numbered b _b The difference in time between t _b Keep one with the unit of asynchronous time clock of the file bar numbered bCausing; q _b Is a point in time equal to the time when the local timestamp function J (t _b ) When the time taken on the asynchronous time clock of the archive bar numbered b, i.e. the local timestamp function J (t) _b ) The value of the time at that time is taken as the time point q _b Is a value of (2); the local timestamp function J (t _b ) At t _b Equal to time point q when=0 _b At t _b >0 is equal to time q _b The value of (2) plus t _b A sum of values obtained from (a); and sets a local timestamp function J (t _b ) The value of greater than or equal to the call local timestamp function J (t _b ) Takes the value of time on an asynchronous time clock and sets each time the local timestamp function J (t _b ) The obtained function values are different, when t _b =0, call the local timestamp function J (t _b ) When the function is executed, the local time stamp function J (t _b ) The value of the function, when t _b >0 will call the local timestamp function J (t _b ) The value of the function is recorded in a time use space, and each archive strip has a time use space, wherein the time use space is a storage space for storing a time point reserved by a temporary user when the archive is recorded on the archive strip with the number b, and the reserved time point is time taken from an asynchronous time clock of the reserved archive strip.