CN103077229B - Groups of users matching process and system - Google Patents
Groups of users matching process and system Download PDFInfo
- Publication number
- CN103077229B CN103077229B CN201310002585.6A CN201310002585A CN103077229B CN 103077229 B CN103077229 B CN 103077229B CN 201310002585 A CN201310002585 A CN 201310002585A CN 103077229 B CN103077229 B CN 103077229B
- Authority
- CN
- China
- Prior art keywords
- groups
- file
- users
- user
- cryptographic hash
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Storage Device Security (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention provides a kind of groups of users matching system.The file set up mapping relations of this system by user each in groups of users and groups of users is uploaded, the cryptographic hash of the file cryptographic hash of current for the user file uploaded uploaded with each user compares to find out the groups of users of mating with the user of current upload file, the cryptographic hash of All Files user uploaded is compared and is thought that all users of upload file match groups of users, ensure that groups of users quick, accurately, safely mate.The present invention also provides a kind of groups of users matching process.<!--1-->
Description
Technical field
The present invention relates to a kind of Data Matching technology, particularly a kind of groups of users matching process and system.
Background technology
Along with the rise in Web2.0 epoch, increasing interactive function is fused to various with in the online service website of social functions, and wherein groups of users is exactly one of function.
So-called groups of users, will have the population of same or similar hobby or feature to carrying out together chatting and the platform exchanged exactly.Groups of users be have identical hobby friend flock together composition gathering ground, more focus on everybody can better exchange, can be the friend be familiar with in your actual life in groups of users, also can be the stranger had never seen, everybody interested topic open to discussion, exchange oneself experience gains in depth of comprehension.Groups of users is also the cradle of various topic, and everyone can create oneself group, selects the topic that yourself likes.Meanwhile, the value that groups of users can bring to user is wherein huge, such as, when the user in groups of users has had problem, then can play the strength of colony, absorbs all the useful ideas and solves Problems existing.
Existing documents programme is: when user knows particular user group, selects the groups of users that will add according to the judgement of oneself.But, do not know to have particular user group user and be applicable to adding fashionable, being difficult to know that what groups of users is applicable to oneself and by what approach goes to add this kind of groups of users.
Summary of the invention
A fundamental purpose of the present invention is to provide a kind of groups of users matching process, the user thinking current upload file for user fast, accurately, match user group safely.
In addition, the present invention also provides a kind of groups of users matching system, the user thinking current upload file for user fast, accurately, match user group safely.
Another fundamental purpose of the present invention is to provide a kind of groups of users matching process, think all users of upload file fast, accurately, match user group safely.
In addition, the present invention also provides a kind of groups of users matching system, think all users of upload file fast, accurately, match user group safely.
A kind of groups of users matching process, the method comprising the steps of: file set up mapping relations user each in groups of users and groups of users uploaded; Obtain the cryptographic hash of the current file uploaded of user; The cryptographic hash of acquisition and the cryptographic hash of file that maps with each groups of users are compared; Identical file whether is had to be stored in file reception end according to the analysis of cryptographic hash comparison result; When there being identical file to be stored in file reception end, match the user that the groups of users mapped with the same file found out is supplied to current upload file.
Preferably, the method also comprises: detect and whether the user analyzing current upload file selects to add the groups of users matched; When the user of current upload file selects to add the groups of users matched, the user authorizing current upload file accesses the authority of the groups of users matched the user of current upload file to be added the groups of users matched.
A kind of groups of users matching system, this system comprises: mapping relations set up module, for file set up mapping relations user each in groups of users and groups of users uploaded; Cryptographic hash computing module, for obtaining the cryptographic hash of the current file uploaded of user; Groups of users matching module, for the cryptographic hash of acquisition and the cryptographic hash of file that maps with each groups of users are compared, identical file whether is had to be stored in file reception end according to the analysis of cryptographic hash comparison result, when there being identical file to be stored in file reception end, match the user that the groups of users mapped with the same file found out is supplied to current upload file.
Preferably, described groups of users matching module also for: to detect and whether the user analyzing current upload file selects to add the groups of users matched; When the user of current upload file selects to add the groups of users matched, the user authorizing current upload file accesses the authority of the groups of users matched the user of current upload file to be added the groups of users matched.
A kind of groups of users matching process, the method comprising the steps of: file set up mapping relations user each in groups of users and groups of users uploaded; Obtain the cryptographic hash of the All Files that user uploads; Compare in the cryptographic hash obtained; Identical file whether is had to be stored in file reception end according to the analysis of cryptographic hash comparison result; When there being identical file to be stored in file reception end, matching the groups of users mapped with the same file found out and being supplied to and uploading this same file but the user also not adding the groups of users matched.
Preferably, the method also comprises: detect and analyze and upload this same file but whether the user also not adding the groups of users matched selects to add the groups of users matched; Upload this same file but also do not add the groups of users matched user select add the groups of users matched time, authorize and upload this same file but the user also not adding the groups of users matched accesses the authority of the groups of users matched, so that will this same file be uploaded but the user also not adding the groups of users matched adds the groups of users matched.
A kind of groups of users matching system, this system comprises: mapping relations set up module, for file set up mapping relations user each in groups of users and groups of users uploaded; Cryptographic hash computing module, for obtaining the cryptographic hash of the All Files that user uploads; Groups of users matching module, for comparing in the cryptographic hash obtained, identical file whether is had to be stored in file reception end according to the analysis of cryptographic hash comparison result, when there being identical file to be stored in file reception end, matching the groups of users mapped with the same file found out and being supplied to and uploading this same file but the user also not adding the groups of users matched.
Preferably, described groups of users matching module also for: detect and analyze and upload this same file but whether the user also not adding the groups of users matched selects to add the groups of users matched; Upload this same file but also do not add the groups of users matched user select add the groups of users matched time, authorize and upload this same file but the user also not adding the groups of users matched accesses the authority of the groups of users matched, so that will this same file be uploaded but the user also not adding the groups of users matched adds the groups of users matched.
Compare prior art, the file set up mapping relations of the present invention by user each in groups of users and groups of users is uploaded, the cryptographic hash of the file cryptographic hash of current for the user file uploaded uploaded with each user compares to find out the groups of users of mating with the user of current upload file, the cryptographic hash of All Files user uploaded is compared and is thought that all users of upload file match groups of users, ensure that groups of users quick, accurately, safely mate.
Accompanying drawing explanation
Fig. 1 is the running environment figure that the present invention realizes the server preferred embodiment of groups of users coupling.
Fig. 2 is the example of the groups of users that in Fig. 1, server is set up.
Fig. 3 is the hardware structure figure of server preferred embodiment in Fig. 1.
Fig. 4 is the functional block diagram of groups of users matching system preferred embodiment in Fig. 2.
Fig. 5 is the concrete implementing procedure figure of a groups of users matching process of the present invention preferred embodiment.
Fig. 6 is the concrete implementing procedure figure of another preferred embodiment of groups of users matching process of the present invention.
The realization of the object of the invention, functional characteristics and advantage will in conjunction with the embodiments, are described further with reference to accompanying drawing.
Embodiment
Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.
As shown in Figure 1, the running environment figure of the server preferred embodiment of groups of users coupling is realized for the present invention.This server 1 passes through in network 2 and at least one terminal 3(figure for 3) communicate to connect.This server 1 is for setting up groups of users, wherein, the user that each groups of users is liked by special interests forms, in network significance, described user refers to the identification information of the user of meter terminal 3 (such as, member system on ordinary meaning, described user refers to account and/or the password of the user of meter terminal 3).
In the present embodiment, this server 1 also stores end 4 communication linkage with at least one, store the file that end 4 is uploaded for storage terminal 3, server 1 is file reception end with storing end 4, and the file of reception is also stored into storage end 4 by the file that server 1 receiving terminal 3 is uploaded; In other embodiments of the invention, the file that described terminal 3 is uploaded is stored in server 1, and server 1 is file reception end, and server 1 receives the file that also storage terminal 3 is uploaded.
Described groups of users, such as, shown in Fig. 2, reporter group 221, photography group 222, focus discussion group 223 etc.The user that each groups of users is liked by special interests forms, such as, the user that reporter group 221 comprises be " reporter A ", " reporter B ", " reporter C ",,, (not shown).
Described network 2 can be internet, mobile radio communication or other any suitable communication networks.Described terminal 3 can be mobile phone, computing machine, panel computer, personal digital assistant (PersonalDigitalAssistant, PDA) or other any suitable data processing equipments.
As shown in Figure 3, be the hardware structure figure of server preferred embodiment in Fig. 1.This server 1 comprises groups of users matching system 11, processing unit 10 and storage unit 13.
This storage unit 13, for the service data of file, this groups of users matching system 11 and this groups of users matching system 11 that user in each groups of users uploads.
This processing unit 10, for calling and performing this groups of users matching system 11, with the file uploaded according to user for user matches corresponding groups of users.
As shown in Figure 4, be the functional block diagram of groups of users matching system preferred embodiment in Fig. 2.This groups of users matching system 11 comprises mapping relations and sets up module 110, cryptographic hash computing module 111 and groups of users matching module 112.
These mapping relations set up module 110, for file set up mapping relations user each in groups of users and groups of users uploaded.Such as, the file that file, " reporter C " that the file " reporter A " uploaded, " reporter B " are uploaded upload,,,, set up mapping relations with groups of users " reporter group 221 ".
Below in order to better describe the function of cryptographic hash computing module 111 and groups of users matching module 112 in this groups of users matching system 11, set forth respectively with two embodiments below:
Embodiment one:
This groups of users matching system 11 is user's match user group according to the current file uploaded of user.
This cryptographic hash computing module 111, for obtaining the cryptographic hash of the current file uploaded of user.Described cryptographic hash can be such as MD5 value and/or SHA1 value.If when the current file uploaded of user has had a corresponding cryptographic hash, then this cryptographic hash computing module 111 extracting directly has gone out the cryptographic hash of the current upload file of user; If when the current file uploaded of user does not have a corresponding cryptographic hash, then this cryptographic hash computing module 111 directly calculates the cryptographic hash of the current upload file of user.
It should be noted that, the mode that this cryptographic hash computing module 111 calculates the cryptographic hash of the file that user uploads has multiple, sets forth the cryptographic hash of this cryptographic hash computing module 111 how calculation document below with two examples:
Example one: the cryptographic hash of calculation document full content.It is emphasized that the cryptographic hash computing velocity of this embodiment is slower relative to following example two when calculating relatively large file.
Example two: whether the size of Study document is greater than pre-set threshold value; When the size of file is greater than pre-set threshold value, from file, extract content according to the rule preset, and the content calculating cryptographic hash for extracting; When the size of file is less than or equal to pre-set threshold value, for file full content calculates cryptographic hash.
Described default rule can be: the content of file is divided into more than two deciles (such as, being divided into 5 deciles); Afterbody in the content of each decile extracts content and the size sum of all extraction contents equals the above-mentioned pre-set threshold value (content size of extraction, such as, the content size that the afterbody of the content of first decile extracts is A, the content size that the afterbody of the content of second decile extracts is B, the content size that the afterbody of the content of the 3rd decile extracts is C, the content size that the afterbody of the content of the 4th decile extracts is D, the content size that the afterbody of the content of the 5th decile extracts is E, and above-mentioned pre-set threshold value=A+B+C+D+E).
Described default rule can also be: the content of file is divided into more than two deciles (such as, being divided into 5 deciles), afterbody in the content of last decile extracts content, stem in other deciles extracts content, and the size sum of all extraction contents equals the above-mentioned pre-set threshold value (content size of extraction, such as, the content size that the stem of the content of first decile is extracted is A, the content size that the stem of the content of second decile is extracted is B, the content size that the stem of the content of the 3rd decile is extracted is C, the content size that the stem of the content of the 4th decile is extracted is D, the content size that the afterbody of the content of the 5th decile extracts is E, and above-mentioned pre-set threshold value=A+B+C+D+E).
Described default rule can also be other any suitable contents extraction rules, two concrete examples of the described default rule more than provided are non exhaustive row, and those skilled in the art can expect other any suitable equivalent contents extraction rules easily with reference to the example of described default rule.
This groups of users matching module 112, for the cryptographic hash of acquisition and the cryptographic hash of file that maps with each groups of users are compared, identical file whether is had to be stored in file reception end according to the analysis of cryptographic hash comparison result, when there being identical file to be stored in file reception end, match the user that the groups of users mapped with the same file found out is supplied to current upload file.
In order to reach a better technique effect further, preferably, this groups of users matching module 112 is also for detect and whether the user analyzing current upload file selects to add the groups of users matched, when the user of current upload file selects to add the groups of users matched, the user authorizing current upload file accesses the authority of the groups of users matched the user of current upload file to be added the groups of users matched.In this preferred version, this groups of users matching module 112 provides options to select whether add the groups of users matched for user.
Embodiment two:
This groups of users matching system 11 is all user's match user groups of upload file according to the All Files that user uploads.
This cryptographic hash computing module 111, for obtaining the cryptographic hash of the All Files that user uploads.Described cryptographic hash can be such as MD5 value and/or SHA1 value.If when the file that user uploads has had a corresponding cryptographic hash, then this cryptographic hash computing module 111 extracting directly has gone out the cryptographic hash of user's upload file; If when the file having user to upload does not have a corresponding cryptographic hash, then this cryptographic hash computing module 111 directly calculates the cryptographic hash of the upload file not having corresponding cryptographic hash.
It should be noted that, the mode that this cryptographic hash computing module 111 calculates the cryptographic hash of the file that user uploads has multiple, sets forth the cryptographic hash of this cryptographic hash computing module 111 how calculation document below with two examples:
Example one: the cryptographic hash of calculation document full content.It is emphasized that the cryptographic hash computing velocity of this embodiment is slower relative to following example two when calculating relatively large file.
Example two: whether the size of Study document is greater than pre-set threshold value; When the size of file is greater than pre-set threshold value, from file, extract content according to the rule preset, and the content calculating cryptographic hash for extracting; When the size of file is less than or equal to pre-set threshold value, for file full content calculates cryptographic hash.
Described default rule can be: the content of file is divided into more than two deciles (such as, being divided into 5 deciles); Afterbody in the content of each decile extracts content and the size sum of all extraction contents equals the above-mentioned pre-set threshold value (content size of extraction, such as, the content size that the afterbody of the content of first decile extracts is A, the content size that the afterbody of the content of second decile extracts is B, the content size that the afterbody of the content of the 3rd decile extracts is C, the content size that the afterbody of the content of the 4th decile extracts is D, the content size that the afterbody of the content of the 5th decile extracts is E, and above-mentioned pre-set threshold value=A+B+C+D+E).
Described default rule can also be: the content of file is divided into more than two deciles (such as, being divided into 5 deciles), afterbody in the content of last decile extracts content, stem in other deciles extracts content, and the size sum of all extraction contents equals the above-mentioned pre-set threshold value (content size of extraction, such as, the content size that the stem of the content of first decile is extracted is A, the content size that the stem of the content of second decile is extracted is B, the content size that the stem of the content of the 3rd decile is extracted is C, the content size that the stem of the content of the 4th decile is extracted is D, the content size that the afterbody of the content of the 5th decile extracts is E, and above-mentioned pre-set threshold value=A+B+C+D+E).
Described default rule can also be other any suitable contents extraction rules, two concrete examples of the described default rule more than provided are non exhaustive row, and those skilled in the art can expect other any suitable equivalent contents extraction rules easily with reference to the example of described default rule.
This groups of users matching module 112, for comparing in the cryptographic hash obtained, identical file whether is had to be stored in file reception end according to the analysis of cryptographic hash comparison result, when there being identical file to be stored in file reception end, matching the groups of users mapped with the same file found out and being supplied to and uploading this same file but the user also not adding the groups of users matched.
In order to reach a better technique effect further, preferably, this groups of users matching module 112 also uploads this same file but whether the user also not adding the groups of users matched selects to add the groups of users matched for detecting and analyzing, upload this same file but also do not add the groups of users matched user select add the groups of users matched time, authorize and upload this same file but the user also not adding the groups of users matched accesses the authority of the groups of users matched, so that will this same file be uploaded but the user also not adding the groups of users matched adds the groups of users matched.In this preferred version, this groups of users matching module 112 provides options to select whether add the groups of users matched for user.
As shown in Figure 5, be the concrete implementing procedure figure of a groups of users matching process of the present invention preferred embodiment.
It is emphasized that: process flow diagram shown in Fig. 5 is only a preferred embodiment, those skilled in the art is when knowing, any embodiment built around inventive concept should not depart from the scope contained in following technical scheme:
By the file set up mapping relations that user each in groups of users and groups of users uploads; Obtain the cryptographic hash of the current file uploaded of user; The cryptographic hash of acquisition and the cryptographic hash of file that maps with each groups of users are compared; Identical file whether is had to be stored in file reception end according to the analysis of cryptographic hash comparison result; When there being identical file to be stored in file reception end, match the user that the groups of users mapped with the same file found out is supplied to current upload file.
It is below the user's match user group being progressively embodied as current upload file in conjunction with the present embodiment.
Step S10, these mapping relations set up the file set up mapping relations that user each in groups of users and groups of users uploads by module 110.Such as, the file that file, " reporter C " that the file " reporter A " uploaded, " reporter B " are uploaded upload,,,, set up mapping relations with groups of users " reporter group 221 ".
Step S11, this cryptographic hash computing module 111 obtains the cryptographic hash of the current file uploaded of user.
Step S13, the cryptographic hash of acquisition and the cryptographic hash of file that maps with each groups of users are compared by this groups of users matching module 112.
Step S15, whether this groups of users matching module 112 has identical file to be stored in file reception end according to the analysis of cryptographic hash comparison result.
When there being identical file to be stored in file reception end, proceed to and perform following step S16, or when not having identical file to be stored in file reception end, flow process terminating.
Step S16, this groups of users matching module 112 matches the user that the groups of users mapped with the same file found out is supplied to current upload file.
Step S17, this groups of users matching module 112 is detected and whether the user analyzing current upload file selects to add the groups of users matched.
When the user of current upload file selects to add the groups of users matched, proceed to and perform following step S18, or when the user of current upload file does not add the groups of users matched, flow process terminates.
Step S18, the user that this groups of users matching module 112 authorizes current upload file accesses the authority of the groups of users matched the user of current upload file to be added the groups of users matched.
As shown in Figure 6, be the concrete implementing procedure figure of another preferred embodiment of groups of users matching process of the present invention.
It is emphasized that: process flow diagram shown in Fig. 6 is only a preferred embodiment, those skilled in the art is when knowing, any embodiment built around inventive concept should not depart from the scope contained in following technical scheme:
By the file set up mapping relations that user each in groups of users and groups of users uploads; Obtain the cryptographic hash of the All Files that user uploads; Compare in the cryptographic hash obtained; Identical file whether is had to be stored in file reception end according to the analysis of cryptographic hash comparison result; When there being identical file to be stored in file reception end, matching the groups of users mapped with the same file found out and being supplied to and uploading this same file but the user also not adding the groups of users matched.
Below all user's match user groups being progressively embodied as upload file in conjunction with the present embodiment.
Step S20, these mapping relations set up the file set up mapping relations that user each in groups of users and groups of users uploads by module 110.Such as, the file that file, " reporter C " that the file " reporter A " uploaded, " reporter B " are uploaded upload,,,, set up mapping relations with groups of users " reporter group 221 ".
Step S21, this cryptographic hash computing module 111 obtains the cryptographic hash of the All Files that user uploads.
Step S23, this groups of users matching module 112 is compared in the cryptographic hash obtained.
Step S25, whether this groups of users matching module 112 has identical file to be stored in file reception end according to the analysis of cryptographic hash comparison result.
When there being identical file to be stored in file reception end, proceed to and perform following step S26, or when not having identical file to be stored in file reception end, flow process terminating.
Step S26, this groups of users matching module 112 matches the groups of users mapped with the same file found out and is supplied to and uploads this same file but the user also not adding the groups of users matched.
Step S27, this groups of users matching module 112 is detected and is analyzed and uploads this same file but whether the user also not adding the groups of users matched selects to add the groups of users matched.
Upload this same file but also do not add the groups of users matched user select add the groups of users matched time, proceed to and perform following step S28, or, when uploading this same file but the user also not adding the groups of users matched does not add the groups of users matched, flow process terminates.
Step S28, this groups of users matching module 112 is authorized and is uploaded this same file but the user also not adding the groups of users matched accesses the authority of the groups of users matched, will upload this same file but the user also not adding the groups of users matched adds the groups of users matched.
These are only the preferred embodiments of the present invention; not thereby the scope of the claims of the present invention is limited; every utilize instructions of the present invention and accompanying drawing content to do equivalent structure or equivalent flow process conversion; or be directly or indirectly used in other relevant technical fields, be all in like manner included in scope of patent protection of the present invention.
Claims (8)
1. a groups of users matching process, is characterised in that, the method comprising the steps of:
By the file set up mapping relations that user each in groups of users and groups of users uploads;
Obtain the cryptographic hash of the current file uploaded of user;
The cryptographic hash of acquisition and the cryptographic hash of file that maps with each groups of users are compared;
Identical file whether is had to be stored in file reception end according to the analysis of cryptographic hash comparison result;
When there being identical file to be stored in file reception end, match the user that the groups of users mapped with the same file found out is supplied to current upload file;
The step of the cryptographic hash of the current file uploaded of described acquisition user comprises: when the current file uploaded of user has had corresponding cryptographic hash, obtain the cryptographic hash of the current upload file of user;
When the current file uploaded of user does not have corresponding cryptographic hash, whether the size of Study document is greater than pre-set threshold value; When the size of file is greater than pre-set threshold value, from file, extract content according to the rule preset, and the content calculating cryptographic hash for extracting; When the size of file is less than or equal to pre-set threshold value, for file full content calculates cryptographic hash.
2. groups of users matching process as claimed in claim 1, it is characterized in that, the method also comprises:
To detect and whether the user analyzing current upload file selects to add the groups of users matched;
When the user of current upload file selects to add the groups of users matched, the user authorizing current upload file accesses the authority of the groups of users matched the user of current upload file to be added the groups of users matched.
3. a groups of users matching system, is characterised in that, this system comprises:
Mapping relations set up module, for file set up mapping relations user each in groups of users and groups of users uploaded;
Cryptographic hash computing module, for obtaining the cryptographic hash of the current file uploaded of user;
Groups of users matching module, for the cryptographic hash of acquisition and the cryptographic hash of file that maps with each groups of users are compared, identical file whether is had to be stored in file reception end according to the analysis of cryptographic hash comparison result, when there being identical file to be stored in file reception end, match the user that the groups of users mapped with the same file found out is supplied to current upload file;
Described cryptographic hash computing module is also for there being a corresponding cryptographic hash during at the current file uploaded of user, obtain the cryptographic hash of the current upload file of user;
Described cryptographic hash computing module is not also for having a corresponding cryptographic hash during at the current file uploaded of user, whether the size of Study document is greater than pre-set threshold value; When the size of file is greater than pre-set threshold value, from file, extract content according to the rule preset, and the content calculating cryptographic hash for extracting; When the size of file is less than or equal to pre-set threshold value, for file full content calculates cryptographic hash.
4. groups of users matching system as claimed in claim 3, is characterized in that, described groups of users matching module also for:
To detect and whether the user analyzing current upload file selects to add the groups of users matched;
When the user of current upload file selects to add the groups of users matched, the user authorizing current upload file accesses the authority of the groups of users matched the user of current upload file to be added the groups of users matched.
5. a groups of users matching process, is characterised in that, the method comprising the steps of:
By the file set up mapping relations that user each in groups of users and groups of users uploads;
Obtain the cryptographic hash of the All Files that user uploads;
Compare in the cryptographic hash obtained;
Identical file whether is had to be stored in file reception end according to the analysis of cryptographic hash comparison result;
When there being identical file to be stored in file reception end, matching the groups of users mapped with the same file found out and being supplied to and uploading this same file but the user also not adding the groups of users matched.
6. groups of users matching process as claimed in claim 5, it is characterized in that, the method also comprises:
Detect and analyze and upload this same file but whether the user also not adding the groups of users matched selects to add the groups of users matched;
Upload this same file but also do not add the groups of users matched user select add the groups of users matched time, authorize and upload this same file but the user also not adding the groups of users matched accesses the authority of the groups of users matched, so that will this same file be uploaded but the user also not adding the groups of users matched adds the groups of users matched.
7. a groups of users matching system, is characterised in that, this system comprises:
Mapping relations set up module, for file set up mapping relations user each in groups of users and groups of users uploaded;
Cryptographic hash computing module, for obtaining the cryptographic hash of the All Files that user uploads;
Groups of users matching module, for comparing in the cryptographic hash obtained, identical file whether is had to be stored in file reception end according to the analysis of cryptographic hash comparison result, when there being identical file to be stored in file reception end, matching the groups of users mapped with the same file found out and being supplied to and uploading this same file but the user also not adding the groups of users matched.
8. groups of users matching system as claimed in claim 7, is characterized in that, described groups of users matching module also for:
Detect and analyze and upload this same file but whether the user also not adding the groups of users matched selects to add the groups of users matched;
Upload this same file but also do not add the groups of users matched user select add the groups of users matched time, authorize and upload this same file but the user also not adding the groups of users matched accesses the authority of the groups of users matched, so that will this same file be uploaded but the user also not adding the groups of users matched adds the groups of users matched.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310002585.6A CN103077229B (en) | 2013-01-04 | 2013-01-04 | Groups of users matching process and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310002585.6A CN103077229B (en) | 2013-01-04 | 2013-01-04 | Groups of users matching process and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103077229A CN103077229A (en) | 2013-05-01 |
| CN103077229B true CN103077229B (en) | 2016-04-06 |
Family
ID=48153759
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310002585.6A Active CN103077229B (en) | 2013-01-04 | 2013-01-04 | Groups of users matching process and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103077229B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103248711B (en) * | 2013-05-23 | 2016-08-24 | 华为技术有限公司 | A kind of method of files passe and server |
| CN103346897B (en) * | 2013-06-26 | 2016-12-07 | 腾讯科技（北京）有限公司 | A kind of group's Adding Way and relevant device, system |
| CN106407462A (en) * | 2016-10-10 | 2017-02-15 | 北京恒华伟业科技股份有限公司 | File processing method and system |
| CN109427016A (en) * | 2017-08-23 | 2019-03-05 | 知识产权出版社有限责任公司 | Community construction method and device and storage medium, processor |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6615225B1 (en) * | 2000-04-27 | 2003-09-02 | International Business Machines Corporation | System and method for relating files in a distributed data storage environment |
| CN101105795A (en) * | 2006-10-27 | 2008-01-16 | 北京搜神网络技术有限责任公司 | Network behavior based personalized recommendation method and system |
| CN101431485A (en) * | 2008-12-31 | 2009-05-13 | 深圳市迅雷网络技术有限公司 | Method and system for automatically recommending internet information |
| CN101909018A (en) * | 2009-06-05 | 2010-12-08 | 潘晓丰 | Method and system for returning to instant messaging group according to webpage browsed by user |
| CN102325172A (en) * | 2011-08-30 | 2012-01-18 | 中兴通讯股份有限公司 | Method for sharing data among mobile terminals, system and control server |
-
2013
- 2013-01-04 CN CN201310002585.6A patent/CN103077229B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6615225B1 (en) * | 2000-04-27 | 2003-09-02 | International Business Machines Corporation | System and method for relating files in a distributed data storage environment |
| CN101105795A (en) * | 2006-10-27 | 2008-01-16 | 北京搜神网络技术有限责任公司 | Network behavior based personalized recommendation method and system |
| CN101431485A (en) * | 2008-12-31 | 2009-05-13 | 深圳市迅雷网络技术有限公司 | Method and system for automatically recommending internet information |
| CN101909018A (en) * | 2009-06-05 | 2010-12-08 | 潘晓丰 | Method and system for returning to instant messaging group according to webpage browsed by user |
| CN102325172A (en) * | 2011-08-30 | 2012-01-18 | 中兴通讯股份有限公司 | Method for sharing data among mobile terminals, system and control server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103077229A (en) | 2013-05-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103166917B (en) | Network equipment personal identification method and system | |
| CN105282126B (en) | Login authentication method, terminal and server | |
| CN103368917B (en) | A kind of risk control method and system of network virtual user | |
| KR101764696B1 (en) | Method and System for determination of social network hot topic in consideration of user’s influence and time | |
| CN102186173B (en) | Identity authentication method and system | |
| CN103077229B (en) | Groups of users matching process and system | |
| CN104636371A (en) | Information recommendation method and device | |
| CN103095824B (en) | Files passe control method and system | |
| WO2011008145A1 (en) | Providing content by using a social network | |
| CN103108033B (en) | File uploading method and system | |
| CN106534268B (en) | Data sharing method and device | |
| US20160150007A1 (en) | Optimizing resource downloads or streams using a collection of trusted network connected endpoints | |
| CN104010035A (en) | Method and system for application program distribution | |
| CN103109273A (en) | Method and apparatus for managing data | |
| CN107733786A (en) | A kind of method and apparatus of friend recommendation | |
| US20180107707A1 (en) | Preventing abuse in content sharing system | |
| EP2725538B1 (en) | Privacy protected dynamic clustering of end users | |
| CN103841157A (en) | File sharing device and method | |
| JP6683681B2 (en) | Determining the contribution of various user interactions to conversions | |
| CN104978523A (en) | Malicious sample capture method and system based on network hot word recognition | |
| CN105183734A (en) | Method and device for image file sharing | |
| CN110929129A (en) | Information detection method, equipment and machine-readable storage medium | |
| CN110401626B (en) | Hacker attack grading detection method and device | |
| KR101928822B1 (en) | System and method for computing a user's trust value of unknown device in IoT | |
| CN105141664A (en) | Method and equipment for recommending friends to network reading user |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C56 | Change in the name or address of the patentee | ||
| CP03 | Change of name, title or address |
Address after: 523000 Guangdong Province, Dongguan Songshan Lake high tech Industrial Development Zone No. 17 Keyuan pine floor 6 floor Patentee after: GUANGDONG 115 TECHNOLOGY CO., LTD. Address before: 523000 Guangdong province Dongguan Songshan Lake high tech Industrial Development Zone No. 17 Keyuan pine floor 5 floor Patentee before: Guangdong 115 Technology Co., Ltd. |
|
| CP02 | Change in the address of a patent holder |
Address after: 514000 Fifth Floor, World Business Center, Meizhou City, Guangdong Province Patentee after: GUANGDONG 115 TECHNOLOGY CO., LTD. Address before: 523000 6th Floor, Building 17, Songkeyuan, Dongguan Songshan Lake Hi-tech Industrial Development Zone, Guangdong Province Patentee before: GUANGDONG 115 TECHNOLOGY CO., LTD. |
|
| CP02 | Change in the address of a patent holder |