CN105260465A - Graph data processing service method and apparatus - Google Patents

Graph data processing service method and apparatus Download PDF

Info

Publication number
CN105260465A
CN105260465A CN201510673285.XA CN201510673285A CN105260465A CN 105260465 A CN105260465 A CN 105260465A CN 201510673285 A CN201510673285 A CN 201510673285A CN 105260465 A CN105260465 A CN 105260465A
Authority
CN
China
Prior art keywords
information
picture information
graph
subgraph
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201510673285.XA
Other languages
Chinese (zh)
Other versions
CN105260465B (en
Inventor
汤奇峰
史剑冬
安斌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZAMPLUS ADVERTISING (SHANGHAI) CO Ltd
Original Assignee
ZAMPLUS ADVERTISING (SHANGHAI) CO Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZAMPLUS ADVERTISING (SHANGHAI) CO Ltd filed Critical ZAMPLUS ADVERTISING (SHANGHAI) CO Ltd
Priority to CN201510673285.XA priority Critical patent/CN105260465B/en
Publication of CN105260465A publication Critical patent/CN105260465A/en
Application granted granted Critical
Publication of CN105260465B publication Critical patent/CN105260465B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • 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 present invention provides a graph data processing service method and apparatus. The method comprises: when receiving sub-graph information of a queried target sub-graph, acquiring an index identifier of any graph node in the sub-graph information of the target sub-graph; according to a first mapping relationship between the index identifier of the map node and a corresponding main identifier, acquiring the corresponding main identifier; according to the main identifier, searching for a physical partition corresponding to the target sub-graph; determining whether the physical partition comprises identifier information as same as the main identifier; and when the physical partition comprises the identifier information as same as the main identifier, according to the identifier information, acquiring the sub-graph information of the target sub-graph, so as to achieve the effects of quickly querying the sub-graph information through any graph node and improving the efficiency of querying the sub-graph.

Description

A kind of method, device of diagram data process service
Technical field
The present invention relates to graphical data mining technical field, particularly relate to method, the device of a kind of diagram data process service.
Background technology
Figure is a kind of abstract data structure conventional in computer science and technology field, many application scenarioss can represent with the topological structure of collection of illustrative plates in actual applications, such as social networks is exactly a kind of typical in scheme the data for basic structure, and the topological structure of whole social graph embodies interpersonal incidence relation in social networks.
At present, the search problem of large-scale graph data causes interest widely in academia and industry member.In prior art, figure calculating and chart database are mainly based on the demand of social networks, study interpersonal relation, what the inquiry of figure was focused on is not relation, but the information containing keyword, the diagram data process method of servicing of prior art stresses to calculate with figure, returns the information comprising keyword, and can not realize the efficient inquiry of collection of illustrative plates to user.
Summary of the invention
The technical problem to be solved in the present invention improves the efficiency of inquiry sub-graph data, and then improve the treatment effeciency of other operations in diagram data service.
For solving the problems of the technologies described above, a kind of method that the embodiment of the present invention provides diagram data process to serve, described method comprises:
When receiving the picture information of query aim subgraph, obtain the index mark of any one node of graph in the picture information of described target subgraph; Wherein, the index of node of graph identifies and node of graph information one_to_one corresponding;
The first mapping relations between knowing with corresponding principal mark according to the index of described node of graph mark obtain corresponding principal mark and know; Wherein, described first mapping relations comprise: obtain the type belonging to known node of graph according to the index mark of known node of graph, Btree corresponding to Hash index selection is passed through according to described type, obtain the principal mark knowledge of subgraph according to the index mark of described known node of graph in described Btree, wherein, a corresponding Btree of type, the corresponding relation that the index mark comprising the node of graph of a type in a Btree identifies with the principal mark of subgraph;
The Physical Extents that target subgraph is corresponding according to described main identifier lookup; Wherein, there are the second mapping relations with between described corresponding Physical Extents in described principal mark knowledge;
Judge whether to comprise in described Physical Extents the sensible same identification information with described principal mark;
When comprising the sensible same identification information with described principal mark in described Physical Extents, then get the picture information of described target subgraph according to described identification information; Wherein, the picture information of described identification information and a subgraph is one-to-one relationship; The picture information of a described subgraph comprises the incidence relation information between node of graph information and node of graph; The incidence relation information of two node of graph is there is not between any two subgraphs.
Alternatively, the method for described diagram data process service, also comprises:
When receiving the information of insertion one group of incidence relation information to one picture information to be updated, obtain the index mark of two node of graph information corresponding to an incidence relation information to be added respectively as the first index mark and the second index mark; Wherein, the node of graph information of corresponding two node of graph of incidence relation information, incidence relation information comprises the incidence relation of two node of graph, degree of incidence and last correlation time;
According to described first index mark acquisition first picture information, according to described second index mark acquisition second picture information;
When described first picture information and described second picture information belong to same described picture information to be updated, in the Physical Extents at described picture information place to be updated, upgrade described incidence relation information, obtain upgrading picture information;
When a picture information in described first picture information and described second picture information is blank, in the Physical Extents not for blank picture information place to be updated obtained, upgrade described incidence relation information, setting up corresponding picture information is described first mapping relations that the first blank index mark or the second index mark are known with the principal mark of described picture information to be updated;
When described first picture information is different with described second picture information, the first picture information and the second picture information are merged, obtain upgrading picture information.
Alternatively, described first picture information and the second picture information to be merged, obtain upgrading picture information, comprising:
Using described first picture information or described second picture information as chief subgraph information, read another picture information and another picture information described is write Physical Extents, described chief subgraph information place;
To set up and described first index identifies identical index and identifies corresponding node of graph and identify identical index with described second index and identify incidence relation between corresponding node of graph;
The principal mark of described chief subgraph information is known and knows as the principal mark of described renewal subgraph;
Upgrade described first mapping relations that in another picture information described, each index mark is known with the principal mark of described renewal subgraph.
Alternatively, the method for described diagram data process service, also comprises:
When an incidence relation information needs to delete in service detection to picture information, obtain the index mark of two node of graph information corresponding to an incidence relation information to be added respectively as the first index mark and the second index mark; Wherein, the node of graph information of corresponding two node of graph of incidence relation information, incidence relation information comprises the incidence relation of two node of graph, degree of incidence and last correlation time;
Target picture information is obtained according to described first index mark or described second index mark;
In the Physical Extents at described target picture information place, delete described incidence relation information, obtain upgrading picture information.
Alternatively, in described service detection to picture information, an incidence relation information needs to delete, and comprising:
When detecting that the picture information associated weights value existed in incidence relation information reaches fixed threshold, need to delete corresponding incidence relation information; Wherein, described associated weights value calculates gained according to described degree of incidence and described last correlation time.
Alternatively, describedly in the Physical Extents at described target picture information place, delete described incidence relation information, obtain upgrading picture information, comprising:
When after the described incidence relation information of deletion, when described target picture information forms the picture information of subgraph after multiple fractionation, after the described fractionation corresponding at most by the index identification number of node of graph, subgraph retains, using subgraph after the described fractionation that retains as renewal subgraph.
Alternatively, the method for described diagram data process service, also comprises:
When receiving the information of the picture information deleting target subgraph, obtain the index mark of arbitrary node of graph in the picture information of described target subgraph;
Described first mapping relations between knowing according to described index mark and described index mark and principal mark obtain principal mark and know;
The second mapping relationship searching target physical subregion of the target physical by stages corresponding with it is known according to described principal mark;
When there is described principal mark in described target physical subregion and knowing, in described target physical subregion, delete each node of graph and corresponding principal mark in the picture information of the picture information of target subgraph, described second mapping relations and described target subgraph know the first mapping relations of intersymbol;
The picture information of the principal mark knowledge only comprising described target subgraph is write in described target physical subregion.
Alternatively, the method for described diagram data process service, also comprises:
When described service reception to exist Physical Extents for clearance need the information of carrying out disk arrangement time, the picture information recording current described Physical Extents for clearance is SNAPSHOT INFO;
Described SNAPSHOT INFO is write exchange area; Described exchange area is unappropriated space in disk;
The deleted Physical Extents shared by subgraph in described SNAPSHOT INFO is removed in described exchange area;
The synchronizing information of write new in current described Physical Extents for clearance is write described exchange area;
Information in described exchange area is covered the information in described Physical Extents for clearance.
Alternatively, the method for described diagram data process service, also comprises:
Record the required described principal mark obtained in diagram data processing procedure described in every day to know;
The all described principal mark recorded in the term of validity of regulation is known and merges, obtain effective main identification sets;
Search picture information storehouse, when inquire in described picture information storehouse exist do not appear at described effective principal mark know the picture information concentrated time, described picture information is deleted.
The embodiment of the present invention additionally provides the device of a kind of diagram data process service, and described device comprises:
First acquiring unit, when being suitable for the picture information receiving query aim subgraph, obtains the index mark of arbitrary node of graph in the picture information of described target subgraph; Wherein, the index of node of graph identifies and node of graph information one_to_one corresponding;
First principal mark knows acquiring unit, and the first mapping relations between knowing with corresponding principal mark according to the index of described node of graph mark obtain corresponding principal mark and know; Wherein, described first mapping relations comprise: obtain the type belonging to known node of graph according to the index mark of known node of graph, Btree corresponding to Hash index selection is passed through according to described type, be suitable for the principal mark knowledge obtaining subgraph in described Btree according to the index mark of described arbitrary node of graph, wherein, a corresponding Btree of type, the corresponding relation that the index mark comprising the node of graph of a type in a Btree identifies with the principal mark of subgraph;
Unit is searched in Physical Extents, is suitable for the Physical Extents that target subgraph is corresponding according to described main identifier lookup; Wherein, there are the second mapping relations with between described corresponding Physical Extents in described principal mark knowledge;
First judging unit, is suitable for judging whether to comprise in described Physical Extents the sensible same identification information with described principal mark;
First object subgraph acquiring unit, is suitable for when comprising the sensible same identification information with described principal mark in described Physical Extents, then getting the picture information of described target subgraph according to described identification information; Wherein, the picture information of described identification information and a subgraph is one-to-one relationship; The picture information of a described subgraph comprises the incidence relation information between node of graph information and node of graph; The incidence relation information of two node of graph is there is not between any two subgraphs.
Alternatively, the device of described diagram data process service, also comprise incidence relation plug-in unit, described incidence relation plug-in unit comprises:
Second acquisition unit, being suitable for when receiving the information of insertion one group of incidence relation information to one picture information to be updated, obtaining the index mark of two node of graph information in an incidence relation information to be added respectively as the first index mark and the second index mark; Wherein, the node of graph information of corresponding two node of graph of incidence relation information, incidence relation information comprises the incidence relation of two node of graph, degree of incidence and last correlation time;
Second target subgraph acquiring unit, is suitable for according to described first index mark acquisition first picture information, according to described second index mark acquisition second picture information;
First updating block, be suitable for when described first picture information and described second picture information belong to same described picture information to be updated, in the Physical Extents at described picture information place to be updated, upgrade described incidence relation information, obtain upgrading picture information;
Second updating block, when a picture information in described first picture information and described second picture information is blank, in the Physical Extents not for blank picture information place to be updated obtained, upgrade described incidence relation information, setting up corresponding picture information is described first mapping relations that the first blank index mark or the second index mark are known with the principal mark of described picture information to be updated;
3rd updating block, is suitable for, when described first picture information is different with described second picture information, the first picture information and the second picture information being merged, and obtains upgrading picture information.
Alternatively, described 3rd updating block is suitable for:
Using described first picture information or described second picture information as chief subgraph information, read another picture information and another picture information described is write Physical Extents, described chief subgraph information place;
To set up and described first index identifies identical index and identifies corresponding node of graph and identify identical index with described second index and identify incidence relation between corresponding node of graph;
The principal mark of described chief subgraph information is known and knows as the principal mark of described renewal subgraph;
Upgrade described first mapping relations that in another picture information described, each index mark is known with the principal mark of described renewal subgraph.
Alternatively, the device of described diagram data process service, also comprise incidence relation delete cells, described incidence relation delete cells comprises:
3rd acquiring unit, be suitable for when an incidence relation information needs to delete in service detection to picture information, obtain the index mark of two node of graph information corresponding to an incidence relation information to be added respectively as the first index mark and the second index mark; Wherein, the node of graph information of corresponding two node of graph of incidence relation information, incidence relation information comprises the incidence relation of two node of graph, degree of incidence and last correlation time;
3rd target subgraph acquiring unit, is suitable for obtaining target picture information according to described first index mark or described second index mark;
Incidence relation information deletion unit, is suitable for deleting described incidence relation information in the Physical Extents at described target picture information place, obtains upgrading picture information.
Alternatively, described incidence relation delete cells also comprises the second judging unit, when the associated weights value being suitable for existing in incidence relation information at picture information reaches fixed threshold, judges to need to delete corresponding incidence relation information; Wherein, described associated weights value calculates gained by described degree of incidence and described last correlation time.
Alternatively, described incidence relation information deletion unit is suitable for: when after the described incidence relation information of deletion, when described target picture information forms the picture information of subgraph after multiple fractionation, after the described fractionation corresponding at most by the index identification number of node of graph, subgraph retains, using subgraph after the described fractionation retained as upgrading subgraph.
Alternatively, the device of described diagram data process service, also comprise subgraph delete cells, described subgraph delete cells comprises:
4th acquiring unit, when being suitable for the information receiving the picture information deleting target subgraph, obtains the index mark of arbitrary node of graph in the picture information of described target subgraph;
4th principal mark knows acquiring unit, and described first mapping relations be suitable between knowing according to described index mark and described index mark and principal mark obtain principal mark and know;
Target physical subregion searches unit, is suitable for the second mapping relationship searching target physical subregion knowing the target physical by stages corresponding with it according to described principal mark;
Delete cells, be suitable for, when there is described principal mark in described target physical subregion and knowing, in described target physical subregion, deleting each node of graph and corresponding principal mark in the picture information of the picture information of target subgraph, described second mapping relations and described target subgraph knowing the first mapping relations of intersymbol;
Writing unit, is suitable for writing the picture information of the principal mark knowledge only comprising described target subgraph in described target physical subregion.
Alternatively, the device of described diagram data process service, also comprises Physical Extents cleaning unit, and described Physical Extents cleaning unit comprises:
First record cell, be suitable for when described service reception to exist Physical Extents for clearance need the information of carrying out disk arrangement time, the picture information being suitable for recording current described Physical Extents for clearance is SNAPSHOT INFO;
Exchange area writing unit, is suitable for described SNAPSHOT INFO to write exchange area; Described exchange area is unappropriated space in disk;
Cleaning unit, is suitable for the deleted Physical Extents shared by subgraph of removing in described exchange area in described SNAPSHOT INFO;
Lock unit, is suitable for the synchronizing information of write new in current described Physical Extents for clearance to write described exchange area;
Capping unit, is suitable for the information information in described exchange area covered in described Physical Extents for clearance.
Alternatively, the device of described diagram data process service, also comprises subgraph cleaning unit, and described subgraph cleaning unit comprises:
Second record cell, is suitable for recording the required described principal mark obtained in diagram data processing procedure described in every day and knows;
Principal mark knows merge cells, and all described principal mark being suitable for recording in the term of validity by regulation knows merging, obtains effective main identification sets;
Picture information cleaning unit, is suitable for searching for picture information storehouse, when inquire in described picture information storehouse exist do not appear at described effective principal mark know the picture information concentrated time, described picture information is deleted.
Compared with prior art, the technical scheme of the embodiment of the present invention has following beneficial effect:
The embodiment of the present invention is by when receiving the picture information of query aim subgraph, obtain the index mark of any one node of graph in the picture information of described target subgraph, the first mapping relations between knowing with corresponding principal mark according to the index of described node of graph mark obtain corresponding principal mark and know, the Physical Extents that target subgraph is corresponding according to described main identifier lookup, judge whether to comprise in described Physical Extents the sensible same identification information with described principal mark, when comprising the sensible same identification information with described principal mark in described Physical Extents, the picture information of described target subgraph is then got according to described identification information, the principal mark getting final product effective acquisition subgraph by the information of arbitrary node of graph due to the technical scheme of the embodiment of the present invention is known, and then know quickly through the principal mark of described subgraph the Physical Extents finding subgraph and store, thus realize the information that can be inquired subgraph by arbitrary node of graph, improve the efficiency of inquiry subgraph.
Further, the technical scheme of the embodiment of the present invention can also according to service detection to information instruction insert incidence relation operation accordingly, delete incidence relation operation and delete subgraph operation, owing to have employed the scheme of above-mentioned inquiry picture information when relating to inquiry picture information in aforesaid operations, therefore corresponding diagram data treatment effeciency also correspondingly improves.
Further, the technical scheme of the embodiment of the present invention is by when detecting the associated weights in incidence relation information and reaching fixed threshold, delete corresponding incidence relation information, thus make the connected relation between node of graph keep strong continune, be unlikely to make subgraph become infinitely great, and then the efficiency of inquiry subgraph can be improved.
Further, the technical scheme of the embodiment of the present invention is known by recording the required described principal mark obtained in diagram data processing procedure described in every day, the all described principal mark recorded in the term of validity of regulation is known and merges, obtain effective main identification sets, search picture information storehouse, when inquire in described picture information storehouse exist do not appear at described effective principal mark know the picture information concentrated time, described picture information is deleted, thus the size of diagram data realized by regularly removing control store, the inquiry and process avoiding data unrestrictedly to expand being unfavorable for diagram data.
Accompanying drawing explanation
Fig. 1 is the structural representation of the drawing of seeds in the embodiment of the present invention;
Fig. 2 is the process flow diagram of the method that a kind of diagram data process in the embodiment of the present invention is served;
Fig. 3 is the process flow diagram of the method that the another kind of diagram data process in the embodiment of the present invention is served;
Fig. 4 is the process flow diagram of the method that the another kind of diagram data process in the embodiment of the present invention is served;
Fig. 5 is the process flow diagram of the method that the another kind of diagram data process in the embodiment of the present invention is served;
Fig. 6 is the process flow diagram of the method that the another kind of diagram data process in the embodiment of the present invention is served;
Fig. 7 is the structural representation of the device that a kind of diagram data process in the embodiment of the present invention is served.
Embodiment
As previously mentioned, in prior art, figure calculating and chart database are mainly based on the demand of social networks, study interpersonal relation, what the inquiry of figure was focused on is not relation, but the information containing keyword, the diagram data process method of servicing of prior art stresses and figure calculates, return the information comprising keyword to user, and the efficient inquiry of collection of illustrative plates can not be realized.
When the embodiment of the present invention is by the picture information that receives query aim subgraph, obtain the index mark of any one node of graph in the picture information of described target subgraph; The first mapping relations between knowing with corresponding principal mark according to the index of described node of graph mark obtain corresponding principal mark and know; The Physical Extents that target subgraph is corresponding according to described main identifier lookup; Judge whether to comprise in described Physical Extents the sensible same identification information with described principal mark; When comprising the sensible same identification information with described principal mark in described Physical Extents, the picture information of described target subgraph is then got according to described identification information, thus realize the information that can be inquired subgraph by arbitrary node of graph, and then improve the efficiency of inquiry subgraph.
For enabling above-mentioned purpose of the present invention, characteristic sum beneficial effect more becomes apparent, and is described in detail specific embodiments of the invention below in conjunction with accompanying drawing.
Fig. 1 is the structural representation of the drawing of seeds in the embodiment of the present invention.There are in Fig. 1 two subgraphs and be respectively subgraph a and subgraph b.Figure comprises node of graph information and limit as a kind of conventional data structure, because figure a and figure b does not have connected relation and divide into subgraph a and subgraph b two subgraphs in Fig. 1, be made up of node of graph and incidence relation in subgraph, each node of graph can be specifically defined as and refer to a certain information in practical application scene, and the limit of subgraph represents the incidence relation between two node of graph.Such as, suppose that collection of illustrative plates is the topological diagram of the service account in Internet service, so in subgraph a, node of graph V1 and node of graph V2 specifically can represent the account logged in Internet service, such as node of graph V1 can the microblog account information of representative of consumer, node of graph V2 can micro-letter account information of representative of consumer, and the microblog account information of limit representative of consumer between node of graph V1 and node of graph V2 and micro-letter account information of user exist incidence relation.
It is pointed out that can specifically define by which information content unique corresponding with a node of graph, such as, node of graph V1 can the microblog account information of representative of consumer A and V2 can micro-letter account information of representative of consumer.In addition, node of graph V1 representative of consumer can also be defined and use A terminal landing microblog account, and node of graph V2 representative of consumer uses B terminal landing microblog account, namely user logs in same Internet service account and also can be subdivided into different node of graph in different terminals, the identification information of terminal can be added in node of graph information, make node of graph information unique corresponding with a node of graph, by defining the node of graph information of each node of graph, the data that the user behavior of digging user on different terminals etc. enriches can be contributed to.
In specific embodiment of the invention, each subgraph has a principal mark to know, the index mark of the node of graph when principal mark knowledge of each subgraph is first time write incidence relation, the index mark of described node of graph and node of graph information one_to_one corresponding.Such as, the node of graph in Fig. 1 in subgraph a during first time write incidence relation is V1, and the index of node of graph V1 is designated 1, then index mark 1 is the principal mark knowledge of subgraph a.
In specific embodiment of the invention, each node of graph has the type belonging to oneself, and in same subgraph, a type can by multiple node of graph.Such as, in subgraph a, node of graph V1 and V2 belongs to microblog account, and node of graph V3 and V4 belongs to micro-letter account.
In concrete enforcement, the node of graph information of corresponding two node of graph of an incidence relation in subgraph, incidence relation information comprises the incidence relation of two node of graph, degree of incidence and last correlation time.In concrete enforcement, described incidence relation information also comprises associated weights value, and described associated weights value calculates gained according to described degree of incidence and described last correlation time.
The technical scheme of the embodiment of the present invention efficiently can be inquired about and be read sub-graph data information, can also insert further, the operational processes such as deletion to sub-graph data information.The acquisition of described sub-graph data information and process are conducive to excavation and the research of user behavior data.
Below in conjunction with specific embodiment, the method that diagram data process of the present invention is served is described.
Fig. 2 is the process flow diagram of the method that a kind of diagram data process in the embodiment of the present invention is served.The method of the diagram data process service shown in Fig. 2, can comprise the following steps, be described with reference to Fig. 1:
Step S201: when receiving the picture information of query aim subgraph, obtains the index mark of any one node of graph in the picture information of described target subgraph.
In Fig. 1, the node of graph information of each node of graph of subgraph a and the index of node of graph identify one_to_one corresponding.Such as, in subgraph a, the node of graph of first time write incidence relation is V1, and the index mark of node of graph V1, V2, V3, V4 corresponds to 1,2,3,4 respectively, and the master of subgraph a is designated 1.
In concrete enforcement, when receiving the picture information of query aim picture group, the index mark of the node of graph obtained from inquiry request may be the index mark of any one node of graph in picture information, is not defined as the index mark of specific node of graph.
Step S202: the first mapping relations between knowing with corresponding principal mark according to the index of described node of graph mark obtain corresponding principal mark and know.
In concrete enforcement, described first mapping relations comprise: obtain the type belonging to known node of graph according to the index mark of known node of graph, Btree corresponding to Hash index selection is passed through according to described type, obtain the principal mark knowledge of subgraph according to the index mark of described known node of graph in described Btree, wherein, a corresponding Btree of type, the corresponding relation that the index mark comprising the node of graph of a type in a Btree identifies with the principal mark of subgraph.
Such as, the index getting node of graph V3 in step S201 is designated 3, obtains the type described in node of graph V1, pass through Btree corresponding to Hash index selection according to described type according to described index mark 3.The type of V1 and V2 all belongs to microblog account, the principal mark containing node of graph V1 and V2 and subgraph a in the Btree of this type of microblog account knows the corresponding relation of 1, therefore, in described Btree, know the corresponding relation of 1 according to the index mark of known node of graph V3 and subgraph principal mark, the principal mark that can obtain subgraph a knows 1.
Step S203: the Physical Extents that target subgraph is corresponding according to described main identifier lookup.
In concrete enforcement, it is the second mapping relations that described principal mark is known with the mapping relations existed between described corresponding Physical Extents, can find Physical Extents corresponding to target subgraph according to described second mapping relations.Particularly, each subgraph stores a physical location of corresponding disk, from certain cheaply there is the region of certain length.Described second mapping relations are the index relative that principal mark is known and set up between disk side-play amount and length, such as, the length of subgraph a is 30, so the second mapping relations are the principal mark knowledge of subgraph a and the index relative between its disk side-play amount 1 and length 30, then can find the described memory location of subgraph a in disk according to described second mapping relations.
Step S204: judge whether to comprise in described Physical Extents the sensible same identification information with described principal mark.
In concrete enforcement, if when comprising the sensible same identification information with described principal mark in described Physical Extents, the data storing in this Physical Extents and know corresponding subgraph with described principal mark are described.
Step S205: when comprising the sensible same identification information with described principal mark in described Physical Extents, then get the picture information of described target subgraph according to described identification information.
The embodiment of the present invention obtains corresponding principal mark by the first mapping relations according to the index mark of described node of graph and knows, find according to described principal mark knowledge the Physical Extents that the target subgraph of inquiry is corresponding by the second mapping relations, achieve and read sub-graph data information according to the Subgraph node checks in known subgraph to the memory location of subgraph, thus improve the efficiency of searching subgraph.
Fig. 3 is the process flow diagram of the method that the another kind of diagram data process in the embodiment of the present invention is served.The method of diagram data process service as shown in Figure 3, can comprise:
Step S301: when receiving the information of insertion one group of incidence relation information to one picture information to be updated, obtains the index mark of two node of graph information corresponding to an incidence relation information to be added respectively as the first index mark and the second index mark.In concrete enforcement, the node of graph information of corresponding two node of graph of incidence relation information, incidence relation information comprises the incidence relation of two node of graph, degree of incidence and last correlation time.
Step S302: according to described first index mark acquisition first picture information, according to described second index mark acquisition second picture information.In concrete enforcement, the method obtaining picture information according to index Identification is identical with the method described in Fig. 2, is not repeated herein.
Step S303: when described first picture information and described second picture information belong to same described picture information to be updated, upgrade described incidence relation information in the Physical Extents at described picture information place to be updated, obtains upgrading picture information.
Step S304: when a picture information in described first picture information and described second picture information is blank, in the Physical Extents not for blank picture information place to be updated obtained, upgrade described incidence relation information, setting up corresponding picture information is described first mapping relations that the first blank index mark or the second index mark are known with the principal mark of described picture information to be updated.
Step S305: when described first picture information is different with described second picture information, the first picture information and the second picture information are merged, obtains upgrading picture information.In concrete enforcement, described first picture information and the second picture information to be merged, obtain upgrading picture information can comprise: using described first picture information or described second picture information as chief subgraph information, read another picture information and another picture information described is write Physical Extents, described chief subgraph information place; To set up and described first index identifies identical index and identifies corresponding node of graph and identify identical index with described second index and identify incidence relation between corresponding node of graph; The principal mark of described chief subgraph information is known and knows as the principal mark of described renewal subgraph; Upgrade described first mapping relations that in another picture information described, each index mark is known with the principal mark of described renewal subgraph.
Fig. 4 is the process flow diagram of the method that the another kind of diagram data process in the embodiment of the present invention is served.The method of diagram data process service as shown in Figure 4, can comprise:
Step S401: when an incidence relation information needs to delete in service detection to picture information, obtains the index mark of two node of graph information corresponding to an incidence relation information to be added respectively as the first index mark and the second index mark.
In concrete enforcement, the node of graph information of corresponding two node of graph of incidence relation information, incidence relation information comprises the incidence relation of two node of graph, degree of incidence and last correlation time.
In concrete enforcement, in described service detection to picture information, an incidence relation information needs to delete, and can comprise:
When detecting that the picture information associated weights value existed in incidence relation information reaches fixed threshold, need to delete corresponding incidence relation information; Wherein, described associated weights value calculates gained according to described degree of incidence and described last correlation time.It is pointed out that described fixed threshold can be arranged as required, do not limit.
Step S402: obtain target picture information according to described first index mark or described second index mark.
In concrete enforcement, the method obtaining target picture information according to index mark is identical with method described in Fig. 2, is not repeated herein.
Step S403: delete described incidence relation information in the Physical Extents at described target picture information place, obtains upgrading picture information.
In concrete enforcement, when after the described incidence relation information of deletion, when described target picture information forms the picture information of subgraph after multiple fractionation, after the described fractionation corresponding at most by the index identification number of node of graph, subgraph retains, using subgraph after the described fractionation that retains as renewal subgraph.
Fig. 5 is the process flow diagram of the method that the another kind of diagram data process in the embodiment of the present invention is served.The method of diagram data process service as shown in Figure 5, can comprise:
Step S501: when receiving the information of the picture information deleting target subgraph, obtains the index mark of arbitrary node of graph in the picture information of described target subgraph.
Step S502: described first mapping relations between knowing according to described index mark and described index mark and principal mark obtain principal mark and know.
Step S503: the second mapping relationship searching target physical subregion knowing the target physical by stages corresponding with it according to described principal mark.
Step S504: when there is described principal mark in described target physical subregion and knowing, delete each node of graph and corresponding principal mark in the picture information of the picture information of target subgraph, described second mapping relations and described target subgraph and know the first mapping relations of intersymbol in described target physical subregion;
Step S505: the picture information writing the principal mark knowledge only comprising described target subgraph in described target physical subregion.
Fig. 6 is the process flow diagram of the method that the another kind of diagram data process in the embodiment of the present invention is served.The method of diagram data process service as shown in Figure 6, can comprise:
Step S601: record the required described principal mark obtained in diagram data processing procedure described in every day and know.
Step S602: all described principal mark recorded in the term of validity of regulation is known and merges, obtain effective main identification sets.In concrete enforcement, the term of validity of described regulation can carry out different settings, does not limit at this.
Step S603: search picture information storehouse, when inquire in described picture information storehouse exist do not appear at described effective principal mark know the picture information concentrated time, described picture information is deleted.
In concrete enforcement, the method for diagram data process service, can also comprise:
When described service reception to exist Physical Extents for clearance need the information of carrying out disk arrangement time, the picture information recording current described Physical Extents for clearance is SNAPSHOT INFO; Described SNAPSHOT INFO is write exchange area; Described exchange area is unappropriated space in disk; The deleted Physical Extents shared by subgraph in described SNAPSHOT INFO is removed in described exchange area; The synchronizing information of write new in current described Physical Extents for clearance is write described exchange area; Information in described exchange area is covered the information in described Physical Extents for clearance.
Such scheme achieves the picture information that frequent operation is not carried out in periodic cleaning within a period of time, thus avoids factor data unrestrictedly to expand impacting inquiry subgraph efficiency.
Fig. 7 is the structural representation of the device that a kind of diagram data process in the embodiment of the present invention is served.The device 70 of described diagram data process service can comprise:
First acquiring unit 701, when being suitable for the picture information receiving query aim subgraph, obtains the index mark of arbitrary node of graph in the picture information of described target subgraph; Wherein, the index of node of graph identifies and node of graph information one_to_one corresponding;
First principal mark knows acquiring unit 702, and the first mapping relations between knowing with corresponding principal mark according to the index of described node of graph mark obtain corresponding principal mark and know; Wherein, described first mapping relations comprise: obtain the type belonging to known node of graph according to the index mark of known node of graph, Btree corresponding to Hash index selection is passed through according to described type, be suitable for the principal mark knowledge obtaining subgraph in described Btree according to the index mark of described arbitrary node of graph, wherein, a corresponding Btree of type, the corresponding relation that the index mark comprising the node of graph of a type in a Btree identifies with the principal mark of subgraph;
Unit 703 is searched in Physical Extents, is suitable for the Physical Extents that target subgraph is corresponding according to described main identifier lookup; Wherein, there are the second mapping relations with between described corresponding Physical Extents in described principal mark knowledge;
First judging unit 704, is suitable for judging whether to comprise in described Physical Extents the sensible same identification information with described principal mark;
First object subgraph acquiring unit 705, is suitable for when comprising the sensible same identification information with described principal mark in described Physical Extents, then getting the picture information of described target subgraph according to described identification information; Wherein, the picture information of described identification information and a subgraph is one-to-one relationship; The picture information of a described subgraph comprises the incidence relation information between node of graph information and node of graph; The incidence relation information of two node of graph is there is not between any two subgraphs.
The device 70 of described diagram data process service can also comprise: incidence relation plug-in unit 711, and described incidence relation plug-in unit 711 can comprise:
Second acquisition unit, being suitable for when receiving the information of insertion one group of incidence relation information to one picture information to be updated, obtaining the index mark of two node of graph information in an incidence relation information to be added respectively as the first index mark and the second index mark; Wherein, the node of graph information of corresponding two node of graph of incidence relation information, incidence relation information comprises the incidence relation of two node of graph, degree of incidence and last correlation time; Second target subgraph acquiring unit, is suitable for according to described first index mark acquisition first picture information, according to described second index mark acquisition second picture information; First updating block, be suitable for when described first picture information and described second picture information belong to same described picture information to be updated, in the Physical Extents at described picture information place to be updated, upgrade described incidence relation information, obtain upgrading picture information; Second updating block, when a picture information in described first picture information and described second picture information is blank, in the Physical Extents not for blank picture information place to be updated obtained, upgrade described incidence relation information, setting up corresponding picture information is described first mapping relations that the first blank index mark or the second index mark are known with the principal mark of described picture information to be updated; 3rd updating block, is suitable for, when described first picture information is different with described second picture information, the first picture information and the second picture information being merged, and obtains upgrading picture information.
In concrete enforcement, first picture information and the second picture information are merging by described 3rd updating block, when obtaining upgrading picture information, to be suitable for described first picture information or described second picture information, as chief subgraph information, reading another picture information and another picture information described being write Physical Extents, described chief subgraph information place; To set up and described first index identifies identical index and identifies corresponding node of graph and identify identical index with described second index and identify incidence relation between corresponding node of graph; The principal mark of described chief subgraph information is known and knows as the principal mark of described renewal subgraph; Upgrade described first mapping relations that in another picture information described, each index mark is known with the principal mark of described renewal subgraph.
In concrete enforcement, the device 70 of described diagram data process service can also comprise incidence relation delete cells 721; Described incidence relation delete cells 721 can comprise:
3rd acquiring unit, be suitable for when an incidence relation information needs to delete in service detection to picture information, obtain the index mark of two node of graph information corresponding to an incidence relation information to be added respectively as the first index mark and the second index mark; Wherein, the node of graph information of corresponding two node of graph of incidence relation information, incidence relation information comprises the incidence relation of two node of graph, degree of incidence and last correlation time; 3rd target subgraph acquiring unit, is suitable for obtaining target picture information according to described first index mark or described second index mark; Incidence relation information deletion unit, is suitable for deleting described incidence relation information in the Physical Extents at described target picture information place, obtains upgrading picture information.
In concrete enforcement, described incidence relation delete cells 721 can also comprise:
Second judging unit, when the associated weights value being suitable for existing in incidence relation information at picture information reaches fixed threshold, judges to need to delete corresponding incidence relation information; Wherein, described associated weights value calculates gained by described degree of incidence and described last correlation time.
In concrete enforcement, the device 70 of described diagram data process service can also comprise: subgraph delete cells 731, described subgraph delete cells 731 can comprise: the 4th acquiring unit, when being suitable for the information receiving the picture information deleting target subgraph, obtain the index mark of arbitrary node of graph in the picture information of described target subgraph; 4th principal mark knows acquiring unit, and described first mapping relations be suitable between knowing according to described index mark and described index mark and principal mark obtain principal mark and know; Target physical subregion searches unit, is suitable for the second mapping relationship searching target physical subregion knowing the target physical by stages corresponding with it according to described principal mark; Delete cells, be suitable for, when there is described principal mark in described target physical subregion and knowing, in described target physical subregion, deleting each node of graph and corresponding principal mark in the picture information of the picture information of target subgraph, described second mapping relations and described target subgraph knowing the first mapping relations of intersymbol; Writing unit, is suitable for writing the picture information of the principal mark knowledge only comprising described target subgraph in described target physical subregion.
In concrete enforcement, the device 70 of described diagram data process service can also comprise: Physical Extents cleaning unit 741, and described Physical Extents cleaning unit 741 can comprise:
First record cell, be suitable for when described service reception to exist Physical Extents for clearance need the information of carrying out disk arrangement time, the picture information being suitable for recording current described Physical Extents for clearance is SNAPSHOT INFO; Exchange area writing unit, is suitable for described SNAPSHOT INFO to write exchange area; Described exchange area is unappropriated space in disk; Cleaning unit, is suitable for the deleted Physical Extents shared by subgraph of removing in described exchange area in described SNAPSHOT INFO; Lock unit, is suitable for the synchronizing information of write new in current described Physical Extents for clearance to write described exchange area; Capping unit, is suitable for the information information in described exchange area covered in described Physical Extents for clearance.
In concrete enforcement, the device 70 of described diagram data process service can also comprise subgraph cleaning unit 751, and described subgraph cleaning unit 751 can comprise:
Second record cell, is suitable for recording the required described principal mark obtained in diagram data processing procedure described in every day and knows; Principal mark knows merge cells, and all described principal mark being suitable for recording in the term of validity by regulation knows merging, obtains effective main identification sets; Picture information cleaning unit, is suitable for searching for picture information storehouse, when inquire in described picture information storehouse exist do not appear at described effective principal mark know the picture information concentrated time, described 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 that the hardware that can carry out instruction relevant by program has come, this program can be stored in computer-readable recording medium, and storage medium can comprise: ROM, RAM, disk or CD etc.
Although the present invention discloses as above, the present invention is not defined in this.Any those skilled in the art, without departing from the spirit and scope of the present invention, all can make various changes or modifications, and therefore protection scope of the present invention should be as the criterion with claim limited range.

Claims (18)

1. a method for diagram data process service, is characterized in that, comprising:
When receiving the picture information of query aim subgraph, obtain the index mark of any one node of graph in the picture information of described target subgraph; Wherein, the index of node of graph identifies and node of graph information one_to_one corresponding;
The first mapping relations between knowing with corresponding principal mark according to the index of described node of graph mark obtain corresponding principal mark and know; Wherein, described first mapping relations comprise: obtain the type belonging to known node of graph according to the index mark of known node of graph, Btree corresponding to Hash index selection is passed through according to described type, obtain the principal mark knowledge of subgraph according to the index mark of described known node of graph in described Btree, wherein, a corresponding Btree of type, the corresponding relation that the index mark comprising the node of graph of a type in a Btree identifies with the principal mark of subgraph;
The Physical Extents that target subgraph is corresponding according to described main identifier lookup; Wherein, there are the second mapping relations with between described corresponding Physical Extents in described principal mark knowledge;
Judge whether to comprise in described Physical Extents the sensible same identification information with described principal mark;
When comprising the sensible same identification information with described principal mark in described Physical Extents, then get the picture information of described target subgraph according to described identification information; Wherein, the picture information of described identification information and a subgraph is one-to-one relationship; The picture information of a described subgraph comprises the incidence relation information between node of graph information and node of graph; The incidence relation information of two node of graph is there is not between any two subgraphs.
2. the method for diagram data process service according to claim 1, is characterized in that, also comprise:
When receiving the information of insertion one group of incidence relation information to one picture information to be updated, obtain the index mark of two node of graph information corresponding to an incidence relation information to be added respectively as the first index mark and the second index mark; Wherein, the node of graph information of corresponding two node of graph of incidence relation information, incidence relation information comprises the incidence relation of two node of graph, degree of incidence and last correlation time;
According to described first index mark acquisition first picture information, according to described second index mark acquisition second picture information;
When described first picture information and described second picture information belong to same described picture information to be updated, in the Physical Extents at described picture information place to be updated, upgrade described incidence relation information, obtain upgrading picture information;
When a picture information in described first picture information and described second picture information is blank, in the Physical Extents not for blank picture information place to be updated obtained, upgrade described incidence relation information, setting up corresponding picture information is described first mapping relations that the first blank index mark or the second index mark are known with the principal mark of described picture information to be updated;
When described first picture information is different with described second picture information, the first picture information and the second picture information are merged, obtain upgrading picture information.
3. the method for diagram data process according to claim 2 service, is characterized in that, describedly the first picture information and the second picture information is merged, and obtains renewal picture information, comprising:
Using described first picture information or described second picture information as chief subgraph information, read another picture information and another picture information described is write Physical Extents, described chief subgraph information place;
To set up and described first index identifies identical index and identifies corresponding node of graph and identify identical index with described second index and identify incidence relation between corresponding node of graph;
The principal mark of described chief subgraph information is known and knows as the principal mark of described renewal subgraph;
Upgrade described first mapping relations that in another picture information described, each index mark is known with the principal mark of described renewal subgraph.
4., according to the method for the diagram data process service described in claim 1, it is characterized in that, also comprise:
When an incidence relation information needs to delete in service detection to picture information, obtain the index mark of two node of graph information corresponding to an incidence relation information to be added respectively as the first index mark and the second index mark; Wherein, the node of graph information of corresponding two node of graph of incidence relation information, incidence relation information comprises the incidence relation of two node of graph, degree of incidence and last correlation time;
Target picture information is obtained according to described first index mark or described second index mark;
In the Physical Extents at described target picture information place, delete described incidence relation information, obtain upgrading picture information.
5. according to the method for the diagram data process service described in claim 4, it is characterized in that, in described service detection to picture information, an incidence relation information needs to delete, and comprising:
When detecting that the picture information associated weights value existed in incidence relation information reaches fixed threshold, need to delete corresponding incidence relation information; Wherein, described associated weights value calculates gained according to described degree of incidence and described last correlation time.
6. the method for diagram data process according to claim 4 service, is characterized in that, describedly in the Physical Extents at described target picture information place, deletes described incidence relation information, obtains upgrading picture information, comprising:
When after the described incidence relation information of deletion, when described target picture information forms the picture information of subgraph after multiple fractionation, after the described fractionation corresponding at most by the index identification number of node of graph, subgraph retains, using subgraph after the described fractionation that retains as renewal subgraph.
7. the method for diagram data process service according to claim 1, is characterized in that, also comprise:
When receiving the information of the picture information deleting target subgraph, obtain the index mark of arbitrary node of graph in the picture information of described target subgraph;
Described first mapping relations between knowing according to described index mark and described index mark and principal mark obtain principal mark and know;
The second mapping relationship searching target physical subregion of the target physical by stages corresponding with it is known according to described principal mark;
When there is described principal mark in described target physical subregion and knowing, in described target physical subregion, delete each node of graph and corresponding principal mark in the picture information of the picture information of target subgraph, described second mapping relations and described target subgraph know the first mapping relations of intersymbol;
The picture information of the principal mark knowledge only comprising described target subgraph is write in described target physical subregion.
8. the method for diagram data process service according to claim 1, is characterized in that, also comprise:
When described service reception to exist Physical Extents for clearance need the information of carrying out disk arrangement time, the picture information recording current described Physical Extents for clearance is SNAPSHOT INFO;
Described SNAPSHOT INFO is write exchange area; Described exchange area is unappropriated space in disk;
The deleted Physical Extents shared by subgraph in described SNAPSHOT INFO is removed in described exchange area;
The synchronizing information of write new in current described Physical Extents for clearance is write described exchange area;
Information in described exchange area is covered the information in described Physical Extents for clearance.
9. the method for the diagram data process service according to any one of claim 1-8, is characterized in that, also comprise:
Record the required described principal mark obtained in diagram data processing procedure described in every day to know;
The all described principal mark recorded in the term of validity of regulation is known and merges, obtain effective main identification sets;
Search picture information storehouse, when inquire in described picture information storehouse exist do not appear at described effective principal mark know the picture information concentrated time, described picture information is deleted.
10. a device for diagram data process service, is characterized in that, comprising:
First acquiring unit, when being suitable for the picture information receiving query aim subgraph, obtains the index mark of arbitrary node of graph in the picture information of described target subgraph; Wherein, the index of node of graph identifies and node of graph information one_to_one corresponding;
First principal mark knows acquiring unit, and the first mapping relations between knowing with corresponding principal mark according to the index of described node of graph mark obtain corresponding principal mark and know; Wherein, described first mapping relations comprise: obtain the type belonging to known node of graph according to the index mark of known node of graph, Btree corresponding to Hash index selection is passed through according to described type, be suitable for the principal mark knowledge obtaining subgraph in described Btree according to the index mark of described arbitrary node of graph, wherein, a corresponding Btree of type, the corresponding relation that the index mark comprising the node of graph of a type in a Btree identifies with the principal mark of subgraph;
Unit is searched in Physical Extents, is suitable for the Physical Extents that target subgraph is corresponding according to described main identifier lookup; Wherein, there are the second mapping relations with between described corresponding Physical Extents in described principal mark knowledge;
First judging unit, is suitable for judging whether to comprise in described Physical Extents the sensible same identification information with described principal mark;
First object subgraph acquiring unit, is suitable for when comprising the sensible same identification information with described principal mark in described Physical Extents, then getting the picture information of described target subgraph according to described identification information; Wherein, the picture information of described identification information and a subgraph is one-to-one relationship; The picture information of a described subgraph comprises the incidence relation information between node of graph information and node of graph; The incidence relation information of two node of graph is there is not between any two subgraphs.
The device of 11. diagram data process services according to claim 10, it is characterized in that, also comprise incidence relation plug-in unit, described incidence relation plug-in unit comprises:
Second acquisition unit, being suitable for when receiving the information of insertion one group of incidence relation information to one picture information to be updated, obtaining the index mark of two node of graph information in an incidence relation information to be added respectively as the first index mark and the second index mark; Wherein, the node of graph information of corresponding two node of graph of incidence relation information, incidence relation information comprises the incidence relation of two node of graph, degree of incidence and last correlation time;
Second target subgraph acquiring unit, is suitable for according to described first index mark acquisition first picture information, according to described second index mark acquisition second picture information;
First updating block, be suitable for when described first picture information and described second picture information belong to same described picture information to be updated, in the Physical Extents at described picture information place to be updated, upgrade described incidence relation information, obtain upgrading picture information;
Second updating block, when a picture information in described first picture information and described second picture information is blank, in the Physical Extents not for blank picture information place to be updated obtained, upgrade described incidence relation information, setting up corresponding picture information is described first mapping relations that the first blank index mark or the second index mark are known with the principal mark of described picture information to be updated;
3rd updating block, is suitable for, when described first picture information is different with described second picture information, the first picture information and the second picture information being merged, and obtains upgrading picture information.
The device of 12. diagram data process services according to claim 11, it is characterized in that, described 3rd updating block is suitable for:
Using described first picture information or described second picture information as chief subgraph information, read another picture information and another picture information described is write Physical Extents, described chief subgraph information place;
To set up and described first index identifies identical index and identifies corresponding node of graph and identify identical index with described second index and identify incidence relation between corresponding node of graph;
The principal mark of described chief subgraph information is known and knows as the principal mark of described renewal subgraph;
Upgrade described first mapping relations that in another picture information described, each index mark is known with the principal mark of described renewal subgraph.
The device of 13. a kind of diagram data process services according to claim 10, it is characterized in that, also comprise incidence relation delete cells, described incidence relation delete cells comprises:
3rd acquiring unit, be suitable for when an incidence relation information needs to delete in service detection to picture information, obtain the index mark of two node of graph information corresponding to an incidence relation information to be added respectively as the first index mark and the second index mark; Wherein, the node of graph information of corresponding two node of graph of incidence relation information, incidence relation information comprises the incidence relation of two node of graph, degree of incidence and last correlation time;
3rd target subgraph acquiring unit, is suitable for obtaining target picture information according to described first index mark or described second index mark;
Incidence relation information deletion unit, is suitable for deleting described incidence relation information in the Physical Extents at described target picture information place, obtains upgrading picture information.
The device of 14. a kind of diagram data process services according to claim 13, it is characterized in that, described incidence relation delete cells also comprises the second judging unit, when the associated weights value being suitable for existing in incidence relation information at picture information reaches fixed threshold, judge to need to delete corresponding incidence relation information; Wherein, described associated weights value calculates gained by described degree of incidence and described last correlation time.
The device of 15. a kind of diagram data process services according to claim 13, it is characterized in that, described incidence relation information deletion unit is suitable for: when after the described incidence relation information of deletion, when described target picture information forms the picture information of subgraph after multiple fractionation, after the described fractionation corresponding at most by the index identification number of node of graph, subgraph retains, using subgraph after the described fractionation retained as upgrading subgraph.
The device of 16. a kind of diagram data process services according to claim 10, it is characterized in that, also comprise subgraph delete cells, described subgraph delete cells comprises:
4th acquiring unit, when being suitable for the information receiving the picture information deleting target subgraph, obtains the index mark of arbitrary node of graph in the picture information of described target subgraph;
4th principal mark knows acquiring unit, and described first mapping relations be suitable between knowing according to described index mark and described index mark and principal mark obtain principal mark and know;
Target physical subregion searches unit, is suitable for the second mapping relationship searching target physical subregion knowing the target physical by stages corresponding with it according to described principal mark;
Delete cells, be suitable for, when there is described principal mark in described target physical subregion and knowing, in described target physical subregion, deleting each node of graph and corresponding principal mark in the picture information of the picture information of target subgraph, described second mapping relations and described target subgraph knowing the first mapping relations of intersymbol;
Writing unit, is suitable for writing the picture information of the principal mark knowledge only comprising described target subgraph in described target physical subregion.
The device of 17. diagram data process services according to claim 10, is characterized in that, also comprises Physical Extents cleaning unit, and described Physical Extents cleaning unit comprises:
First record cell, be suitable for when described service reception to exist Physical Extents for clearance need the information of carrying out disk arrangement time, the picture information being suitable for recording current described Physical Extents for clearance is SNAPSHOT INFO;
Exchange area writing unit, is suitable for described SNAPSHOT INFO to write exchange area; Described exchange area is unappropriated space in disk;
Cleaning unit, is suitable for the deleted Physical Extents shared by subgraph of removing in described exchange area in described SNAPSHOT INFO;
Lock unit, is suitable for the synchronizing information of write new in current described Physical Extents for clearance to write described exchange area;
Capping unit, is suitable for the information information in described exchange area covered in described Physical Extents for clearance.
The device of 18. diagram data process services according to any one of claim 10-17, it is characterized in that, also comprise subgraph cleaning unit, described subgraph cleaning unit comprises:
Second record cell, is suitable for recording the required described principal mark obtained in diagram data processing procedure described in every day and knows;
Principal mark knows merge cells, and all described principal mark being suitable for recording in the term of validity by regulation knows merging, obtains effective main identification sets;
Picture information cleaning unit, is suitable for searching for picture information storehouse, when inquire in described picture information storehouse exist do not appear at described effective principal mark know the picture information concentrated time, described picture information is deleted.
CN201510673285.XA 2015-10-16 2015-10-16 A kind of method, apparatus of diagram data processing service Active CN105260465B (en)

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 true CN105260465A (en) 2016-01-20
CN105260465B 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)

