CN110609926A - Data tag storage management method and device - Google Patents
Data tag storage management method and device Download PDFInfo
- Publication number
- CN110609926A CN110609926A CN201910889915.5A CN201910889915A CN110609926A CN 110609926 A CN110609926 A CN 110609926A CN 201910889915 A CN201910889915 A CN 201910889915A CN 110609926 A CN110609926 A CN 110609926A
- Authority
- CN
- China
- Prior art keywords
- data
- keyword
- value
- data object
- tag
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
Abstract
The invention provides a data label storage management method and a device, wherein the method comprises the following steps: acquiring a data object ID and a corresponding data tag; based on a reverse key value mapping mode, storing data labels into a key word set, wherein one key word represents one data label, storing a data object ID corresponding to the data label into the value set, and one value represents one data object ID; the corresponding relation between the key words and the values is as follows: a key corresponds to one or more values that form a subset of the values corresponding to the key. The method stores the data labels to the keyword set and stores the corresponding data object IDs to the value set in a reverse key value mapping mode, so that the independent storage of the data labels to the data objects is realized, and the high-efficiency data label storage management is realized; the storage management of the data objects is indirectly realized, the problem of tagged classified storage of mass data objects is effectively solved, and the management efficiency is improved.
Description
Technical Field
The present invention relates to the field of data tag technologies, and in particular, to a data tag storage management method and apparatus.
Background
At present, a large number of data objects (structured representation of data entities in application programs, which may be basic data elements or structured complex data sets) exist in various WEB or client application programs, and in order to perform rapid classification retrieval or batch processing on a certain type of data objects, identification of the data objects is often required. Such data that describes the attributes or classifications of the data objects and identifies the data objects is called a data tag. In order to better manage data objects, for example, applications perform tagging management on client data, and classify clients based on tags so as to meet the requirements of fine management of clients, accurate marketing, personalized information push and the like, various WEB or client applications have the requirement of identifying and classifying data objects by using data tags, but a general method for efficient storage management of tags is lacked.
At present, the traditional data tag storage management methods mainly include two methods, one is that a data tag and a data object are stored together, the data tag generally adds tag attributes to the data object, if one data object has a plurality of tag attributes, a plurality of attribute fields need to be added when the data tag is used for identification, and the data tag and the data object are stored together; the other is a common Key Value (non-reverse Key Value) label storage mode, in which a Key (Key) in the Key Value mapping is a data object or a data object identifier, and a Value (Value) is a data label.
The traditional data label storage management method has low efficiency, particularly when the data volume of the data object is large, for example, when the customer information is large, the use of the low-efficiency label management method can cause the delay of customer label management to be large, the timeliness of customer classification can be seriously influenced, and further the fine management and customer experience based on classified customers are influenced. For example, when personalized push is performed, the pushed information exceeds the validity period, which may seriously affect the experience of the client.
Therefore, how to provide an efficient data tag storage management method becomes a problem to be solved by those skilled in the art.
Disclosure of Invention
The embodiment of the invention provides a data tag storage management method, which is used for providing an efficient data tag storage management method and comprises the following steps:
acquiring a data object ID and a data tag corresponding to the data object;
based on a reverse key value mapping mode, storing the data labels into a key word set, wherein one key word represents one data label, storing the data object ID corresponding to the data label into the value set, and one value represents one data object ID; the corresponding relation between the key words and the values is as follows: a key corresponds to one or more values that form a subset of the values corresponding to the key.
An embodiment of the present invention further provides a data tag storage management apparatus, so as to provide an efficient data tag storage management apparatus, where the apparatus includes:
the information acquisition module is used for acquiring the ID of the data object and the data label corresponding to the data object;
the label storage module is used for storing the data labels into a key word set based on a reverse key value mapping mode, wherein one key word represents one data label, the data object ID corresponding to the data label is stored into the value set, and one value represents one data object ID; the corresponding relation between the key words and the values is as follows: a key corresponds to one or more values that form a subset of the values corresponding to the key.
The embodiment of the invention also provides computer equipment which comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein the processor realizes the data tag storage management method when executing the computer program.
An embodiment of the present invention also provides a computer-readable storage medium, which stores a computer program for executing the above data tag storage management method.
In the embodiment of the invention, data labels are stored in a key word set in a reverse key value mapping mode, one key word represents one data label, a data object ID corresponding to the data label is stored in the value set, and one value represents one data object ID; one key word corresponds to one or more values, and the one or more values form a subset of the values corresponding to the key word, so that the independent storage of the data tags independent of the data objects is realized, and the efficient storage management of the data tags is realized; the storage management of the data objects is indirectly realized through the storage management of the data tags, so that the problem of tagged classified storage of mass data objects is effectively solved, and the management efficiency of the mass data objects is also improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic diagram of a data tag storage management method according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of a relationship between keywords and values in an embodiment of the present invention.
Fig. 3 is a schematic diagram illustrating a query management method for a data object according to an embodiment of the present invention.
Fig. 4 is a schematic diagram of a data tag storage management apparatus according to an embodiment of the present invention.
Fig. 5 is a block diagram of a query management module according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the technical terms involved in the description of the embodiments will be explained below:
data object: the structured representation of the data entities in the application may be either basic data elements or a structured complex data set. In the embodiment of the invention, the data object is an integral data unit.
Data object ID: the naming of data objects, including numbers, characters, and codes, a data object ID may be used to identify a unique data object.
Data label: the data for marking the data object is used for explaining the attribute or classification of the data object so as to achieve the purposes of quickly classifying and retrieving the data object or processing a certain type of data object in batch and the like.
Reverse keyed tag storage: the mapping relation of the reverse key value is as follows: key (Key) is a data tag and Value (Value) is a data object ID. What is needed is to establish an independent reverse Key-Value label storage, use all labels as keys in the Key-Value mapping respectively, and store the corresponding data object ID in the Value subset of the corresponding Key.
In order to solve the problem of low efficiency of conventional tag storage management, an embodiment of the present invention provides a data tag storage management method, so as to provide an efficient data tag storage management method, as shown in fig. 1, the method includes:
step 101: acquiring a data object ID and a data tag corresponding to the data object;
step 102: based on a reverse key value mapping mode, storing the data labels into a key word set, wherein one key word represents one data label, storing the data object ID corresponding to the data label into the value set, and one value represents one data object ID; the corresponding relation between the key words and the values is as follows: a key corresponds to one or more values that form a subset of the values corresponding to the key.
As can be seen from the flow shown in fig. 1, in the embodiment of the present invention, data tags are stored in a key set in a reverse key value mapping manner, where one key represents one data tag, a data object ID corresponding to the data tag is stored in the value set, and one value represents one data object ID; one key word corresponds to one or more values, and the one or more values form a subset of the values corresponding to the key word, so that the independent storage of the data tags independent of the data objects is realized, and the efficient storage management of the data tags is realized; the storage management of the data objects is indirectly realized through the storage management of the data tags, so that the problem of tagged classified storage of mass data objects is effectively solved, and the management efficiency of the mass data objects is also improved.
In specific implementation, it can be understood by those skilled in the art that the number of the obtained data object IDs may be one or multiple, for example, when a large number of data objects are processed in batch, the number of the obtained data object IDs is multiple, and is determined according to the actually processed data object.
In one embodiment, a data object may have one or more data tags, such that a data object ID has one or more corresponding data tags, i.e., the same value in multiple subsets of values corresponding to multiple keys. In specific implementation, the correspondence between the keywords and the values is as shown in fig. 2, and the keyword of the tag 1 in the keyword set corresponds to: data object ID1, data object ID2, and data object ID3, a subset of the three value component values corresponding to the key of tag 1, for ease of distinction, the subset is referred to as subset 1; in the subset 1, the keyword corresponding to each value is the keyword of the tag 1; the keywords of tag 2 in the keyword set correspond to: data object ID1, another subset of data object ID1 component values corresponding to the key of tag 2, for ease of distinction, the subset is referred to as subset 2; in the subset 2, the keyword corresponding to each value is the keyword of the tag 2; it can be seen that the same data object ID may exist in different subsets of values, for example, the data object ID1 in the embodiment exists in subset 1 and subset 2, but under one subset of values, the key corresponding to the data object ID is the key corresponding to the one subset, e.g., in subset 1, the data object ID1 only corresponds to the key of tag 1.
In specific implementation, when one or more data objects need to add data tags, if the keywords corresponding to the added data tags exist in the keyword set, the corresponding data object IDs are stored in the subset of values corresponding to the corresponding keywords;
if the keyword set does not have the keywords corresponding to the added data tags, corresponding keywords are added to the keyword set, and the corresponding data object IDs are stored in the value set and correspond to the added corresponding keywords.
In specific implementation, when one or more data objects need to delete a data tag, a corresponding keyword is searched from the keyword set according to the data tag to be deleted, a value corresponding to the data object ID of the data tag to be deleted is searched from the value set according to the corresponding keyword, and the corresponding value is deleted.
When the data label is deleted, the corresponding keyword is searched from the keyword set according to the data label to be deleted, and the searched keyword and the subset of the value corresponding to the keyword are deleted. Compared with the traditional data label deletion, the data label of each data object is judged whether to contain the data label to be deleted or not without traversing all the data objects, so that the deletion management processing is greatly simplified, and the processing efficiency is improved.
When one or more data objects need to modify the data tags, the original data tags can be deleted first, then the modified data tags are added for processing, and the processing of deleting the data tags and adding the data tags is completed according to the steps.
It can be understood that the above method for modifying a data tag is only an example, and when implemented, the method may be transformed, or other methods may be adopted, and the method for modifying and managing a data tag or a data object based on the above storage method all falls into the protection scope of the present invention, and is not described in detail in the embodiments.
Based on the above data tag storage management method, query management on a data object can also be achieved, and the specific implementation steps are shown in fig. 3 and include:
step 301: receiving an input data tag;
step 302: searching a corresponding keyword from the keyword set according to the data tag;
step 303: finding out a corresponding value from the set of values according to the keyword;
step 304: and displaying or sending the corresponding value.
In a specific embodiment, the found data object ID may be sent to a user or other application program, and a required operation is performed on the data object represented by the data object ID, for example, the client information data with the data label "after 80" is sent to a message pushing program, so as to push relevant personalized information for the client information "after 80". Thereby enabling the functionality of performing specified operations with respect to data objects of a certain class (having a certain data tag or tags). Those skilled in the art can understand that the sending of the client information to the message pushing program is only an example, other operations that send the found data object ID to the user or other application programs and are required to execute the data object represented by the data object ID all fall into the protection scope of the present invention, and no further description is given here in the embodiments of the present invention.
In a specific embodiment, the keyword set and the corresponding value set are stored in the memory for storage in the manner of the memory database according to the storage method, for example, an efficient memory database Redis used. The data storage based on the memory storage can ensure the efficient access of the data, support the persistent storage of the data and effectively prevent the data loss. Redis is simple to operate, can support multiple languages API, is based on open source project, has low use cost, and is one of the mainstream memory databases at present. Those skilled in the art will understand that the above-mentioned memory databases are only examples, and most of the currently mainstream commercial database systems include Oracle, MySQL, SQL Server, DB2, Sybase, PostgreSQL, MongoDB, etc., although most of them are systematic, complex to operate, and have a certain use cost, if the data tag storage in the specific embodiment is located inside a large system, one of these databases is already provided, and these databases may also be used.
Based on the application of the memory database Redis, the management of data tag addition, deletion, modification and the like can directly process the keyword set by using the API provided by the memory database Redis and the like, thereby greatly improving the management processing efficiency.
In a specific embodiment, when a plurality of data objects have the same data tag, there will be a plurality of values (data object IDs) corresponding to the keyword of the data tag, and the plurality of values, i.e., subsets of the values, may be stored in a list form or in a file form. At this time, the processing that can be specifically realized for the storage management of the data tag is as follows:
applying a data tag to one or more data objects: and directly adding the ID of the data object needing to apply the data label to a list of values corresponding to the corresponding keywords of the data label.
Deleting a data tag from one or more data objects: and directly deleting the values of the one or more data object IDs from the value list corresponding to the corresponding key of the data tag.
Delete one or more data tags: and directly deleting the corresponding key of the one or more data labels from the key set in the key set, and deleting the list of the values corresponding to the corresponding key in the value set.
Adding one or more data tags to a data object: and traversing the data label key word set, searching the key words corresponding to the one or more data labels, and increasing the value of the ID of the data object in a list of values corresponding to the corresponding key words.
Deleting one or more data tags for a data object: and traversing the data label key word set, searching the key words corresponding to the one or more data labels, and deleting the value of the ID of the data object from the list of the values corresponding to the corresponding key words.
When one or more data objects are newly added: and traversing the data tag keyword set, searching keywords corresponding to the specified data tag, and adding the value of the data object ID of the newly added data object in a list of values corresponding to the corresponding keywords.
When deleting a data object: and traversing the data label key word set, and deleting the value of the data object ID of the data object in the list of the value corresponding to each key word.
Because the number of the data objects is generally far larger than that of the data tags, the query management process shows that the traversal range is only limited to the keyword set corresponding to the data tags, so that traversal of a mass data object set is avoided, the operation complexity can be effectively reduced, and the query efficiency is improved.
Based on the same inventive concept, embodiments of the present invention further provide a data tag storage management apparatus, and because the principle of the problem solved by the data tag storage management apparatus is similar to that of the data tag storage management method, the implementation of the data tag storage management apparatus may refer to the implementation of the data tag storage management method, and repeated parts are not described again, and the specific structure is as shown in fig. 4:
an information obtaining module 401, configured to obtain a data object ID and a data tag corresponding to the data object;
a tag storage module 402, configured to store the data tag in a key set based on a reverse key value mapping manner, where one key represents one data tag, and a data object ID corresponding to the data tag is stored in the value set, and one value represents one data object ID; the correspondence between a key and a value is that a key corresponds to one or more values that form a subset of the values corresponding to the key.
When the data tag of the data object needs to be added, the method further includes, on the basis of the apparatus shown in fig. 4:
a tag addition management module, configured to, when a data tag of a data object is added, store a corresponding data object ID into a subset of values corresponding to a corresponding keyword if the keyword corresponding to the added data tag already exists in the keyword set;
if the keyword set does not have the keywords corresponding to the added data tags, adding corresponding keywords in the keyword set, and storing the corresponding data object IDs in a value set corresponding to the added corresponding keywords.
When the data tag of the data object needs to be deleted, the apparatus shown in fig. 4 further includes:
and the label deletion management module is used for searching a corresponding keyword from the keyword set according to the data label to be deleted, searching a value corresponding to the data object ID of the data label to be deleted from the value set according to the corresponding keyword, and deleting the corresponding value when deleting the data label of the data object.
When the data label is deleted, the corresponding keyword is searched from the keyword set according to the data label to be deleted, and the searched keyword and the subset of the value corresponding to the keyword are deleted.
Based on the above data tag storage management device, query management of data objects can also be realized, further comprising: as shown in fig. 5, the query management module specifically includes:
a receiving unit 501, configured to receive an input data tag;
a searching unit 502, configured to find a corresponding keyword from the keyword set according to the data tag;
a query unit 503, configured to find a corresponding value from the set of values according to the keyword;
an output unit 504, configured to display or send the corresponding value.
The embodiment of the invention also provides computer equipment which comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein the processor realizes the data tag storage management method when executing the computer program.
An embodiment of the present invention further provides a computer-readable storage medium, in which a computer program for executing the data tag storage management method is stored.
In summary, the data tag storage management method and apparatus provided by the present invention have the following advantages:
storing data labels to a key word set in a reverse key value mapping mode, wherein one key word represents one data label, storing a data object ID corresponding to the data label to the value set, and one value represents one data object ID; one key word corresponds to one or more values, and the one or more values form a subset of the values corresponding to the key word, so that the independent storage of the data tags independent of the data objects is realized, and the efficient storage management of the data tags is realized; based on the application of the memory database, the management of adding, deleting, modifying and the like of the data tags can directly process the keyword set by using the API provided by the memory database, so that the management efficiency of the data tags is greatly improved; the storage management of the data objects is indirectly realized through the storage management of the data tags, so that the problem of tagged classified storage of mass data objects is effectively solved, and the management efficiency of the mass data objects is also improved.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, apparatus, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes may be made to the embodiment of the present invention by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A data tag storage management method is characterized by comprising the following steps:
acquiring a data object ID and a data tag corresponding to the data object;
based on a reverse key value mapping mode, storing the data labels into a key word set, wherein one key word represents one data label, storing the data object ID corresponding to the data label into the value set, and one value represents one data object ID; the corresponding relation between the key words and the values is as follows: a key corresponds to one or more values that form a subset of the values corresponding to the key.
2. The method of claim 1, further comprising:
when the data tags of the data objects are added, if the keywords corresponding to the added data tags exist in the keyword set, storing the corresponding data object ID into the subset of the values corresponding to the corresponding keywords;
if the keyword set does not have the keywords corresponding to the added data tags, adding corresponding keywords in the keyword set, and storing the corresponding data object IDs in a value set corresponding to the added corresponding keywords.
3. The method of claim 1, further comprising:
when deleting the data tag of the data object, searching a corresponding keyword from the keyword set according to the data tag to be deleted, searching a value corresponding to the data object ID of the data tag to be deleted from the value set according to the corresponding keyword, and deleting the corresponding value;
when the data label is deleted, searching the corresponding keyword from the keyword set according to the data label to be deleted, and deleting the searched keyword and the subset of the value corresponding to the keyword.
4. The method of any of claims 1 to 3, further comprising:
receiving an input data tag;
searching a corresponding keyword from the keyword set according to the data tag;
finding out a corresponding value from the set of values according to the keyword;
and displaying or sending the corresponding value.
5. A data tag storage management apparatus, comprising:
the information acquisition module is used for acquiring the ID of the data object and the data label corresponding to the data object;
the label storage module is used for storing the data labels into a key word set based on a reverse key value mapping mode, wherein one key word represents one data label, the data object ID corresponding to the data label is stored into the value set, and one value represents one data object ID; the corresponding relation between the key words and the values is as follows: a key corresponds to one or more values that form a subset of the values corresponding to the key.
6. The apparatus of claim 5, further comprising:
a tag addition management module, configured to, when a data tag of a data object is added, store a corresponding data object ID into a subset of values corresponding to a corresponding keyword if the keyword corresponding to the added data tag already exists in the keyword set;
if the keyword set does not have the keywords corresponding to the added data tags, adding corresponding keywords in the keyword set, and storing the corresponding data object IDs in a value set corresponding to the added corresponding keywords.
7. The apparatus of claim 5, further comprising:
the tag deletion management module is used for searching a corresponding keyword from the keyword set according to the data tag to be deleted, searching a value corresponding to the data object ID of the data tag to be deleted from the value set according to the corresponding keyword, and deleting the corresponding value when the data tag of the data object is deleted;
when the data label is deleted, searching the corresponding keyword from the keyword set according to the data label to be deleted, and deleting the searched keyword and the subset of the value corresponding to the keyword.
8. The apparatus of any one of claims 5 to 7, further comprising: a query management module;
the query management module specifically comprises:
a receiving unit for receiving an input data tag;
the searching unit is used for searching the corresponding keyword from the keyword set according to the data tag;
the query unit is used for finding out a corresponding value from the set of values according to the keyword;
and the output unit is used for displaying or sending the corresponding value.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 4 when executing the computer program.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program for executing the method of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910889915.5A CN110609926A (en) | 2019-09-20 | 2019-09-20 | Data tag storage management method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910889915.5A CN110609926A (en) | 2019-09-20 | 2019-09-20 | Data tag storage management method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110609926A true CN110609926A (en) | 2019-12-24 |
Family
ID=68891718
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910889915.5A Pending CN110609926A (en) | 2019-09-20 | 2019-09-20 | Data tag storage management method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110609926A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116627360A (en) * | 2023-07-24 | 2023-08-22 | 苏州浪潮智能科技有限公司 | Data issuing method, data management system, server and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160246481A1 (en) * | 2015-02-20 | 2016-08-25 | Ebay Inc. | Extraction of multiple elements from a web page |
| CN106991149A (en) * | 2017-03-28 | 2017-07-28 | 桂林电子科技大学 | A kind of magnanimity spatial object storage method for merging coding and multi-edition data |
| CN107562804A (en) * | 2017-08-08 | 2018-01-09 | 上海数据交易中心有限公司 | Data buffer service system and method, terminal |
| CN108897874A (en) * | 2018-07-03 | 2018-11-27 | 北京字节跳动网络技术有限公司 | Method and apparatus for handling data |
| CN109408507A (en) * | 2018-09-27 | 2019-03-01 | 中国联合网络通信集团有限公司 | Processing method, device, equipment and the readable storage medium storing program for executing of multiattribute data |
| CN109981322A (en) * | 2017-12-28 | 2019-07-05 | 北京京东尚科信息技术有限公司 | The method and apparatus of cloud resource management based on label |
-
2019
- 2019-09-20 CN CN201910889915.5A patent/CN110609926A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160246481A1 (en) * | 2015-02-20 | 2016-08-25 | Ebay Inc. | Extraction of multiple elements from a web page |
| CN106991149A (en) * | 2017-03-28 | 2017-07-28 | 桂林电子科技大学 | A kind of magnanimity spatial object storage method for merging coding and multi-edition data |
| CN107562804A (en) * | 2017-08-08 | 2018-01-09 | 上海数据交易中心有限公司 | Data buffer service system and method, terminal |
| CN109981322A (en) * | 2017-12-28 | 2019-07-05 | 北京京东尚科信息技术有限公司 | The method and apparatus of cloud resource management based on label |
| CN108897874A (en) * | 2018-07-03 | 2018-11-27 | 北京字节跳动网络技术有限公司 | Method and apparatus for handling data |
| CN109408507A (en) * | 2018-09-27 | 2019-03-01 | 中国联合网络通信集团有限公司 | Processing method, device, equipment and the readable storage medium storing program for executing of multiattribute data |
Non-Patent Citations (5)
| Title |
|---|
| 丁振凡: "《JAVA语言实用教程 第2版》", 31 January 2008, 北京：北京邮电大学出版社, pages: 126 * |
| 菜鸟知识搬运工: "C++ set与map、unordered_map、unordered_set与哈希表", 《CSDN：HTTPS://BLOG.CSDN.NET/QQ_30815237/ARTICLE/DETAILS/91047041》 * |
| 菜鸟知识搬运工: "C++ set与map、unordered_map、unordered_set与哈希表", 《CSDN：HTTPS://BLOG.CSDN.NET/QQ_30815237/ARTICLE/DETAILS/91047041》, 6 June 2019 (2019-06-06) * |
| 陈茂军: "基于云平台下的数据挖掘研究", 《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑（月刊）》 * |
| 陈茂军: "基于云平台下的数据挖掘研究", 《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑（月刊）》, no. 02, 15 February 2017 (2017-02-15) * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116627360A (en) * | 2023-07-24 | 2023-08-22 | 苏州浪潮智能科技有限公司 | Data issuing method, data management system, server and storage medium |
| CN116627360B (en) * | 2023-07-24 | 2023-11-03 | 苏州浪潮智能科技有限公司 | Data issuing method, data management system, server and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108228817B (en) | Data processing method, device and system | |
| US9870382B2 (en) | Data encoding and corresponding data structure | |
| US11645294B2 (en) | Interactive identification of similar SQL queries | |
| CN111046034B (en) | Method and system for managing memory data and maintaining data in memory | |
| KR101137147B1 (en) | Query forced indexing | |
| US8924373B2 (en) | Query plans with parameter markers in place of object identifiers | |
| US20140351241A1 (en) | Identifying and invoking applications based on data in a knowledge graph | |
| CN111459985A (en) | Identification information processing method and device | |
| CN106407303A (en) | Data storage method and apparatus, and data query method and apparatus | |
| US11216516B2 (en) | Method and system for scalable search using microservice and cloud based search with records indexes | |
| CN111506559A (en) | Data storage method and device, electronic equipment and storage medium | |
| CN109871470B (en) | Power grid equipment data labeling management system and implementation method | |
| US20190362016A1 (en) | Frequent pattern analysis for distributed systems | |
| CN107526746B (en) | Method and apparatus for managing document index | |
| US6999966B2 (en) | Content management system and methodology for implementing a complex object using nested/recursive structures | |
| CN110929120B (en) | Method and apparatus for managing technical metadata | |
| US10628421B2 (en) | Managing a single database management system | |
| CN110851663A (en) | Method and apparatus for managing metadata | |
| CN110807028A (en) | Method, apparatus and computer program product for managing a storage system | |
| CN110609926A (en) | Data tag storage management method and device | |
| CN115309789B (en) | Method for generating associated data graph in real time based on intelligent dynamic business object | |
| US10885157B2 (en) | Determining a database signature | |
| CN116010345A (en) | Method, device and equipment for realizing table service scheme of flow batch integrated data lake | |
| US9898493B2 (en) | Runtime generation of a mapping table for uploading data into structured data marts | |
| CN112685557A (en) | Visualized information resource management 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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191224 |
|
| RJ01 | Rejection of invention patent application after publication |