CN110245028B - Message storage method, device, computer equipment and storage medium of IoT-MQ - Google Patents

Message storage method, device, computer equipment and storage medium of IoT-MQ Download PDF

Info

Publication number
CN110245028B
CN110245028B CN201910394580.XA CN201910394580A CN110245028B CN 110245028 B CN110245028 B CN 110245028B CN 201910394580 A CN201910394580 A CN 201910394580A CN 110245028 B CN110245028 B CN 110245028B
Authority
CN
China
Prior art keywords
message
hashcode
iot
hash
request
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
Application number
CN201910394580.XA
Other languages
Chinese (zh)
Other versions
CN110245028A (en
Inventor
詹泽
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ping An Technology Shenzhen Co Ltd
Original Assignee
Ping An Technology Shenzhen Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Ping An Technology Shenzhen Co Ltd filed Critical Ping An Technology Shenzhen Co Ltd
Priority to CN201910394580.XA priority Critical patent/CN110245028B/en
Publication of CN110245028A publication Critical patent/CN110245028A/en
Priority to PCT/CN2019/118172 priority patent/WO2020228287A1/en
Application granted granted Critical
Publication of CN110245028B publication Critical patent/CN110245028B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/54—Interprogram communication
    • G06F9/546—Message passing systems or structures, e.g. queues
    • 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/2291—User-Defined Types; Storage 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/28—Databases characterised by their database models, e.g. relational or object models
    • G06F16/284—Relational databases
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • 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)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer And Data Communications (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The present application relates to the field of message queuing technologies, and in particular, to a method, an apparatus, a computer device, and a storage medium for storing messages in an internet of things message queue IoT-MQ. The method comprises the following steps: establishing a hashCode corresponding relation table, wherein the hashCode corresponding relation table stores the corresponding relation between hashCode calculated by a preset hash algorithm and hashCode used for determining a storage position of a message; adding a tag to each IoT-MQ message to obtain a plurality of first tags; inputting each first mark in the plurality of first marks as a key into a preset hash algorithm for calculation, and calculating a first hash code corresponding to each first mark; searching a second hashCode corresponding to each first hashCode in a message library, wherein the message library is a distributed message library; and storing the information of the IoT-MQ corresponding to the different first hashCode into the hash slots of the second hashCode corresponding to each first hashCode respectively. The method solves the problem that the message storage performance is poor when a relational database is adopted to store a large number of messages.

Description

Message storage method, device, computer equipment and storage medium of IoT-MQ
Technical Field
The present application relates to the field of message queuing technologies, and in particular, to a method, an apparatus, a computer device, and a storage medium for storing messages in an internet of things message queue IoT-MQ.
Background
IoT-MQ (Internet of Things Message Queue, chinese is the internet of things message queue) mainly solves the problem that internet of things devices perform message transmission on the internet, and the message characteristics of the internet of things devices mainly include: 1. the message types are many, such as household appliance information, temperature information, weather information and the like. 2. The number of devices is large, the message quantity is large, the internet of things devices are more than ten millions of devices in general, the message quantity is generally hundred million-level messages, the main functions of the IoT-MQ are to collect the messages of the devices, distribute the messages and store the messages, and the requirement for storing a large number of messages is generally satisfied: 1. message storage is reliable, 2. Message storage has less impact on overall IoT MQ performance, 3. Stored messages facilitate subsequent retrieval for secondary processing. The solutions in the current market are roughly: with conventional relational database storage, such as with Mysql, pg, etc., when the amount of data is very large, such as for the storage of billions of data, etc., it is necessary to reprocess the sub-database sub-tables, etc., and when the amount of data is very large, it is very bad for queries, and most relational databases are in-memory databases, resulting in unsatisfactory performance in message storage and message retrieval.
Content of the application
Aiming at the defects of the prior art, the application provides a message storage method, a device, a computer device and a storage medium of an internet of things message queue (IoT-MQ), which aim to solve the problems of poor message storage performance due to the adoption of a relational database to store a large number of messages.
The technical scheme provided by the application is as follows:
a message storage method of an internet of things message queue IoT-MQ, the method comprising:
establishing a hashCode corresponding relation table, wherein the hashCode corresponding relation table stores the corresponding relation between hashCode calculated by a preset hash algorithm and hashCode used for determining a storage position of a message;
adding a tag to each IoT-MQ message to obtain a plurality of first tags;
inputting each first mark in the plurality of first marks as a key into a preset hash algorithm for calculation, and calculating a first hash code corresponding to each first mark;
searching a second hashCode corresponding to each first hashCode in a message library according to the hashCode corresponding relation table, wherein the message library is a distributed message library;
and storing the information of the IoT-MQ corresponding to the different first hashCode into the hash slots of the second hashCode corresponding to each first hashCode respectively.
Further, before the step of obtaining a plurality of first tags according to the adding of the tag to the message of each IoT-MQ, the method comprises:
identifying a device to which each IoT-MQ message belongs;
acquiring a device ID corresponding to the device to which each message of the IoT-MQ belongs according to the device to which the message of each IoT-MQ belongs;
correspondingly, the step of adding a tag to the message of each IoT-MQ to obtain a plurality of first tags includes:
taking the device ID corresponding to the device to which each message of the IoT-MQ belongs as a mark;
a corresponding tag is added to each IoT-MQ message to obtain a plurality of first tags.
Further, the step of storing the messages of IoT-MQ corresponding to different first hashCode in the hash slots of the second hashCode corresponding to each first hashCode includes:
and storing the information of the IoT-MQ into the information list in the corresponding hash slot according to the time sequence of storage.
Further, after the step of storing the messages of IoT-MQ corresponding to different first hashCode in the hash slots of the second hashCode corresponding to each of the first hashCode, the method includes:
Receiving a request to obtain a message of an IoT-MQ, wherein the request comprises a key;
inputting the key in the request into the preset hash algorithm for calculation, and calculating a hash code corresponding to the key in the request to obtain a target hash code;
searching the hashCode corresponding to the target hashCode in a message library according to the hashCode corresponding relation table to obtain a first target hashCode;
acquiring a hash slot of the first target hash code to obtain a first target hash slot;
and returning all the messages in the first target hash slot to the initiator of the request.
Further, after the step of storing the messages of IoT-MQ corresponding to different first hashCode in the hash slots of the second hashCode corresponding to each of the first hashCode, the method includes:
receiving a request to obtain a message of an IoT-MQ, wherein the request comprises a key and a timestamp;
inputting the key in the request into the preset hash algorithm for calculation, and calculating a hash code corresponding to the key in the request to obtain a second target hash code;
searching the hashCode corresponding to the second target hashCode in a message library according to the hashCode corresponding relation table to obtain a third target hashCode;
Obtaining a hash slot of the third target hash code to obtain a target hash slot;
judging whether the time stamp is a null value or not;
if the time stamp is null, returning all messages in the target hash slot to the initiator of the request;
and if the time stamp is not null, returning a message corresponding to the time stamp in the target hash slot to the initiator of the request.
Further, the step of returning the message corresponding to the timestamp in the target hash slot to the initiator of the request if the timestamp is not null includes:
if the time stamp is not null, searching the storage time corresponding to the time stamp from the head of the message list in the target hash slot;
when the storage time corresponding to the timestamp is found, acquiring a message corresponding to the found storage time;
and returning the acquired corresponding message to the initiator of the request.
Further, after the step of storing the messages of IoT-MQ corresponding to different first hashCode in the hash slots of the second hashCode corresponding to each of the first hashCode, the method includes:
receiving effective storage time input by a user;
Acquiring the storage time of each message of each hash slot;
judging whether the storage time of each message is within the effective storage time;
if the storage time in each message is judged to be not within the effective storage time, acquiring the message of which the storage time is not within the effective storage time, and acquiring a target message;
and deleting the target message from the corresponding hash slot.
The application also provides a message storage device of the internet of things message queue (IoT-MQ), which comprises:
the system comprises a relation table establishing module, a message storage position determining module and a message storage position determining module, wherein the relation table establishing module is used for establishing a hashCode corresponding relation table which stores the corresponding relation between hashCode calculated by a preset hash algorithm and hashCode stored in the message storage position determining module;
a marking module, configured to add a mark to each IoT-MQ message to obtain a plurality of first marks;
the computing module is used for inputting each first mark in the plurality of first marks as a key into a preset hash algorithm for computing, and computing a first hashCode corresponding to each first mark;
the searching module is used for searching a second hashCode corresponding to each first hashCode in a message library according to the hashCode corresponding relation table, and the message library is a distributed message library;
And the storage module is used for respectively storing the messages of the IoT-MQ corresponding to the different first hashCode into the hash slots of the second hashCode corresponding to each first hashCode.
The application also provides a computer device comprising a memory storing a computer program and a processor implementing the steps of any of the methods described above when the processor executes the computer program.
The application also provides a computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of the method of any of the preceding claims.
According to the technical scheme, the application has the beneficial effects that: the message marking of the IoT-MQ is carried out, the first mark is used as a key, a preset hash algorithm is used for calculation, a plurality of hash codes corresponding to the first mark are obtained, corresponding hash codes are searched in a message library, the messages of the IoT-MQ are respectively stored in the hash slots of the corresponding hash codes in the message library, the message library is used for storage, the message library is distributed and highly reliable, the reliability of storing a large number of messages is guaranteed, and the problems of poor message storage performance due to the fact that a relational database is used for storing a large number of messages are solved.
Drawings
FIG. 1 is a flow chart of a message storage method of an Internet of things message queue (IoT-MQ) provided by an embodiment of the present application;
FIG. 2 is a functional block diagram of a message storage device of an Internet of things message queue (IoT-MQ) to which an embodiment of the present application is applied;
fig. 3 is a schematic block diagram of a computer device to which an embodiment of the present application is applied.
Detailed Description
The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
As shown in fig. 1, an embodiment of the present application proposes a message storage method of an internet of things message queue IoT-MQ, the method comprising the following steps:
step S101, a hashCode corresponding relation table is established, and the hashCode corresponding relation table stores the corresponding relation between hashCode calculated through a preset hash algorithm and hashCode used for determining storage positions of messages.
The corresponding relation between one hash code and the other hash code is stored in the corresponding relation table of the hash codes, wherein one hash code is calculated through a preset hash algorithm, and the other hash code is used for storing an information of the IoT-MQ.
Step S102, adding marks to each message of the IoT-MQ to obtain a plurality of first marks.
When an IoT-MQ receives the messages, a tag is added to each IoT-MQ message, and after the tagging is completed, a plurality of first tags are obtained.
In the present embodiment, before step S102, it includes:
detecting whether the IoT-MQ receives the message;
if it is detected that the IoT-MQ receives the message, a signal to add a tag to the IoT-MQ message is triggered.
In this embodiment, the first tag is a category tag, e.g., topic, identifying which category of message the message belongs to.
In some embodiments, the first tag is a device tag, such as a device ID, identifying which device the message belongs to.
In some embodiments, prior to step S102, comprising:
identifying a device to which each IoT-MQ message belongs;
and acquiring the device ID corresponding to the device to which each message of the IoT-MQ belongs according to the device to which the message of each IoT-MQ belongs.
Identifying the message of each IoT-MQ, identifying the device to which the message of each IoT-MQ belongs, and acquiring the device ID corresponding to the device to which the message of each IoT-MQ belongs according to the device to which the message of each IoT-MQ belongs after identifying the device to which the message of each IoT-MQ belongs.
Correspondingly, in step S102, it includes:
taking the device ID corresponding to the device to which each message of the IoT-MQ belongs as a mark;
a corresponding tag is added to each IoT-MQ message to obtain a plurality of first tags.
After obtaining the device ID corresponding to the device to which the message of each IoT-MQ belongs, adding the corresponding device ID to the message of each IoT-MQ, and obtaining a plurality of first marks by using the device ID as a mark.
Step S103, inputting each first mark in the plurality of first marks as a key into a preset hash algorithm for calculation, and calculating a first hashCode corresponding to each first mark.
After the plurality of first marks are obtained, each first mark in the plurality of first marks is used as a key, the key is a parameter in a hash algorithm, and the hash codes corresponding to the plurality of first marks are calculated through calculation of a preset hash algorithm, so that the first hash codes are obtained.
Step S104, searching a second hashCode corresponding to each first hashCode in a message library according to the hashCode corresponding relation table, wherein the message library is a distributed message library.
After the hashCode corresponding to the plurality of first marks is calculated, searching the corresponding hashCode in the message library according to the hashCode corresponding to the plurality of first marks, namely searching the hashCode which is the same as the hashCode corresponding to the plurality of first marks in the message library.
In this embodiment, the message library is a RocketMQ.
Step S105, storing the messages of IoT-MQ corresponding to different first hashCode in the hash slots of the second hashCode corresponding to each first hashCode.
The corresponding hashCode is found in the message library, the hash slots of the corresponding hashCode are obtained in the message library according to the corresponding relation between the hashCode corresponding to the plurality of first marks and the hashCode in the message library, and the messages of the IoT-MQ are respectively stored in the hash slots of the corresponding hashCode in the message library.
In the present embodiment, in step S105, it includes:
and storing the information of the IoT-MQ into the information list in the corresponding hash slot according to the time sequence of storage.
The message list is configured in the hash slot and is used for storing the message of the IoT-MQ, when the message of the IoT-MQ is stored in the hash slot of the corresponding hash code in the message library, the message of the IoT-MQ is stored in the message list in the corresponding hash slot according to the storage time sequence, so that the head part of the whole message queue is the latest message, and the tail part is the oldest message.
In the present embodiment, after step S105, it includes:
receiving a request to obtain a message of an IoT-MQ, wherein the request comprises a key;
Inputting the key in the request into the preset hash algorithm for calculation, and calculating a hash code corresponding to the key in the request to obtain a target hash code;
searching the hashCode corresponding to the target hashCode in a message library according to the hashCode corresponding relation table to obtain a first target hashCode;
acquiring a hash slot of the first target hash code to obtain a first target hash slot;
and returning all the messages in the first target hash slot to the initiator of the request.
A request to obtain a message of an IoT-MQ is received, the request including a key, and after the request is received, the key in the request is obtained from the request, in this embodiment, the initiator of the request may also be obtained from the request. After the key in the request is acquired, calculating a hash code corresponding to the key in the request through a preset hash algorithm, obtaining a target hash code, searching a hash code corresponding to the target hash code in a message library according to the target hash code, acquiring a hash slot in which the corresponding hash code is found according to the found corresponding hash code, obtaining a first target hash slot, and returning all messages in the first target hash slot to an initiator of the request. The hash algorithm may be MD5 or SHA-1.
After the step of obtaining the hash slot of the first target hash code to obtain the first target hash slot, the method includes:
and judging whether the first target hash slot has a message or not.
Correspondingly, the step of returning all messages in the first target hash slot to the initiator of the request includes:
and if the first target hash slot is judged to be the existence message, returning all the messages in the first target hash slot to the initiator of the request.
After the step of determining whether the first target hash slot has a message, the method includes:
and if the first target hash slot is judged to be the non-existence message, returning the information of the non-existence message in the first target hash slot to the initiator of the request.
When it is determined that the first target hash slot is a non-existence message, the request initiator needs to be notified of the fact, and then information of the non-existence message in the first target hash slot is returned to the request initiator.
In some embodiments, after step S105, comprising:
receiving a request to obtain a message of an IoT-MQ, wherein the request comprises a key and a timestamp;
inputting the key in the request into the preset hash algorithm for calculation, and calculating a hash code corresponding to the key in the request to obtain a second target hash code;
Searching the hashCode corresponding to the second target hashCode in a message library according to the hashCode corresponding relation table to obtain a third target hashCode;
obtaining a hash slot of the third target hash code to obtain a target hash slot;
judging whether the time stamp is a null value or not;
if the time stamp is null, returning all messages in the target hash slot to the initiator of the request;
and if the time stamp is not null, returning a message corresponding to the time stamp in the target hash slot to the initiator of the request.
A request to obtain a message of an IoT-MQ is received, wherein the request includes a key and a timestamp, and after the request is received, the key in the request is obtained from the request, in this embodiment, the initiator of the request may also be obtained from the request. After the key in the request is obtained, calculating the hash code corresponding to the key in the request through a preset hash algorithm, obtaining a second target hash code, searching the hash code corresponding to the second target hash code in a message library according to the second target hash code, obtaining a hash slot of the corresponding hash code according to the searched hash code, obtaining a time stamp from the request, judging the time stamp, judging whether the time stamp is null, returning all messages in the target hash slot to an initiator of the request, and returning the messages corresponding to the time stamp in the target hash slot to the initiator of the request if the time stamp is not null.
And if the timestamp is not null, returning a message corresponding to the timestamp in the target hash slot to the initiator of the request, wherein the step comprises the following steps:
if the time stamp is not null, searching the storage time corresponding to the time stamp from the head of the message list in the target hash slot;
when the storage time corresponding to the timestamp is found, acquiring a message corresponding to the found storage time;
and returning the acquired corresponding message to the initiator of the request.
If the time stamp is not null, searching from the head of the message list in the target hash slot, searching the storage time corresponding to the time stamp until the tail of the message list is searched, ending the searching, and when the storage time corresponding to the time stamp is searched, acquiring the message corresponding to the searched storage time, and returning the acquired corresponding message to the initiator of the request. If the timestamp is not null, searching from the head of the message list in the target hash slot, searching for the storage time corresponding to the timestamp, continuing searching after searching for the storage time corresponding to the timestamp, ending searching when searching for the storage time not corresponding to the timestamp, acquiring the message corresponding to the searched storage time when searching for the storage time corresponding to the timestamp, and returning the acquired corresponding message to the initiator of the request.
In the present embodiment, after step S105, it includes:
receiving effective storage time input by a user;
acquiring the storage time of each message of each hash slot;
judging whether the storage time of each message is within the effective storage time;
if the storage time in each message is judged to be not within the effective storage time, acquiring the message of which the storage time is not within the effective storage time, and acquiring a target message;
and deleting the target message from the corresponding hash slot.
In summary, for the message marking of IoT-MQ, the first mark is used as a key to calculate through a preset hash algorithm, so as to obtain a plurality of hash codes corresponding to the first mark, the corresponding hash codes are searched in the message library, the messages of each IoT-MQ are respectively stored in the hash slots of the corresponding hash codes in the message library, the message library is used for storing, the message library is distributed and highly reliable, the reliability of storing a large number of messages is ensured, and the problems of poor message storage performance due to the adoption of the relational database are solved.
As shown in fig. 2, an embodiment of the present application proposes a message storage device 1 of an internet of things message queue IoT-MQ, where the device 1 includes a relationship table establishment module 11, a marking module 12, a calculation module 13, a lookup module 14 and a storage module 15.
The relationship table establishing module 11 is configured to establish a hashCode corresponding relationship table, where the hashCode corresponding relationship table stores a corresponding relationship between hashCode calculated by a preset hash algorithm and hashCode used for determining a storage location of a message.
A tagging module 12 for adding tags to each IoT-MQ message to obtain a plurality of first tags.
When an IoT-MQ receives the messages, a tag is added to each IoT-MQ message, and after the first tags are completed, a plurality of first tags are obtained.
In this embodiment, the apparatus 1 includes:
a first detection module for detecting whether the IoT-MQ receives the message;
and the first triggering module is used for triggering a signal for adding a mark to the message of the IoT-MQ if the message is detected to be received by the IoT-MQ.
In this embodiment, the first tag is a category tag, e.g., topic, identifying which category of message the message belongs to.
In some embodiments, the first tag is a device tag, such as a device ID, identifying which device the message belongs to.
In some embodiments, the apparatus 1 comprises:
a first identifying module, configured to identify a device to which each IoT-MQ message belongs;
the first obtaining module is configured to obtain, according to a device to which the message of each IoT-MQ belongs, a device ID corresponding to the device to which the message of each IoT-MQ belongs.
Identifying the message of each IoT-MQ, identifying the device to which the message of each IoT-MQ belongs, and acquiring the device ID corresponding to the device to which the message of each IoT-MQ belongs according to the device to which the message of each IoT-MQ belongs after identifying the device to which the message of each IoT-MQ belongs.
Correspondingly, the marking module 12 comprises:
a device ID marking module, configured to use, as a mark, a device ID corresponding to a device to which each IoT-MQ message belongs;
and the first sub-marking module is used for adding corresponding marks to the message of each IoT-MQ to obtain a plurality of first marks.
After obtaining the device ID corresponding to the device to which the message of each IoT-MQ belongs, adding the corresponding device ID to the message of each IoT-MQ, and obtaining a plurality of first marks by using the device ID as a mark.
The calculating module 13 is configured to input each first mark of the plurality of first marks as a key to a preset hash algorithm for calculation, and calculate a first hash code corresponding to each first mark.
After the plurality of first marks are obtained, each first mark in the plurality of first marks is used as a key, the key is a parameter in a hash algorithm, and the hash codes corresponding to the plurality of first marks are calculated through calculation of a preset hash algorithm, so that the first hash codes are obtained.
The searching module 14 is configured to search, according to the hashCode correspondence table, a second hashCode corresponding to each of the first hashcodes in a message library, where the message library is a distributed message library.
After the hashCode corresponding to the plurality of first marks is calculated, searching the corresponding hashCode in the message library according to the hashCode corresponding to the plurality of first marks, namely searching the hashCode which is the same as the hashCode corresponding to the plurality of first marks in the message library.
In this embodiment, the message library is a RocketMQ.
A storage module 15, configured to store the messages corresponding to IoT-MQ of different first hashCode into the hash slots of the second hashCode corresponding to each of the first hashCode.
The corresponding hashCode is found in the message library, the hash slots of the corresponding hashCode are obtained in the message library according to the corresponding relation between the hashCode corresponding to the plurality of first marks and the hashCode in the message library, and the messages of the IoT-MQ are respectively stored in the hash slots of the corresponding hashCode in the message library.
In the present embodiment, the storage module 15 includes:
and the first sub-storage module is used for storing the information of the IoT-MQ into the information list in the corresponding hash slot according to the storage time sequence.
The message list is configured in the hash slot and is used for storing the message of the IoT-MQ, when the message of the IoT-MQ is stored in the hash slot of the corresponding hash code in the message library, the message of the IoT-MQ is stored in the message list in the corresponding hash slot according to the storage time sequence, so that the head part of the whole message queue is the latest message, and the tail part is the oldest message.
In this embodiment, the apparatus 1 includes:
a first receiving module to receive a request to acquire a message of an IoT-MQ, wherein the request includes a key;
the first calculation module is used for inputting the key in the request into the preset hash algorithm for calculation, and calculating the hashCode corresponding to the key in the request to obtain a target hashCode;
the first searching module is used for searching the hashCode corresponding to the target hashCode in a message library according to the hashCode corresponding relation table to obtain a first target hashCode;
the first obtaining module is used for obtaining the hash slot of the first target hash code to obtain a first target hash slot;
and the first return module is used for returning all the messages in the first target hash slot to the initiator of the request.
A request to obtain a message of an IoT-MQ is received, the request including a key, and after the request is received, the key in the request is obtained from the request, in this embodiment, the initiator of the request may also be obtained from the request. After the key in the request is acquired, calculating a hash code corresponding to the key in the request through a preset hash algorithm, obtaining a target hash code, searching a hash code corresponding to the target hash code in a message library according to the target hash code, acquiring a hash slot in which the corresponding hash code is found according to the found corresponding hash code, obtaining a first target hash slot, and returning all messages in the first target hash slot to an initiator of the request. The hash algorithm may be MD5 or SHA-1.
The apparatus 1 comprises:
and the first judging module is used for judging whether the first target hash slot has a message or not.
Correspondingly, the first return module comprises:
and the first sub-return module is used for returning all the messages in the first target hash slot to the initiator of the request if the first target hash slot is judged to be the existence message.
The apparatus 1 comprises:
and the first return module is used for returning the information of the absence message in the first target hash slot to the initiator of the request if the first target hash slot is determined to be the absence message.
When it is determined that the first target hash slot is a non-existence message, the request initiator needs to be notified of the fact, and then information of the non-existence message in the first target hash slot is returned to the request initiator.
In some embodiments, the apparatus 1 comprises:
a second receiving module for receiving a request to acquire a message of an IoT-MQ, wherein the request comprises a key and a timestamp;
a third acquisition module for
The third calculation module is used for inputting the key in the request into the preset hash algorithm for calculation, and calculating the hashCode corresponding to the key in the request to obtain a second target hashCode;
The third searching module is used for searching the hashCode corresponding to the second target hashCode in the message library to obtain a third target hashCode;
the second obtaining module is used for obtaining the hash slot of the third target hash code to obtain a target hash slot;
a fourth acquisition module for
The second judging module is used for judging whether the time stamp is a null value or not;
a third return module, configured to return all messages in the target hash slot to the initiator of the request if the timestamp is null;
and a fourth returning module, configured to return, if the timestamp is not null, a message corresponding to the timestamp in the target hash slot to the initiator of the request.
A request to obtain a message of an IoT-MQ is received, wherein the request includes a key and a timestamp, and after the request is received, the key in the request is obtained from the request, in this embodiment, the initiator of the request may also be obtained from the request. After the key in the request is obtained, calculating the hash code corresponding to the key in the request through a preset hash algorithm, obtaining a second target hash code, searching the hash code corresponding to the second target hash code in a message library according to the second target hash code, obtaining a hash slot of the corresponding hash code according to the searched hash code, obtaining a time stamp from the request, judging the time stamp, judging whether the time stamp is null, returning all messages in the target hash slot to an initiator of the request, and returning the messages corresponding to the time stamp in the target hash slot to the initiator of the request if the time stamp is not null.
The fourth return module includes:
the first sub-searching module is used for searching the storage time corresponding to the time stamp from the head of the message list in the target hash slot if the time stamp is not null;
the first sub-acquisition module is used for acquiring a message corresponding to the searched storage time when the storage time corresponding to the time stamp is searched;
and the first sub-return module is used for returning the acquired corresponding message to the initiator of the request.
If the time stamp is not null, searching from the head of the message list in the target hash slot, searching the storage time corresponding to the time stamp until the tail of the message list is searched, ending the searching, and when the storage time corresponding to the time stamp is searched, acquiring the message corresponding to the searched storage time, and returning the acquired corresponding message to the initiator of the request. If the timestamp is not null, searching from the head of the message list in the target hash slot, searching for the storage time corresponding to the timestamp, continuing searching after searching for the storage time corresponding to the timestamp, ending searching when searching for the storage time not corresponding to the timestamp, acquiring the message corresponding to the searched storage time when searching for the storage time corresponding to the timestamp, and returning the acquired corresponding message to the initiator of the request.
In this embodiment, the apparatus 1 includes:
the fourth receiving module is used for receiving the effective storage time input by the user;
a fifth obtaining module, configured to obtain a storage time of each message of each hash slot;
the third judging module is used for judging whether the storage time of each message is within the effective storage time;
a sixth obtaining module, configured to obtain a target message if it is determined that the storage time in each message is not within the valid storage time, where the storage time is not within the valid storage time;
and the first deleting module is used for deleting the target message from the corresponding hash slot.
In summary, for the message marking of IoT-MQ, the first mark is used as a key to calculate through a preset hash algorithm, so as to obtain a plurality of hash codes corresponding to the first mark, the corresponding hash codes are searched in the message library, the messages of each IoT-MQ are respectively stored in the hash slots of the corresponding hash codes in the message library, the message library is used for storing, the message library is distributed and highly reliable, the reliability of storing a large number of messages is ensured, and the problems of poor message storage performance due to the adoption of the relational database are solved.
As shown in fig. 3, in an embodiment of the present application, a computer device is further provided, where the computer device may be a server, and the internal structure of the computer device may be as shown in fig. 3. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the computer is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, computer programs, and a database. The memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The database of the computer device is used for storing data such as models of message storage methods of the internet of things message queue IoT-MQ. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program, when executed by a processor, implements a message storage method for an internet of things message queue IoT-MQ.
The processor executes the steps of the message storage method of the internet of things message queue IoT-MQ: establishing a hashCode corresponding relation table, wherein the hashCode corresponding relation table stores the corresponding relation between hashCode calculated by a preset hash algorithm and hashCode used for determining a storage position of a message; adding a tag to each IoT-MQ message to obtain a plurality of first tags; inputting each first mark in the plurality of first marks as a key into a preset hash algorithm for calculation, and calculating a first hash code corresponding to each first mark; searching a second hashCode corresponding to each first hashCode in a message library according to the hashCode corresponding relation table, wherein the message library is a distributed message library; and storing the information of the IoT-MQ corresponding to the different first hashCode into the hash slots of the second hashCode corresponding to each first hashCode respectively.
In one embodiment, before the step of adding the tag to the message of each IoT-MQ to obtain the plurality of first tags, the method further includes:
identifying a device to which each IoT-MQ message belongs;
acquiring a device ID corresponding to the device to which each message of the IoT-MQ belongs according to the device to which the message of each IoT-MQ belongs;
Correspondingly, the step of adding a tag to the message of each IoT-MQ to obtain a plurality of first tags includes:
taking the device ID corresponding to the device to which each message of the IoT-MQ belongs as a mark;
adding a corresponding tag to each IoT-MQ message, the obtaining a plurality of first tags.
In one embodiment, the step of storing the messages corresponding to IoT-MQ of different first hashCode in the hash slots of the second hashCode corresponding to each of the first hashCode includes:
and storing the information of the IoT-MQ into the information list in the corresponding hash slot according to the time sequence of storage.
In one embodiment, after the step of storing the messages corresponding to IoT-MQ of different first hashCode in the hash slots of the second hashCode corresponding to each of the first hashCode, the method includes:
receiving a request to obtain a message of an IoT-MQ, wherein the request comprises a key;
inputting the key in the request into the preset hash algorithm for calculation, and calculating a hash code corresponding to the key in the request to obtain a target hash code;
searching the hashCode corresponding to the target hashCode in a message library according to the hashCode corresponding relation table to obtain a first target hashCode;
Acquiring a hash slot of the first target hash code to obtain a first target hash slot;
and returning all the messages in the first target hash slot to the initiator of the request.
In one embodiment, after the step of storing the messages corresponding to IoT-MQ of different first hashCode in the hash slots of the second hashCode corresponding to each of the first hashCode, the method includes:
receiving a request to obtain a message of an IoT-MQ, wherein the request comprises a key and a timestamp;
inputting the key in the request into the preset hash algorithm for calculation, and calculating a hash code corresponding to the key in the request to obtain a second target hash code;
searching the hashCode corresponding to the second target hashCode in a message library according to the hashCode corresponding relation table to obtain a third target hashCode;
obtaining a hash slot of the third target hash code to obtain a target hash slot;
judging whether the time stamp is a null value or not;
if the time stamp is null, returning all messages in the target hash slot to the initiator of the request;
and if the time stamp is not null, returning a message corresponding to the time stamp in the target hash slot to the initiator of the request.
In one embodiment, the step of returning the message corresponding to the timestamp in the target hash slot to the initiator of the request if the timestamp is not null includes:
if the time stamp is not null, searching the storage time corresponding to the time stamp from the head of the message list in the target hash slot;
when the storage time corresponding to the timestamp is found, acquiring a message corresponding to the found storage time;
and returning the acquired corresponding message to the initiator of the request.
In one embodiment, after the step of storing the messages corresponding to IoT-MQ of different first hashCode in the hash slots of the second hashCode corresponding to each of the first hashCode, the method includes:
receiving effective storage time input by a user;
acquiring the storage time of each message of each hash slot;
judging whether the storage time of each message is within the effective storage time;
if the storage time in each message is judged to be not within the effective storage time, acquiring the message of which the storage time is not within the effective storage time, and acquiring a target message;
and deleting the target message from the corresponding hash slot.
It will be appreciated by those skilled in the art that the architecture shown in fig. 3 is merely a block diagram of a portion of the architecture in connection with the present inventive arrangements and is not intended to limit the computer devices to which the present inventive arrangements are applicable.
The computer equipment of the embodiment of the application marks the message of the IoT-MQ, calculates the first mark as a key through a preset hash algorithm to obtain a plurality of hash codes corresponding to the first mark, searches corresponding hash codes in a message library, respectively stores the message of each IoT-MQ in the hash slot of the corresponding hash code in the message library, adopts the message library for storage, is distributed and highly reliable, ensures the reliability of storing a large number of messages, and aims to solve the problems of storing a large number of messages by adopting a relational database and poor message storage performance.
An embodiment of the present application further provides a computer readable storage medium, on which a computer program is stored, which when executed by a processor implements a message storage method of an internet of things message queue IoT-MQ, specifically: establishing a hashCode corresponding relation table, wherein the hashCode corresponding relation table stores the corresponding relation between hashCode calculated by a preset hash algorithm and hashCode used for determining a storage position of a message; adding a tag to each IoT-MQ message to obtain a plurality of first tags; inputting each first mark in the plurality of first marks as a key into a preset hash algorithm for calculation, and calculating a first hash code corresponding to each first mark; searching a second hashCode corresponding to each first hashCode in a message library, wherein the message library is a distributed message library; and storing the information of the IoT-MQ corresponding to the different first hashCode into the hash slots of the second hashCode corresponding to each first hashCode respectively.
In one embodiment, before the step of adding the tag to the message of each IoT-MQ to obtain the plurality of first tags, the method further includes:
identifying a device to which each IoT-MQ message belongs;
acquiring a device ID corresponding to the device to which each message of the IoT-MQ belongs according to the device to which the message of each IoT-MQ belongs;
correspondingly, the step of adding a tag to the message of each IoT-MQ to obtain a plurality of first tags includes:
taking the device ID corresponding to the device to which each message of the IoT-MQ belongs as a mark;
a corresponding tag is added to each IoT-MQ message to obtain a plurality of first tags.
In one embodiment, the step of storing the messages corresponding to IoT-MQ of different first hashCode in the hash slots of the second hashCode corresponding to each of the first hashCode includes:
and storing the information of the IoT-MQ into the information list in the corresponding hash slot according to the time sequence of storage.
In one embodiment, after the step of storing the messages corresponding to IoT-MQ of different first hashCode in the hash slots of the second hashCode corresponding to each of the first hashCode, the method includes:
Receiving a request to obtain a message of an IoT-MQ, wherein the request comprises a key;
inputting the key in the request into the preset hash algorithm for calculation, and calculating a hash code corresponding to the key in the request to obtain a target hash code;
searching the hashCode corresponding to the target hashCode in a message library according to the hashCode corresponding relation table to obtain a first target hashCode;
acquiring a hash slot of the first target hash code to obtain a first target hash slot;
and returning all the messages in the first target hash slot to the initiator of the request.
In one embodiment, after the step of storing the messages corresponding to IoT-MQ of different first hashCode in the hash slots of the second hashCode corresponding to each of the first hashCode, the method includes:
receiving a request to obtain a message of an IoT-MQ, wherein the request comprises a key and a timestamp;
inputting the key in the request into the preset hash algorithm for calculation, and calculating a hash code corresponding to the key in the request to obtain a second target hash code;
searching the hashCode corresponding to the second target hashCode in a message library according to the hashCode corresponding relation table to obtain a third target hashCode;
Obtaining a hash slot of the third target hash code to obtain a target hash slot;
judging whether the time stamp is a null value or not;
if the time stamp is null, returning all messages in the target hash slot to the initiator of the request;
and if the time stamp is not null, returning a message corresponding to the time stamp in the target hash slot to the initiator of the request.
In one embodiment, the step of returning the message corresponding to the timestamp in the target hash slot to the initiator of the request if the timestamp is not null includes:
if the time stamp is not null, searching the storage time corresponding to the time stamp from the head of the message list in the target hash slot;
when the storage time corresponding to the timestamp is found, acquiring a message corresponding to the found storage time;
and returning the acquired corresponding message to the initiator of the request.
In one embodiment, after the step of storing the messages corresponding to IoT-MQ of different first hashCode in the hash slots of the second hashCode corresponding to each of the first hashCode, the method includes:
Receiving effective storage time input by a user;
acquiring the storage time of each message of each hash slot;
judging whether the storage time of each message is within the effective storage time;
if the storage time in each message is judged to be not within the effective storage time, acquiring the message of which the storage time is not within the effective storage time, and acquiring a target message;
and deleting the target message from the corresponding hash slot.
According to the storage medium, the message of the IoT-MQ is marked, the first marks are used as keys and calculated through a preset hash algorithm, the hashCode corresponding to the first marks is obtained, the corresponding hashCode is searched in the message library, the messages of the IoT-MQ are respectively stored in the hash slots of the hashCode corresponding to the message library, the message library is used for storage, the message library is distributed and highly reliable, the reliability of storing a large number of messages is guaranteed, and the problems that the relational database is used for storing a large number of messages and the message storage performance is poor are solved.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium provided by the present application and used in embodiments may include non-volatile and/or volatile memory. The nonvolatile memory can include Read Only Memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), dual speed data rate SDRAM (SSRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), memory bus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.
The foregoing description of the preferred embodiment of the application is not intended to be limiting, but rather is intended to cover all modifications, equivalents, and alternatives falling within the spirit and principles of the application.

Claims (10)

1. A method for storing messages in an internet of things message queue IoT-MQ, the method comprising:
establishing a hashCode corresponding relation table, wherein the hashCode corresponding relation table stores the corresponding relation between hashCode calculated by a preset hash algorithm and hashCode used for determining a storage position of a message;
adding a tag to each IoT-MQ message to obtain a plurality of first tags;
inputting each first mark in the plurality of first marks as a key into the preset hash algorithm for calculation, and calculating a first hashCode corresponding to each first mark;
searching a second hashCode corresponding to each first hashCode in a message library according to the hashCode corresponding relation table, wherein the message library is a distributed message library;
and storing the information of the IoT-MQ corresponding to the different first hashCode into the hash slots of the second hashCode corresponding to each first hashCode respectively.
2. The method for message storage of an internet of things message queue IoT-MQ in accordance with claim 1, comprising, prior to the step of adding a tag to each message of the IoT-MQ to obtain a plurality of first tags:
identifying a device to which each IoT-MQ message belongs;
acquiring a device ID corresponding to the device to which each message of the IoT-MQ belongs according to the device to which the message of each IoT-MQ belongs;
in the step of adding a tag to each IoT-MQ message to obtain a plurality of first tags, the method comprises:
taking the device ID corresponding to the device to which each message of the IoT-MQ belongs as a mark;
a corresponding tag is added to each IoT-MQ message to obtain a plurality of first tags.
3. The method for storing messages in IoT-MQ in an internet of things message queue according to claim 1, wherein the step of storing the messages in IoT-MQ corresponding to different first hashCode in the hash slots of the second hashCode corresponding to each of the first hashCode comprises:
and storing the information of the IoT-MQ into the information list in the corresponding hash slot according to the time sequence of storage.
4. The method for storing messages in IoT-MQ in an internet of things message queue according to claim 1, wherein after the step of storing the messages in IoT-MQ corresponding to different first hashCode in hash slots of second hashCode corresponding to each of the first hashCode, respectively, the method comprises:
Receiving a request to obtain a message of an IoT-MQ, wherein the request comprises a key;
inputting the key in the request into the preset hash algorithm for calculation, and calculating a hash code corresponding to the key in the request to obtain a target hash code;
searching the hashCode corresponding to the target hashCode in a message library according to the hashCode corresponding relation table to obtain a first target hashCode;
acquiring a hash slot of the first target hash code to obtain a first target hash slot;
and returning all the messages in the first target hash slot to the initiator of the request.
5. The method for storing messages in IoT-MQ in an internet of things message queue according to claim 1, wherein after the step of storing the messages in IoT-MQ corresponding to different first hashCode in hash slots of second hashCode corresponding to each of the first hashCode, respectively, the method comprises:
receiving a request to obtain a message of an IoT-MQ, wherein the request comprises a key and a timestamp;
inputting the key in the request into the preset hash algorithm for calculation, and calculating a hash code corresponding to the key in the request to obtain a second target hash code;
searching the hashCode corresponding to the second target hashCode in a message library according to the hashCode corresponding relation table to obtain a third target hashCode;
Obtaining a hash slot of the third target hash code to obtain a target hash slot;
judging whether the time stamp is a null value or not;
if the time stamp is null, returning all messages in the target hash slot to the initiator of the request;
and if the time stamp is not null, returning a message corresponding to the time stamp in the target hash slot to the initiator of the request.
6. The method for storing messages in the internet of things message queue IoT-MQ in accordance with claim 5, wherein the step of returning the message corresponding to the timestamp in the target hash slot to the originator of the request if the timestamp is not null comprises:
if the time stamp is not null, searching the storage time corresponding to the time stamp from the head of the message list in the target hash slot;
when the storage time corresponding to the timestamp is found, acquiring a message corresponding to the found storage time;
and returning the acquired corresponding message to the initiator of the request.
7. The method for storing messages in IoT-MQ in an internet of things message queue according to claim 1, wherein after the step of storing the messages in IoT-MQ corresponding to different first hashCode in hash slots of second hashCode corresponding to each of the first hashCode, respectively, the method comprises:
Receiving effective storage time input by a user;
acquiring the storage time of each message of each hash slot;
judging whether the storage time of each message is within the effective storage time;
if the storage time in each message is judged to be not within the effective storage time, acquiring the message of which the storage time is not within the effective storage time, and acquiring a target message;
and deleting the target message from the corresponding hash slot.
8. A message storage device of an internet of things message queue IoT-MQ, the device comprising:
the system comprises a relation table establishing module, a message storage position determining module and a message storage position determining module, wherein the relation table establishing module is used for establishing a hashCode corresponding relation table which stores the corresponding relation between hashCode calculated by a preset hash algorithm and hashCode stored in the message storage position determining module;
a marking module, configured to add a mark to each IoT-MQ message to obtain a plurality of first marks;
the computing module is used for inputting each first mark in the plurality of first marks as a key into a preset hash algorithm for computing, and computing a first hashCode corresponding to each first mark;
the searching module is used for searching a second hashCode corresponding to each first hashCode in a message library according to the hashCode corresponding relation table, and the message library is a distributed message library;
And the storage module is used for respectively storing the messages of the IoT-MQ corresponding to the different first hashCode into the hash slots of the second hashCode corresponding to each first hashCode.
9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 7 when the computer program is executed.
10. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 7.
CN201910394580.XA 2019-05-13 2019-05-13 Message storage method, device, computer equipment and storage medium of IoT-MQ Active CN110245028B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201910394580.XA CN110245028B (en) 2019-05-13 2019-05-13 Message storage method, device, computer equipment and storage medium of IoT-MQ
PCT/CN2019/118172 WO2020228287A1 (en) 2019-05-13 2019-11-13 Iot-mq message storage method, device, computer apparatus and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910394580.XA CN110245028B (en) 2019-05-13 2019-05-13 Message storage method, device, computer equipment and storage medium of IoT-MQ

Publications (2)

Publication Number Publication Date
CN110245028A CN110245028A (en) 2019-09-17
CN110245028B true CN110245028B (en) 2023-08-25

Family

ID=67884275

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910394580.XA Active CN110245028B (en) 2019-05-13 2019-05-13 Message storage method, device, computer equipment and storage medium of IoT-MQ

Country Status (2)

Country Link
CN (1) CN110245028B (en)
WO (1) WO2020228287A1 (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110245028B (en) * 2019-05-13 2023-08-25 平安科技（深圳）有限公司 Message storage method, device, computer equipment and storage medium of IoT-MQ
CN110928609B (en) * 2020-01-20 2020-06-16 武汉斗鱼鱼乐网络科技有限公司 Method, device and medium for marking equipment and computer equipment
CN112769924B (en) * 2020-12-31 2022-04-15 平安科技（深圳）有限公司 Distributed deployment method, device, equipment and medium of RocktMQ
CN115065647B (en) * 2022-06-20 2024-04-16 中银金融科技有限公司 Data calculation method and device and electronic equipment

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103503388A (en) * 2011-09-01 2014-01-08 华为技术有限公司 Distributed queue message reading method, device and system
CN103761141A (en) * 2013-12-13 2014-04-30 北京奇虎科技有限公司 Method and device for realizing message queue
CN105516367A (en) * 2016-02-02 2016-04-20 北京百度网讯科技有限公司 Distributed data storage system, method and device
CN106055630A (en) * 2016-05-27 2016-10-26 北京小米移动软件有限公司 Log storage method and device
CN109739930A (en) * 2018-12-19 2019-05-10 平安普惠企业管理有限公司 Date storage method, device based on distributed cache system, computer equipment

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120110343A1 (en) * 2010-10-29 2012-05-03 Bandic Zvonimir Z Trustworthy timestamps on data storage devices
US9043334B2 (en) * 2012-12-26 2015-05-26 Industrial Technology Research Institute Method and system for accessing files on a storage system
US9652310B1 (en) * 2013-09-30 2017-05-16 EMC IP Holding Company LLC Method and apparatus for using consistent-hashing to ensure proper sequencing of message processing in a scale-out environment
CN104536958B (en) * 2014-09-26 2018-03-16 杭州华为数字技术有限公司 A kind of composite index method and device
US10230681B2 (en) * 2015-12-14 2019-03-12 International Business Machines Corporation Method and apparatus for unified message adaptation
CN108833438B (en) * 2018-07-18 2020-04-14 电子科技大学 Block chain-based industrial Internet of things information secure storage method
CN109274730B (en) * 2018-09-04 2021-07-23 上海联寓智能科技有限公司 Internet of things system, MQTT message transmission optimization method and device
CN110245028B (en) * 2019-05-13 2023-08-25 平安科技（深圳）有限公司 Message storage method, device, computer equipment and storage medium of IoT-MQ

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103503388A (en) * 2011-09-01 2014-01-08 华为技术有限公司 Distributed queue message reading method, device and system
CN103761141A (en) * 2013-12-13 2014-04-30 北京奇虎科技有限公司 Method and device for realizing message queue
CN105516367A (en) * 2016-02-02 2016-04-20 北京百度网讯科技有限公司 Distributed data storage system, method and device
CN106055630A (en) * 2016-05-27 2016-10-26 北京小米移动软件有限公司 Log storage method and device
CN109739930A (en) * 2018-12-19 2019-05-10 平安普惠企业管理有限公司 Date storage method, device based on distributed cache system, computer equipment

Also Published As

Publication number Publication date
CN110245028A (en) 2019-09-17
WO2020228287A1 (en) 2020-11-19

Similar Documents

Publication Publication Date Title
CN110245028B (en) Message storage method, device, computer equipment and storage medium of IoT-MQ
CN109741060B (en) Information inquiry system, method, device, electronic equipment and storage medium
AU2016382908A1 (en) Short link processing method, device and server
US11176110B2 (en) Data updating method and device for a distributed database system
US11113199B2 (en) Low-overhead index for a flash cache
CN105243060A (en) Picture retrieval method and apparatus
US20200349113A1 (en) File storage method, deletion method, server and storage medium
WO2019148712A1 (en) Phishing website detection method, device, computer equipment and storage medium
CN104679830A (en) File processing method and device
CN109756563B (en) Information pushing method and device, computer equipment and storage medium
CN111258956B (en) Method and device for prereading far-end mass data files
CN111767297B (en) Big data processing method, device, equipment and medium
JP2020057416A (en) Method and device for processing data blocks in distributed database
CN109656474B (en) Data storage method and device, computer equipment and storage medium
CN109302433B (en) Method, device, equipment and storage medium for detecting remote command execution vulnerability
CN109271383B (en) Dynamic label processing method and device, computer equipment and storage medium
CN112162991B (en) Intelligent management method and device for data
CN109379640B (en) Bullet screen checking method and device based on linked list mode, terminal and storage medium
CN114253776A (en) Memory detection model training method, device, equipment and medium
CN113923176B (en) Message withdrawal method, device and equipment for instant messaging and computer readable medium
CN115857834B (en) Method and device for checking read-write consistency of memory
CN116028481B (en) Data quality detection method, device, equipment and storage medium
CN113407209B (en) Configuration data updating method and device
CN110727641B (en) Log searching method and device
CN114741177A (en) Information acquisition method and device

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