Cited By (4)

* Cited by examiner, † Cited by third party
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
CN111191080A (en) * 2019-08-22 2020-05-22 腾讯科技（深圳）有限公司 Data processing method and device
CN112784119A (en) * 2021-01-14 2021-05-11 内蒙古蒙商消费金融股份有限公司 Data query and synchronization optimization method and device

Citations (6)

* Cited by examiner, † Cited by third party
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

Patent Citations (6)

* Cited by examiner, † Cited by third party
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

Cited By (4)

* Cited by examiner, † Cited by third party
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
CN111191080A (en) * 2019-08-22 2020-05-22 腾讯科技（深圳）有限公司 Data processing method and device
CN112784119A (en) * 2021-01-14 2021-05-11 内蒙古蒙商消费金融股份有限公司 Data query and synchronization optimization method and device

Also Published As

Publication number Publication date
CN105260465B (en) 2018-10-30

Similar Documents

Publication Publication Date Title
CN108733761B (en) Data processing method, device and system
CN107092439B (en) Data storage method and equipment
CN105718455B (en) A kind of data query method and device
CN111125089A (en) Time sequence data storage method, device, server and storage medium
KR101994021B1 (en) File manipulation method and apparatus
CN103703467A (en) Method and apparatus for storing data
CN107704202B (en) Method and device for quickly reading and writing data
CN107911461B (en) Object processing method in cloud storage system, storage server and cloud storage system
CN103020204A (en) Method and system for carrying out multi-dimensional regional inquiry on distribution type sequence table
CN106649403B (en) Index implementation method and system in file storage
EP3251033B1 (en) Hybrid data distribution in a massively parallel processing architecture
CN101944124A (en) Distributed file system management method, device and corresponding file system
CN105260465A (en) Graph data processing service method and apparatus
CN104978324B (en) Data processing method and device
CN103870202A (en) Distributed storage method and system of block device
CN108205562B (en) Positioning data storage and retrieval method and device for geographic information system
CN104539750A (en) IP locating method and device
CN104469392A (en) Video file storage method and device
CN104408044A (en) File access method and system
CN105338073A (en) File directory processing method, server and system
CN104281717A (en) Method for establishing massive ID mapping relation
CN105260464A (en) Data storage structure conversion method and apparatus
CN102779138A (en) Hard disk access method of real time data
KR101654314B1 (en) Distributed processing system in spatial data and method for operating the same
CN105447168A (en) Method for restoring and recombining fragmented files in MP4 format

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