CN105260465B - A kind of method, apparatus of diagram data processing service - Google Patents
A kind of method, apparatus of diagram data processing service Download PDFInfo
- Publication number
- CN105260465B CN105260465B CN201510673285.XA CN201510673285A CN105260465B CN 105260465 B CN105260465 B CN 105260465B CN 201510673285 A CN201510673285 A CN 201510673285A CN 105260465 B CN105260465 B CN 105260465B
- Authority
- CN
- China
- Prior art keywords
- information
- picture information
- subgraph
- node
- graph
- 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
- 238000010586 diagram Methods 0.000 title claims abstract description 72
- 238000012545 processing Methods 0.000 title claims abstract description 62
- 238000000034 method Methods 0.000 title claims abstract description 51
- 238000013507 mapping Methods 0.000 claims abstract description 61
- PMHURSZHKKJGBM-UHFFFAOYSA-N isoxaben Chemical group O1N=C(C(C)(CC)CC)C=C1NC(=O)C1=C(OC)C=CC=C1OC PMHURSZHKKJGBM-UHFFFAOYSA-N 0.000 claims description 18
- 238000005194 fractionation Methods 0.000 claims description 15
- 238000001514 detection method Methods 0.000 claims description 10
- 238000004140 cleaning Methods 0.000 claims description 6
- 238000012217 deletion Methods 0.000 claims description 6
- 230000037430 deletion Effects 0.000 claims description 6
- 238000003780 insertion Methods 0.000 claims description 5
- 230000037431 insertion Effects 0.000 claims description 5
- 230000000717 retained effect Effects 0.000 claims description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000009412 basement excavation Methods 0.000 description 1
- 238000007418 data mining Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
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
- G06F16/9027—Trees
-
- 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
- G06F16/9024—Graphs; Linked lists
-
- 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/903—Querying
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Software Systems (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- Economics (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The method, apparatus of diagram data processing service, the method includes：When receiving the picture information of inquiry target subgraph, the index mark of any of the picture information of target subgraph node of graph is obtained；The first mapping relations between being known with corresponding principal mark according to the index mark of the node of graph obtain corresponding principal mark and know；According to the corresponding physical extent of target subgraph described in the main identifier lookup；Whether judge in the physical extent comprising the identical identification information with principal mark knowledge；When in the physical extent comprising identical identification information is known with the principal mark, the picture information of the target subgraph is then got according to the identification information, to realize the information that can rapidly inquire subgraph by any node of graph, and then improve the efficiency of inquiry subgraph.
Description
Technical field
The present invention relates to graphical data mining technical fields, more particularly to a kind of method, apparatus of diagram data processing service.
Background technology
Figure is common a kind of abstract data structure in computer science and technology field, in practical applications many applied fields
Scape can be indicated with the topological structure of collection of illustrative plates, such as social networks is exactly a kind of typically data to scheme as basic structure,
The topological structure of entire social graph embodies interpersonal incidence relation in social networks.
Currently, the search problem of large-scale graph data causes extensive interest in academia and industrial quarters.It is existing
In technology, figure calculates the demand that social networks is mainly based upon with chart database, studies interpersonal relationship, the inquiry of figure
The diagram data processing method of servicing of the not instead of relationship focused on, the information containing keyword, the prior art stresses to calculate with figure,
The information for including keyword is returned to user, and can not achieve the efficient inquiry of collection of illustrative plates.
Invention content
The technical problem to be solved by the present invention is to improve the efficiency of inquiry sub-graph data, and then improve its in diagram data service
The treatment effeciency that he operates.
In order to solve the above technical problems, the embodiment of the present invention provides a kind of method of diagram data processing service, the method
Including：
When receiving the picture information of inquiry target subgraph, any of picture information of target subgraph figure section is obtained
The index mark of point；Wherein, the index mark of node of graph is corresponded with node of graph information；
The first mapping relations between being known with corresponding principal mark according to the index mark of the node of graph obtain corresponding principal mark
Know；Wherein, first mapping relations include：The class belonging to known node of graph is obtained according to the index mark of known node of graph
Type, according to the type by the corresponding Btree of Hash index selections, according to the known node of graph in the Btree
Index the principal mark knowledge that mark obtains subgraph, wherein a type corresponds to a Btree, includes a type in a Btree
The correspondence that the index mark of node of graph and the principal mark of subgraph identify；
According to the corresponding physical extent of target subgraph described in the main identifier lookup；Wherein, the principal mark know with it is described right
There are the second mapping relations between the physical extent answered；
Whether judge in the physical extent comprising the identical identification information with principal mark knowledge；
When including to know identical identification information with the principal mark in the physical extent, then obtained according to the identification information
To the picture information of the target subgraph；Wherein, the picture information of the identification information and a subgraph is one-to-one relationship；
The picture information of one subgraph includes the incidence relation information between node of graph information and node of graph；Between any two subgraph not
There are the incidence relation information of two node of graph.
Optionally, the diagram data handles the method serviced, further includes：
When receiving information of the one group of incidence relation information of insertion to a picture information to be updated, obtain to be added
The corresponding two node of graph information of an incidence relation information index mark respectively as first index mark and the second rope
Tendering is known；Wherein, an incidence relation information corresponds to the node of graph information of two node of graph, and an incidence relation information includes two
Incidence relation, degree of incidence and the last correlation time of a node of graph；
The first picture information is obtained according to the first index mark, the second subgraph is obtained according to the second index mark
Information；
When first picture information and second picture information belong to the same picture information to be updated,
The incidence relation information is updated in the physical extent where the picture information to be updated, obtains update picture information；
When a picture information in first picture information and second picture information is blank, in acquisition
To update the incidence relation information in the physical extent where the picture information to be updated of blank, corresponding subgraph letter is established
Described the first of the principal mark knowledge that breath indexes mark or the second index mark and the picture information to be updated for the first of blank
Mapping relations；
When first picture information and the second picture information difference, the first picture information and the second subgraph are believed
Breath merges, and obtains update picture information.
Optionally, described to merge the first picture information with the second picture information, update picture information is obtained, including：
Using first picture information or second picture information as chief subgraph information, another picture information is read
And physical extent where the chief subgraph information is written into another described picture information；
It establishes and identifies the corresponding node of graph of identical index mark with first index and index mark with described second
Identical index identifies the incidence relation between corresponding node of graph；
The principal mark of the chief subgraph information is known and is known as the principal mark of the update subgraph；
Update the principal mark knowledge that mark and the update subgraph are respectively indexed in another described picture information described first is reflected
Penetrate relationship.
Optionally, the diagram data handles the method serviced, further includes：
When an incidence relation information needs to delete in service detection to picture information, an association to be added is obtained
The index mark of the corresponding two node of graph information of relation information is identified respectively as the first index mark and the second index；Its
In, an incidence relation information corresponds to the node of graph information of two node of graph, and an incidence relation information includes two node of graph
Incidence relation, degree of incidence and last correlation time；
Target picture information is obtained according to the first index mark or the second index mark；
The incidence relation information is deleted in the physical extent where the target picture information, obtains update subgraph letter
Breath.
Optionally, an incidence relation information needs to delete in the service detection to picture information, including：
When detecting that picture information reaches fixed threshold there are the associated weights value in incidence relation information, deletion pair is needed
The incidence relation information answered；Wherein, the associated weights value calculates institute according to the degree of incidence and the last correlation time
?.
Optionally, the incidence relation information is deleted in the physical extent where the target picture information, obtained
To update picture information, including：
After deleting the incidence relation information, the target picture information forms the picture information of subgraph after multiple fractionations
When, subgraph after the index mark number at most corresponding fractionation of node of graph is retained, subgraph after the fractionation of reservation is made
To update subgraph.
Optionally, the diagram data handles the method serviced, further includes：
When receiving the information of picture information of delete target subgraph, obtains in the picture information of the target subgraph and appoint
The index of one node of graph identifies；
First mapping relations between being known according to the index mark and the index mark and principal mark obtain principal mark and know；
The second mapping relationship searching target physical subregion of corresponding target physical by stages is known according to the principal mark；
When knowing there are the principal mark in the target physical subregion, the delete target subgraph in the target physical subregion
Picture information, second mapping relations and the target subgraph picture information in each node of graph and corresponding master
Identify the first mapping relations of intersymbol；
The picture information for the principal mark knowledge for only including the target subgraph is written in the target physical subregion.
Optionally, the diagram data handles the method serviced, further includes：
When the service, which is received, needs to carry out the information of disk arrangement there are physical extent for clearance, current institute is recorded
The picture information for stating physical extent for clearance is SNAPSHOT INFO；
The SNAPSHOT INFO is write into exchange area；The exchange area is unappropriated space in disk；
The occupied physical extent of deleted subgraph in the SNAPSHOT INFO is removed in the exchange area；
The exchange area is written into the synchronizing information being newly written in presently described physical extent for clearance；
Information in the exchange area is covered into the information in the physical extent for clearance.
Optionally, the diagram data handles the method serviced, further includes：
The principal mark of required acquisition is known in the daily diagram data processing procedure of record；
All principal marks recorded in the defined term of validity are known and are merged, effective main identification sets are obtained；
Picture information library is searched for, the effective principal mark knowledge is not appeared in when inquiring in the picture information library to exist
When the picture information of concentration, the picture information is deleted.
The embodiment of the present invention additionally provides a kind of device of diagram data processing service, and described device includes：
First acquisition unit obtains the son of the target subgraph when suitable for receiving the picture information for inquiring target subgraph
The index mark of any node of graph in figure information；Wherein, the index mark of node of graph is corresponded with node of graph information；
First main mark acquiring unit, the first mapping between being known with corresponding principal mark according to the index mark of the node of graph
The corresponding principal mark of Relation acquisition is known；Wherein, first mapping relations include：It is obtained according to the index of known node of graph mark
Know the type belonging to node of graph, according to the type by the corresponding Btree of Hash index selections, is suitable in the Btree
The principal mark that subgraph is obtained according to the index mark of any node of graph is known, wherein type corresponds to a Btree, one
The correspondence that the index mark of the node of graph comprising a type and the principal mark of subgraph identify in Btree；
Physical extent searching unit is suitable for according to the corresponding physical extent of target subgraph described in the main identifier lookup；Its
In, the principal mark is known and there are the second mapping relations between the corresponding physical extent；
First judging unit is suitable for judging in the physical extent whether believing comprising the identical mark with principal mark knowledge
Breath；
First object subgraph acquiring unit is suitable for working as in the physical extent and believing comprising the identical mark with principal mark knowledge
Breath, then get the picture information of the target subgraph according to the identification information；Wherein, the identification information and a subgraph
Picture information be one-to-one relationship；The picture information of one subgraph includes the association between node of graph information and node of graph
Relation information；The incidence relation information of two node of graph is not present between any two subgraph.
Optionally, the device of the diagram data processing service further includes that incidence relation is inserted into unit, and the incidence relation is inserted
Entering unit includes：
Second acquisition unit, suitable for being inserted into one group of incidence relation information to picture information to be updated receiving
When information, the index for obtaining two node of graph information in an incidence relation information to be added is identified respectively as the first rope
Tendering is known and the second index identifies；Wherein, an incidence relation information corresponds to the node of graph information of two node of graph, an association
Relation information includes the incidence relation, degree of incidence and last correlation time of two node of graph；
Second target subgraph acquiring unit is suitable for obtaining the first picture information according to the first index mark, according to institute
It states the second index mark and obtains the second picture information；
First updating unit belongs to same suitable for working as first picture information and second picture information and described waits for
When newer picture information, the incidence relation information is updated in the physical extent where the picture information to be updated,
Obtain update picture information；
Second updating unit, when a picture information in first picture information and second picture information is sky
Bai Shi updates the incidence relation information in acquisition is not for the physical extent where the picture information to be updated of blank,
Establish the master of the first index mark or the second index mark and the picture information to be updated that corresponding picture information is blank
First mapping relations of mark；
Third updating unit is suitable for when first picture information and the second picture information difference, by the first son
Figure information merges with the second picture information, obtains update picture information.
Optionally, the third updating unit is suitable for：
Using first picture information or second picture information as chief subgraph information, another picture information is read
And physical extent where the chief subgraph information is written into another described picture information；
It establishes and identifies the corresponding node of graph of identical index mark with first index and index mark with described second
Identical index identifies the incidence relation between corresponding node of graph；
The principal mark of the chief subgraph information is known and is known as the principal mark of the update subgraph；
Update the principal mark knowledge that mark and the update subgraph are respectively indexed in another described picture information described first is reflected
Penetrate relationship.
Optionally, the device of the diagram data processing service, further includes incidence relation deleting unit, the incidence relation is deleted
Except unit includes：
Third acquiring unit, suitable for when an incidence relation information needs to delete in service detection to picture information, obtaining
It takes the index of the corresponding two node of graph information of an incidence relation information to be added to identify to identify respectively as the first index
With the second index mark；Wherein, an incidence relation information corresponds to the node of graph information of two node of graph, an incidence relation letter
Breath includes the incidence relation, degree of incidence and last correlation time of two node of graph；
Third target subgraph acquiring unit is suitable for obtaining mesh according to the first index mark or the second index mark
Mark picture information；
Incidence relation information deletion unit, suitable for deleting the pass in the physical extent where the target picture information
Join relation information, obtains update picture information.
Optionally, the incidence relation deleting unit further includes second judgment unit, is suitable for there is association in picture information
When associated weights value in relation information reaches fixed threshold, judgement needs to delete corresponding incidence relation information；Wherein, described
Associated weights value is as obtained by the degree of incidence and the last correlation time calculating.
Optionally, the incidence relation information deletion unit is suitable for：After deleting the incidence relation information, the target
When picture information forms the picture information of subgraph after multiple fractionations, by the index mark number at most corresponding fractionations of node of graph
Subgraph retains afterwards, using subgraph after the fractionation of reservation as update subgraph.
Optionally, the device of the diagram data processing service, further includes subgraph deleting unit, the subgraph deleting unit packet
It includes：
4th acquiring unit when information suitable for the picture information for receiving delete target subgraph, obtains target
The index mark of any node of graph in the picture information of figure；
4th main mark acquiring unit, described in being identified between principal mark knowledge according to index mark and the index
First mapping relations obtain principal mark and know；
Target physical subregion searching unit, suitable for knowing the second of corresponding target physical by stages according to the principal mark
Mapping relationship searching target physical subregion；
Deleting unit, suitable for when knowing there are the principal mark in the target physical subregion, in the target physical subregion
Each scheme in the picture information of the picture information of middle delete target subgraph, second mapping relations and the target subgraph
Node knows the first mapping relations of intersymbol with corresponding principal mark；
Writing unit, suitable for the subgraph for the principal mark knowledge for only including the target subgraph is written in the target physical subregion
Information.
Optionally, the device of the diagram data processing service, further includes physical extent cleaning unit, and the physical extent is clear
Managing unit includes：
First recording unit, suitable for there are physical extents for clearance to need to carry out disk arrangement when the service is received
When information, the picture information suitable for recording presently described physical extent for clearance is SNAPSHOT INFO；
Exchange area writing unit, suitable for the SNAPSHOT INFO is write exchange area；The exchange area is not occupied in disk
Space；
Unit is cleared up, suitable for being removed in the exchange area occupied by the deleted subgraph in the SNAPSHOT INFO
Physical extent；
The exchange is written in synchronization unit, the synchronizing information suitable for will be newly written in presently described physical extent for clearance
Area；
Capping unit, suitable for the information in the exchange area to be covered to the information in the physical extent for clearance.
Optionally, the device of the diagram data processing service, further includes subgraph cleaning unit, and the subgraph clears up unit packet
It includes：
Second recording unit, the principal mark for being suitable for recording required acquisition in the diagram data processing procedure daily are known；
Principal mark knows combining unit, merges suitable for knowing all principal marks recorded in the defined term of validity, obtains effectively
Main identification sets；
Picture information clears up unit, is adapted to search for picture information library, does not have when inquiring to exist in the picture information library
When appearing in the picture information that the effective principal mark knowledge is concentrated, the picture information is deleted.
Compared with prior art, the technical solution of the embodiment of the present invention has the advantages that：
The embodiment of the present invention is by when receiving the picture information of inquiry target subgraph, obtaining the son of the target subgraph
The index of any of figure information node of graph identifies, and first between being known with corresponding principal mark according to the index mark of the node of graph
Mapping relations obtain corresponding principal mark and know, and according to the corresponding physical extent of target subgraph described in the main identifier lookup, judge institute
It whether states in physical extent comprising knowing identical identification information with the principal mark, when including in the physical extent and the principal mark
When knowing identical identification information, then the picture information of the target subgraph is got according to the identification information, due to the present invention
The technical solution of embodiment by the information of any node of graph can the principal mark of effective acquisition subgraph know, and then quickly through described
The principal mark of subgraph knows the physical extent for finding subgraph storage, to realize the letter that can inquire subgraph by any node of graph
Breath improves the efficiency of inquiry subgraph.
Further, the technical solution of the embodiment of the present invention can also carry out corresponding according to the information instruction that service detection arrives
Insertion incidence relation operation, delete incidence relation operation and delete subgraph operation, due to inquiring subgraph involved in aforesaid operations
The scheme of above-mentioned inquiry picture information is used when information, therefore corresponding diagram data treatment effeciency also correspondingly improves.
Further, the technical solution of the embodiment of the present invention is reached by the associated weights in detecting incidence relation information
When fixed threshold, corresponding incidence relation information is deleted, so that the connected relation between node of graph keeps strong continune, it is unlikely
In making subgraph become infinitely great, and then the efficiency of inquiry subgraph can be improved.
Further, the technical solution of the embodiment of the present invention is required in the diagram data processing procedure daily by recording
The principal mark obtained is known, and all principal marks recorded in the defined term of validity are known and are merged, effective main identification sets are obtained,
Picture information library is searched for, the effective principal mark is not appeared in when inquiring in the picture information library to exist and knows the son concentrated
When figure information, the picture information is deleted, to realize the size by periodically removing the diagram data to control storage, is avoided
Data are unfavorable for the inquiry and processing of diagram data without limitation expansion.
Description of the drawings
Fig. 1 is the structural schematic diagram of the drawing of seeds in the embodiment of the present invention；
Fig. 2 is a kind of flow chart of the method for diagram data processing service in the embodiment of the present invention；
Fig. 3 is the flow chart of the method for another diagram data processing service in the embodiment of the present invention；
Fig. 4 is the flow chart of the method for another diagram data processing service in the embodiment of the present invention；
Fig. 5 is the flow chart of the method for another diagram data processing service in the embodiment of the present invention；
Fig. 6 is the flow chart of the method for another diagram data processing service in the embodiment of the present invention；
Fig. 7 is a kind of structural schematic diagram of the device of diagram data processing service in the embodiment of the present invention.
Specific implementation mode
As previously mentioned, in the prior art, figure calculates and chart database is mainly based upon the demand of social networks, research people with
Relationship between people, the not instead of relationship of the inquiry emphasis of figure, the information containing keyword, the diagram data processing of the prior art
Method of servicing stresses to calculate with figure, and the information for including keyword is returned to user, and can not achieve the efficient inquiry of collection of illustrative plates.
When the embodiment of the present invention is by receiving the picture information for inquiring target subgraph, the subgraph of the target subgraph is obtained
The index of any of information node of graph identifies；First between being known with corresponding principal mark according to the index mark of the node of graph reflects
The corresponding principal mark of Relation acquisition is penetrated to know；According to the corresponding physical extent of target subgraph described in the main identifier lookup；Described in judgement
Whether include the identical identification information with principal mark knowledge in physical extent；When in the physical extent include and the principal mark know
Identical identification information then gets the picture information of the target subgraph according to the identification information, to realize by appointing
One node of graph can inquire the information of subgraph, and then improve the efficiency of inquiry subgraph.
It is understandable to enable above-mentioned purpose, feature and the advantageous effect of the present invention to become apparent, below in conjunction with the accompanying drawings to this
The specific embodiment of invention is described in detail.
Fig. 1 is the structural schematic diagram of the drawing of seeds in the embodiment of the present invention.It is respectively subgraph to have two subgraphs in Fig. 1
A and subgraph b.Figure includes node of graph information and side as a kind of common data structure, is connected because figure a and figure b do not have in Fig. 1
Clearance system and be divided into two subgraphs of subgraph a and subgraph b, be made of node of graph and incidence relation in subgraph, each node of graph
It can be specifically defined as referring to a certain information in practical application scene, and the side of subgraph represents the pass of the association between two node of graph
System.For example, it is assumed that collection of illustrative plates is the topological diagram of the service account in Internet service, then node of graph V1 and node of graph in subgraph a
V2 can specifically represent the account logged in Internet service, such as node of graph V1 can represent the microblog account information of user,
Node of graph V2 can represent the wechat account information of user, and the side between node of graph V1 and node of graph V2 represents the microblogging account of user
There are incidence relations for number information and the wechat account information of user.
It should be pointed out that can be specifically defined it is uniquely corresponding with a node of graph by which information content, for example, figure section
Point V1 can represent the microblog account information of user A and V2 can represent the wechat account information of user.In addition to this it is possible to
It defines node of graph V1 and represents user using A terminal landing microblog accounts, and node of graph V2 represents user and uses B terminal landing microbloggings
Account, i.e. user log in same Internet service account in different terminals can also be subdivided into different node of graph, figure section
The identification information of terminal can be added in point information so that node of graph information is uniquely corresponding with a node of graph, every by defining
The node of graph information of a node of graph can contribute to excavate the abundant data such as user behavior of the user on different terminals.
In the specific implementation of the present invention, there are one principal marks to know for each subgraph, and the principal mark knowledge of each subgraph is for the first time
The index of node of graph when incidence relation is written identifies, and index mark and the node of graph information of the node of graph correspond.Example
Such as, node of graph when incidence relation is written in Fig. 1 in subgraph a for the first time is V1, and the index of node of graph V1 is identified as 1, then indexes
Mark 1 is known for the principal mark of subgraph a.
In the specific implementation of the present invention, each node of graph has a type belonging to oneself, a type in the same subgraph
It can be by multiple node of graph.For example, in subgraph a, node of graph V1 and V2 belong to microblog account, and node of graph V3 and V4 belong to wechat
Account.
In specific implementation, an incidence relation in subgraph corresponds to the node of graph information of two node of graph, an association
Relation information includes the incidence relation, degree of incidence and last correlation time of two node of graph.In specific implementation, the association is closed
Be information further include associated weights value, the associated weights value calculates institute according to the degree of incidence and the last correlation time
?.
The technical solution of the embodiment of the present invention, which can be inquired efficiently, reads sub-graph data information, can also believe sub-graph data
It ceases and the operation processings such as is inserted further into, is deleted.The acquisition and processing of the sub-graph data information are conducive to user behavior
The excavation and research of data.
The method of the diagram data processing service of the present invention is illustrated with reference to specific embodiment.
Fig. 2 is a kind of flow chart of the method for diagram data processing service in the embodiment of the present invention.Figure number shown in Fig. 2
According to the method for processing service, it may comprise steps of, illustrate referring to Fig.1：
Step S201：When receiving the picture information of inquiry target subgraph, in the picture information for obtaining the target subgraph
The index of any one node of graph identifies.
The index of the node of graph information of each node of graph of subgraph a and node of graph mark corresponds in Fig. 1.For example, sub
The node of graph that incidence relation is written in figure a for the first time is V1, the index mark of node of graph V1, V2, V3, V4 corresponds to 1 respectively, 2,
3,4, the master of subgraph a is identified as 1.
In specific implementation, when receiving the picture information of inquiry target group picture, the node of graph that is obtained from inquiry request
Index mark may be the index mark of any one node of graph in picture information, be not limited to the rope of specific node of graph
Tendering is known.
Step S202：The first mapping relations acquisition pair between being known with corresponding principal mark according to the index mark of the node of graph
The principal mark answered is known.
In specific implementation, first mapping relations include：Known figure section is obtained according to the index of known node of graph mark
Type belonging to point, according to the type by the corresponding Btree of Hash index selections, in the Btree according to
Know that the index mark of node of graph obtains the principal mark knowledge of subgraph, wherein a type corresponds to a Btree, includes in a Btree
The correspondence that the index mark of the node of graph of one type and the principal mark of subgraph identify.
For example, the index for getting node of graph V3 in step S201 is identified as 3, figure section is obtained according to index mark 3
Type described in point V1 passes through the corresponding Btree of Hash index selections according to the type.The type of V1 and V2 belongs to microblogging
Account contains the corresponding pass that node of graph V1 and V2 knows 1 with the principal mark of subgraph a in the Btree of this type of microblog account
Therefore system according to the correspondence of the index mark and subgraph principal mark knowledge 1 of known node of graph V3 in the Btree, can obtain
The principal mark of subgraph a knows 1.
Step S203：According to the corresponding physical extent of target subgraph described in the main identifier lookup.
In specific implementation, it is the second mapping that the principal mark, which is known with existing mapping relations between the corresponding physical extent,
Relationship can find the corresponding physical extent of target subgraph according to second mapping relations.Specifically, each subgraph storage
One physical location of corresponding disk has the region of certain length since some is cheap.Based on second mapping relations
The index relative established between mark and disk offset and length, for example, the length of subgraph a is 30, then the second mapping is closed
The principal mark that system is subgraph a knows and the index relative between its disk offset 1 and length 30, then is according to second mapping relations
Storage locations of the subgraph a in disk can be found.
Step S204：Whether judge in the physical extent comprising the identical identification information with principal mark knowledge.
In specific implementation, if including when knowing identical identification information with the principal mark, to illustrate in the physical extent
The data that corresponding subgraph is known with the principal mark are stored in the physical extent.
Step S205：When including to know identical identification information with the principal mark in the physical extent, then according to the mark
Picture information of the knowledge acquisition of information to the target subgraph.
The embodiment of the present invention obtains corresponding principal mark according to the index of node of graph mark by the first mapping relations and knows,
The corresponding physical extent of target subgraph for finding inquiry is known according to the principal mark by the second mapping relations, is realized known to
Subgraph in Subgraph node checks to subgraph storage location and read sub-graph data information, to improve lookup subgraph
Efficiency.
Fig. 3 is the flow chart of the method for another diagram data processing service in the embodiment of the present invention.Figure as shown in Figure 3
The method of data processing service may include：
Step S301：When receiving information of the one group of incidence relation information of insertion to a picture information to be updated,
The index mark for obtaining the corresponding two node of graph information of an incidence relation information to be added is marked respectively as the first index
Know and the second index identifies.In specific implementation, an incidence relation information corresponds to the node of graph information of two node of graph, Yi Tiaoguan
Connection relation information includes the incidence relation, degree of incidence and last correlation time of two node of graph.
Step S302：The first picture information is obtained according to the first index mark, is obtained according to the second index mark
Take the second picture information.In specific implementation, the side according to the method for index Identification acquisition picture information and Fig. 2
Method is identical, and this will not be repeated here.
Step S303：When first picture information and second picture information belong to the same son to be updated
When figure information, the incidence relation information is updated in the physical extent where the picture information to be updated, is updated
Picture information.
Step S304：When a picture information in first picture information and second picture information is blank
When, the incidence relation information is updated in acquisition is not for the physical extent where the picture information to be updated of blank, is built
Vertical corresponding picture information is the first index mark of blank or the principal mark of the second index mark and the picture information to be updated
First mapping relations known.
Step S305：When first picture information and the second picture information difference, by the first picture information with
Second picture information merges, and obtains update picture information.In specific implementation, described to believe the first picture information and the second subgraph
Breath merges, and obtains update picture information and may include：Using first picture information or second picture information as boss
Figure information reads another picture information and chief subgraph information place physics point is written in another described picture information
Area；Establish identify the corresponding node of graph of identical index mark with first index and indexed with described second identify it is identical
Index identifies the incidence relation between corresponding node of graph；The principal mark of the chief subgraph information is known into the master as the update subgraph
Mark；First mapping that respectively principal mark of index mark and the update subgraph is known in another described picture information of update is closed
System.
Fig. 4 is the flow chart of the method for another diagram data processing service in the embodiment of the present invention.Figure as shown in Figure 4
The method of data processing service may include：
Step S401：When an incidence relation information needs to delete in service detection to picture information, obtain to be added
The corresponding two node of graph information of an incidence relation information index mark respectively as first index mark and the second rope
Tendering is known.
In specific implementation, an incidence relation information corresponds to the node of graph information of two node of graph, an incidence relation
Information includes the incidence relation, degree of incidence and last correlation time of two node of graph.
In specific implementation, an incidence relation information needs to delete in the service detection to picture information, can wrap
It includes：
When detecting that picture information reaches fixed threshold there are the associated weights value in incidence relation information, deletion pair is needed
The incidence relation information answered；Wherein, the associated weights value calculates institute according to the degree of incidence and the last correlation time
?.It should be pointed out that the fixed threshold can be configured as needed, it is not limited.
Step S402：Target picture information is obtained according to the first index mark or the second index mark.
In specific implementation, the method that acquisition target picture information is identified according to index is identical as method described in Fig. 2,
This is not repeated.
Step S403：The incidence relation information is deleted in the physical extent where the target picture information, is obtained
Update picture information.
In specific implementation, after deleting the incidence relation information, the target picture information forms son after multiple fractionations
When the picture information of figure, subgraph after the index mark number at most corresponding fractionation of node of graph is retained, described in reservation
Subgraph is as update subgraph after fractionation.
Fig. 5 is the flow chart of the method for another diagram data processing service in the embodiment of the present invention.Figure as shown in Figure 5
The method of data processing service may include：
Step S501：When receiving the information of picture information of delete target subgraph, the son of the target subgraph is obtained
The index mark of any node of graph in figure information.
Step S502：First mapping relations between being known according to the index mark and the index mark and principal mark obtain
Principal mark is taken to know.
Step S503：The second mapping relationship searching target of corresponding target physical by stages is known according to the principal mark
Physical extent.
Step S504：When knowing there are the principal mark in the target physical subregion, deleted in the target physical subregion
Except each node of graph in the picture information of the picture information of target subgraph, second mapping relations and the target subgraph
The first mapping relations of intersymbol are known with corresponding principal mark；
Step S505：The subgraph letter for the principal mark knowledge for only including the target subgraph is written in the target physical subregion
Breath.
Fig. 6 is the flow chart of the method for another diagram data processing service in the embodiment of the present invention.Figure as shown in FIG. 6
The method of data processing service may include：
Step S601：The principal mark of required acquisition is known in the daily diagram data processing procedure of record.
Step S602：All principal marks recorded in the defined term of validity are known and are merged, effective main identification sets are obtained.
In specific implementation, the defined term of validity can carry out different settings, not limit herein.
Step S603：Picture information library is searched for, described is had when inquiring in the picture information library to exist not appearing in
When the principal mark of effect knows the picture information concentrated, the picture information is deleted.
In specific implementation, diagram data handles the method serviced, can also include：
When the service, which is received, needs to carry out the information of disk arrangement there are physical extent for clearance, current institute is recorded
The picture information for stating physical extent for clearance is SNAPSHOT INFO；The SNAPSHOT INFO is write into exchange area；The exchange area is magnetic
Unappropriated space in disk；The deleted subgraph removed in the exchange area in the SNAPSHOT INFO is occupied
Physical extent；The exchange area is written into the synchronizing information being newly written in presently described physical extent for clearance；By the exchange
Information in area covers the information in the physical extent for clearance.
Said program realizes periodic cleaning whithin a period of time without the picture information of progress frequent operation, to avoid
Inquiry subgraph efficiency is impacted because data unlimitedly expand.
Fig. 7 is a kind of structural schematic diagram of the device of diagram data processing service in the embodiment of the present invention.The diagram data
Handling the device 70 serviced may include：
First acquisition unit 701 obtains the target subgraph when suitable for receiving the picture information for inquiring target subgraph
The index mark of any node of graph in picture information；Wherein, the index mark of node of graph is corresponded with node of graph information；
First main mark acquiring unit 702, first between being known with corresponding principal mark according to the index mark of the node of graph
Mapping relations obtain corresponding principal mark and know；Wherein, first mapping relations include：It is obtained according to the index of known node of graph mark
The type belonging to known node of graph is taken, according to the type by the corresponding Btree of Hash index selections, is suitable for described
The principal mark that subgraph is obtained according to the index mark of any node of graph in Btree is known, wherein a type corresponds to one
The correspondence that the index mark of the node of graph comprising a type and the principal mark of subgraph identify in Btree, a Btree；
Physical extent searching unit 703 is suitable for according to the corresponding physical extent of target subgraph described in the main identifier lookup；
Wherein, the principal mark is known and there are the second mapping relations between the corresponding physical extent；
Whether the first judging unit 704 is suitable for judging in the physical extent comprising the identical mark with principal mark knowledge
Information；
First object subgraph acquiring unit 705 is suitable for working as in the physical extent comprising the identical mark with principal mark knowledge
Know information, then gets the picture information of the target subgraph according to the identification information；Wherein, the identification information and one
The picture information of subgraph is one-to-one relationship；The picture information of one subgraph includes between node of graph information and node of graph
Incidence relation information；The incidence relation information of two node of graph is not present between any two subgraph.
The diagram data handles the device 70 serviced：Incidence relation is inserted into unit 711, the incidence relation
Being inserted into unit 711 may include：
Second acquisition unit, suitable for being inserted into one group of incidence relation information to picture information to be updated receiving
When information, the index for obtaining two node of graph information in an incidence relation information to be added is identified respectively as the first rope
Tendering is known and the second index identifies；Wherein, an incidence relation information corresponds to the node of graph information of two node of graph, an association
Relation information includes the incidence relation, degree of incidence and last correlation time of two node of graph；Second target subgraph acquiring unit,
Suitable for obtaining the first picture information according to the first index mark, the second subgraph letter is obtained according to the second index mark
Breath；First updating unit belongs to same described to be updated suitable for working as first picture information and second picture information
Picture information when, the incidence relation information is updated in the physical extent where the picture information to be updated, is obtained
Update picture information；Second updating unit, when the subgraph letter in first picture information and second picture information
When breath is blank, the incidence relation is updated in acquisition is not for the physical extent where the picture information to be updated of blank
Information establishes the first index mark or the second index mark and the picture information to be updated that corresponding picture information is blank
Principal mark know first mapping relations；Third updating unit is suitable for working as first picture information and second subgraph
When information difference, the first picture information is merged with the second picture information, obtains update picture information.
In specific implementation, the third updating unit is merging the first picture information with the second picture information, obtains
When updating picture information, it is suitable for, using first picture information or second picture information as chief subgraph information, reading another
Simultaneously physical extent where the chief subgraph information is written in another described picture information by one picture information；It establishes and described the
One index identifies the identical corresponding node of graph of index mark and index mark identical with the second index mark is corresponding
Incidence relation between node of graph；The principal mark of the chief subgraph information is known and is known as the principal mark of the update subgraph；Described in update
First mapping relations that respectively principal mark of index mark and the update subgraph is known in another picture information.
In specific implementation, the device 70 of the diagram data processing service can also include incidence relation deleting unit 721；
The incidence relation deleting unit 721 may include：
Third acquiring unit, suitable for when an incidence relation information needs to delete in service detection to picture information, obtaining
It takes the index of the corresponding two node of graph information of an incidence relation information to be added to identify to identify respectively as the first index
With the second index mark；Wherein, an incidence relation information corresponds to the node of graph information of two node of graph, an incidence relation letter
Breath includes the incidence relation, degree of incidence and last correlation time of two node of graph；Third target subgraph acquiring unit is suitable for root
Target picture information is obtained according to the first index mark or the second index mark；Incidence relation information deletion unit is fitted
The incidence relation information is deleted in the physical extent where the target picture information, obtains update picture information.
In specific implementation is implemented, the incidence relation deleting unit 721 can also include：
Second judgment unit, suitable for there are the associated weights values in incidence relation information to reach fixed threshold in picture information
When, judgement needs to delete corresponding incidence relation information；Wherein, the associated weights value by the degree of incidence and it is described most
Correlation time calculates gained afterwards.
In specific implementation, the device 70 of the diagram data processing service can also include：Subgraph deleting unit 731, institute
Stating subgraph deleting unit 731 may include：4th acquiring unit, the information of the picture information suitable for receiving delete target subgraph
When, obtain the index mark of any node of graph in the picture information of the target subgraph；4th main mark acquiring unit is suitable for root
First mapping relations between knowing according to the index mark and the index mark and principal mark obtain principal mark and know；Target physical point
Area's searching unit, suitable for knowing the second mapping relationship searching object of corresponding target physical by stages according to the principal mark
Manage subregion；Deleting unit, suitable for when knowing there are the principal mark in the target physical subregion, in the target physical subregion
Each figure saves in the picture information of the picture information of delete target subgraph, second mapping relations and the target subgraph
Point knows the first mapping relations of intersymbol with corresponding principal mark；Writing unit is only wrapped suitable for being written in the target physical subregion
The picture information that principal mark containing the target subgraph is known.
In specific implementation, the device 70 of the diagram data processing service can also include：Physical extent clears up unit
741, the physical extent clears up unit 741 and may include：
First recording unit, suitable for there are physical extents for clearance to need to carry out disk arrangement when the service is received
When information, the picture information suitable for recording presently described physical extent for clearance is SNAPSHOT INFO；Exchange area writing unit, is suitable for
The SNAPSHOT INFO is write into exchange area；The exchange area is unappropriated space in disk；Unit is cleared up, is suitable for described
The occupied physical extent of deleted subgraph in the SNAPSHOT INFO is removed in exchange area；Synchronization unit, being suitable for will
The exchange area is written in the synchronizing information being newly written in presently described physical extent for clearance；Capping unit is suitable for the friendship
It changes the information in area and covers information in the physical extent for clearance.
In specific implementation, the device 70 of the diagram data processing service can also include that subgraph clears up unit 751, described
Subgraph clears up unit 751：
Second recording unit, the principal mark for being suitable for recording required acquisition in the diagram data processing procedure daily are known；
Principal mark knows combining unit, merges suitable for knowing all principal marks recorded in the defined term of validity, obtains effective principal mark and know
Collection；Picture information clears up unit, is adapted to search for picture information library, is not appeared in when inquiring to exist in the picture information library
When the effective principal mark knows the picture information concentrated, the picture information is deleted.
One of ordinary skill in the art will appreciate that all or part of step in the various methods of above-described embodiment is can
It is completed with instructing relevant hardware by program, which can be stored in computer readable storage medium, and storage is situated between
Matter may include：ROM, RAM, disk or CD etc..
Although present disclosure is as above, present invention is not limited to this.Any those skilled in the art are not departing from this
It in the spirit and scope of invention, can make various changes or modifications, therefore protection scope of the present invention should be with claim institute
Subject to the range of restriction.
Claims (18)
1. a kind of method of diagram data processing service, which is characterized in that including：
When receiving the picture information of inquiry target subgraph, any of the picture information of target subgraph node of graph is obtained
Index mark；Wherein, the index mark of node of graph is corresponded with node of graph information；
The first mapping relations between being known with corresponding principal mark according to the index mark of the node of graph obtain corresponding principal mark and know；Its
In, first mapping relations include：The type belonging to known node of graph is obtained according to the index mark of known node of graph, according to
The type is identified in the Btree according to the index of the known node of graph by the corresponding Btree of Hash index selections
The principal mark for obtaining subgraph is known, wherein a type corresponds to a Btree, includes the node of graph of a type in a Btree
The correspondence that the principal mark of index mark and subgraph is known；
According to the corresponding physical extent of target subgraph described in the main identifier lookup；Wherein, the principal mark know with it is described corresponding
There are the second mapping relations between physical extent；
Whether judge in the physical extent comprising the identical identification information with principal mark knowledge；
When including to know identical identification information with the principal mark in the physical extent, then institute is got according to the identification information
State the picture information of target subgraph；Wherein, the picture information of the identification information and a subgraph is one-to-one relationship；It is described
The picture information of one subgraph includes the incidence relation information between node of graph information and node of graph；It is not present between any two subgraph
The incidence relation information of two node of graph.
2. the method for diagram data processing service according to claim 1, which is characterized in that further include：
When receiving information of the one group of incidence relation information of insertion to a picture information to be updated, to be added one is obtained
The index mark of the corresponding two node of graph information of incidence relation information is marked respectively as the first index mark and the second index
Know；Wherein, an incidence relation information corresponds to the node of graph information of two node of graph, and an incidence relation information includes two figures
Incidence relation, degree of incidence and the last correlation time of node；
The first picture information is obtained according to the first index mark, the second subgraph letter is obtained according to the second index mark
Breath；
When first picture information and second picture information belong to the same picture information to be updated, in institute
It states in the physical extent where picture information to be updated and updates the incidence relation information, obtain update picture information；
When a picture information in first picture information and second picture information is blank, what it is in acquisition is not
The incidence relation information is updated in physical extent where the picture information to be updated of blank, establishing corresponding picture information is
First mapping that the first index mark or the second index mark of blank and the principal mark of the picture information to be updated are known
Relationship；
When first picture information and the second picture information difference, the first picture information and the second picture information are closed
And obtain update picture information.
3. the method for diagram data according to claim 2 processing service, which is characterized in that it is described by the first picture information with
Second picture information merges, and obtains update picture information, including：
Using first picture information or second picture information as chief subgraph information, reads another picture information and incite somebody to action
Physical extent where the chief subgraph information is written in another described picture information；
It establishes and identifies the corresponding node of graph of identical index mark with first index and to index mark with described second identical
Index identify the incidence relation between corresponding node of graph；
The principal mark of the chief subgraph information is known and is known as the principal mark of the update subgraph；
First mapping that respectively principal mark of index mark and the update subgraph is known in another described picture information of update is closed
System.
4. according to the method for the diagram data processing service described in claim 1, which is characterized in that further include：Work as service detection
When needing to delete to an incidence relation information in picture information, it is two corresponding to obtain an incidence relation information to be added
The index mark of node of graph information is identified respectively as the first index mark and the second index；Wherein, an incidence relation information
The node of graph information of corresponding two node of graph, an incidence relation information includes the incidence relation of two node of graph, degree of incidence
With last correlation time；
Target picture information is obtained according to the first index mark or the second index mark；
The incidence relation information is deleted in the physical extent where the target picture information, obtains update picture information.
5. according to the method for the diagram data processing service described in claim 4, which is characterized in that the service detection to subgraph
An incidence relation information needs to delete in information, including：
When detecting that picture information reaches fixed threshold there are the associated weights value in incidence relation information, need to delete corresponding
Incidence relation information；Wherein, the associated weights value calculates gained according to the degree of incidence and the last correlation time.
6. the method for diagram data processing service according to claim 4, which is characterized in that described to believe in the target subgraph
The incidence relation information is deleted in physical extent where ceasing, obtains update picture information, including：
After deleting the incidence relation information, when the target picture information forms the picture information of subgraph after multiple fractionations,
Subgraph after the index mark number at most corresponding fractionation of node of graph is retained, using subgraph after the fractionation of reservation as more
New subgraph.
7. the method for diagram data processing service according to claim 1, which is characterized in that further include：
When receiving the information of picture information of delete target subgraph, any figure in the picture information of the target subgraph is obtained
The index of node identifies；
First mapping relations between being known according to the index mark and the index mark and principal mark obtain principal mark and know；
The second mapping relationship searching target physical subregion of corresponding target physical by stages is known according to the principal mark；
When knowing there are the principal mark in the target physical subregion, the son of delete target subgraph in the target physical subregion
Each node of graph is known with corresponding principal mark in the picture information of figure information, second mapping relations and the target subgraph
First mapping relations of intersymbol；
The picture information for the principal mark knowledge for only including the target subgraph is written in the target physical subregion.
8. the method for diagram data processing service according to claim 1, which is characterized in that further include：
When the service, which is received, needs to carry out the information of disk arrangement there are physical extent for clearance, presently described wait for is recorded
The picture information for clearing up physical extent is SNAPSHOT INFO；
The SNAPSHOT INFO is write into exchange area；The exchange area is unappropriated space in disk；
The occupied physical extent of deleted subgraph in the SNAPSHOT INFO is removed in the exchange area；
The exchange area is written into the synchronizing information being newly written in presently described physical extent for clearance；
Information in the exchange area is covered into the information in the physical extent for clearance.
9. the method for the diagram data processing service according to any one of claim 1-8, which is characterized in that further include：
The principal mark of required acquisition is known in the daily diagram data processing procedure of record；
All principal marks recorded in the defined term of validity are known and are merged, effective main identification sets are obtained；
Picture information library is searched for, the effective principal mark knowledge concentration is not appeared in when inquiring in the picture information library to exist
Picture information when, the picture information is deleted.
10. a kind of device of diagram data processing service, which is characterized in that including：
First acquisition unit when suitable for receiving the picture information for inquiring target subgraph, obtains the subgraph letter of the target subgraph
The index mark of any node of graph in breath；Wherein, the index mark of node of graph is corresponded with node of graph information；
First main mark acquiring unit, the first mapping relations between being known with corresponding principal mark according to the index mark of the node of graph
Corresponding principal mark is obtained to know；Wherein, first mapping relations include：Known figure is obtained according to the index of known node of graph mark
Type belonging to node is suitable for the basis in the Btree according to the type by the corresponding Btree of Hash index selections
The principal mark that the index mark of any node of graph obtains subgraph is known, wherein a type corresponds to a Btree, a Btree
In the node of graph comprising a type the correspondence known with the principal mark of subgraph of index mark；
Physical extent searching unit is suitable for according to the corresponding physical extent of target subgraph described in the main identifier lookup；Wherein, institute
It states principal mark knowledge and there are the second mapping relations between the corresponding physical extent；
Whether the first judging unit is suitable for judging in the physical extent comprising the identical identification information with principal mark knowledge；
First object subgraph acquiring unit is suitable for working as in the physical extent comprising the identical identification information with principal mark knowledge,
The picture information of the target subgraph is then got according to the identification information；Wherein, the identification information and subgraph
Picture information is one-to-one relationship；The picture information of one subgraph includes that the association between node of graph information and node of graph is closed
It is information；The incidence relation information of two node of graph is not present between any two subgraph.
11. the device of diagram data processing service according to claim 10, which is characterized in that further include that incidence relation is inserted into
Unit, the incidence relation are inserted into unit and include：
Second acquisition unit, suitable for receiving information of the one group of incidence relation information of insertion to a picture information to be updated
When, the index mark for obtaining two node of graph information in an incidence relation information to be added is marked respectively as the first index
Know and the second index identifies；Wherein, an incidence relation information corresponds to the node of graph information of two node of graph, an incidence relation
Information includes the incidence relation, degree of incidence and last correlation time of two node of graph；
Second target subgraph acquiring unit is suitable for obtaining the first picture information according to the first index mark, according to described the
Two index marks obtain the second picture information；
First updating unit belongs to same described to be updated suitable for working as first picture information and second picture information
Picture information when, the incidence relation information is updated in the physical extent where the picture information to be updated, is obtained
Update picture information；
Second updating unit, when a picture information in first picture information and second picture information is blank
When, the incidence relation information is updated in acquisition is not for the physical extent where the picture information to be updated of blank, is built
Vertical corresponding picture information is the first index mark of blank or the principal mark of the second index mark and the picture information to be updated
First mapping relations known；
Third updating unit is suitable for when first picture information and the second picture information difference, and the first subgraph is believed
Breath merges with the second picture information, obtains update picture information.
12. the device of diagram data processing service according to claim 11, which is characterized in that the third updating unit is suitable
In：
Using first picture information or second picture information as chief subgraph information, reads another picture information and incite somebody to action
Physical extent where the chief subgraph information is written in another described picture information；
It establishes and identifies the corresponding node of graph of identical index mark with first index and to index mark with described second identical
Index identify the incidence relation between corresponding node of graph；
The principal mark of the chief subgraph information is known and is known as the principal mark of the update subgraph；
First mapping that respectively principal mark of index mark and the update subgraph is known in another described picture information of update is closed
System.
13. a kind of device of diagram data processing service according to claim 10, which is characterized in that further include incidence relation
Deleting unit, the incidence relation deleting unit include：
Third acquiring unit, suitable for when an incidence relation information needs to delete in service detection to picture information, acquisition waits for
The index mark for the corresponding two node of graph information of one article of incidence relation information being added is respectively as the first index mark and the
Two index marks；Wherein, an incidence relation information corresponds to the node of graph information of two node of graph, an incidence relation packet
Include the incidence relation, degree of incidence and last correlation time of two node of graph；
Third target subgraph acquiring unit is suitable for obtaining target according to the first index mark or the second index mark
Figure information；
Incidence relation information deletion unit is closed suitable for deleting the association in the physical extent where the target picture information
It is information, obtains update picture information.
14. a kind of device of diagram data processing service according to claim 13, which is characterized in that the incidence relation is deleted
Except unit further includes second judgment unit, suitable in picture information, there are the associated weights values in incidence relation information to reach fixed
When threshold value, judgement needs to delete corresponding incidence relation information；Wherein, the associated weights value passes through the degree of incidence and institute
State last correlation time calculating gained.
15. a kind of device of diagram data processing service according to claim 13, which is characterized in that the incidence relation letter
Breath deleting unit is suitable for：After deleting the incidence relation information, the target picture information forms subgraph after multiple fractionations
When picture information, subgraph after the index mark number at most corresponding fractionation of node of graph is retained, by the fractionation of reservation
Subgraph is as update subgraph afterwards.
16. a kind of device of diagram data processing service according to claim 10, which is characterized in that further include that subgraph is deleted
Unit, the subgraph deleting unit include：
4th acquiring unit when information suitable for the picture information for receiving delete target subgraph, obtains the target subgraph
The index mark of any node of graph in picture information；
4th main mark acquiring unit, suitable for according to described first between the index mark and the index mark and principal mark knowledge
Mapping relations obtain principal mark and know；
Target physical subregion searching unit, suitable for knowing the second mapping of corresponding target physical by stages according to the principal mark
Relationship searches target physical subregion；
Deleting unit, suitable for when knowing there are the principal mark in the target physical subregion, being deleted in the target physical subregion
Except each node of graph in the picture information of the picture information of target subgraph, second mapping relations and the target subgraph
The first mapping relations of intersymbol are known with corresponding principal mark；
Writing unit, suitable for the subgraph letter for the principal mark knowledge for only including the target subgraph is written in the target physical subregion
Breath.
17. the device of diagram data processing service according to claim 10, which is characterized in that further include physical extent cleaning
Unit, the physical extent cleaning unit include：
First recording unit, suitable for there are the information that physical extent for clearance needs progress disk arrangement when the service is received
When, the picture information suitable for recording presently described physical extent for clearance is SNAPSHOT INFO；
Exchange area writing unit, suitable for the SNAPSHOT INFO is write exchange area；The exchange area is unappropriated in disk
Space；
Unit is cleared up, suitable for removing the occupied object of deleted subgraph in the SNAPSHOT INFO in the exchange area
Manage subregion；
The exchange area is written in synchronization unit, the synchronizing information suitable for will be newly written in presently described physical extent for clearance；
Capping unit, suitable for the information in the exchange area to be covered to the information in the physical extent for clearance.
18. the device of the diagram data processing service according to any one of claim 10-17, which is characterized in that further include
Subgraph clears up unit, and the subgraph cleaning unit includes：
Second recording unit, the principal mark for being suitable for recording required acquisition in the diagram data processing procedure daily are known；
Principal mark knows combining unit, merges suitable for knowing all principal marks recorded in the defined term of validity, is effectively led
Identification sets；
Picture information clears up unit, is adapted to search for picture information library, does not occur when inquiring to exist in the picture information library
When the effective principal mark knows the picture information concentrated, the picture information is deleted.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510673285.XA CN105260465B (en) | 2015-10-16 | 2015-10-16 | A kind of method, apparatus of diagram data processing service |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510673285.XA CN105260465B (en) | 2015-10-16 | 2015-10-16 | A kind of method, apparatus of diagram data processing service |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105260465A CN105260465A (en) | 2016-01-20 |
| CN105260465B true CN105260465B (en) | 2018-10-30 |
Family
ID=55100155
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510673285.XA Active CN105260465B (en) | 2015-10-16 | 2015-10-16 | A kind of method, apparatus of diagram data processing service |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105260465B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108986163A (en) * | 2018-06-29 | 2018-12-11 | 南京睿悦信息技术有限公司 | Augmented reality location algorithm based on more mark identifications |
| CN110263225A (en) * | 2019-05-07 | 2019-09-20 | 南京智慧图谱信息技术有限公司 | Data load, the management, searching system of a kind of hundred billion grades of knowledge picture libraries |
| CN111191080B (en) * | 2019-08-22 | 2021-04-30 | 腾讯科技（深圳）有限公司 | Data processing method and device |
| CN112784119B (en) * | 2021-01-14 | 2023-04-28 | 内蒙古蒙商消费金融股份有限公司 | Data query and synchronization optimization method and device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007146298A3 (en) * | 2006-06-12 | 2008-11-13 | Metacarta Inc | Systems and methods for hierarchical organization and presentation of geographic search results |
| CN101470711A (en) * | 2007-12-25 | 2009-07-01 | 国际商业机器公司 | Data visualization method and apparatus for layered graph structure |
| CN102073708A (en) * | 2010-12-30 | 2011-05-25 | 东北大学 | Large-scale uncertain graph database-oriented subgraph query method |
| CN102163218A (en) * | 2011-03-28 | 2011-08-24 | 武汉大学 | Graph-index-based graph database keyword vicinity searching method |
| CN103077216A (en) * | 2012-12-28 | 2013-05-01 | 中国科学院深圳先进技术研究院 | Sub-graph matching device and sub-graph matching method |
| CN104392010A (en) * | 2014-12-23 | 2015-03-04 | 北京理工大学 | Subgraph matching query method |
-
2015
- 2015-10-16 CN CN201510673285.XA patent/CN105260465B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007146298A3 (en) * | 2006-06-12 | 2008-11-13 | Metacarta Inc | Systems and methods for hierarchical organization and presentation of geographic search results |
| CN101470711A (en) * | 2007-12-25 | 2009-07-01 | 国际商业机器公司 | Data visualization method and apparatus for layered graph structure |
| CN102073708A (en) * | 2010-12-30 | 2011-05-25 | 东北大学 | Large-scale uncertain graph database-oriented subgraph query method |
| CN102163218A (en) * | 2011-03-28 | 2011-08-24 | 武汉大学 | Graph-index-based graph database keyword vicinity searching method |
| CN103077216A (en) * | 2012-12-28 | 2013-05-01 | 中国科学院深圳先进技术研究院 | Sub-graph matching device and sub-graph matching method |
| CN104392010A (en) * | 2014-12-23 | 2015-03-04 | 北京理工大学 | Subgraph matching query method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105260465A (en) | 2016-01-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105260465B (en) | A kind of method, apparatus of diagram data processing service | |
| CN109684333B (en) | Data storage and cutting method, equipment and storage medium | |
| CN103561133B (en) | A kind of IP address attribution information index method and method for quickly querying | |
| WO2015188750A1 (en) | Method, apparatus and system for implementing location based services | |
| CN106874266A (en) | User's portrait method and the device for user's portrait | |
| CN105701096A (en) | Index generation method, data inquiry method, index generation device, data inquiry device and system | |
| CN107145526B (en) | Reverse-nearest neighbor query processing method for geographic social keywords under road network | |
| CN104462549A (en) | Data processing method and device | |
| CN106126383A (en) | A kind of log processing method and device | |
| CN102122291A (en) | Blog friend recommendation method based on tree log pattern analysis | |
| CN104216962A (en) | Mass network management data indexing design method based on HBase | |
| CN104933175B (en) | Performance data correlation analysis method and performance monitoring system | |
| CN105426375A (en) | Relationship network calculation method and apparatus | |
| CN103618733A (en) | Data filtering system and method applied to mobile internet | |
| CN107305570B (en) | Data retrieval method and system | |
| CN110543584B (en) | Method, device, processing server and storage medium for establishing face index | |
| CN112256880A (en) | Text recognition method and device, storage medium and electronic equipment | |
| CN105447168A (en) | Method for restoring and recombining fragmented files in MP4 format | |
| CN106033438A (en) | Public sentiment data storage method and server | |
| CN105335408B (en) | A kind of extended method and related system of search term white list | |
| CN106878240A (en) | Zombie host recognition methods and device | |
| US20110296012A1 (en) | Multi-tier message correlation | |
| CN111177481A (en) | User identifier mapping method and device | |
| KR20180007248A (en) | Method for frequent itemset mining from uncertain data with different item importance and uncertain weighted frequent item mining apparatus performing the same | |
| CN104516916B (en) | The analysis method and device of OA network system incidence relation |
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 |