CN105893635B - Netted multiple index matching process towards distribution subscription - Google Patents
Netted multiple index matching process towards distribution subscription Download PDFInfo
- Publication number
- CN105893635B CN105893635B CN201610459488.3A CN201610459488A CN105893635B CN 105893635 B CN105893635 B CN 105893635B CN 201610459488 A CN201610459488 A CN 201610459488A CN 105893635 B CN105893635 B CN 105893635B
- Authority
- CN
- China
- Prior art keywords
- index
- entry
- subscription
- node
- netted
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
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/95—Retrieval from the web
- G06F16/951—Indexing; Web crawling techniques
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Transfer Between Computers (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention discloses a kind of netted multiple index matching process towards distribution subscription, belongs to Information Technology Agreement field.There is full table scan when deleting user and subscribing to entry existing multiple index matching algorithm in this method, propose improved netted multilevel index structure, it can be in the case where ensuring index efficiency, entry is subscribed to using the chained list head pointer locking for subscribing to entry to be deleted, to the full table scan of multiple index when avoiding deleting, the deletion efficiency of index is improved；It is defined using doubly linked list and subscribes to the corresponding multiple subscription entries of entry attributes and be attached subscription entry identical in index, improve the maintenance efficiency of index；Index subscribes to entry attributes classification for operate operator and attribute respectively and establishes index, can carry out quickly carrying out beta pruning filtering to querying condition, improve inquiry and the matching efficiency of index.
Description
Technical field
The present invention relates to Information Technology Agreement field more particularly to a kind of netted multiple index matchings towards distribution subscription
Method.
Background technique
Message subscribing/release model can effectively reduce the degree of coupling between communicating pair, so that publisher and subscriber
It is full decoupled in time, space and synchronism, the dependence of communicating pair is reduced, is a kind of effective asynchronous communication model,
It is widely used in large-scale distributed network.Data are carried out using form of message in news release/subscribing mode
Publication and subscription, subscriber indicate interested event type and notification agent server；When publisher has new event publication
When, server is sent event identical with Subscriber subscriptions' type in subscriber's hand by matching algorithm.Wherein, matching is calculated
Method is responsible for efficiently finding all subscription conditions to match with given time, therefore in order to will efficiently occur in real time
Event is pushed to booking reader, it is necessary to efficient index and matching algorithm.
Most widely the indexes applications towards distribution subscription are multiple indexes at present, which combines in distribution subscription
The relationships such as link, covering, compatible, merging with the filter in algorithm.However, existing multiple index matching process is being handled
Counter is used when the matching process of subscribed content, this can generate the replication problem of matching process in operation.Moreover, more
It is for serious problem, in the application that may be continually deleted the entry of subscription for user, existing multiple index
Matching process cannot be supported efficiently to index delete operation.Especially under concurrent environment, difference subscribes to deleting for entry index
Except carrying out simultaneously with matching operation, to index, in the efficiency of delete operation, more stringent requirements are proposed for this.
In view of this, the problem of being directed to existing multiple index method, it is necessary to new improved method is proposed, with same
When solve the problems, such as matching process repetition and delete when need to carry out entirely index scanning.
Summary of the invention
Goal of the invention: there are the repetition of matching process and timeliness is being deleted for index matching algorithm in existing distribution subscription
The low problem of rate, the present invention propose a kind of netted multiple index matching process towards distribution subscription, will in index structure
The same different attribute node for subscribing to entry is attached by chained list, is significantly improved subscription entry in distribution subscription system and is deleted
Except when index efficiency.
Thinking of the invention is: existing multiple index mating structure is in the case where user deletes and subscribes to, in order to guarantee
The consistency of entry and index is subscribed to, multiple index has to delete the entry in multiple index simultaneously.However multiple index exists
When deleting subscription entry, multiple predicate attributes as existing for a subscription entry are dispersed in a plurality of index chained list, cause to delete
Except when to need to carry out full index scanning algorithm complexity high.In order to improve the index efficiency in distribution subscription, solve the above problems,
The data structure of index is first defined, the multiple attributes subscribed in entry are indicated with node respectively, same subscription entry
Multiple attribute nodes be attached using chained list；Netted index structure is created according to attribute, indicates to subscribe to also with chained list
SID is subscribed in entry attributes, each node storage in chained list, it is innovative herein in the index will be corresponding to same subscription SID
All properties be attached and save the head pointer of chained list using chained list, can be according to chained list when deleting some and subscribing to entry
Head pointer disposably delete all association attributes nodes, do not need traversal index node.
Technical solution: a kind of netted multiple index matching process towards distribution subscription comprises the following steps:
S1: defining the data structure of netted multiple index, which includes chained list and node, and node is ordered for storing
The attribute information of entry is read, wherein the content stored in each node is shown in Table 1.
S2: constructing netted multiple index, creates global rope according to current all subscription entries in index initial phase
Draw, specifically include the following steps:
Step S21: for current new subscription entry, every subscription entry is parsed into multiple order by subscribing to resolver
Condition is read, subscription condition is attached by chained list, and forward and backward pointer is sky, the structure of each chained list node such as table at this time
Shown in one, chained list head includes the SID of the subscription entry；
Step S22: obtaining the present node of chained list, judges the operate operation that the node whether is had existed in index
Symbol, if so, entering step S23；Otherwise, S24 is entered step；
Step S23: present node is inserted into rope by selection level-one index corresponding with the operate operator of the node
In drawing, S25 is entered step；
Step S24: the level-one index of the operate operator of present node is constructed, present node is inserted into index and is worked as
In, into rapid S25；
Step S25: being directed toward next node for the doubly linked list pointer in step S21, judges whether present node is sky,
If entering step S26；Otherwise, step S22 is continued to execute；
Step S26: to different subscription conditions, the node of same alike result is attached by index point；
Step S27: the netted multiple index of completion current subscription entry addition, return step S21, and to all subscription items
Mesh successively executes step S21 to step S25, until all subscription entries are all added in netted multiple index.
S3: maintenance global index comprising two kinds of operations of insertion and deletion of index；
Step S31: the SID to be deleted for subscribing to entry is obtained；
Step S32: according to entry SID is subscribed to, the head pointer of the entry is searched in netted index and pointer is moved back one
A node；
Step S33: all preceding to node and backward node of present node is recorded, present node is deleted；
Step S34: the node in netted index is reconnected, and is subscribed to entry chain table pointer and is moved back one；
Step S35: judge whether pointer is empty, if it is not, continuing step S33；Otherwise, it deletes and subscribes to entry completion.
S4: current event is matched with entry is subscribed to using index matching algorithm, deletion is unsatisfactory for matching condition
Entry is subscribed to, is specifically included the following steps:
Step S41: extracting all subscription conditions of current event, forms matching set；
Step S42: successively in netted index level-one index (operator operator) and secondary index (attribute) into
Row matching, matched beta pruning filtering rule are shown in claim 5；
Step S43: all subscription entries for being unsatisfactory for matching aggregates content are deleted；
Step S44: judging whether index traverses completion, if so, returning to matching result set；Otherwise, step is continued to execute
S42。
S5: current event is pushed to and subscribes to the corresponding all users of entry set.
The present invention by adopting the above technical scheme, has the advantages that using doubly linked list structure, being capable of two-way search
Corresponding subscription entry attributes node, improves the search efficiency of index with deletion；It is carried out based on the chained list of attribute according to operator
Sequence, quickly filters out ungratified subscription SID, improves the matching efficiency of index；Same is subscribed into SID using list structure
The attribute for being included is connected, and all interdependent nodes are successively deleted by head pointer, can effectively improve the deletion effect of index
Rate.
The invention proposes a kind of matching algorithms of new multiple index, eliminate the counter in traditional matching process,
Concordance list is introduced, replication problem in the matching process is avoided.Invention proposes a kind of netted multistage towards distribution subscription
Matching process is indexed, is attached the same different attribute node for subscribing to entry by chained list in index structure, Ke Yitong
When solve the problems, such as matching process repetition and delete when need to carry out entirely index scanning, significantly improve distribution subscription system
The middle index efficiency subscribed to when entry is deleted.Index is improved herein, proposes netted multilevel index structure, Neng Gouyou
Effect reduces algorithm complexity of the multiple index when deleting.
The additional aspect of the present invention and advantage will be set forth in part in the description, these will become from the following description
Obviously, or practice through the invention is recognized.
Detailed description of the invention
Fig. 1 shows the process flow of the netted multiple index matching process towards distribution subscription of the embodiment of the present invention
Figure；
Fig. 2 shows the single node structure charts of the netted multiple index towards distribution subscription of the embodiment of the present invention；
Fig. 3 shows the process flow diagram of the index construct process of the embodiment of the present invention；
The netted multiple index towards distribution subscription that Fig. 4 shows the embodiment of the present invention subscribes to entry structure figure；
Fig. 5 shows the netted multilevel index structure figure towards distribution subscription of the embodiment of the present invention.
Specific embodiment
Combined with specific embodiments below, the present invention is furture elucidated, it should be understood that these embodiments are merely to illustrate the present invention
Rather than limit the scope of the invention, after the present invention has been read, those skilled in the art are to various equivalences of the invention
The modification of form falls within the application range as defined in the appended claims.
Fig. 1 shows the process flow of the netted multiple index matching process towards distribution subscription of the embodiment of the present invention
Figure.As shown in Figure 1, a kind of netted multiple index matching process towards distribution subscription, comprises the following steps: step S1: definition
The data structure of netted multiple index, the data structure include chained list and node, and node is used to store the attribute letter for subscribing to entry
Breath；Step S2: constructing netted multiple index, creates global rope according to current all subscription entries in index initial phase
Draw；Step S3: maintenance global index comprising two kinds of operations of insertion and deletion of index；Step S4: index matching algorithm is utilized
Current event is matched with entry is subscribed to, the determining and matched subscription entry set of current event；Step S5: by current thing
Part, which is pushed to, subscribes to the corresponding all users of entry set.
As one embodiment, the netted multiple index matching process towards distribution subscription may include: data structure, rope
Draw creation, index maintenance and subscribes to event matches.For example, index matching process proposed by the present invention can be real as follows
It applies:
Step S1: defining the data structure of netted multiple index, which includes chained list and node, and node is for depositing
The attribute information of entry is subscribed in storage, and the structure of each node is shown in Fig. 2.The content of each node storage and function description are shown in Table 1.Its
In all refer to comprising a head in every chained list, all nodes of the chained list can be found by head pointer.Fig. 2 shows this hairs
The single node structure chart of the netted multiple index towards distribution subscription of bright embodiment.As shown in Fig. 2, in node include SID,
Operate operator, forwarding pointer, attribute, value index point, backwarding pointer.
1 node component part of table
Step S2: constructing netted multiple index, creates global net according to all subscription entries in index initial phase
Shape index.Netted multiple index improves on the basis of existing multiple index, and same is subscribed to the different of entry and is subscribed to
Entry attributes are linked together by chained list, while the head pointer of the chained list is stored using structure of arrays.Carrying out subscription entry
When deletion, whole nodes of the subscription entry can be deleted according to head pointer as long as determining subscription entry SID, are avoided to rope
The full table scan drawn.
As one embodiment, index construct process specifically includes the following steps:
Step S21: for current new subscription entry, by subscribe to resolver by every it is new subscribe to entry be parsed into it is multiple
Subscription condition, subscription condition are attached by doubly linked list.At this point, the forward and backward pointer of the chained list is sky, Mei Gelian
The structure of table node can use structure as shown in Table 1, and chained list head includes the SID of the subscription entry.Fig. 4 is to subscribe to item
The list structure of part composition wherein stores the head pointer of the subscription entry, stores a subscription condition in each node in S1.
The working example for wherein subscribing to resolver is as follows:
It subscribes to entry: subscribing to the water conservancy satellite photo shot between daily 8:00-12:00.
List structure is as follows after parsing:
Wherein, forwarding pointer and backwarding pointer are all empty, this is because subscription condition is inserted into netted multistage not yet
In index.
Step S22: obtaining the present node of chained list, judges whether have existed the node in the index created
Operate operator, if so, entering step S23；Otherwise, S24 is entered step；
Step S23: present node is inserted into rope by selection level-one index corresponding with the operate operator of the node
In drawing, S25 is entered step；
Step S24: the level-one index of the operate operator of present node is constructed, present node is inserted into index and is worked as
In, into rapid S25；
1 attribute of algorithm is inserted into netted multiple index algorithm
Step S25: the backwarding pointer of doubly linked list (in step S21) is directed toward next node, judges present node
It whether is sky, if entering step S26；Otherwise, step S22 is continued to execute；
Step S26: to different subscription conditions, the node of same alike result is attached by index point；
Step S27: the netted multiple index of completion current subscription entry addition, return step S21, and to all subscription items
Mesh successively executes step S21 to step S25, until all subscription entries are all added in netted multiple index.
Fig. 4 is a part of netted multilevel index structure, and operator " > " is that level-one indexes, and multiple " Attribute " is constituted
Secondary index.Corresponding secondary index is lateral doubly linked list, can quickly realize the insertion and deletion of node；It is longitudinal
Subscription entry pointer S1 ..., Sn links together different subscription entries.Horizontal and vertical pointer direction constitutes net
Shape multilevel index structure.
The description of index creation algorithm such as algorithm 2:
The creation algorithm of the netted multiple index of algorithm 2
Step S3: maintenance global index specifically includes the insertion of index and deletes two kinds of operations, and the insertion algorithm of index is shown in
Algorithm 3.
The netted multiple index insertion algorithm of algorithm 3
The deletion algorithm of index specifically executes step and sees algorithm 4:
The deletion algorithm of the netted multiple index of algorithm 4
Step S4: subscription entry is matched with current event using index matching algorithm, deletion is unsatisfactory for matching item
The subscription entry of part, specifically includes the following steps:
Step S41: extracting all subscription conditions of current event, forms matching set；
Step S42: successively in netted index level-one index (operator operator) and secondary index (attribute) into
Row matching, matched beta pruning filtering rule are shown in claim 5；
Step S43: all subscription entries for being unsatisfactory for matching aggregates content are deleted；
Step S44: judging whether index traverses completion, if so, returning to matching result set；Otherwise, step is continued to execute
S42.Specific matching process is shown in algorithm 5:
The matching algorithm of the netted multiple index of algorithm 5
Step S5: current event is pushed to and subscribes to the corresponding all users of entry set.
From the foregoing, it will be observed that being eliminated in traditional matching process the invention proposes a kind of matching algorithm of new multiple index
Counter, introduce concordance list, avoid replication problem in the matching process.Invention proposes a kind of towards distribution subscription
Netted multiple index matching process is connected the same different attribute node for subscribing to entry by chained list in index structure
It connects, can solve the problems, such as the repetition of matching process simultaneously and need to carry out indexing scanning entirely when deleting, significantly improve hair
Index efficiency when entry is deleted is subscribed in cloth ordering system.Index is improved herein, proposes netted multiple index
Structure can be effectively reduced algorithm complexity of the multiple index when deleting.
Those skilled in the art of the present technique are appreciated that the present invention can be related to for executing in operation described herein
The equipment of one or more operations.The equipment can specially design and manufacture for required purpose, or also may include
Known device in general purpose computer, the general purpose computer are activated or are reconstructed with having the procedure selection being stored in it.This
The computer program of sample can be stored in equipment (for example, computer) readable medium or be stored in be referred to suitable for storage electronics
It enables and is coupled in any kind of medium of bus respectively, the computer-readable medium is including but not limited to any kind of
Disk (including floppy disk, hard disk, CD, CD-ROM and magneto-optic disk), immediately memory (RAM), read-only memory (ROM), electricity can be compiled
Journey ROM, electrically erasable ROM (EPROM), electrically erasable ROM (EEPROM), flash memory, magnetic card or light card.It is readable
Medium includes for by any mechanism of the readable form storage or transmission information of equipment (for example, computer).For example, readable
Medium include immediately memory (RAM), read-only memory (ROM), magnetic disk storage medium, optical storage medium, flash memory device, with
The signal (such as carrier wave, infrared signal, digital signal) etc. that electricity, light, sound or other forms are propagated.
Those skilled in the art of the present technique be appreciated that can be realized with computer program instructions these structure charts and/or
The combination of each frame and these structure charts and/or the frame in block diagram and/or flow graph in block diagram and/or flow graph.It can be by this
The processor that a little computer program instructions are supplied to general purpose computer, special purpose computer or other programmable data processing methods comes
Machine is generated, is used for be performed instruction by the processor of computer or other programmable data processing methods and create
Realize the method specified in the frame or multiple frames of structure chart and/or block diagram and/or flow graph.
Those skilled in the art of the present technique have been appreciated that in the present invention the various operations crossed by discussion, method, in process
Steps, measures, and schemes can be replaced, changed, combined or be deleted.Further, each with having been crossed by discussion in the present invention
Kind of operation, method, other steps, measures, and schemes in process may also be alternated, changed, rearranged, decomposed, combined or deleted.
Further, in the prior art to have and the step in various operations, method disclosed in the present invention, process, measure, scheme
It may also be alternated, changed, rearranged, decomposed, combined or deleted.
The above is only some embodiments of the invention, it is noted that for the ordinary skill people of the art
For member, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications are also answered
It is considered as protection scope of the present invention.
Claims (8)
1. a kind of netted multiple index matching process towards distribution subscription, which is characterized in that comprise the following steps:
Step S1: defining the data structure of netted multiple index, which includes chained list and node, and node is ordered for storing
Read the attribute information of entry；
Step S2: constructing netted multiple index, creates global rope according to current all subscription entries in index initial phase
Draw；
Step S3: maintenance global index comprising two kinds of operations of insertion and deletion of index；
Step S4: current event is matched with entry is subscribed to using index matching algorithm, determination is matched with current event
Subscribe to entry set；
Step S5: current event is pushed to and subscribes to the corresponding all users of entry set；
Wherein, the subscription entry attributes information of the node storage includes:
Table one
2. the method as described in claim 1, which is characterized in that create the specific of global multistage netted index in the step S2
Operating procedure is as follows:
Step S21: for current new subscription entry, every subscription entry is parsed into multiple subscription items by subscribing to resolver
Part, subscription condition are attached by chained list；
Step S22: obtaining the present node of chained list, judges the operate operator that the node whether is had existed in index, if
It is to enter step S23；Otherwise, S24 is entered step；
Step S23: present node is inserted into index and worked as by selection level-one index corresponding with the operate operator of the node
In, enter step S25；
Step S24: constructing the level-one index of the operate operator of present node, present node be inserted into index, into
Enter rapid S25；
Step S25: being directed toward next node for the doubly linked list pointer in step S21, judges whether present node is empty, if
Enter step S26；Otherwise, step S22 is continued to execute；
Step S26: to different subscription conditions, the node of same alike result is attached by index point；
Step S27: completing current subscription entry and be added netted multiple index, return step S21, and to all subscription entries according to
Secondary execution step S21 to step S25, until all subscription entries are all added in netted multiple index.
3. method according to claim 2, which is characterized in that the sequence root of the step S23 and S24 interior joint insertion index
It is determined according to the type of operator operator.
4. method as claimed in claim 3, which is characterized in that the insertion sequence includes:
Sequence from small to large: when operator be >, >=when, the node insertion sequence in netted index is from small to large；
Descending order: when operator be <, <=when, the node insertion sequence in netted index is from big to small.
5. the method as described in claim 1, which is characterized in that the step S3 includes of both the insertion and deletion of index
Content, insertion refer to that the subscription entry for increasing user newly passes through index insertion database；Deletion refers to that will delete subscription entry cancellation orders
It reads, i.e., subscribed content is deleted from database by index.
6. method as claimed in claim 5, which is characterized in that the index creation in the index insertion operation and step S2 is grasped
The implementation procedure of work is identical.
7. method as claimed in claim 5, which is characterized in that steps are as follows for the specific execution of the index delete operation:
Step S31: subscription entry SID to be deleted is obtained；
Step S32: according to entry SID is subscribed to, the head pointer of the entry is searched in netted index and pointer is moved back into a section
Point；
Step S33: all preceding to node and backward node of present node is recorded, present node is deleted；
Step S34: the node in netted index is reconnected, and is subscribed to entry chain table pointer and is moved back one；
Step S35: judge whether pointer is empty, if it is not, continuing step S33；Otherwise, it deletes and subscribes to entry completion.
8. the method as described in claim 1, which is characterized in that the step S4's specific steps are as follows:
Step S41: extracting all subscription conditions of current event, forms matching set；
Step S42: it is successively indexed with the level-one in netted index and secondary index is matched；
Step S43: all subscription entries for being unsatisfactory for matching aggregates content are deleted；
Step S44: judging whether index traverses completion, if so, returning to matching result set；Otherwise, step S42 is continued to execute.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610459488.3A CN105893635B (en) | 2016-06-23 | 2016-06-23 | Netted multiple index matching process towards distribution subscription |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610459488.3A CN105893635B (en) | 2016-06-23 | 2016-06-23 | Netted multiple index matching process towards distribution subscription |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105893635A CN105893635A (en) | 2016-08-24 |
| CN105893635B true CN105893635B (en) | 2019-04-30 |
Family
ID=56718151
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610459488.3A Active CN105893635B (en) | 2016-06-23 | 2016-06-23 | Netted multiple index matching process towards distribution subscription |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105893635B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9667681B1 (en) * | 2016-09-23 | 2017-05-30 | Machine Zone, Inc. | Systems and methods for providing messages to multiple subscribers |
| CN112307318B (en) * | 2019-08-02 | 2024-03-08 | 中移(成都)信息通信科技有限公司 | Content publishing method, system and device |
| CN111062810A (en) * | 2019-11-12 | 2020-04-24 | 上交所技术有限责任公司 | Interface-based multidimensional index data processing method suitable for security trading system |
| CN113535705B (en) * | 2021-08-03 | 2024-02-02 | 佛山赛思禅科技有限公司 | SFAD cuckoo filter and repeated data deleting method based on SFAD cuckoo filter |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101295311A (en) * | 2008-06-17 | 2008-10-29 | 浙江大学 | Semantic matching algorithm of large scale issuance subscription system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8250032B2 (en) * | 2009-06-02 | 2012-08-21 | International Business Machines Corporation | Optimizing publish/subscribe matching for non-wildcarded topics |
-
2016
- 2016-06-23 CN CN201610459488.3A patent/CN105893635B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101295311A (en) * | 2008-06-17 | 2008-10-29 | 浙江大学 | Semantic matching algorithm of large scale issuance subscription system |
Non-Patent Citations (1)
| Title |
|---|
| 基于内容的发布/订阅匹配相关技术研究;邓婷婷;《万方数据库 长沙理工大学硕士学位论文》;20080925;正文第 7，20-25页 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105893635A (en) | 2016-08-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105893635B (en) | Netted multiple index matching process towards distribution subscription | |
| CN105608135B (en) | Data mining method and system based on Apriori algorithm | |
| CN109739894A (en) | Supplement method, apparatus, equipment and the storage medium of metadata description | |
| CN112287015B (en) | Image generation system, image generation method, electronic device, and storage medium | |
| Shie et al. | Efficient algorithms for discovering high utility user behavior patterns in mobile commerce environments | |
| CN100390793C (en) | System and method for indexing queries, rules and subscriptions | |
| CN109933505A (en) | Log processing method, device, computer equipment and storage medium | |
| Gogna et al. | Matrix completion incorporating auxiliary information for recommender system design | |
| CN109118155B (en) | Method and device for generating operation model | |
| CN108121827A (en) | A kind of synchronous method and device of full dose data | |
| CN108062378B (en) | The Connection inquiring method and system of more time serieses under a kind of storage of column | |
| CN110378148A (en) | A kind of multiple domain data-privacy guard method of facing cloud platform | |
| US11017031B2 (en) | System and method of data transformation | |
| CN103984760B (en) | The data structure of content oriented distribution subscription system and its compound event matching process | |
| CN106326295B (en) | Semantic data storage method and device | |
| KR101693727B1 (en) | Apparatus and method for reorganizing social issues from research and development perspective using social network | |
| Amati et al. | Modelling the temporal evolution of the retweet graph | |
| CN110263282A (en) | A kind of design method of the content distribution subscription communication pattern based on Kafka | |
| Lee et al. | Implementation of a large-scalable social data analysis system based on mapreduce | |
| US20140067840A1 (en) | System and method for retrieving information | |
| CN107291875A (en) | A kind of metadata organization management method and system based on metadata graph | |
| CN111262589A (en) | DFA space compression method and device | |
| CN108920676A (en) | A kind of method and system handling diagram data | |
| CN111782932B (en) | Method, device and computer readable storage medium for establishing data association | |
| Ayres | IC specification language |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |