CN109842621B - Method and terminal for reducing token storage quantity - Google Patents
Method and terminal for reducing token storage quantity Download PDFInfo
- Publication number
- CN109842621B CN109842621B CN201910072155.9A CN201910072155A CN109842621B CN 109842621 B CN109842621 B CN 109842621B CN 201910072155 A CN201910072155 A CN 201910072155A CN 109842621 B CN109842621 B CN 109842621B
- Authority
- CN
- China
- Prior art keywords
- unique identifier
- token
- record corresponding
- tokens
- record
- 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.)
- Active
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention discloses a method and a terminal for reducing token storage quantity, wherein a unique identifier is stored in a way of corresponding to one record, tokens corresponding to the unique identifier are stored in the record corresponding to the unique identifier, and the method is different from the existing way that one token corresponds to one record, the change on a data structure enables the data quantity stored in a database to be only related to the number of the unique identifiers, so that the resource occupation and the database pressure are effectively reduced; after a new token is stored each time, judging the number of tokens in a record corresponding to the unique identifier of the token, and deleting the tokens meeting preset conditions in the record when the number of tokens stored in the record reaches a preset value.
Description
Technical Field
The invention relates to the technical field of user login, in particular to a method and a terminal for reducing token storage quantity.
Background
With the progress of society, smart phones are rapidly popularized and developed, and further development of mobile internet functions is driven. The large increase of the user quantity and the data quantity brings huge pressure to a mobile internet server, almost all software products have a scene of using login, and a general system is usually designed according to the standard oauth2.0 of international certification, wherein the implementation of oauth2.0 requires issuing login permission in a token or token mode.
Due to the temporary issuance of the token, the token has an expiration time, and generally, a token is stored in a cache and used as the cache, and a token is stored in a database persistent layer and used as source data. Generally, a new token is generated when a user logs in once, a corresponding token record is stored in a database, at this time, if the user logs in for many times, the database stores a plurality of token records, meanwhile, monitoring and dial testing functions used by other systems may also frequently call a login interface for testing, if each system calling the login interface carries out dial testing, great pressure is caused to the login system, a great number of token records are generated, and great pressure is brought to the database and the current system.
In order to reduce the pressure on the database caused by too many stored token records, the existing processing mode is to perform polling check on all token records in the whole database through a timing task and delete expired tokens at regular time.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: the method and the terminal for reducing the token storage quantity can effectively reduce the database pressure and improve the efficiency.
In order to solve the technical problems, the invention adopts a technical scheme that:
a method of reducing the number of tokens stored, comprising the steps of:
s1, when a new token is generated, acquiring a unique identifier corresponding to the new token, and storing the new token into a record corresponding to the unique identifier;
s2, judging whether the number of tokens stored in the record corresponding to the unique identifier reaches a preset value, if so, deleting the tokens meeting preset conditions in the record corresponding to the unique identifier.
In order to solve the technical problem, the invention adopts another technical scheme as follows:
a terminal for reducing the amount of token stores, comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:
s1, when a new token is generated, acquiring a unique identifier corresponding to the new token, and storing the new token into a record corresponding to the unique identifier;
s2, judging whether the number of tokens stored in the record corresponding to the unique identifier reaches a preset value, if so, deleting the tokens meeting preset conditions in the record corresponding to the unique identifier.
The invention has the beneficial effects that: the method is characterized in that the method is stored in a mode that one unique identifier corresponds to one record, and the token corresponding to the unique identifier is stored in the record corresponding to the unique identifier, so that the method is different from the existing mode that one token corresponds to one record, the change of a data structure can ensure that the data quantity stored in a database is only related to the number of the unique identifiers and is not related to the number of the generated tokens, the occupation of the database and server resources is reduced, and the pressure of the database is effectively reduced; after a new token is stored every time, the number of tokens in the record corresponding to the unique identifier of the token is judged, when the number of tokens stored in the record corresponding to the unique identifier reaches a preset value, the tokens meeting preset conditions in the record corresponding to the unique identifier are deleted, and the method is different from the existing mode of polling all token records in the whole database through a timing task.
Drawings
FIG. 1 is a flow chart of steps of a method of reducing token store size in accordance with an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a terminal for reducing token storage quantity according to an embodiment of the present invention;
FIG. 3 is a flowchart illustrating steps of a method for reducing token store size, in accordance with an embodiment of the present invention;
description of the reference symbols:
1. a terminal for reducing token storage quantity; 2. a memory; 3. a processor.
Detailed Description
In order to explain the technical contents, the objects and the effects of the present invention in detail, the following description is made with reference to the accompanying drawings in combination with the embodiments.
The key concept of the invention is that one unique identifier is stored corresponding to one record, the corresponding token is stored in the record corresponding to the unique identifier, after a new token is stored each time, whether the number of tokens in the record corresponding to the unique identifier of the token reaches a preset value is judged, and if yes, the tokens meeting preset conditions in the record are deleted.
Referring to fig. 1, a method for reducing token storage amount includes the steps of:
s1, when a new token is generated, acquiring a unique identifier corresponding to the new token, and storing the new token into a record corresponding to the unique identifier;
s2, judging whether the number of tokens stored in the record corresponding to the unique identifier reaches a preset value, if so, deleting the tokens meeting preset conditions in the record corresponding to the unique identifier.
As can be seen from the above description, the beneficial effects of the present invention are: the method is characterized in that the unique identifier is stored in a way of corresponding to one record, the token corresponding to the unique identifier is stored in the record corresponding to the unique identifier, and the method is different from the existing way that one token corresponds to one record, and the change on the data structure can enable the data volume stored in the database to be only related to the number of the unique identifiers and not related to the number of the generated tokens, so that the occupation of the database and server resources is reduced, and the pressure of the database is effectively reduced; after a new token is stored every time, the number of tokens in the record corresponding to the unique identifier of the token is judged, when the number of tokens stored in the record corresponding to the unique identifier reaches a preset value, the tokens meeting preset conditions in the record corresponding to the unique identifier are deleted, and the method is different from the existing mode of polling all token records in the whole database through a timing task.
Further, between the steps S1 and S2, the method further includes:
asynchronously sending a message containing the unique identifier corresponding to the new token to a message middleware;
acquiring the unique identifier corresponding to the new token from the message middleware in real time through an asynchronous thread;
the step S2 of determining whether the number of tokens stored in the record corresponding to the unique identifier reaches a preset value specifically includes:
and judging whether the number of tokens stored in the record corresponding to the unique identifier reaches a preset value in real time through an asynchronous thread.
According to the description, the unique identifier corresponding to the new token is obtained in real time through the asynchronous thread, whether the number of tokens stored in the record corresponding to the unique identifier reaches the preset value or not is judged according to the unique identifier, the judgment process and the subsequent processing process can be realized under the condition that the login process and the login interface throughput are not influenced, the judgment speed is increased in a concurrent mode, the database pressure reducing speed is increased, and the efficiency is improved.
Further, each record corresponding to each unique identifier includes a count field, and the value of the count field is the number of tokens stored in the record corresponding to the unique identifier;
the step S2 specifically includes:
judging whether the value of the counting field corresponding to the unique identifier reaches a preset value, and if not, adding one to the value of the counting field;
and if so, deleting the token meeting the preset conditions in the record corresponding to the unique identifier, and updating the value of the counting field corresponding to the unique identifier according to the deletion result.
According to the description, when the token insertion or deletion operation is performed on the record corresponding to the unique identifier each time, the counting field needs to be updated correspondingly, whether the number of tokens in the record corresponding to the unique identifier reaches a preset value or not can be conveniently judged through the counting field, and the judgment efficiency is improved.
Furthermore, the record corresponding to each unique identifier comprises an array;
in the step S1, the storing the new token into the record corresponding to the unique identifier includes:
and storing the new token into an array of records corresponding to the unique identifier.
It can be known from the above description that, by storing the token in the array of the record corresponding to the unique identifier, it can be easily and conveniently implemented that the unique identifier is used as a main key, all the tokens corresponding to the unique identifier are stored in one record of the database, so that the database stores the number of tokens equivalent to the number of users without adding the number of tokens to the utmost, the data storage amount of the database is only related to the number of registered users, but not to the login times of all the users, the change in the data structure can effectively reduce the occupation of the database and server resources, reduce the pressure of the database, and ensure the convenience of accessing the tokens through the array storage of the tokens.
Further, the token includes an expiration time;
deleting the token meeting the preset condition in the record corresponding to the unique identifier in the step S2 includes:
judging whether an expired token exists in the record corresponding to the unique identifier, and if so, deleting all expired tokens in the record corresponding to the unique identifier;
and if not, sorting the tokens in the record corresponding to the unique identifier according to the sequence of the expiration time corresponding to each token, and deleting the earliest expired token in the record corresponding to the unique identifier.
According to the above description, when the number of tokens in the record corresponding to the unique identifier reaches a preset value, an expired token in the record is deleted first, it is ensured that all tokens that have not expired yet are available at the time of login as much as possible, and when an expired token does not exist in the record, the earliest expired token in the record is deleted, so that it is ensured that the tokens in the record are always newer tokens under the limitation of number.
Referring to fig. 2, a terminal for reducing token storage amount includes a memory, a processor and a computer program stored in the memory and running on the processor, where the processor executes the computer program to implement the following steps:
s1, when a new token is generated, acquiring a unique identifier corresponding to the new token, and storing the new token into a record corresponding to the unique identifier;
s2, judging whether the number of tokens stored in the record corresponding to the unique identifier reaches a preset value, if so, deleting the tokens meeting preset conditions in the record corresponding to the unique identifier.
From the above description, the beneficial effects of the present invention are: the method is characterized in that the method is stored in a mode that one unique identifier corresponds to one record, and the token corresponding to the unique identifier is stored in the record corresponding to the unique identifier, so that the method is different from the existing mode that one token corresponds to one record, the change of a data structure can ensure that the data quantity stored in a database is only related to the number of the unique identifiers and is not related to the number of the generated tokens, the occupation of the database and server resources is reduced, and the pressure of the database is effectively reduced; the method comprises the steps that after a new token is stored every time, the number of tokens in a record corresponding to a unique identifier of the token is judged, when the number of tokens stored in the record corresponding to the unique identifier reaches a preset value, the tokens meeting preset conditions in the record corresponding to the unique identifier are deleted, and the method is different from the existing mode of polling all token records in a whole database through a timing task.
Further, between the steps S1 and S2, the method further includes:
asynchronously sending a message containing the unique identifier corresponding to the new token to a message middleware;
acquiring the unique identifier corresponding to the new token from the message middleware in real time through an asynchronous thread;
the step S2 of determining whether the number of tokens stored in the record corresponding to the unique identifier reaches a preset value specifically includes:
and judging whether the number of tokens stored in the record corresponding to the unique identifier reaches a preset value in real time through an asynchronous thread.
According to the description, the unique identifier corresponding to the new token is obtained in real time through the asynchronous thread, whether the number of tokens stored in the record corresponding to the unique identifier reaches the preset value or not is judged according to the unique identifier, the judgment process and the subsequent processing process can be realized under the condition that the login process and the login interface throughput are not influenced, the judgment speed is increased in a concurrent mode, the database pressure reducing speed is increased, and the efficiency is improved.
Further, the record corresponding to each unique identifier comprises a count field, and the value of the count field is the number of tokens stored in the record corresponding to the unique identifier;
the step S2 specifically includes:
judging whether the value of the counting field corresponding to the unique identifier reaches a preset value, and if not, adding one to the value of the counting field;
and if so, deleting the token meeting the preset conditions in the record corresponding to the unique identifier, and updating the value of the counting field corresponding to the unique identifier according to the deletion result.
According to the description, when the token is inserted or deleted into or from the record corresponding to the unique identifier, the counting field needs to be updated correspondingly, whether the number of tokens in the record corresponding to the unique identifier reaches a preset value or not can be judged conveniently through the counting field, and the judgment efficiency is improved.
Further, the record corresponding to each unique identifier comprises an array;
in the step S1, the storing the new token into the record corresponding to the unique identifier includes:
and storing the new token into an array of records corresponding to the unique identifier.
It can be known from the above description that, by storing the token in the array of the record corresponding to the unique identifier, it can be easily and conveniently implemented that the unique identifier is used as a main key, all the tokens corresponding to the unique identifier are stored in one record of the database, so that the database stores the number of tokens equivalent to the number of users without adding the number of tokens to the utmost, the data storage amount of the database is only related to the number of registered users, but not to the login times of all the users, the change in the data structure can effectively reduce the occupation of the database and server resources, reduce the pressure of the database, and ensure the convenience of accessing the tokens through the array storage of the tokens.
Further, the token includes an expiration time;
deleting the token meeting the preset condition in the record corresponding to the unique identifier in the step S2 includes:
judging whether the record corresponding to the unique identifier has an expired token or not, and if so, deleting all expired tokens in the record corresponding to the unique identifier;
if not, sorting the token in the record corresponding to the unique identifier according to the sequence of the expiration time corresponding to each token, and deleting the earliest expired token in the record corresponding to the unique identifier.
According to the above description, when the number of tokens in the record corresponding to the unique identifier reaches a preset value, an expired token in the record is deleted first, it is ensured that all tokens that have not expired yet are available at the time of login as much as possible, and when an expired token does not exist in the record, the earliest expired token in the record is deleted, so that it is ensured that the tokens in the record are always newer tokens under the limitation of number.
Example one
Referring to fig. 1 and 3, a method for reducing token storage amount includes the steps of:
the client calls a login interface, and after the login interface executes login related services, token information is generated;
storing the generated token information to a cache layer;
s1, when a new token is generated, acquiring a unique identifier corresponding to the new token, and storing the new token into a record corresponding to the unique identifier;
the unique identification comprises a user ID of a login user and a client identification c l I entType where the login user is located, the unique identification is used as a unique main key to store a record in a database, and the database is a mongo database;
the record corresponding to each unique identifier comprises an array, and the token comprises expiration time;
specifically, the new token is stored in an array of records corresponding to the unique identifier in a predefined data format;
the record corresponding to each unique identifier comprises a counting field, and the value of the counting field is the number of tokens stored in the record corresponding to the unique identifier, namely the number of tokens which can be used by a user corresponding to the unique identifier on a corresponding client;
the data format is as follows:
specific examples are as follows:
i d is a unique main key corresponding to the unique identifier, count is the count field, item is the array and is used for storing a plurality of token entity objects, and expi reT ime is the expiration time of the token;
asynchronously sending a message containing the unique identifier corresponding to the new token to the MQ message middleware, ending the login process, and returning the related information of the login end to the client;
acquiring the unique identifier corresponding to the new token from the MQ message middleware in real time through an asynchronous thread;
s2, judging whether the number of tokens stored in the record corresponding to the unique identifier reaches a preset value, if so, deleting the tokens meeting preset conditions in the record corresponding to the unique identifier.
Specifically, querying in a database through an asynchronous thread or an asynchronous task according to the unique identifier, namely a user id and a client identifier c l I entType, as a unique main key, and judging whether the number of tokens stored in a record corresponding to the unique identifier, namely the value of the count field, reaches a preset value in real time, if not, adding one to the value of the count field;
if so, deleting the token meeting the preset conditions in the record corresponding to the unique identifier, and updating the value of the counting field corresponding to the unique identifier according to the deletion result;
specifically, whether expired tokens exist in the record corresponding to the unique identifier is judged, and if yes, all expired tokens in the record corresponding to the unique identifier are deleted;
if not, sorting the tokens in the record corresponding to the unique identifier according to the sequence of the expiration time corresponding to each token, deleting the earliest expired token in the record corresponding to the unique identifier, and at this time, not updating the value of the counting field;
wherein, preferably, the preset value is 10;
specifically, the asynchronous thread or asynchronous task module queries in a database according to the unique identifier, i.e., a user id and a client identifier c l I entType, as a unique main key, and judges whether the number of tokens stored in a record corresponding to the unique identifier, i.e., the value of the count field, reaches 10 in real time, if not, the number of times that a user corresponding to the unique identifier performs login operation on a corresponding client does not reach the specified number of times, and adds one to the value of the count field to end the token processing process of the login;
if so, indicating that the number of times of the user corresponding to the unique identifier performing login operation on the corresponding client reaches a specified number of times, namely 10 times, processing the token of the user on the client, judging whether the record corresponding to the unique identifier has an expired token, if so, deleting all expired tokens in the record corresponding to the unique identifier, and updating the value of the counting field according to the condition of deleting the token;
if not, it is indicated that no token is overdue, at this time, the tokens in the record corresponding to the unique identifier are sequenced according to the sequence of the expiration time corresponding to each token, the earliest overdue token in the record corresponding to the unique identifier is deleted, at this time, because the value of the counting field reaches a preset value, the newly inserted token does not participate in counting, and the total number of tokens is just kept unchanged by deleting the earliest overdue token and the newly inserted token, so that the value of the counting field does not need to be updated;
under the condition of not influencing the user login process and the login interface throughput, the number of tokens logged in by each user can be controlled, so that only the number of tokens with the same level as the number of the users is stored at present, the number of tokens cannot be increased endlessly, the data storage quantity of a database is only related to the number of registered users, but not to the login times of all the users, and the pressure of the database and the resource occupation of a server are effectively reduced;
because the inactive user does not use the client for a long time, the number of tokens in the record corresponding to the unique identifier of the inactive user is usually lower than the specified number for a long time, and the number of tokens in the record corresponding to the unique identifier of the active user usually exceeds the specified number, so that the scheme can be used for aiming at the limitation of the number of tokens of the active user under the normal condition, effectively reducing the pressure of a database, and simultaneously conveniently distinguishing the active user from the inactive user through the number and the change condition of the tokens in the record corresponding to each unique identifier, thereby providing a basis for the expansion of a subsequent function module.
Example two
Referring to fig. 2, a terminal 1 for reducing token storage amount includes a memory 2, a processor 3, and a computer program stored in the memory 2 and executable on the processor 3, where the processor 3 implements the steps in the first embodiment when executing the computer program.
In summary, the method and the terminal for reducing token storage quantity provided by the invention store tokens in a way that one unique identifier corresponds to one record, each record corresponding to one unique identifier comprises one array, tokens corresponding to the unique identifiers are stored in the array corresponding to the record corresponding to the unique identifier, and are different from the existing way that one token corresponds to one record, the change in data structure can make the data quantity stored in the database only related to the number of the unique identifiers and unrelated to the number of generated tokens, so that the database is guaranteed to store token quantities with the same level as the number of users, the convenience of accessing the tokens is guaranteed by storing the tokens in the arrays, the occupation of resources of the database and a server is reduced, and the pressure of the database is effectively reduced; after a new token is stored each time, the number of tokens in the record corresponding to the unique identifier of the token is judged in real time through an asynchronous thread, when the number of tokens stored in the record corresponding to the unique identifier reaches a preset value, the token meeting preset conditions in the record corresponding to the unique identifier is deleted, and the method is different from the prior mode of polling all token records in the whole database through a timed task.
The above description is only an embodiment of the present invention, and is not intended to limit the scope of the present invention, and all equivalent modifications made by the present invention and the contents of the accompanying drawings, which are directly or indirectly applied to the related technical fields, are included in the scope of the present invention.
Claims (8)
1. A method of reducing the number of tokens stored, comprising the steps of:
s1, when a new token is generated, acquiring a unique identifier corresponding to the new token, and storing the new token into a record corresponding to the unique identifier;
s2, judging whether the number of tokens stored in the record corresponding to the unique identifier reaches a preset value, if so, deleting the tokens meeting preset conditions in the record corresponding to the unique identifier;
the unique identification comprises a userId of the login user and a client identification clientType of the login user;
the record corresponding to each unique identifier comprises an array;
the step S1 of storing the new token in the record corresponding to the unique identifier includes:
storing the new token into an array of records corresponding to the unique identifier;
the S1 further includes: the client calls a login interface, and after the login interface executes login related services, token information is generated;
and storing in a mode that one unique identifier corresponds to one record, wherein the token corresponding to the unique identifier is stored in the record corresponding to the unique identifier.
2. The method for reducing token storage amount of claim 1, wherein between the steps S1 and S2 further comprising:
asynchronously sending a message containing the unique identifier corresponding to the new token to a message middleware;
acquiring the unique identifier corresponding to the new token from the message middleware in real time through an asynchronous thread;
the step S2 of determining whether the number of tokens stored in the record corresponding to the unique identifier reaches a preset value specifically includes: and judging whether the number of tokens stored in the record corresponding to the unique identifier reaches a preset value in real time through an asynchronous thread.
3. A method for reducing the number of tokens stored according to claim 1 or 2, wherein each record corresponding to a unique identifier includes a count field, and the value of the count field is the number of tokens stored in the record corresponding to the unique identifier;
the step S2 specifically includes:
judging whether the value of the counting field corresponding to the unique identifier reaches a preset value, and if not, adding one to the value of the counting field;
and if so, deleting the token meeting the preset conditions in the record corresponding to the unique identifier, and updating the value of the counting field corresponding to the unique identifier according to the deletion result.
4. A method of reducing the number of token stores as claimed in claim 1 or 2, wherein the token includes an expiration time;
deleting the token meeting the preset condition in the record corresponding to the unique identifier in the step S2 includes:
judging whether the record corresponding to the unique identifier has an expired token or not, and if so, deleting all expired tokens in the record corresponding to the unique identifier;
if not, sorting the token in the record corresponding to the unique identifier according to the sequence of the expiration time corresponding to each token, and deleting the earliest expired token in the record corresponding to the unique identifier.
5. A terminal for reducing token storage amount, comprising a memory, a processor and a computer program stored on the memory and operable on the processor, wherein the processor implements the following steps when executing the computer program:
s1, when a new token is generated, acquiring a unique identifier corresponding to the new token, and storing the new token into a record corresponding to the unique identifier;
s2, judging whether the number of tokens stored in the record corresponding to the unique identifier reaches a preset value, if so, deleting the tokens meeting preset conditions in the record corresponding to the unique identifier;
the unique identification comprises a userId of the login user and a client identification clientType of the login user;
the record corresponding to each unique identifier comprises an array;
in the step S1, the storing the new token into the record corresponding to the unique identifier includes:
storing the new token into an array of records corresponding to the unique identifier;
the S1 further includes: the client calls a login interface, and after the login interface executes login related services, token information is generated;
and storing in a mode that one unique identifier corresponds to one record, wherein the token corresponding to the unique identifier is stored in the record corresponding to the unique identifier.
6. The terminal for reducing token storage amount of claim 5, wherein between the steps S1 and S2 further comprising:
asynchronously sending a message containing the unique identifier corresponding to the new token to a message middleware;
acquiring the unique identifier corresponding to the new token from the message middleware in real time through an asynchronous thread;
the step S2 of determining whether the number of tokens stored in the record corresponding to the unique identifier reaches a preset value specifically includes:
and judging whether the number of tokens stored in the record corresponding to the unique identifier reaches a preset value in real time through an asynchronous thread.
7. A terminal for reducing the number of tokens stored in the terminal according to claim 5 or 6, wherein a count field is included in the record corresponding to each unique identifier, and the value of the count field is the number of tokens stored in the record corresponding to the unique identifier;
the step S2 specifically includes:
judging whether the value of the counting field corresponding to the unique identifier reaches a preset value, and if not, adding one to the value of the counting field;
and if so, deleting the token meeting the preset condition in the record corresponding to the unique identifier, and updating the value of the counting field corresponding to the unique identifier according to the deletion result.
8. A terminal for reducing token storage quantity according to claim 5 or 6, characterized in that said token includes an expiration time;
deleting the token meeting the preset condition in the record corresponding to the unique identifier in the step S2 includes:
judging whether an expired token exists in the record corresponding to the unique identifier, and if so, deleting all expired tokens in the record corresponding to the unique identifier;
and if not, sorting the tokens in the record corresponding to the unique identifier according to the sequence of the expiration time corresponding to each token, and deleting the earliest expired token in the record corresponding to the unique identifier.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910072155.9A CN109842621B (en) | 2019-01-25 | 2019-01-25 | Method and terminal for reducing token storage quantity |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910072155.9A CN109842621B (en) | 2019-01-25 | 2019-01-25 | Method and terminal for reducing token storage quantity |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109842621A CN109842621A (en) | 2019-06-04 |
| CN109842621B true CN109842621B (en) | 2022-07-26 |
Family
ID=66884154
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910072155.9A Active CN109842621B (en) | 2019-01-25 | 2019-01-25 | Method and terminal for reducing token storage quantity |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109842621B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110430062B (en) * | 2019-07-22 | 2023-07-21 | 深圳市兰拓科技发展有限公司 | Login request processing method, device, equipment and medium |
| CN110691454A (en) * | 2019-09-10 | 2020-01-14 | 四川创宏电气有限公司 | Fire-fighting lamp polling method and emergency lamp control system |
| CN110750513A (en) * | 2019-09-17 | 2020-02-04 | 福建天泉教育科技有限公司 | Dynamic database capacity expansion method and storage medium |
| CN110753037A (en) * | 2019-09-27 | 2020-02-04 | 苏州浪潮智能科技有限公司 | Token management method, device and storage medium |
| CN111865935B (en) * | 2020-06-30 | 2022-05-17 | 北京天融信网络安全技术有限公司 | Data transmission system |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106302479A (en) * | 2016-08-18 | 2017-01-04 | 武汉斗鱼网络科技有限公司 | A kind of single-point logging method for multi-service internet site and system |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101035031A (en) * | 2007-04-03 | 2007-09-12 | 华为技术有限公司 | Method and device for detecting the number of the shared access host |
| CN103095737B (en) * | 2011-10-27 | 2017-03-01 | 阿里巴巴集团控股有限公司 | A kind for the treatment of method and apparatus of network browsing information |
| US20170223057A1 (en) * | 2016-02-01 | 2017-08-03 | General Electric Company | System and method for access control services |
| CN107807993B (en) * | 2017-11-08 | 2021-06-15 | 山东云缦智能科技有限公司 | Method and device for realizing webpage history recording function |
-
2019
- 2019-01-25 CN CN201910072155.9A patent/CN109842621B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106302479A (en) * | 2016-08-18 | 2017-01-04 | 武汉斗鱼网络科技有限公司 | A kind of single-point logging method for multi-service internet site and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109842621A (en) | 2019-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109842621B (en) | Method and terminal for reducing token storage quantity | |
| CN104699718B (en) | Method and apparatus for being rapidly introduced into business datum | |
| CN109104336B (en) | Service request processing method and device, computer equipment and storage medium | |
| CN112445596B (en) | Data importing method, system and storage medium based on multithreading | |
| CN105898085B (en) | Harass recognition methods and the device of communications account | |
| WO2019085307A1 (en) | Data sampling method, terminal, and device, and computer readable storage medium | |
| CN107688626B (en) | Slow query log processing method and device and electronic equipment | |
| CN108228322B (en) | Distributed link tracking and analyzing method, server and global scheduler | |
| CN111367925A (en) | Data dynamic real-time updating method, device and storage medium | |
| CN110659971B (en) | Transaction data processing method and device | |
| CN111385294B (en) | Data processing method, system, computer device and storage medium | |
| CN111078651A (en) | Method and device for counting usage amount of object storage | |
| CN109614270A (en) | Data read-write method, device, equipment and storage medium based on Hbase | |
| CN108733543B (en) | Log analysis method and device, electronic equipment and readable storage medium | |
| CN110222046B (en) | List data processing method, device, server and storage medium | |
| CN112671878B (en) | Block chain information subscription method, device, server and storage medium | |
| EP3945420A1 (en) | Method and apparatus for data processing, server and storage medium | |
| CN111367948B (en) | Data processing method and device, electronic equipment and computer readable storage medium | |
| CN116028696A (en) | Resource information acquisition method and device, electronic equipment and storage medium | |
| CN113419687B (en) | Object storage method, system, equipment and storage medium | |
| CN115795100A (en) | User event processing method and device, electronic equipment and readable storage medium | |
| CN114036048A (en) | Case activity detection method, device, equipment and storage medium | |
| CN113760876A (en) | Data filtering method and device | |
| CN114253905A (en) | File writing method, device and equipment based on directory quota | |
| CN112231290A (en) | Method, device and equipment for processing local log and storage medium |
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 |