CN111831757A - Method and device for generating and managing distributed global unique identification information - Google Patents
Method and device for generating and managing distributed global unique identification information Download PDFInfo
- Publication number
- CN111831757A CN111831757A CN202010517683.3A CN202010517683A CN111831757A CN 111831757 A CN111831757 A CN 111831757A CN 202010517683 A CN202010517683 A CN 202010517683A CN 111831757 A CN111831757 A CN 111831757A
- Authority
- CN
- China
- Prior art keywords
- machine code
- unique identification
- identification information
- application process
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/2308—Concurrency control
- G06F16/2336—Pessimistic concurrency control approaches, e.g. locking or multiple versions without time stamps
- G06F16/2343—Locking methods, e.g. distributed locking or locking implementation details
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Stored Programmes (AREA)
Abstract
The application discloses a method and a device for generating distributed global unique identification information, a method and a device for managing the distributed global unique identification information, a computer storage medium and electronic equipment, wherein the generation method comprises the following steps: acquiring starting information of an application process; locking the machine code describing that the machine code using state is idle in a relational database according to the starting information of the application process; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes; and generating global unique identification information according to the locked machine code. And on the premise of ensuring the uniqueness of the machine code and the uniqueness of the generated distributed global unique identification information, the working efficiency of generating the distributed global unique identification information can be effectively improved.
Description
Technical Field
The application relates to the technical field of computers, in particular to a method and a device for generating distributed global unique identification information and a method and a device for managing the distributed global unique identification information. The application also relates to a computer storage medium and an electronic device.
Background
In internet applications, a database table usually occupies a large physical storage space, and in order to solve the problem, a database fragmentation technology is adopted. The database fragmentation technology is to split a database table and connect the split tables through a database middleware. Each data or message in the split table needs one Id for identification, however, if an Id auto-increment strategy is adopted for each split table, repeated ids may be generated, and a globally unique Id may be generated by using a distributed Id generation strategy, so as to uniquely identify a large amount of data and messages in a complex distributed system. For example, in a financial, e-commerce, payment, etc. product system, data is growing, a sub-table after splitting a data sub-database needs to have a global unique Id to identify each data or message, and the self-increment Id of the data sub-database obviously cannot meet the requirement.
In the prior art, more generation algorithms are provided for generation of the globally unique Id to overcome the disadvantage of self-increment Id, however, in the generation process of the globally unique Id, special attention needs to be paid to uniqueness of a machine code. The prior art relates to two-sided considerations when guaranteeing the requirement of machine code (workid) uniqueness in globally unique ids:
firstly, usually, an operation and maintenance person is required to store a unique machine code (workid) in a globally unique Id corresponding to each virtual process in a distributed system in a text file in advance, and package and deploy the unique machine code along with a package file, and then upload the unique machine code (workid) to a corresponding directory of a cloud service end, custom parameters are required to be added in a start script of the virtual process so as to obtain the workid from the text file for use, and obviously, the effect of the method necessarily depends on the development capability of the operation and maintenance person.
Secondly, the deployment mode of the machine code needs to support that when each service node is newly added, a unique machine code number which can be used maximally and does not exceed the storage capacity of the machine code is automatically generated, and each generated machine code number needs to be recorded and maintained for each deployment, so that the number is successfully recovered when the service node is released. This obviously lets the deployment system of machine code additionally embed unnecessary function to lead to the fortune dimension can't be absorbed in and focus on guaranteeing essential work such as high availability, elastic expansion, make the work rate inefficiency reduce.
Disclosure of Invention
The application provides a method for generating distributed global unique identification information, which aims to solve the problem that the working efficiency of a distributed system in the prior art is reduced.
The application provides a method for generating distributed global unique identification information, which comprises the following steps:
acquiring starting information of an application process;
locking the machine code describing that the machine code using state is idle in a relational database according to the starting information of the application process; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes;
and generating global unique identification information according to the locked machine code.
In some embodiments, the locking the machine code in the relational database, the machine code describing that the machine code usage state is idle according to the startup information of the application process, includes:
inquiring service information with a machine code use state field value of 1 in the relational database according to the starting information of the application process; wherein, the idle state is represented when the use state is 1, and the occupation state is represented when the use state is 2;
and locking the machine code and the corresponding related service information with the use state field value of 1.
In some embodiments, said generating distributed globally unique identification information from said machine code that is locked comprises:
modifying the use state of the locked machine code from idle to occupied;
according to the modification of the use state, modifying the related service information describing the machine code in the relational database;
submitting transaction information which generates distributed global unique identification information according to the modified machine code;
and generating distributed global unique identification information according to the machine code in the transaction information.
In some embodiments, said generating distributed globally unique identification information from said machine code in said transaction information comprises:
determining the machine code which is successfully occupied according to the transaction information;
storing the machine code locally;
and generating distributed global unique identification information through a generation algorithm based on the locally stored machine code.
In some embodiments, the obtaining the start information of the application process includes:
and acquiring the starting information of the application process when the management object class in the software tool development kit is instantiated.
In some embodiments, the obtaining the start-up information of the application process when the management object class in the software tool development kit is instantiated includes:
determining a management class which needs to be instantiated into a management object in the software tool development kit by a container starting annotation mode;
and acquiring the starting information of the application process when the determined management class is instantiated.
The present application further provides a device for generating distributed globally unique identification information, including:
the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring starting information of an application process;
the locking unit is used for locking the machine codes describing that the machine code using state is idle in the relational database according to the starting information of the application process; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing relevant information of service states of the machine codes;
and the generating unit is used for generating the global unique identification information according to the locked machine code.
The application also provides a management method of the distributed global unique identification information, which comprises the following steps:
determining whether the current service state of the application process is normally closed;
if the machine code is determined to be normally closed, acquiring the occupied machine code in the application process;
releasing the machine code from a relational database; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes.
In some embodiments, the determining whether the current service state of the application process is normally closed includes:
when the current service state of the application process is triggered by closing a hook, determining that the current service state is normally closed; wherein the closing hook is a method provided by a software toolkit and used for calling when the application process is closed.
In some embodiments, the obtaining the occupied machine code in the application process if the current service state is normally closed includes:
and when the service state is closed, determining the machine code occupied in the application process through the locally stored machine code information.
In some embodiments, said releasing said machine code from said relational database comprises:
inquiring the machine code matched with the machine code and the occupation state of the machine code in the relational database;
and modifying the service using state of the inquired machine code from an occupied state to an idle state.
In some embodiments, further comprising:
and updating the service closing time of the inquired machine code into the modification time for modifying the service using state from the occupied state to the idle state.
In some embodiments, further comprising:
if the abnormal closing is determined, reading the machine code of which the use state is occupied in the relational database;
determining whether the process of the application process exists or not according to the machine code;
and if the process does not exist, releasing the machine code from the relational database.
In some embodiments, the determining whether the current service state of the application process is normally closed includes:
when the current service state of the application process is not triggered by a closing hook, determining that the current service state is abnormally closed; wherein the closing hook is a method provided by a software toolkit and used for calling when the application process is closed.
In some embodiments, the reading the machine code in the relational database that is used as occupied if the abnormal shutdown is determined to be performed includes:
and when the current service state of the application process is determined to be abnormally closed, reading the machine code which is occupied by the use state in the relational database through the detection script.
In some embodiments, when the current service state of the application process is determined to be abnormally closed, reading machine code in the relational database, the machine code being occupied by using the state, by a detection script, includes:
and when the current service state of the application process is determined to be abnormally closed, starting the detection script to read the machine code which is occupied in the use state in the relational database through the set detection time.
In some embodiments, said determining from said machine code whether a process of said application process exists comprises:
and detecting whether the process of the application process exists according to the machine code, the process number information of the application process occupying the machine code on the operating system corresponding to the machine code in the relational database and the IP address information of the server where the process occupying the machine code is located, or according to the machine code, the IP address information of the server where the process occupying the machine code is located and the port number information of the operating system occupied by the application process occupying the machine code.
The present application further provides a management apparatus for distributed globally unique identification information, including:
the determining unit is used for determining whether the current service state of the application process is normally closed;
the acquisition unit is used for acquiring the occupied machine code in the application process according to the condition that the application process is determined to be normally closed in the determination unit;
the release unit is used for releasing the machine code acquired by the acquisition unit from a relational database; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes.
The application also provides a computer storage medium for storing the data generated by the network platform and a program for processing the data generated by the network platform;
when the program is read and executed, the following steps are executed:
acquiring starting information of an application process;
locking the machine code describing that the machine code using state is idle in a relational database according to the starting information of the application process; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes;
generating global unique identification information according to the locked machine code;
or;
determining whether the current service state of the application process is normally closed;
if the machine code is determined to be normally closed, acquiring the occupied machine code in the application process;
releasing the machine code from a relational database; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes.
The present application further provides an electronic device, comprising:
a processor;
a memory for storing a program for processing network platform generated data, said program when read and executed by said processor performing the steps of:
acquiring starting information of an application process;
locking the machine code describing that the machine code using state is idle in a relational database according to the starting information of the application process; the database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes;
generating global unique identification information according to the locked machine code;
or;
determining whether the current service state of the application process is normally closed;
if the machine code is determined to be normally closed, acquiring the occupied machine code in the application process;
releasing the machine code from a relational database; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing relevant information of service states of the machine codes.
Compared with the prior art, the method has the following advantages:
according to the method for generating the distributed global unique identification information, the machine code describing the machine code using state as idle in the relational database is locked according to the acquired starting information of the application process; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes; and generating global unique identification information according to the locked machine code. The machine code is pre-stored in the relational database, so that the acquisition of the machine code in the generation process of the distributed global unique identification information does not depend on the technical capability of operation and maintenance development any more, the required machine code can be obtained only through the relational database, the description of the service state related service information of each machine code is included in the relational database, and the working efficiency of generating the distributed global unique identification information can be effectively improved on the premise of ensuring the uniqueness of the machine code and the uniqueness of generating the distributed global unique identification information.
According to the management method of the distributed global unique identification information, the machine codes can be released from the relational database aiming at normal closing and abnormal closing through determining the closing form of the current service state of the application process, so that convenience is brought to the subsequent generation of the distributed global unique identification information, the management of the distributed global unique identification information is more convenient and fast integrally, a great deal of effort is not required to be invested to process the acquisition of the machine codes of newly-added nodes, and the maintenance and management work of a great deal of operation and maintenance development aiming at the distributed global unique identification information is reduced.
Drawings
Fig. 1 is a flowchart of an embodiment of a method for generating distributed globally unique identification information provided in the present application;
fig. 2 is a schematic structural diagram of an embodiment of a distributed globally unique identification information generation apparatus provided in the present application;
fig. 3 is a flowchart of an embodiment of a method for managing distributed globally unique identification information according to the present application;
fig. 4 is a schematic structural diagram of an embodiment of a management apparatus for distributed globally unique identification information provided in the present application.
Detailed Description
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present application. This application is capable of implementation in many different ways than those herein set forth and of similar import by those skilled in the art without departing from the spirit of this application and is therefore not limited to the specific implementations disclosed below.
The terminology used in the description herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. The description used in this application and in the appended claims is for example: the terms "a," "an," "first," and "second," etc., are not intended to be limiting in number or order, but rather are used to distinguish one type of information from another.
As will be understood in the background section, the distributed globally unique identification information (alternatively referred to as a distributed globally unique Id) is used to distinguish one piece of information that does not use data or messages, and thus the basic requirement is that global uniqueness, i.e., no duplicate ids can occur. Existing globally unique ids for distributed applications include several algorithms: a uuid (universal uniqueidentifier), a database incremental Id mechanism, third-party software generation (Redis), a SnowFlake algorithm, and the like.
The snowfall SnowFlake algorithm is an algorithm designed by Twitter that can generate unique ids in a distributed system, and can satisfy the requirement of allocation of tens of thousands of message ids per second by Twitter, wherein the message ids are unique and have a roughly ascending order.
The Id generated by the SnowFlake algorithm is a 64-bit integer, and the structure includes 4 parts, specifically as follows (each part is separated by a "-" symbol):
0-00000000000000000000000000000000000000000-0000000000-00000000000；
a 1-bit identification part, wherein in java, the highest bit of long is a sign bit, a positive number is 0, a negative number is 1, and the generated Id is a positive number and is 0;
a 41-bit timestamp section, which is a millisecond of time, typically does not store the current timestamp, but rather the difference in timestamps (current time-fixed start time), which allows the Id generated to start at a smaller value; a 41-bit timestamp can be used for 69 years, (1L < <41)/(1000L 60 24 365) 69 years;
in the 10-bit node part, the first 5 bits are used as data center identification in the Twitter implementation, the second 5 bits are used as machine identification, which is collectively called as workerId, and 1024 nodes can be deployed;
a 12-bit sequence number part supports that 4096 Ids can be generated by the same node in the same millisecond;
the Id generated by the SnowFlake algorithm is approximately increased according to time, when the Id is used in a distributed system, when data identification is not needed, a 10-bit machine identifier (workerId, also called a machine code) needs to be unique, and thus the Id generated by each node can be ensured to be unique. The visible machine identification (workid) is only one of the core points in the snowflow algorithm that guarantees global uniqueness.
In order to ensure uniqueness of machine codes, in the prior art, the machine codes are usually stored in a text file in advance, and are packaged and deployed together with a package file, then the machine codes (workid) are obtained from the text file in a predetermined manner, the obtaining manner necessarily depends on development capability of operation and maintenance developers, and in addition, when a cloud service end adds a service node, the generated machine code number cannot exceed storage capacity of the machine code, so the generated machine code number needs to be recorded and maintained every time, and therefore, an additional function of recording and maintaining the machine code number is embedded, so that the operation and maintenance additionally adds other contents irrelevant to essential work on the basis of the essential work of the operation and maintenance, and further, the efficiency of the essential work is reduced.
The technical scheme of the application provides the method for generating the distributed globally unique Id from the conception angle of additional technical problems brought by generating and maintaining the machine code, so that the uniqueness of the machine code in the distributed globally unique Id can be ensured, meanwhile, the maintenance requirement of operation and maintenance on the uniqueness of the machine code is omitted, and the working efficiency is improved.
Referring to fig. 1, fig. 1 is a flowchart of an embodiment of a method for generating a distributed globally unique Id provided in the present application, where the embodiment of the method for generating the distributed globally unique Id includes:
step S101: acquiring starting information of an application process;
the specific implementation process of the step S101 includes:
step S101-1: the method comprises the steps of obtaining starting information of an application process when a management object class in a software tool development kit (SDK) is instantiated.
For example: with the @ PostConstruct notation, subsequent steps are performed when instantiating an SDK internal bean. The annotation introduced when @ postconstract is java5 refers to the method being executed when a project is started, and may also be understood as being executed when a spring container is started, and may be used as a regular load of some data, such as a data dictionary. The Bean can be understood as a multiplexing java class, in theory any java class can be considered as a Bean, and the Bean is generally operated in a specific container and does not allow cross-process access. In this embodiment, the bean inside the SDK runs in a spring container, and instantiation of the bean by spring can be performed in various ways, for example: the method of using the parameter-free construction creation of the class, using the static factory creation, using the example factory creation, etc. is not the key point of the scheme, so the detailed description is not provided here.
Based on the above, the specific implementation process of step S101-1 may include:
step S101-11: determining a management class which needs to be instantiated into a management object in the software tool development kit by a container starting annotation mode;
step S101-12: and acquiring the starting information of the application process when the determined management class is instantiated.
Step S102: locking the machine code describing that the machine code using state is idle in a relational database according to the starting information of the application process; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes.
The purpose of step S102 is to: a free machine code (workid) is determined from the relational database. It can be seen that in the present embodiment, the machine code is stored in the relational database in the form of a data table. The specific contents in the data table may include: machine code and service information related to the machine code service status. The specific contents of the data table can be as follows:
in this embodiment, the specific implementation process of step S102 may include:
step S102-1: inquiring service information with a machine code use state field value of 1 in the relational database according to the starting information of the application process; wherein, the idle state is represented when the use state is 1, and the occupation state is represented when the use state is 2;
step S102-2: and locking the machine code and the corresponding related service information with the use state field value of 1.
Actually, when generating the distributed globally unique identification information, a unique machine code is obtained through the machine codes stored in the relational database, a large number of machine codes are stored in the data table, and relevant service information is recorded for each machine code, and then the current use state of the read machine code can be known by reading the machine code in the data table, and the machine code which is currently idle in the data table can be known by combining the content in the table, and the machine code which is idle in the use state and the service information relevant to the machine code are locked so as to be used when generating the distributed globally unique Id.
Specifically, the locking mode for the machine code whose use state is idle, that is, the value is 1, may be to change the relevant information of the machine code whose use state is 1 into a read-only form, so as to prevent other application processes from preemptively modifying the relevant information.
In this embodiment, the locking may be, for example: look up 1 record with a value of 1 in the state field in the global _ worker _ Id of the data table and lock this record, other transactions are not allowed to update this record until the lock is released.
Step S103: and generating global unique identification information according to the locked machine code.
The step S103 is to generate the global unique identification information according to the determined machine code, and the specific implementation process may include:
step S103-1: modifying the use state of the locked machine code from idle to occupied;
modifying the machine code locked in the step S102, and modifying the use state of the machine code to be occupied when the machine code is currently idle, that is, modifying the state information of the machine code corresponding to the data table from "1" to "2", specifically, according to the workerId value returned in the step S102, finding a record from the global _ worker _ Id of the data table, and updating the value of the state field to 2.
Step S103-2: and according to the modification of the use state, modifying the related service information describing the machine code in the relational database.
After the use state information of the machine code in the data table is modified according to the step S103-1, other related service information describing the machine code also needs to be modified, specifically, the finger of the p _ Id field in the data table is updated to the process Id corresponding to the current application process in the operating system, the value of the IP field is updated to the IP of the cloud server (ECS) where the current application process is located, the value of the last _ start _ time field is updated to the current time, and the value of the memo field is updated to the description of the current application process.
Step S103-3: submitting transaction information which generates distributed global unique identification information according to the modified machine code;
the Transaction information (Transaction) is a program execution logic Unit (Unit) composed of a series of operations for accessing and updating system data, and in this embodiment, successful submission of the Transaction information means successful execution of one or more operations on the database in the whole Transaction process.
It can be understood that, when based on the modification of the service information related to the machine code in step S103-2, the transaction information needs to be submitted to trigger the subsequent generation of the distributed globally unique Id according to the machine code, and therefore, in this embodiment, the submitted transaction information may be generated by an event monitoring mechanism of Spring, for example: processing the successful submission of the transaction information of the database and then executing subsequent operations by using the @ TransactionalEventLister annotation or by using a transaction synchronization manager, wherein the @ TransactionalEventLister annotation can be specifically realized by: adding an adapter, when an applicationlistenermethodsynthasalaadapter registers a synchronizer to issue a transaction through a transactionsynthon manager, registering a synchronizer to issue an event, then registering a synchronizer transactionsynthon event adapter, and after the transaction information is submitted, the transactionsynthon manager calls back the registered synchronization adapter. At this time, the transactionsyncronizationeventadapter internally calls the handed order createdEvent method to perform the subsequent operation, in which the registration information is put into threaded local, and parameters are passed through threaded local. In this embodiment, the commit transaction may be implemented directly by using the @ Transactional annotation of spring or by using the connection.
Step S103-4: and generating distributed global unique identification information according to the machine code in the transaction information.
In the step S103-4, the distributed globally unique identification information may be generated according to the machine code and the related service information in the transaction information submitted in the step S103-3, and in this embodiment, the distributed globally unique identification information may be generated by using a SnowFlake algorithm.
It should be particularly noted that, in order to increase the coverage of the machine code (workerId), the structure of the distributed globally unique identification information generated in the snowflow algorithm may be adjusted, that is:
1bit (symbol identifier bit) +41bit timestamp +12bit machine code +10bit serial number is 64 bit;
the original structure in the snowFlake algorithm is combined, and the adjustment is specifically that 2 bits in the 12-bit serial number in the original structure are moved to the original 10-bit machine code, namely the machine code is changed into 12 bits, so that the unique machine code in different virtual nodes is ensured, the coverage range can reach 4095 to the maximum extent, 4096 virtual nodes can be supported for use, and the uniqueness of the machine code is ensured under the use range.
Based on the above, in this embodiment, the specific implementation process of step S103-4 may include:
step S103-41: determining the machine code which is successfully occupied according to the transaction information;
in this embodiment, the submitted transaction information needs to be verified, and when the submitted transaction information is successful, the machine code in the transaction information can be determined to be the machine code that successfully occupies. Specifically, whether the transaction information is successfully submitted may be determined according to whether an abnormal rollback for the submitted transaction is received, and if the abnormal rollback exists, the transaction information is failed to be submitted, otherwise, the transaction information is successful.
Step S103-42: storing the machine code locally;
the purpose of the step S103-42 is to store the available machine codes determined in the data table to the local, so that the machine codes can be directly obtained from the local when the distributed globally unique identification information is subsequently generated, thereby improving the generation efficiency and reducing the maintenance work on the machine codes. The local may be a service side executing the application process function, and in this embodiment, may specifically be a memory space allocated by the operating system for the started process, that is, a JVM memory space.
Step S103-43: and generating distributed global unique identification information through a generation algorithm based on the locally stored machine code.
From the above, it can be seen that in this embodiment, the distributed globally unique Id may be generated by adopting a snowflow algorithm, where the snowflow algorithm is generated by acquiring a locally stored machine code.
The above is a detailed description of an embodiment of a method for generating distributed globally unique identification information provided by the present application, and corresponds to the foregoing embodiment of a method for generating distributed globally unique identification information, and the present application further discloses an embodiment of a device for generating distributed globally unique identification information, please refer to fig. 2, since the device embodiment is basically similar to the method embodiment, the description is relatively simple, and related points are only referred to a part of the description of the method embodiment. The device embodiments described below are merely illustrative.
As shown in fig. 2, fig. 2 is a schematic structural diagram of an embodiment of a distributed globally unique identification information generating apparatus provided in the present application; the embodiment of the generation device comprises:
an obtaining unit 201, configured to obtain start information of an application process;
the obtaining unit 201 is specifically configured to obtain the starting information of the application process when the management object class in the software tool development kit is instantiated.
The acquisition unit 201 includes: the software tool development kit comprises a determining subunit and an obtaining subunit, wherein the determining subunit is used for determining a management class which needs to be instantiated into a management object in the software tool development kit through a container starting annotation mode. The obtaining subunit is configured to obtain the starting information of the application process when the determined management class is instantiated.
A locking unit 202, configured to lock, according to the start information of the application process, a machine code in the relational database, where the machine code is described as idle in the use state; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing relevant information of service states of the machine codes;
the locking unit 202 may include: a query subunit and a lock subunit;
the query subunit is configured to query, according to the start information of the application process, service information in which a value of a machine code use state field in the relational database is 1; wherein, the idle state is represented when the use state is 1, and the occupation state is represented when the use state is 2;
the locking subunit is configured to lock the machine code and the corresponding related service information with the use state field value of 1.
A generating unit 203, configured to generate globally unique identification information according to the locked machine code;
the generating unit 203 may include: the system comprises a first modification subunit, a second modification subunit, a submission subunit and a generation subunit.
The first modification subunit is used for modifying the use state of the locked machine code from idle to occupied;
the second modification subunit is configured to modify, according to the modification of the use state, service information related to the machine code in the relational database;
the submission subunit is configured to submit the transaction information that is generated according to the modified machine code and used for generating the distributed globally unique identification information;
and the generating subunit is configured to generate the distributed globally unique identification information according to the machine code in the transaction information. The generating subunit may include: determining a subunit and a storage subunit; wherein the determining subunit is configured to determine, according to the transaction information, the machine code that successfully occupies; the storage subunit may be configured to store the machine code locally; the generating subunit is specifically configured to generate, based on the locally stored machine code, distributed globally unique identification information through a generating algorithm.
The above is a description of an embodiment of a distributed globally unique identifier generation apparatus provided in this application, and for specific contents of the generation apparatus, reference may be made to the related description of the above generation method embodiment, and details are not repeated here.
Based on the above, the present application further provides a management method for distributed globally unique identification information, please refer to fig. 3, where fig. 3 is a flowchart of an embodiment of the management method for distributed globally unique identification information provided by the present application, and the embodiment of the management method includes:
step S301: determining whether the current service state of the application process is normally closed;
the specific implementation process of step S301 may be that, when the current service state of the application process is triggered by a closing hook (Shutdownhook), it is determined to be normally closed; wherein the closing hook is a method provided by a software toolkit and used for calling when the application process is closed. Shutdown hooks are jvm (Java virtual machine: Java virtual machine) that provide the application with a secure exit mechanism to handle tasks that the application has not finished processing when it exits jvm, by which some resources can be shut down when it exits jvm, some threads that must be shut down gracefully, etc. Therefore, in step S301, it is determined whether the current service state performed by the application is normally closed, and the current service state is closed by using shutdown.
Step S302: and if the machine code is determined to be normally closed, acquiring the occupied machine code in the application process.
The specific implementation process of step S302 may include:
step S302-1: and when the service state is closed, determining the machine code occupied in the application process through the locally stored machine code information. Specifically, when the service state is off, the occupied machine code in the application process is queried through the locally stored machine code information.
Step S303: releasing the machine code from a relational database; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes.
The specific implementation process of step S303 may include:
step S303-11: inquiring the machine code matched with the machine code and the occupation state of the machine code in the relational database;
step S303-12: and modifying the service using state of the inquired machine code from an occupied state to an idle state. With reference to the content of the step S103-2, the specific implementation of the step S303-2 may be to find a record in the global _ worker _ id of the data table according to 2 conditions that the value of the workerId and the state field occupied by the current service is 2 (in occupancy), and update the value of the state field to be 1 (idle). When positioning is needed, the content used for recording last _ shutdown _ time (the last closing time of the service occupying the workerId, namely the last modification time) information in the data table can be correspondingly updated by modifying based on the use state, so that more information can be traced.
Therefore, the step S303 may further include: and updating the service closing time of the inquired machine code into the modification time for modifying the service using state from the occupied state to the idle state.
In this embodiment, when there is another case in the step S301, if the current service state of the application process is abnormally closed, the specific implementation may include:
step S301-21: if the abnormal closing is determined in the step S301, reading the machine code of which the use state is occupied in the relational database;
the determination about abnormal closing may specifically be that, when the current service state of the application process is not triggered by a closing hook (Shutdownhook), it is determined to be abnormal closing; wherein the closing hook is a method provided by a software toolkit and used for calling when the application process is closed. The specific implementation of reading may be that, when the current service state of the application process is determined to be abnormally closed, the machine code in the relational database whose usage state is occupied is read through the detection script. For example: and accessing all records with occupied workerId states in the data table through the shell script. It is understood that the application process may be a service running continuously and uninterruptedly, and therefore, the detection script may be started to detect the use state of the machine code in the relational database by setting the detection time.
Step S301-22: determining whether the process of the application process exists or not according to the machine code;
the specific implementation process of step S301-22 may be to detect whether the process of the application process exists according to the machine code, and the process number information of the application process occupying the machine code on the operating system and the IP address information of the server where the process occupying the machine code is located in the relational database, or according to the machine code, and the IP address information of the server where the process occupying the machine code is located and the port number information of the application process occupying the operating system, where the application process occupying the machine code occupies the operating system.
Step S301-23: and if the process does not exist, releasing the machine code from the relational database. If a process exists, no processing may be required on the data table, as the process exists and proves that the situation that the current workid is occupied is really present.
The above is a description of an embodiment of a management method for distributed globally unique identification information provided by the present application, and it can be seen that, by this embodiment, corresponding release and acquisition of machine codes stored in a relational database can be performed according to a real-time use state of an application process, so that convenience and rapidness are added to management of distributed globally unique identification information, and great efforts are not required to be invested in operation and maintenance.
Based on the above, the present application further provides a detailed description of an embodiment of a management apparatus for distributed globally unique identification information, which corresponds to the foregoing embodiment of the management method for distributed globally unique identification information, and also discloses an embodiment of a management apparatus for distributed globally unique identification information, please refer to fig. 4, since the apparatus embodiment is basically similar to the method embodiment, the description is relatively simple, and related points are only referred to the partial description of the method embodiment. The device embodiments described below are merely illustrative.
Referring to fig. 4, an embodiment of a management apparatus for distributed globally unique identification information provided in the present application includes:
a determining unit 401, configured to determine whether a current service state of the application process is normally closed;
the determining unit 401 may include: a normal closing determination subunit, configured to determine that the current service state of the application process is triggered by a closing hook, and is normally closed; wherein the closing hook is a method provided by a software toolkit and used for calling when the application process is closed.
An obtaining unit 402, configured to obtain an occupied machine code in the application process if the determining unit determines that the application process is normally closed;
the obtaining unit 402 is specifically configured to determine, when the service state is off, a machine code occupied in the application process from locally stored machine code information.
A releasing unit 403, configured to release the machine code acquired by the acquiring unit 402 from a relational database; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes.
The release unit 403 may include: the query subunit is used for querying the machine code matched with the machine code and the occupation state of the machine code in the relational database; and the modifying subunit is used for modifying the service use state of the queried machine code from an occupied state to an idle state.
In this embodiment, the releasing unit 403 may further include: and the time updating unit is used for updating the service closing time of the inquired machine code into the modification time for modifying the service using state from the occupied state to the idle state.
In other embodiments, the method may further include: the system comprises an abnormal closing determining unit, a reading unit and a process determining unit, wherein the abnormal closing determining unit is used for determining that the current service state of the application process is abnormal closing when the current service state of the application process is not triggered by a closing hook; the reading unit is configured to read a machine code whose use state is occupied in the relational database, and specifically, when the current service state of the application process is determined to be abnormally closed, read the machine code whose use state is occupied in the relational database through a detection script; furthermore, when the current service state of the application process is determined to be abnormal shutdown, the detection script is started to read the machine code which is occupied by the use state in the relational database through the set detection time. The process determining unit is configured to determine whether a process of the application process exists according to the machine code read in the reading unit, and enter the releasing unit 403 if the process does not exist.
For the above details, reference may be made to the steps S301 to S304, and details are not repeated here.
Based on the above, the present application further provides a computer storage medium for storing data generated by a network platform and a program for processing the data generated by the network platform;
when the program is read and executed, the following steps are executed:
acquiring starting information of an application process;
locking the machine code describing that the machine code using state is idle in a relational database according to the starting information of the application process; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes;
generating global unique identification information according to the locked machine code;
or;
determining whether the current service state of the application process is normally closed;
if the machine code is determined to be normally closed, acquiring the occupied machine code in the application process;
releasing the machine code from a relational database; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes.
Based on the above, the present application further provides an electronic device, including:
a processor;
a memory for storing a program for processing network platform generated data, said program when read and executed by said processor performing the steps of:
acquiring starting information of an application process;
locking the machine code describing that the machine code using state is idle in a relational database according to the starting information of the application process; the database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes;
generating global unique identification information according to the locked machine code;
or;
determining whether the current service state of the application process is normally closed;
if the machine code is determined to be normally closed, acquiring the occupied machine code in the application process;
releasing the machine code from a relational database; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing relevant information of service states of the machine codes.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
1. Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other compositions of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium which can be used to store information which can be accessed by a computing device. As defined herein, computer readable media does not include non-transitory computer readable media (transient media), such as modulated data signals and carrier waves.
2. As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
Although the present application has been described with reference to the preferred embodiments, it is not intended to limit the present application, and those skilled in the art can make variations and modifications without departing from the spirit and scope of the present application, therefore, the scope of the present application should be determined by the claims that follow.
Claims (10)
1. A method for generating distributed globally unique identification information is characterized by comprising the following steps:
acquiring starting information of an application process;
locking the machine code describing that the machine code using state is idle in a relational database according to the starting information of the application process; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes;
and generating global unique identification information according to the locked machine code.
2. The method for generating distributed globally unique identification information according to claim 1, wherein the locking a machine code in a relational database, the machine code describing that a machine code usage state is idle according to the startup information of the application process, includes:
inquiring service information with a machine code use state field value of 1 in the relational database according to the starting information of the application process; wherein, the idle state is represented when the use state is 1, and the occupation state is represented when the use state is 2;
and locking the machine code and the corresponding related service information with the use state field value of 1.
3. The method for generating distributed globally unique identification information according to claim 1, wherein said generating distributed globally unique identification information according to the locked machine code includes:
modifying the use state of the locked machine code from idle to occupied;
according to the modification of the use state, modifying the related service information describing the machine code in the relational database;
submitting transaction information which generates distributed global unique identification information according to the modified machine code;
and generating distributed global unique identification information according to the machine code in the transaction information.
4. The method for generating distributed globally unique identification information according to claim 3, wherein said generating distributed globally unique identification information according to the machine code in the transaction information includes:
determining the machine code which is successfully occupied according to the transaction information;
storing the machine code locally;
and generating distributed global unique identification information through a generation algorithm based on the locally stored machine code.
5. An apparatus for generating distributed globally unique identification information, comprising:
the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring starting information of an application process;
the locking unit is used for locking the machine codes describing that the machine code using state is idle in the relational database according to the starting information of the application process; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing relevant information of service states of the machine codes;
and the generating unit is used for generating the global unique identification information according to the locked machine code.
6. A management method for distributed globally unique identification information is characterized by comprising the following steps:
determining whether the current service state of the application process is normally closed;
if the machine code is determined to be normally closed, acquiring the occupied machine code in the application process;
releasing the machine code from a relational database; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes.
7. The method for managing distributed globally unique identification information according to claim 6, wherein said determining whether the current service state of the application process is normally closed includes:
when the current service state of the application process is triggered by closing a hook, determining that the current service state is normally closed; wherein the closing hook is a method provided by a software toolkit and used for calling when the application process is closed.
8. A management apparatus for distributed globally unique identification information, comprising:
the determining unit is used for determining whether the current service state of the application process is normally closed;
the acquisition unit is used for acquiring the occupied machine code in the application process according to the condition that the application process is determined to be normally closed in the determination unit;
the release unit is used for releasing the machine code acquired by the acquisition unit from a relational database; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes.
9. A computer storage medium for storing network platform generated data and a program for processing the network platform generated data;
when the program is read and executed, the following steps are executed:
acquiring starting information of an application process;
locking the machine code describing that the machine code using state is idle in a relational database according to the starting information of the application process; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes;
generating global unique identification information according to the locked machine code;
or;
determining whether the current service state of the application process is normally closed;
if the machine code is determined to be normally closed, acquiring the occupied machine code in the application process;
releasing the machine code from a relational database; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes.
10. An electronic device, comprising:
a processor;
a memory for storing a program for processing network platform generated data, said program when read and executed by said processor performing the steps of:
acquiring starting information of an application process;
locking the machine code describing that the machine code using state is idle in a relational database according to the starting information of the application process; the database stores machine codes used for generating distributed globally unique identification information and a data table used for describing service information related to the service state of the machine codes;
generating global unique identification information according to the locked machine code;
or;
determining whether the current service state of the application process is normally closed;
if the machine code is determined to be normally closed, acquiring the occupied machine code in the application process;
releasing the machine code from a relational database; the relational database stores machine codes used for generating distributed globally unique identification information and a data table used for describing relevant information of service states of the machine codes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010517683.3A CN111831757B (en) | 2020-06-09 | 2020-06-09 | Method and device for generating and managing distributed global unique identification information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010517683.3A CN111831757B (en) | 2020-06-09 | 2020-06-09 | Method and device for generating and managing distributed global unique identification information |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111831757A true CN111831757A (en) | 2020-10-27 |
| CN111831757B CN111831757B (en) | 2023-05-12 |
Family
ID=72898608
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010517683.3A Active CN111831757B (en) | 2020-06-09 | 2020-06-09 | Method and device for generating and managing distributed global unique identification information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111831757B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112559558A (en) * | 2020-12-07 | 2021-03-26 | 北京理房通支付科技有限公司 | Serial number generation method and device, computing device and storage medium |
| CN112948593A (en) * | 2021-03-18 | 2021-06-11 | 北京中经惠众科技有限公司 | Knowledge graph generation method, device, equipment and medium |
| CN113255293A (en) * | 2021-05-25 | 2021-08-13 | 首约科技(北京)有限公司 | Control method and device for distributed architecture scalable order number generator |
| CN113708983A (en) * | 2021-11-01 | 2021-11-26 | 湖南新云网科技有限公司 | Distributed node ID generation method, device, equipment and storage medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101699439A (en) * | 2009-11-16 | 2010-04-28 | 中兴通讯股份有限公司 | Database transaction submitting method and device |
| US20100293140A1 (en) * | 2009-05-18 | 2010-11-18 | Shuhei Nishiyama | Distributed database system by sharing or replicating the meta information on memory caches |
| US9171019B1 (en) * | 2013-02-19 | 2015-10-27 | Amazon Technologies, Inc. | Distributed lock service with external lock information database |
| CN106572165A (en) * | 2016-10-26 | 2017-04-19 | 宜人恒业科技发展（北京）有限公司 | Distributed global unique ID application method |
| CN106682061A (en) * | 2016-10-17 | 2017-05-17 | 暨南大学 | Distributed system for collection and storage of origin data |
| CN107800733A (en) * | 2016-08-31 | 2018-03-13 | 阿里巴巴集团控股有限公司 | The generation method and equipment of session identification in distributed system |
| CN107968847A (en) * | 2017-11-13 | 2018-04-27 | 深圳市华阅文化传媒有限公司 | High Availabitity ID makers and its ID generation methods and device |
| CN108038145A (en) * | 2017-11-23 | 2018-05-15 | 携程旅游网络技术（上海）有限公司 | Distributed Services tracking, system, storage medium and electronic equipment |
| CN110633320A (en) * | 2018-05-30 | 2019-12-31 | 北京京东尚科信息技术有限公司 | Processing method, system, equipment and storage medium of distributed data service |
| CN111124635A (en) * | 2019-12-06 | 2020-05-08 | 北京达佳互联信息技术有限公司 | Task processing method and device, electronic equipment and storage medium |
-
2020
- 2020-06-09 CN CN202010517683.3A patent/CN111831757B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100293140A1 (en) * | 2009-05-18 | 2010-11-18 | Shuhei Nishiyama | Distributed database system by sharing or replicating the meta information on memory caches |
| CN101699439A (en) * | 2009-11-16 | 2010-04-28 | 中兴通讯股份有限公司 | Database transaction submitting method and device |
| US9171019B1 (en) * | 2013-02-19 | 2015-10-27 | Amazon Technologies, Inc. | Distributed lock service with external lock information database |
| CN107800733A (en) * | 2016-08-31 | 2018-03-13 | 阿里巴巴集团控股有限公司 | The generation method and equipment of session identification in distributed system |
| CN106682061A (en) * | 2016-10-17 | 2017-05-17 | 暨南大学 | Distributed system for collection and storage of origin data |
| CN106572165A (en) * | 2016-10-26 | 2017-04-19 | 宜人恒业科技发展（北京）有限公司 | Distributed global unique ID application method |
| CN107968847A (en) * | 2017-11-13 | 2018-04-27 | 深圳市华阅文化传媒有限公司 | High Availabitity ID makers and its ID generation methods and device |
| CN108038145A (en) * | 2017-11-23 | 2018-05-15 | 携程旅游网络技术（上海）有限公司 | Distributed Services tracking, system, storage medium and electronic equipment |
| CN110633320A (en) * | 2018-05-30 | 2019-12-31 | 北京京东尚科信息技术有限公司 | Processing method, system, equipment and storage medium of distributed data service |
| CN111124635A (en) * | 2019-12-06 | 2020-05-08 | 北京达佳互联信息技术有限公司 | Task processing method and device, electronic equipment and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| CIPRIAN-OCTAVIAN TRUICA ET AL.: "Performance evaluation for CRUD operations in asynchronously replicated document oriented database", 《2015 20TH INTERNATIONAL CONFERENCE ON CONTROL SYSTEMS AND COMPUTER SCIENCE》 * |
| 祝幸辉: "云物联平台的数据汇聚与存储方法研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112559558A (en) * | 2020-12-07 | 2021-03-26 | 北京理房通支付科技有限公司 | Serial number generation method and device, computing device and storage medium |
| CN112559558B (en) * | 2020-12-07 | 2024-04-09 | 北京理房通支付科技有限公司 | Method and device for generating serial numbers, computing equipment and storage medium |
| CN112948593A (en) * | 2021-03-18 | 2021-06-11 | 北京中经惠众科技有限公司 | Knowledge graph generation method, device, equipment and medium |
| CN113255293A (en) * | 2021-05-25 | 2021-08-13 | 首约科技(北京)有限公司 | Control method and device for distributed architecture scalable order number generator |
| CN113708983A (en) * | 2021-11-01 | 2021-11-26 | 湖南新云网科技有限公司 | Distributed node ID generation method, device, equipment and storage medium |
| CN113708983B (en) * | 2021-11-01 | 2022-02-11 | 湖南新云网科技有限公司 | Distributed node ID generation method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111831757B (en) | 2023-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111831757B (en) | Method and device for generating and managing distributed global unique identification information | |
| US11586506B2 (en) | System and method for indexing image backups | |
| US10506043B2 (en) | Rapid client-side component processing based on component relationships | |
| US10289443B2 (en) | System and method for sharing global transaction identifier (GTRID) in a transactional middleware environment | |
| US7512693B2 (en) | Dual-component state token with state data direct access index for systems with high transaction volume and high number of unexpired tokens | |
| CN106844014B (en) | Method and device for realizing suspension prevention of distributed transactions | |
| WO2020181810A1 (en) | Data processing method and apparatus applied to multi-level caching in cluster | |
| US7587566B2 (en) | Realtime memory management via locking realtime threads and related data structures | |
| WO2021169342A1 (en) | Resource management method for node in kubernetes, device, and medium | |
| US20030191870A1 (en) | Method and apparatus for updating software libraries | |
| US11687595B2 (en) | System and method for searching backups | |
| CN110968603B (en) | Data access method and device | |
| KR20070049155A (en) | Apparatus, system, and method for file system serialization reinitialization | |
| US20120158794A1 (en) | Techniques to discover object interfaces | |
| US7444634B2 (en) | Method and apparatus for providing dynamic locks for global resources | |
| US8572627B2 (en) | Providing supplemental semantics to a transactional queue manager | |
| CN109522043B (en) | Method and device for managing configuration data and storage medium | |
| US20220129458A1 (en) | Method for generating identification id, and apparatus implementing the same method | |
| US20210133046A1 (en) | System and method for efficient backup generation | |
| US8918370B2 (en) | Dynamic allocation of program libraries | |
| CN112054919B (en) | Method, device, storage medium and system for generating ID (identity) of container cluster under stateless condition | |
| US20110302377A1 (en) | Automatic Reallocation of Structured External Storage Structures | |
| WO2023155591A1 (en) | Progress information management and control method, micro-service apparatus, electronic device, and storage medium | |
| CN116662426A (en) | Database connection establishment method, device, equipment and medium | |
| US6233621B1 (en) | System and method for space efficient hashcode allocation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |