CN112383629A - Method for realizing high-efficiency migratable MQTT Broker subscription tree - Google Patents
Method for realizing high-efficiency migratable MQTT Broker subscription tree Download PDFInfo
- Publication number
- CN112383629A CN112383629A CN202011280427.3A CN202011280427A CN112383629A CN 112383629 A CN112383629 A CN 112383629A CN 202011280427 A CN202011280427 A CN 202011280427A CN 112383629 A CN112383629 A CN 112383629A
- Authority
- CN
- China
- Prior art keywords
- idn
- database
- key
- client
- index
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- 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/50—Network services
- H04L67/55—Push-based network services
-
- 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/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/562—Brokering proxy services
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to a technology for realizing MQTT server subscription tree, in particular to a method for realizing high-efficiency migratable MQTT Broker subscription tree, which comprises the steps of persistently storing the corresponding relation between KEY and client cis in a database, searching an array of KEY corresponding to a theme in the database by a server, and acquiring a client set through the corresponding relation between the stored KEY and the client cis to realize subscription, subscription cancellation and publication under an MQTT protocol.
Description
Technical Field
The invention relates to a technology for realizing MQTT server subscription tree, in particular to a method for realizing high-efficiency migratable MQTT Broker subscription tree.
Background
The MQTT protocol appoints that the terminal carries out message transmission through a publish-subscribe mode, the published and subscribed terminals are limited through topics, and messages sent by the client comprise topic information and client Cientid, wherein the topic information comprises topic subscription information, topic unsubscribe information and subscription publish-subscribe information. The nodes of the subscription tree store terminal information that subscribes to the path node. In the existing mode, the character strings are directly used as nodes for storage based on a memory structure, so that the occupied space is large; one theme can comprise a plurality of clients, the plurality of clients need to be locked when operating, the client 2 can operate only after the operation of the client 1 is finished, and the subscription tree efficiency is low due to difficult concurrence control; the method has the characteristics of persistent storage, and causes the problems of low subscription tree efficiency and difficult migration.
Disclosure of Invention
The technical problems solved by the invention are as follows: the invention provides a method for realizing an MQTT Broker subscription tree which is efficient and migratable, and solves the problems of low efficiency, large occupied space and difficult migration of the subscription tree under an MQTT protocol.
The invention adopts the technical scheme for solving the technical problems that: a method for realizing high-efficiency migratable MQTT Broker subscription tree includes the following steps when topic information is subscription topic information:
s101, the server receives the subscription theme information, splits the subscription theme information according to an agreed separator, and obtains a split theme TOKEN array;
s102, applying each data in the TOKEN array for a shaped inverted index respectively to obtain an index ID [ ID1, ID2, ID3, …, IDn, N ∈ N + ];
s103, searching in a database according to an element IDn in the index ID, wherein the database has a persistent storage function, if the ID corresponding to the IDn is searched in the database, feeding back the ID corresponding to the element IDn in the database, defining an array KEY, storing the ID corresponding to the IDn, establishing the corresponding relationship between the KEY and the client-side CIentid, if the corresponding relationship between the KEY and the client-side CIentid exists in the database, not storing the corresponding relationship, otherwise, storing the corresponding relationship, if the ID corresponding to the IDn is not searched in the database, applying for the database ID and storing the corresponding relationship between the KEY and the client-side CIentid, and then feeding back the corresponding ID to obtain a feedback KEY [ ID1, ID2, ID3, …, IDn, N ∈ N + ], wherein the IDn corresponds to the IDn, and if the element IDn in the index ID is a wildcard character, the applied database ID is the same wildcard character;
s104, when the elements in the KEY do not have wildcards, the server searches the corresponding relation between the KEY and the client Cientid in the database to find a corresponding client set;
s105, when elements in the KEY have wildcards, establishing a secondary cache, storing all fed-back KEY arrays which conform to the elements containing the wildcards, obtaining a set S which is { KEY1, KEY2, KEY3, …, KEYn, N which belongs to N + }, and searching the corresponding relation between KEYn and client Clientid in a database by the server side to obtain a client set corresponding to the set S.
Further, when the topic message is unsubscribe topic information, the method is characterized by comprising the following steps:
s201, the server receives the topic canceling subscription information, splits the topic canceling subscription information according to an agreed separator, and obtains a split topic TOKEN array;
s202, applying for the reshaped inverted index for each data in the TOKEN array respectively to obtain an index ID of [ ID1, ID2, ID3, …, IDn, N belongs to N + ];
s203, searching in a database according to an element IDn in the index ID, wherein the database has a persistent storage function, if the ID corresponding to the IDn is searched in the database, feeding back the ID corresponding to the element in the database, defining an array KEY, storing the ID corresponding to the IDn, obtaining the feedback KEY [ ID1, ID2, ID3, …, IDn, N belongs to N + ], wherein the IDn corresponds to the IDn, and if the ID corresponding to the IDn is not searched in the database, ending the process;
s204, if the elements in the feedback KEY do not have wildcards, directly deleting the corresponding relation between the KEY and the client Clientid;
s205, if the elements in the fed-back KEY have wildcards, establishing a secondary cache, storing all fed-back KEY arrays which conform to the elements containing the wildcards, obtaining a set S ═ { KEY1, KEY2, KEY3, …, KEYn, N ∈ N + }, and deleting the corresponding relation between all the KEY in the set S and the client Cientid.
Further, when the topic message is the publishing topic message, the method is characterized by comprising the following steps:
s301, the server receives the release topic information, splits the release topic information according to an agreed separator, and obtains a split topic TOKEN array;
s302, applying each data in the TOKEN array for a shaped inverted index respectively to obtain an index ID [ ID1, ID2, ID3, …, IDn, N ∈ N + ];
s303, searching in a database according to an element IDn in the index ID, wherein the database has a persistent storage function, if the ID corresponding to the IDn is searched in the database, feeding back the ID corresponding to the element in the database, defining an array KEY, storing the ID corresponding to the IDn, and obtaining a feedback KEY [ ID1, ID2, ID3, …, IDn, N belongs to N + ], wherein the IDn corresponds to the IDn;
s304, if the KEY does not contain the wildcard character, the server searches the corresponding relation between the KEY and the client Cientid in the database to find a client set corresponding to the KEY, and issues information to all the clients in the client set;
s305, if the KEY contains the wildcard, establishing a secondary cache, storing all fed-back KEY arrays conforming to the wildcard, obtaining a set S ═ { KEY1, KEY2, KEY3, …, KEYn, N ∈ N + }, searching the corresponding relation between the KEY and the client Cientid in a database by a server side, finding a client set corresponding to the set S, and issuing information to all clients in the client set.
Further, the agreed delimiter includes the symbol "/".
Further, the index ID ═ ID1, ID2, ID3, …, IDn, N ∈ N + ], where N is the subscription depth, and the search is performed as an additional index.
Further, the database includes a Mysql database or a Redis database.
Further, the id is a number.
Further, the second-level cache adopts a SET data structure.
The invention has the beneficial effects that: the invention relates to a method for realizing an MQTT Broker subscription tree capable of realizing high efficiency and transference, which comprises the steps of persistently storing a corresponding relation between KEY and client cis-ID through a database, searching an array of KEY corresponding to a theme in the database, and acquiring a client set through the stored corresponding relation between the KEY and the client cis-ID to realize message transmission under an MQTT protocol.
Drawings
FIG. 1 shows the steps of subscribing topics of an implementation method of an efficiently migratable MQTT Broker subscription tree according to the present invention.
FIG. 2 shows the steps of removing subscription topics in the implementation method of the invention for an efficient migratable MQTT Broker subscription tree.
FIG. 3 shows the topic publishing step of the implementation method of the high-efficiency migratable MQTT Broker subscription tree of the present invention.
Detailed Description
As shown in fig. 1, a server receives subscription topic information, splits a topic according to an agreed separator, obtains a TOKEN array ID, searches IDn corresponding to an element IDn of the ID in a database, applies for a new ID if the IDn is not found, obtains an array KEY composed of IDn, stores a corresponding relationship between the KEY and a client Cientid, judges whether the KEY contains a wildcard or not, finds a corresponding client set through the KEY if the KEY does not contain the wildcard, establishes a secondary buffer if the KEY contains the wildcard, stores a set conforming to the KEY containing the wildcard, and finds a client set corresponding to a set S through the KEY.
Specifically, the server receives the subscription topic information sent by the client, splits the subscription topic information according to an agreed separator "/", obtains a split topic TOKEN array, applies each data in the TOKEN array to a shaped inverted index respectively, obtains an index ID of [ ID1, ID2, ID3, …, IDn, N ∈ N + ], searches in the database according to an element IDn in the index ID, feeds back an ID corresponding to the element IDn in the database, establishes a corresponding relationship between the KEY and the client cintid if the ID corresponding to the IDn is searched in the database, does not store the corresponding relationship if the ID corresponding to the IDn is not searched in the database, applies for the database ID and stores the corresponding relationship between the KEY and the client cintid, and feeds back the corresponding ID if the ID corresponding to the IDn is not searched in the database, obtaining feedback KEY [ ID1, ID2, ID3, …, IDn, N ∈ N + ], wherein the IDn corresponds to the IDn, if the element IDn in the index ID is a wildcard, the applied database ID is the same wildcard, if the element in the feedback KEY has a wildcard, a secondary cache is established, all fed-back KEY arrays conforming to the wildcard are stored, a set S [ { KEY1, KEY2, KEY3, …, KEYn, N ∈ N + } is obtained, the server obtains a client set corresponding to the set S by searching the stored KEY and the client Cientid, and if the element in the fed-back KEY has no wildcard, the server obtains the client set corresponding to the feedback KEY by searching the stored KEY and the client Cientid.
As shown in fig. 2, the server receives unsubscribe topic information sent by the client, splits the topic according to an agreed separator to obtain a TOKEN array ID, searches IDn corresponding to an element IDn of the ID in the database, if not, ends the process, if so, obtains an array KEY composed of IDn, next, judges whether the KEY contains wildcard characters, if so, establishes a secondary buffer, stores a set conforming to the KEY containing wildcard characters, then finds a client set corresponding to the set S through the KEY, deletes the corresponding relationship between all the KEYs in the set S and the client Clientid, and if not, finds a corresponding client set through the KEY, deletes the corresponding relationship between the KEY and the client Clientid.
Specifically, the server receives the topic information of canceling the subscription, splits the topic information of canceling the subscription according to the appointed delimiter "/", and obtains a split topic TOKEN array; applying each data in the TOKEN array for the shaped inverted index respectively, obtaining index ID [ ID1, ID2, ID3, …, IDn, N ∈ N + ], according to the element IDn in the index ID, searching in a database, if the id corresponding to the IDn is searched in the database, feeding back the id corresponding to the element in the database to obtain feedback KEY [ id1, id2, id3, …, IDn, N ∈ N + ], wherein IDn corresponds to IDn, if there is no id corresponding to IDn in the database, ending, next step, if the elements in the feedback KEY have no wildcard characters, directly deleting the corresponding relation between the KEY and the client Clientid, if the elements in the fed-back KEY have wildcards, establishing a secondary cache, storing all fed-back KEY arrays which conform to the elements containing the wildcards, obtaining a set S which is { KEY1, KEY2, KEY3, …, KEYn, N which belongs to N + }, and deleting the corresponding relation between all the KEY in the set S and the client Cientid.
As shown in fig. 3, the server receives the publish-subscribe topic information sent by the client, splits the topic according to the agreed separator, obtains a TOKEN array ID, searches IDn corresponding to the ID element IDn in the database, obtains an array KEY composed of IDn, next, determines whether the KEY contains wildcards, if the KEY contains wildcards, establishes a secondary buffer, stores a set S corresponding to the KEY containing wildcards, then finds a client set corresponding to the set S according to the corresponding relationship between the KEY and the client Clientid, and if the KEY does not contain wildcards, finds a client set corresponding to the KEY according to the corresponding relationship between the KEY and the client Clientid.
Specifically, the server receives the published topic information, splits the published topic information according to an agreed delimiter "/", obtains a split topic TOKEN array, applies each data in the TOKEN array to a reshaped inverted index respectively, obtains an index ID [ [ ID1, ID2, ID3, …, IDn, N ∈ N + ], searches in the database according to an element IDn in the index ID, and feeds back an ID corresponding to the element in the database if an ID corresponding to the IDn is searched in the database, and obtains a feedback KEY [ [ ID1, ID2, ID3, …, IDn, N ∈ N + ], wherein the IDn corresponds to the IDn; and next, if the KEY does not contain the wildcard, the server searches the corresponding relation between the KEY and the client Cientid in the database to find a client set corresponding to the KEY, and issues information to all the clients in the client set, if the KEY contains the wildcard, a secondary cache is established, all fed-back KEY arrays conforming to the wildcard are stored, a set S { KEY1, KEY2, KEY3, …, KEYn, N ∈ N + } is obtained, the server searches the corresponding relation between the KEY and the client Cientid in the database to find the client set corresponding to the set S, and issues information to all the clients in the client set.
Further, N in the index ID [ ID1, ID2, ID3, …, IDn, N ∈ N + ] is a subscription depth, which is used as an additional index for searching KEY in the database, specifically, all KEY with the same subscription depth are searched to form a set, and then a specific KEY is searched in the set.
Specifically, the database uses a Mysql database or a Redis database, and the secondary cache adopts an SET data structure.
Claims (9)
1. A method for realizing high-efficiency migratable MQTT Broker subscription tree, wherein messages sent by a client comprise topic information and client Cientid, and the topic information is subscription topic information, and the method is characterized by comprising the following steps:
s101, the server receives the subscription theme information, splits the subscription theme information according to an agreed separator, and obtains a split theme TOKEN array;
s102, applying each data in the TOKEN array for a shaped inverted index respectively to obtain an index ID [ ID1, ID2, ID3, …, IDn, N ∈ N + ];
s103, searching in a database according to an element IDn in the index ID, wherein the database has a persistent storage function, if the ID corresponding to the IDn is searched in the database, feeding back the ID corresponding to the element IDn in the database, defining an array KEY, storing the ID corresponding to the IDn, establishing the corresponding relationship between the KEY and the client-side CIentid, if the corresponding relationship between the KEY and the client-side CIentid exists in the database, not storing the corresponding relationship, otherwise, storing the corresponding relationship, if the ID corresponding to the IDn is not searched in the database, applying for the database ID and storing the corresponding relationship between the KEY and the client-side CIentid, and then feeding back the corresponding ID to obtain a feedback KEY [ ID1, ID2, ID3, …, IDn, N ∈ N + ], wherein the IDn corresponds to the IDn, and if the element IDn in the index ID is a wildcard character, the applied database ID is the same wildcard character;
s104, when the elements in the KEY do not have wildcards, the server searches the corresponding relation between the KEY and the client Cientid in the database to find a corresponding client set;
s105, when elements in the KEY have wildcards, establishing a secondary cache, storing all fed-back KEY arrays which conform to the elements containing the wildcards, obtaining a set S which is { KEY1, KEY2, KEY3, …, KEYn, N which belongs to N + }, and searching the corresponding relation between KEYn and client Clientid in a database by the server side to obtain a client set corresponding to the set S.
2. The method of claim 1, wherein the agreed separator includes the symbol "/"; the database comprises a Mysql database or a Redis database; the id is a number; the second-level cache adopts a SET data structure.
3. The implementation method of MQTT Broker subscription tree with efficient migratability according to claim 1, wherein the index ID ═ ID1, ID2, ID3, …, IDn, N ∈ N + ], where N is subscription depth, is searched as an additional index.
4. A method for realizing high-efficiency migratable MQTT Broker subscription tree, wherein messages sent by a client comprise topic information and client Cientid, and the topic information is unsubscribe topic information, and the method is characterized by comprising the following steps:
s201, the server receives the topic canceling subscription information, splits the topic canceling subscription information according to an agreed separator, and obtains a split topic TOKEN array;
s202, applying for the reshaped inverted index for each data in the TOKEN array respectively to obtain an index ID of [ ID1, ID2, ID3, …, IDn, N belongs to N + ];
s203, searching in a database according to an element IDn in the index ID, wherein the database has a persistent storage function, if the ID corresponding to the IDn is searched in the database, feeding back the ID corresponding to the element in the database, defining an array KEY, storing the ID corresponding to the IDn, obtaining the feedback KEY [ ID1, ID2, ID3, …, IDn, N belongs to N + ], wherein the IDn corresponds to the IDn, and if the ID corresponding to the IDn is not searched in the database, ending the process;
s204, if the elements in the feedback KEY do not have wildcards, directly deleting the corresponding relation between the KEY and the client Clientid;
s205, if the elements in the fed-back KEY have wildcards, establishing a secondary cache, storing all fed-back KEY arrays which conform to the elements containing the wildcards, obtaining a set S ═ { KEY1, KEY2, KEY3, …, KEYn, N ∈ N + }, and deleting the corresponding relation between all the KEY in the set S and the client Cientid.
5. The method of claim 4, wherein the agreed separator includes the symbol "/"; the database comprises a Mysql database or a Redis database; the id is a number; the second-level cache adopts a SET data structure.
6. The implementation method of claim 4, wherein the index ID is [ ID1, ID2, ID3, …, IDn, N ∈ N + ], where N is subscription depth, and is searched as an additional index.
7. A method for realizing high-efficiency migratable MQTT Broker subscription tree, wherein messages sent by a client comprise topic information and client Cientid, and the topic information is published topic information, and the method is characterized by comprising the following steps:
s301, the server receives the release topic information, splits the release topic information according to an agreed separator, and obtains a split topic TOKEN array;
s302, applying each data in the TOKEN array for a shaped inverted index respectively to obtain an index ID [ ID1, ID2, ID3, …, IDn, N ∈ N + ];
s303, searching in a database according to an element IDn in the index ID, wherein the database has a persistent storage function, if the ID corresponding to the IDn is searched in the database, feeding back the ID corresponding to the element in the database, defining an array KEY, storing the ID corresponding to the IDn, and obtaining a feedback KEY [ ID1, ID2, ID3, …, IDn, N belongs to N + ], wherein the IDn corresponds to the IDn;
s304, if the KEY does not contain the wildcard character, the server searches the corresponding relation between the KEY and the client Cientid in the database to find a client set corresponding to the KEY, and issues information to all the clients in the client set;
s305, if the KEY contains the wildcard, establishing a secondary cache, storing all fed-back KEY arrays conforming to the wildcard, obtaining a set S ═ { KEY1, KEY2, KEY3, …, KEYn, N ∈ N + }, searching the corresponding relation between the KEY and the client Cientid in a database by a server side, finding a client set corresponding to the set S, and issuing information to all clients in the client set.
8. The method of claim 7, wherein the agreed separator includes the symbol "/"; the database comprises a Mysql database or a Redis database; the id is a number; the second-level cache adopts a SET data structure.
9. The implementation method of claim 7, wherein the index ID is [ ID1, ID2, ID3, …, IDn, N ∈ N + ], where N is subscription depth, and is searched as an additional index.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011280427.3A CN112383629B (en) | 2020-11-16 | 2020-11-16 | Method for realizing high-efficiency migratable MQTT Broker subscription tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011280427.3A CN112383629B (en) | 2020-11-16 | 2020-11-16 | Method for realizing high-efficiency migratable MQTT Broker subscription tree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112383629A true CN112383629A (en) | 2021-02-19 |
| CN112383629B CN112383629B (en) | 2022-02-01 |
Family
ID=74584763
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011280427.3A Active CN112383629B (en) | 2020-11-16 | 2020-11-16 | Method for realizing high-efficiency migratable MQTT Broker subscription tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112383629B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120233268A1 (en) * | 2011-03-11 | 2012-09-13 | International Business Machines Corporation | Publish/subscribe message routing |
| US20160065657A1 (en) * | 2014-08-29 | 2016-03-03 | International Business Machines Corporation | Message and subscription information processing |
| CN106130882A (en) * | 2016-07-13 | 2016-11-16 | 北京百度网讯科技有限公司 | For the method and apparatus transmitting message |
| US20170244657A1 (en) * | 2016-02-22 | 2017-08-24 | International Business Machines Corporation | Message delivery in a message system |
| CN108494815A (en) * | 2018-02-06 | 2018-09-04 | 北京极智感科技有限公司 | A kind of method and system of transmission message |
| CN109862063A (en) * | 2018-11-12 | 2019-06-07 | 平安科技（深圳）有限公司 | Distribution subscription matching process, device and storage medium based on MQTT |
-
2020
- 2020-11-16 CN CN202011280427.3A patent/CN112383629B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120233268A1 (en) * | 2011-03-11 | 2012-09-13 | International Business Machines Corporation | Publish/subscribe message routing |
| US20160065657A1 (en) * | 2014-08-29 | 2016-03-03 | International Business Machines Corporation | Message and subscription information processing |
| US20170244657A1 (en) * | 2016-02-22 | 2017-08-24 | International Business Machines Corporation | Message delivery in a message system |
| CN106130882A (en) * | 2016-07-13 | 2016-11-16 | 北京百度网讯科技有限公司 | For the method and apparatus transmitting message |
| CN108494815A (en) * | 2018-02-06 | 2018-09-04 | 北京极智感科技有限公司 | A kind of method and system of transmission message |
| CN109862063A (en) * | 2018-11-12 | 2019-06-07 | 平安科技（深圳）有限公司 | Distribution subscription matching process, device and storage medium based on MQTT |
Non-Patent Citations (2)
| Title |
|---|
| 三颗豆子: "MQTT Broker数据结构：订阅树", 《URL:HTTP://WWW.BEWINDOWEB.COM/268.HTML》 * |
| 李娜等: "MQTT数据交换协议的分析与优化", 《网络空间安全》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112383629B (en) | 2022-02-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102029277B1 (en) | Device Identifier-Dependent Operation Processing for Packet-Based Data Communications | |
| CN110557423B (en) | Message pushing method and system | |
| CA3131954C (en) | Information synchronization method, system, apparatus, computer device and storage medium | |
| Gai et al. | Broose: a practical distributed hashtable based on the de-bruijn topology | |
| CN103248645A (en) | BT (Bit Torrent) off-line data downloading system and method | |
| CN108874946B (en) | ID management method and device | |
| CN111651476A (en) | Quick matching method and system for MQTT theme in gateway of Internet of things | |
| CN103326925B (en) | A kind of information push method and device | |
| CN101330431B (en) | Method and system for storing instant information | |
| CN103024085A (en) | System and method for processing P2P (peer-to-peer) node request | |
| EP2747336A1 (en) | Content processing method, device and system | |
| US20220166842A1 (en) | Data distribution method and electronic device | |
| CN112383629B (en) | Method for realizing high-efficiency migratable MQTT Broker subscription tree | |
| CN1747390A (en) | Method and system for processing real-time multi-media information in instant telecommunication | |
| CN105227386A (en) | For method, the Apparatus and system of point population statistics online user number | |
| US7827243B2 (en) | Method for transmitting file based on multiplex forwarder | |
| CN102542019A (en) | Identification code storage method and identification code storage system as well as identification code indexing method and identification code indexing system | |
| CN114978921B (en) | Network organization method and device based on binary tree | |
| CN112835896B (en) | Real-time database data hotspot balancing method, device, equipment and medium | |
| CN102118256B (en) | Method for acquiring simple network management protocol (SNMP) data and equipment-side device | |
| CN108509585A (en) | A kind of isomeric data real-time, interactive optimized treatment method | |
| CN100355315C (en) | Method for implementing telephone number to uniform resource identifier mapping business | |
| CN114500583A (en) | Power distribution Internet of things real-time communication method based on MQTT protocol | |
| CN112463735A (en) | Method for splitting large-volume JSON file and requesting according to needs | |
| Tran et al. | Multi-Keyword Based Information Routing in Peer-to-Peer Networks |
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 |