CN104657385A - Search method and device of node - Google Patents
Search method and device of node Download PDFInfo
- Publication number
- CN104657385A CN104657385A CN201310596519.6A CN201310596519A CN104657385A CN 104657385 A CN104657385 A CN 104657385A CN 201310596519 A CN201310596519 A CN 201310596519A CN 104657385 A CN104657385 A CN 104657385A
- Authority
- CN
- China
- Prior art keywords
- node
- shaped model
- tree shaped
- information
- nodal
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2264—Multidimensional index structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+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/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/31—Indexing; Data structures therefor; Storage structures
- G06F16/316—Indexing structures
- G06F16/322—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/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/31—Indexing; Data structures therefor; Storage structures
- G06F16/316—Indexing structures
- G06F16/325—Hash tables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/40—Information retrieval; Database structures therefor; File system structures therefor of multimedia data, e.g. slideshows comprising image and additional audio data
- G06F16/43—Querying
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Multimedia (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a search method and device of a node. The method comprises the following steps: a server acquires attribute information reported by any node aiming at any node; acquiring storage space position information of the node information of any node according to the attribute information of any node; acquiring nodes of a same hierarchy and nodes of adjacent hierarchies in a tree-shaped structure based on the storage space position information. By using the technical scheme, since each hierarchy in a tree-shaped model corresponds to different node attribute types, the node attribute type corresponding to each hierarchy of the tree-shaped model is only required to be matched layer by layer according to the node attribute type corresponding to the attribute information of any node when an optimal node associated with the any node is required to be searched from the tree-shaped model; thus the optimal node to be searched can be quickly acquired, and the system resource consumed in the node search process is small.
Description
Technical field
The present invention relates to communication technical field, particularly relate to a kind of lookup method and device of node.
Background technology
Along with the develop rapidly of multimedia technology, various ways can be adopted to carry out transmission and the broadcasting of Streaming Media, wherein, P2P(Peer to Peer; Point-to-point) stream media system is a kind of conventional streaming media and Play System.
In existing point-to-point stream media system, streaming medium content is cut into multiple data block (chunk), using each data block as the base unit of transmission of flow media data, thus complete continuous print data stream and transmit between node (Peer), wherein, each data block is represented by unique chunk id.Sharing and exchanging the buffered message (being called for short BM) all depending on the description node buffer status exchanged between node of programme content, namely completes sharing of programme content by buffered message and exchanges.
At present, in point-to-point stream media system, the management for node is realized by Hash table usually, and all nodal informations by server administration are unified to be stored in a Hash table.Consult shown in Fig. 1, in this Hash table, be divided into two row according to the difference storing content in form, wherein row are used for the identification information of memory node, and another row are used for other relevant informations of memory node.Mode according to Hash table carries out node storage, when a node searched by needs, then needs to travel through this Hash table, until obtain node to be found; When this node to be found is arranged in last column form of Hash table, and when to search reference position be the first row form of Hash table, server needs to travel through whole Hash table could obtain this node to be found, the complexity that lookup result is obtained is higher, cause node checks procedures system resource cost large, and the problem that the time of searching is long.
As can be seen here, when searching any node based on the nodal information storage means in existing point-to-point stream media system, have that to search the time long, expend system resource greatly and the problem of influential system performance.
Summary of the invention
The embodiment of the present invention provides a kind of node checks method and device, when searching any node in order to solve based on the nodal information storage means in existing point-to-point stream media system, have that to search the time long, expend system resource greatly and the problem of influential system performance.
The concrete technical scheme that the embodiment of the present invention provides is as follows:
A lookup method for node, is applied in point-to-point stream media system, comprises:
According to the node attribute information of the described any node carried in the node checks message that any node sends, obtain the storage space positional information of nodal information in the tree shaped model be pre-created of described any node; Wherein, the multiple nodal community type that described tree shaped model is corresponding according to the attribute information of node creates, and a kind of nodal community type of each layer of correspondence of described tree shaped model;
According to the storage space positional information of described any node, from the level of the described tree shaped model corresponding to described storage space positional information, successively travel through described tree shaped model according to order from the bottom to top, search the node that linking number does not reach linking number threshold value.
Optionally, according to the node attribute information of the described any node carried in the node checks message that any node sends, the nodal community type that the node attribute information of described any node is corresponding is obtained; The nodal community type corresponding according to described any node, successively mates in the tree shaped model be pre-created; When not comprising described any node in described tree shaped model, according to the attribute information of described any node, the nodal information of described any node is stored in the respective stored space in tree shaped model, and obtains storage space positional information corresponding to described any node.
Further, when comprising described any node in described tree shaped model, upgrade the nodal information of the described any node in described tree shaped model.
Further, Type division is carried out to the attribute information of any node, obtain multiple different types of nodal community type, wherein, the corresponding attribute type rank of any one nodal community type; The attribute type rank order from high to low corresponding according to each nodal community type, creates every one deck of tree shaped model successively, makes the equal corresponding a kind of nodal community type of each layer of described tree shaped model; Wherein, using the ground floor of highest-ranking for described attribute type nodal community type as described tree shaped model.
Adopt technique scheme, the attribute type rank sequence that the attribute information based on node is corresponding, create the every one deck of tree shaped model successively, the tree shaped model of acquisition can be made to be more suitable for searching node.
The nodal community type that nodal community type corresponding for described any node is corresponding with one deck every in described tree shaped model is successively mated; According to matching result, determine the storage space that described any node is corresponding, and the nodal information of described any node is stored in corresponding storage space.
Adopt technique scheme, because the attribute information of tree shaped model and node matches, therefore, quick storage can be carried out to nodal information by tree shaped model, effectively improve the storage efficiency of system.
Node search a device, be applied in point-to-point stream media system, comprise:
Acquiring unit, for the node attribute information according to the described any node carried in the node checks message of any node transmission, obtains the storage space positional information of nodal information in the tree shaped model be pre-created of described any node; Wherein, the multiple nodal community type that described tree shaped model is corresponding according to the attribute information of node creates, and a kind of nodal community type of each layer of correspondence of described tree shaped model;
Search unit, for the storage space positional information according to described any node, from the level of the described tree shaped model corresponding to described storage space positional information, successively travel through described tree shaped model according to order from the bottom to top, search the node that linking number does not reach linking number threshold value.
Optionally, described acquiring unit, specifically for: according to the node attribute information of the described any node carried in the node checks message that any node sends, obtain the nodal community type that the node attribute information of described any node is corresponding; The nodal community type corresponding according to described any node, successively mates in the tree shaped model be pre-created; When not comprising described any node in described tree shaped model, according to the attribute information of described any node, the nodal information of described any node is stored in the respective stored space in tree shaped model, and obtains storage space positional information corresponding to described any node.
Further, said apparatus also comprises updating block, for when comprising described any node in described tree shaped model, upgrades the nodal information of the described any node in described tree shaped model.
Further, said apparatus also comprises creating unit, for: Type division is carried out to the attribute information of any node, obtains multiple different types of nodal community type, wherein, the corresponding attribute type rank of any one nodal community type; The attribute type rank order from high to low corresponding according to each nodal community type, creates every one deck of tree shaped model successively, makes the equal corresponding a kind of nodal community type of each layer of described tree shaped model; Wherein, using the ground floor of highest-ranking for described attribute type nodal community type as described tree shaped model.
Adopt technique scheme, the attribute type rank sequence that the attribute information based on node is corresponding, create the every one deck of tree shaped model successively, the tree shaped model of acquisition can be made to be more suitable for searching node.
Optionally, described acquiring unit, specifically for: after the nodal information of each node described being stored in the respective stored space in described tree shaped model, obtaining storage space positional information corresponding to each node respectively and store.
Adopt technique scheme, because the attribute information of tree shaped model and node matches, therefore, quick storage can be carried out to nodal information by tree shaped model, effectively improve the storage efficiency of system.
In the embodiment of the present invention, for any node, server obtains the attribute information that this any node reports; And according to the attribute information of this any node, obtain the storage space positional information of this any node, based on this storage space positional information, preferentially in tree structure obtain same level and close on the node of level.Adopt technique scheme, due to the nodal community type that one deck every in this tree shaped model is all corresponding different, therefore, when needing to search at above-mentioned tree shaped model the optimum node that any node is associated, the nodal community type corresponding according to the attribute information of this any node is only needed successively to mate nodal community type corresponding to tree shaped model each layer, thus can quick obtaining optimum node to be found, node checks process consumes system resource is little.
Accompanying drawing explanation
Fig. 1 is that in prior art, Hash represents intention;
Fig. 2 is the detail flowchart carrying out node checks in the embodiment of the present invention;
Fig. 3 is tree shaped model schematic diagram in the embodiment of the present invention;
Fig. 4 be embodiment of the present invention interior joint search apparatus structure schematic diagram.
Embodiment
When searching any node in order to solve based on the nodal information storage means in existing point-to-point stream media system, have that to search the time long, expend system resource greatly and the problem of influential system performance.In the embodiment of the present invention, for any node, server obtains the attribute information that this any node reports; Obtain the storage space positional information of the nodal information of this any node, based on this storage space positional information, in tree structure, preferentially obtain same level and close on the node of level.Adopt technique scheme, due to the nodal community type that one deck every in this tree shaped model is all corresponding different, therefore, when needing to search at above-mentioned tree shaped model the optimum node that any node is associated, the nodal community type corresponding according to the attribute information of this any node is only needed successively to mate nodal community type corresponding to tree shaped model each layer, thus can quick obtaining optimum node to be found, node checks process consumes system resource is little.
The embodiment of the present invention is applied in point-to-point stream media system, is described in detail to the preferred embodiment of the present invention below in conjunction with accompanying drawing.
Consult shown in Fig. 2, in the embodiment of the present invention, the detailed process carrying out node checks is:
Step 200: according to the node attribute information of this any node carried in the node checks message that any node sends, obtain the storage space positional information of nodal information in the tree shaped model be pre-created of this any node.
In point-to-point stream media system, usually the nodal information of each node is stored in the server of this node of administration.
In the embodiment of the present invention, the mode that server obtains the attribute information of local each node of administering is: when server receives the node checks message of any node transmission, namely obtain the attribute information of this any node carried in this node checks message.Wherein, the attribute information of node comprises service provider (ISP) information that this node is provided services on the Internet, and the positional information of this node etc. characterize the information of nodal properties.
Optionally, server can according to the attribute information of node, be pre-created tree shaped model, detailed process is: carry out Type division to the attribute information of any node, obtains multiple different nodal community type, wherein, the corresponding attribute type rank of any one nodal community type, this nodal community type comprises ISP type, country type, regional population, provinces and cities' type etc.; The attribute type rank sequence corresponding according to each nodal community type, creates every one deck of tree shaped model successively, makes the nodal community type that each layer of this tree shaped model is all corresponding different; Wherein, using the ground floor of highest-ranking for attribute type nodal community type as described tree shaped model; Attribute type rank corresponding to each nodal community type can be arranged as the case may be voluntarily.
Due in point-to-point stream media system, do not allow the node checks behavior across ISP, therefore, optionally, using the ground floor of the ISP type in nodal community type as tree shaped model, by the root node of ISP type as tree shaped model, and according to the sequence of other nodal community type level, create every one deck of this tree shaped model successively.Such as, consult shown in Fig. 3, using the root node (ground floor) of ISP type as tree shaped model, using the second layer of country type as tree shaped model, using the third layer of regional population as tree shaped model, using as tree shaped model the 4th layer of provinces and cities' type, the nodal information of node is stored in the storage space under the above-mentioned tree shaped model bottom.
Adopt technique scheme, based on the attribute type rank sequence that the attribute information of node is corresponding, create the every one deck of tree shaped model successively, using the memory model of this tree shaped model as nodal information, as can be seen here, above-mentioned node memory model process of establishing simple and fast, and the node memory model set up can be more suitable for searching of node.
In the embodiment of the present invention, based on the above-mentioned tree shaped model created, first server searches the position of nodal information in tree shaped model of above-mentioned any node, if there is above-mentioned any node in the tree shaped model of server, then upgrade the nodal information of this any node, wherein, this nodal information comprises timestamp information, current time linking number information, node identification etc.; If there is not the nodal information of above-mentioned any node in the tree shaped model of server, then the nodal information of this any node is stored.Wherein, server obtains the process of the storage space positional information of nodal information in tree shaped model of above-mentioned any node and is: server obtains nodal community type corresponding to the node attribute information of this any node; The nodal community type corresponding with one deck every in above-mentioned tree shaped model to the nodal community type that this any node is corresponding is successively mated, according to matching result, obtain the storage space that this any node is corresponding, thus obtain the storage space positional information of this storage space in above-mentioned tree shaped model.
Optionally, the storing process for the nodal information of any node is: server obtains nodal community type corresponding to the node attribute information of this any node; The nodal community type corresponding with one deck every in above-mentioned tree shaped model to the nodal community type that this any node is corresponding is successively mated, according to matching result, determine the storage space that this any node is corresponding, and the nodal information of this any node is stored in above-mentioned storage space.Such as, consult shown in Fig. 3, be directed to node A, if the nodal community type that the node attribute information of this node A is corresponding is respectively ISP1, China, northeast, Jilin, then successively mate with above-mentioned tree shaped model according to this nodal community type of this node A, the nodal information of node A finally can be determined to be stored in storage space t.
Further, server obtains storage space positional information corresponding to each node respectively and stores after being stored to by the nodal information of each node in the respective stored space in above-mentioned tree shaped model.
Adopt technique scheme, because the attribute information of tree shaped model and node matches, therefore, quick storage can be carried out to nodal information by tree shaped model, effectively improve the storage efficiency of system.
Step 210: according to the storage space positional information of above-mentioned any node, from the level of the tree shaped model corresponding to this storage space positional information, successively travel through tree shaped model according to order from the bottom to top, search the node that linking number does not reach linking number threshold value.
In the embodiment of the present invention, search the storage space positional information that the process need of node to be found is corresponding according to node to be found, from the level of the tree shaped model corresponding to storage space positional information, successively travel through tree shaped model according to order from the bottom to top, search the node that linking number does not reach linking number threshold value.As can be seen here, in point-to-point stream media system, be optimum node with the immediate node of this any node geo-location information.That is based on above-mentioned tree shaped model, first coupling and this any node are in other nodes on same layer, and these other nodes are optimum node.Such as, consult shown in Fig. 3, suppose the optimum node needing to search node A, node A is arranged in storage space t, then first coupling and this node A are in other nodes on same layer, namely other nodes in storage space t, if there is Node B in storage space t, then Node B is the optimum node of node A, if there are not other nodes in storage space t, or the linking number of the node existed in storage space t all reaches maximum number of connections threshold value, the node stored under then needing to find other provinces and cities' types in the layer that the last layer nodal community type (i.e. provinces and cities' type) belonging to node A is corresponding, provinces and cities' type corresponding to node A is Jilin, then need searching optimum node with the Jilin storage space be arranged under Liaoning of same layer, the like, until search to optimum node, thus enable above-mentioned any node obtain data message from above-mentioned optimum node.Wherein, this optimum node is node to be found, and node to be found can be one also can be multiple.
Adopt technique scheme, the optimum node of any node can be obtained rapidly, effectively improve system performance.
Based on technique scheme, consult shown in Fig. 4, what the embodiment of the present invention also provided a kind of node searches device, comprises acquiring unit 40, and searches unit 41, wherein:
Acquiring unit 40, for the node attribute information according to the described any node carried in the node checks message of any node transmission, obtains the storage space positional information of nodal information in the tree shaped model be pre-created of described any node; Wherein, the multiple nodal community type that described tree shaped model is corresponding according to the attribute information of node creates, and a kind of nodal community type of each layer of correspondence of described tree shaped model;
Search unit 41, for the storage space positional information according to described any node, from the level of the described tree shaped model corresponding to described storage space positional information, successively travel through described tree shaped model according to order from the bottom to top, search the node that linking number does not reach linking number threshold value.
Said apparatus comprises updating block 42, for: when comprising described any node in described tree shaped model, upgrade the nodal information of the described any node in described tree shaped model.
Said apparatus also comprises creating unit 43, specifically for: Type division is carried out to the attribute information of any node, obtains multiple different types of nodal community type, wherein, the corresponding attribute type rank of any one nodal community type; The attribute type rank order from high to low corresponding according to each nodal community type, creates every one deck of tree shaped model successively, makes the equal corresponding a kind of nodal community type of each layer of described tree shaped model; Wherein, using the ground floor of highest-ranking for described attribute type nodal community type as described tree shaped model.
In sum, in the embodiment of the present invention, according to the node attribute information of this any node carried in the node checks message that any node sends, obtain the storage space positional information of nodal information in the tree shaped model be pre-created of this any node; According to the storage space positional information of above-mentioned any node, from the level of the tree shaped model corresponding to this storage space positional information, successively travel through tree shaped model according to order from the bottom to top, search the node that linking number does not reach linking number threshold value.Adopt technique scheme, due to the nodal community type that one deck every in this tree shaped model is all corresponding different, therefore, when needing to search at above-mentioned tree shaped model the optimum node that any node is associated, the nodal community type corresponding according to the attribute information of this any node is only needed successively to mate nodal community type corresponding to tree shaped model each layer, thus can quick obtaining optimum node to be found, node checks process consumes system resource is little.
Those skilled in the art should understand, embodiments of the invention can be provided as method, system or computer program.Therefore, the present invention can adopt the form of complete hardware embodiment, completely software implementation or the embodiment in conjunction with software and hardware aspect.And the present invention can adopt in one or more form wherein including the upper computer program implemented of computer-usable storage medium (including but not limited to magnetic disk memory, CD-ROM, optical memory etc.) of computer usable program code.
The present invention describes with reference to according to the process flow diagram of the method for the embodiment of the present invention, equipment (system) and computer program and/or block scheme.Should understand can by the combination of the flow process in each flow process in computer program instructions realization flow figure and/or block scheme and/or square frame and process flow diagram and/or block scheme and/or square frame.These computer program instructions can being provided to the processor of multi-purpose computer, special purpose computer, Embedded Processor or other programmable data processing device to produce a machine, making the instruction performed by the processor of computing machine or other programmable data processing device produce device for realizing the function of specifying in process flow diagram flow process or multiple flow process and/or block scheme square frame or multiple square frame.
These computer program instructions also can be stored in can in the computer-readable memory that works in a specific way of vectoring computer or other programmable data processing device, the instruction making to be stored in this computer-readable memory produces the manufacture comprising command device, and this command device realizes the function of specifying in process flow diagram flow process or multiple flow process and/or block scheme square frame or multiple square frame.
These computer program instructions also can be loaded in computing machine or other programmable data processing device, make on computing machine or other programmable devices, to perform sequence of operations step to produce computer implemented process, thus the instruction performed on computing machine or other programmable devices is provided for the step realizing the function of specifying in process flow diagram flow process or multiple flow process and/or block scheme square frame or multiple square frame.
Although describe the preferred embodiments of the present invention, those skilled in the art once obtain the basic creative concept of cicada, then can make other change and amendment to these embodiments.So claims are intended to be interpreted as comprising preferred embodiment and falling into all changes and the amendment of the scope of the invention.
Obviously, those skilled in the art can carry out various change and modification to the embodiment of the present invention and not depart from the spirit and scope of the embodiment of the present invention.Like this, if these amendments of the embodiment of the present invention and modification belong within the scope of the claims in the present invention and equivalent technologies thereof, then the present invention is also intended to comprise these change and modification.
Claims (10)
1. a lookup method for node, is applied in point-to-point stream media system, it is characterized in that, comprising:
According to the node attribute information of the described any node carried in the node checks message that any node sends, obtain the storage space positional information of nodal information in the tree shaped model be pre-created of described any node; Wherein, the multiple nodal community type that described tree shaped model is corresponding according to the attribute information of node creates, and a kind of nodal community type of each layer of correspondence of described tree shaped model;
According to the storage space positional information of described any node, from the level of the described tree shaped model corresponding to described storage space positional information, successively travel through described tree shaped model according to order from the bottom to top, search the node that linking number does not reach linking number threshold value.
2. the method for claim 1, it is characterized in that, according to the node attribute information of the described any node carried in the node checks message that any node sends, obtain the storage space positional information of nodal information in the tree shaped model be pre-created of described any node, specifically comprise:
According to the node attribute information of the described any node carried in the node checks message that any node sends, obtain the nodal community type that the node attribute information of described any node is corresponding;
The nodal community type corresponding according to described any node, successively mates in the tree shaped model be pre-created;
When not comprising described any node in described tree shaped model, according to the attribute information of described any node, the nodal information of described any node is stored in the respective stored space in tree shaped model, and obtains storage space positional information corresponding to described any node.
3. method as claimed in claim 2, is characterized in that, when comprising described any node in described tree shaped model, comprising further:
Upgrade the nodal information of the described any node in described tree shaped model.
4. the method as described in any one of claim 1-3, is characterized in that, the creation method of described tree shaped model, specifically comprises:
Type division is carried out to the attribute information of any node, obtains multiple different types of nodal community type, wherein, the corresponding attribute type rank of any one nodal community type;
The attribute type rank order from high to low corresponding according to each nodal community type, creates every one deck of tree shaped model successively, makes the equal corresponding a kind of nodal community type of each layer of described tree shaped model; Wherein, using the ground floor of highest-ranking for described attribute type nodal community type as described tree shaped model.
5. method as claimed in claim 4, is characterized in that, according to the attribute information of described any node, be stored in the respective stored space in described tree shaped model by the nodal information of described any node, specifically comprise:
The nodal community type that nodal community type corresponding for described any node is corresponding with one deck every in described tree shaped model is successively mated;
According to matching result, determine the storage space that described any node is corresponding, and the nodal information of described any node is stored in corresponding storage space.
6. node search a device, be applied in point-to-point stream media system, it is characterized in that, comprising:
Acquiring unit, for the node attribute information according to the described any node carried in the node checks message of any node transmission, obtains the storage space positional information of nodal information in the tree shaped model be pre-created of described any node; Wherein, the multiple nodal community type that described tree shaped model is corresponding according to the attribute information of node creates, and a kind of nodal community type of each layer of correspondence of described tree shaped model;
Search unit, for the storage space positional information according to described any node, from the level of the described tree shaped model corresponding to described storage space positional information, successively travel through described tree shaped model according to order from the bottom to top, search the node that linking number does not reach linking number threshold value.
7. device as claimed in claim 6, is characterized in that, described acquiring unit, specifically for:
According to the node attribute information of the described any node carried in the node checks message that any node sends, obtain the nodal community type that the node attribute information of described any node is corresponding; The nodal community type corresponding according to described any node, successively mates in the tree shaped model be pre-created; When not comprising described any node in described tree shaped model, according to the attribute information of described any node, the nodal information of described any node is stored in the respective stored space in tree shaped model, and obtains storage space positional information corresponding to described any node.
8. device as claimed in claim 7, is characterized in that, also comprise updating block, for:
When comprising described any node in described tree shaped model, upgrade the nodal information of the described any node in described tree shaped model.
9. the device as described in any one of claim 6-8, is characterized in that, also comprises creating unit, for:
Type division is carried out to the attribute information of any node, obtains multiple different types of nodal community type, wherein, the corresponding attribute type rank of any one nodal community type; The attribute type rank order from high to low corresponding according to each nodal community type, creates every one deck of tree shaped model successively, makes the equal corresponding a kind of nodal community type of each layer of described tree shaped model; Wherein, using the ground floor of highest-ranking for described attribute type nodal community type as described tree shaped model.
10. device as claimed in claim 9, is characterized in that, described acquiring unit, specifically for:
After the nodal information of each node described being stored in the respective stored space in described tree shaped model, obtaining storage space positional information corresponding to each node respectively and store.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310596519.6A CN104657385A (en) | 2013-11-22 | 2013-11-22 | Search method and device of node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310596519.6A CN104657385A (en) | 2013-11-22 | 2013-11-22 | Search method and device of node |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104657385A true CN104657385A (en) | 2015-05-27 |
Family
ID=53248531
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310596519.6A Pending CN104657385A (en) | 2013-11-22 | 2013-11-22 | Search method and device of node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104657385A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107622057A (en) * | 2016-07-13 | 2018-01-23 | 阿里巴巴集团控股有限公司 | A kind of method and apparatus of lookup task |
| CN108121500A (en) * | 2016-11-30 | 2018-06-05 | 深圳市中兴微电子技术有限公司 | The access method and device of a kind of data |
| CN108427767A (en) * | 2018-03-28 | 2018-08-21 | 广州市创新互联网教育研究院 | A kind of correlating method of knowledget opic and resource file |
| CN109726203A (en) * | 2018-12-20 | 2019-05-07 | 四川新网银行股份有限公司 | A kind of date storage method of reconstruct image |
| CN111324806A (en) * | 2018-12-14 | 2020-06-23 | 阿里巴巴集团控股有限公司 | Structured template updating method and device and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1953413A (en) * | 2006-09-13 | 2007-04-25 | 华中科技大学 | An organization method for tree network of control stream in the stream media living broadcast system |
| CN101018172A (en) * | 2007-02-09 | 2007-08-15 | 浪潮电子信息产业股份有限公司 | A method for optimizing the P2P transfer in the MAN |
| CN103037018A (en) * | 2012-12-31 | 2013-04-10 | 乐视网信息技术（北京）股份有限公司 | P2P node selecting method |
| CN103037016A (en) * | 2012-12-31 | 2013-04-10 | 乐视网信息技术（北京）股份有限公司 | P2P node selecting system |
-
2013
- 2013-11-22 CN CN201310596519.6A patent/CN104657385A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1953413A (en) * | 2006-09-13 | 2007-04-25 | 华中科技大学 | An organization method for tree network of control stream in the stream media living broadcast system |
| CN101018172A (en) * | 2007-02-09 | 2007-08-15 | 浪潮电子信息产业股份有限公司 | A method for optimizing the P2P transfer in the MAN |
| CN103037018A (en) * | 2012-12-31 | 2013-04-10 | 乐视网信息技术（北京）股份有限公司 | P2P node selecting method |
| CN103037016A (en) * | 2012-12-31 | 2013-04-10 | 乐视网信息技术（北京）股份有限公司 | P2P node selecting system |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107622057A (en) * | 2016-07-13 | 2018-01-23 | 阿里巴巴集团控股有限公司 | A kind of method and apparatus of lookup task |
| CN108121500A (en) * | 2016-11-30 | 2018-06-05 | 深圳市中兴微电子技术有限公司 | The access method and device of a kind of data |
| CN108427767A (en) * | 2018-03-28 | 2018-08-21 | 广州市创新互联网教育研究院 | A kind of correlating method of knowledget opic and resource file |
| CN111324806A (en) * | 2018-12-14 | 2020-06-23 | 阿里巴巴集团控股有限公司 | Structured template updating method and device and storage medium |
| CN109726203A (en) * | 2018-12-20 | 2019-05-07 | 四川新网银行股份有限公司 | A kind of date storage method of reconstruct image |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9130971B2 (en) | Site-based search affinity | |
| US9124612B2 (en) | Multi-site clustering | |
| CN106227800B (en) | Storage method and management system for highly-associated big data | |
| US9052938B1 (en) | Correlation and associated display of virtual machine data and storage performance data | |
| CN111258978B (en) | Data storage method | |
| US9934324B2 (en) | Index structure to accelerate graph traversal | |
| CN113986873B (en) | Method for processing, storing and sharing data modeling of mass Internet of things | |
| CN106484820B (en) | Renaming method, access method and device | |
| CN104657385A (en) | Search method and device of node | |
| CN103561133A (en) | IP address ownership information indexing and fast querying method | |
| US11630803B2 (en) | Persistent indexing and free space management for flat directory | |
| CN110737663B (en) | Data storage method, device, equipment and storage medium | |
| CN104216962A (en) | Mass network management data indexing design method based on HBase | |
| CN102932160A (en) | Resource management system | |
| CN103678550A (en) | Mass data real-time query method based on dynamic index structure | |
| CN101184091A (en) | Method and apparatus for ascertaining similar documents | |
| CN109871470B (en) | Power grid equipment data labeling management system and implementation method | |
| CN103823846A (en) | Method for storing and querying big data on basis of graph theories | |
| CN104298669A (en) | Person geographic information mining model based on social network | |
| CN103034650A (en) | System and method for processing data | |
| KR101955376B1 (en) | Processing method for a relational query in distributed stream processing engine based on shared-nothing architecture, recording medium and device for performing the method | |
| CN102724301B (en) | Cloud database system and method and equipment for reading and writing cloud data | |
| CN105068828A (en) | Navigation data upgrading method and apparatus | |
| CN110716933B (en) | Novel urban rail train big data-oriented high-flexibility distributed index method | |
| CN105843809A (en) | Data processing method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20151223 Address after: Room six, building 19, building 68, No. 100089 South Road, Haidian District, Beijing Applicant after: LETV CLOUD COMPUTING CO., LTD. Address before: Room six, building 19, building 68, No. 100089 South Road, Haidian District, Beijing Applicant before: LeTV Information Technology (Beijing) Co., Ltd. |
|
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20150527 |
|
| RJ01 | Rejection of invention patent application after publication |