CN103136229B - The Internet obtains the system and method for address name - Google Patents
The Internet obtains the system and method for address name Download PDFInfo
- Publication number
- CN103136229B CN103136229B CN201110380638.9A CN201110380638A CN103136229B CN 103136229 B CN103136229 B CN 103136229B CN 201110380638 A CN201110380638 A CN 201110380638A CN 103136229 B CN103136229 B CN 103136229B
- Authority
- CN
- China
- Prior art keywords
- data
- user
- screen display
- display title
- friend relation
- 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
- Information Transfer Between Computers (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention discloses the system and method obtaining address name in a kind of the Internet, it is possible to the place needed in the Internet represents address name, contributes to promoting the extension of Internet service.The system obtaining address name in the Internet provided in the embodiment of the present invention includes: data acquisition facility, it is connected with multiple data bases, for obtaining the friend relation data of user, these friend relation data being stored in the database, described friend relation data include each good friend screen display title to this user setup of user；Multiple dissection process devices, each dissection process device is connected with a data base respectively, for resolving the friend relation data in data base, counts the occurrence number of described screen display title；Name processor, is connected to described dissection process device, for merging the occurrence number of the screen display title that each dissection process device counts, will appear from maximum and more than predetermined threshold the screen display name of number of times and is referred to as the address name of described user.
Description
Technical field
The present invention relates to Internet technical field, particularly to what a kind of the Internet obtained address name be
System and method.
Background technology
Along with developing rapidly of World Wide Web industry, general the Internet project all have accumulated a large number of users
Data, such as substantial amounts of friend relation data.
But, a lot of startings the Internet projects soon all suffer from having been registered with mass users but
Being that personal information is imperfect, the especially most basic name information of user is imperfect, as in the Internet
Only a small amount of user employs the Real Name of oneself, and in the personal information of a large number of users, name field is empty
Lack state or other users are had no reference significance, thus causing needing to represent address name at one
Place does not has the data that can show, the promotion to Internet service causes difficulty.
Such as, for not registering the user of Real Name, these users establish with some any active ues
Certain friend relation, but owing to lacking name information, when other users of non-friend relation browse without
Method knows whom these users are, rethinks promotion and sets up more friend relation and be difficult to, thus cause cannot be true
Just set up the Internet service with customer relationship as driving force, even directly influence the liveness of user.
Summary of the invention
The Internet that the present invention provides obtains the system and method for address name, to solve existing interconnection
Needing the place representing address name not have at one in net can the problem of display data.
For reaching above-mentioned purpose, the embodiment of the present invention adopts the technical scheme that
Obtaining the system of address name in a kind of the Internet, this system includes:
Data acquisition facility, is connected with multiple data bases, for obtaining the friend relation data of user,
These friend relation data being stored in the database, described friend relation data include each of user
Good friend's screen display title to this user setup；
Multiple dissection process devices, each dissection process device is connected, for logarithm with a data base respectively
Resolve according to the friend relation data in storehouse, count the occurrence number of described screen display title；
Name processor, is connected to described dissection process device, for the screen counting each dissection process device
The occurrence number of aobvious title merges, and will appear from maximum and more than predetermined threshold the screen display name of number of times and is referred to as
Address name for described user.
A kind of method obtaining address name in the Internet, described method includes:
Obtain the friend relation data of user, these friend relation data are stored in multiple data base, institute
State friend relation data and include each good friend screen display title to this user setup of user；
Friend relation data in each data base are resolved respectively, counts going out of described screen display title
Occurrence number；
The occurrence number of all screen display titles counted is merged, will appear from number of times maximum and be more than
The screen display name of predetermined threshold is referred to as the address name of described user.
The embodiment of the present invention provides the benefit that:
The embodiment of the present invention utilizes existing friend relation data in the Internet, is user by user good friend
The screen display name analysis arranged is calculated the Real Name of user such that it is able to need in the Internet
Place represents address name, contributes to promoting the extension of Internet service.
The embodiment of the present invention directly utilizes existing data in the Internet, it is not necessary to third party is additionally provided number
According to, it is only necessary to carrying out data analysis and computing by multiple servers, cost is relatively low；And this programme obtains
The accuracy rate of the user's Real Name arrived is higher, is favorably improved the liveness of user, real set up with
Family relation is the Internet service of driving force.
Accompanying drawing explanation
The system structure obtaining address name in a kind of the Internet that Fig. 1 provides for the embodiment of the present invention one is shown
It is intended to；
The signal of the data in EMS memory storage organization of the dissection process device that Fig. 2 provides for the embodiment of the present invention one
Figure；
The system structure obtaining address name in a kind of the Internet that Fig. 3 provides for the embodiment of the present invention two is shown
It is intended to；
The method flow obtaining address name in a kind of the Internet that Fig. 4 provides for the embodiment of the present invention three shows
It is intended to.
Detailed description of the invention
For making the object, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing to this
Bright embodiment is described in further detail.
See Fig. 1, for a kind of the Internet that the embodiment of the present invention provides obtains the system of address name,
This system includes:
Data acquisition facility 11, is connected with multiple data bases 12, for obtaining the friend relation of user
These friend relation data are stored in described data base 12 by data, and described friend relation data include
Each good friend of the user screen display title to this user setup；
Dissection process device 13, is connected with corresponding data base 12 respectively, good in data base
Friend's relation data resolves, and counts the occurrence number of described screen display title；
Name processor 14, is connected to described dissection process device 13, for counting each dissection process device
The occurrence number of screen display title merge, will appear from that number of times is maximum and screen display name more than predetermined threshold
It is referred to as the address name of described user.
Data acquisition facility 11 can store from existing the Internet to be had on the server of user's information data
Obtain friend relation data, such as, from instant communication server, the user profile data of storage obtain
Friend's relation data (or referred to as original data source).These friend relation data include that each of user is good
Friend's screen display title (ScreenName) to this user setup, further, in friend relation data also
Can include ID (UserId) and good friend's mark (BuddyId), UserId is user in system
Unique mark, BuddyId is unique mark of good friend in system.
Owing to the information in the Internet is the hugest, and in order to ensure the accuracy of address name got,
It is also required to a number of original data source, so the present embodiment have employed multiple servers parallel processing
Working method, system is provided with multiple data base and multiple stage dissection process device.
The mode of Fragmentation is used when the original data source got is stored by data acquisition facility.
Fragmentation generally comprises two kinds of forms, and one is subregion (partitioning), and one is to replicate (replication),
To promote available rows and the performance of application.Fragmentation in the present embodiment uses partitioned storage, it is simply that refer to
Original data source is assigned in different database storage device according to certain rule, when needing to access
The location of data base is carried out according to unified rule.
Further, the friend relation data in data base 12 are stored in tables of data, in this tables of data
Every friend relation data include ID, good friend's mark and corresponding good friend's screen display name to this user
Claiming, described ID and good friend identify the major key (Primary Key) constituting tables of data, see table 1,
Show the example of a tables of data.
Table 1
| UserId | BuddyId | ScreenName |
| 10001 | 10004 | Zhang San |
| 10002 | 10005 | Li Si |
| 10003 | 10004 | Zhang San |
| ... | ... | ... |
The screen display title of user and the occurrence number of this screen display title are entered in internal memory by dissection process device 13
Row storage, concrete, use hash data structure to the screen display title of user and the occurrence number of this screen display title
Storing, the key (key) in hash data structure is ID, the value (Value) in hash data structure
Address for the occurrence number of the screen display title He this screen display title that store this user.By using Hash to tie
Structure this programme can be quickly carried out update and the search operation of data, and quickly location is to required use
User data, improves name and obtains the efficiency of operation.
The occurrence number of the screen display title of each user stored and this screen display title constitutes a node,
There is between different nodes chained list (List) structure.Data corresponding to different user are adopted in internal memory
With list structure, the data of each user can correspond to a node in chained list.Chained list is a kind of line
Property table, but by linear sequential storage data, but the next one can't be stored in each node
The pointer (Pointer) of node.Chained list is generally made up of series of nodes, and each node comprises arbitrary reality
Number of cases is according to (data fields) and one or two are for pointing to the chain of the position of bright upper/or next node
Meet (links).Chained list has various type, such as single-track link table, doubly linked list and endless-chain
Table.Chained list allows the node inserting and removing on table on optional position, but does not allow random access memory.By
In storing the most in order, chained list can reach the complexity of O (1) inserting when.Use chain
List structure can overcome array linked list to need to be known a priori by the shortcoming of size of data, and list structure can be abundant
Utilize calculator memory space, it is achieved internal memory dynamically manages flexibly.
Often having processed friend relation data, dissection process device finds corresponding one group to breathe out in internal memory
Uncommon mapping, inquires screen display title, and adds 1 by the occurrence number of this screen display title.
See Fig. 2, it is shown that the schematic diagram of the data in EMS memory storage organization of dissection process device.Such as,
When the UserId of user 1 is 10004, using 10004 as the Key value in hash data structure, it is corresponding
Value point to the address of occurrence number of the storage screen display title of user 1 and this screen display title, this ground
The screen display title of the data instruction user 1 in location includes that " Zhang San " and this screen display title occur in that 2 times,
Further, the data in this address also can indicate that the screen display title of user 1 also includes " Zhang Sanfeng " and is somebody's turn to do
Screen display title occurs in that 1 time.
After the end cumulative to respective fragment data of all of dissection process device, name processor 14 is right
The occurrence number of the screen display title that each dissection process device counts merges, and will appear from number of times maximum and big
The address name of user as described in being referred to as in the screen display name of predetermined threshold (such as N).The concrete numerical value of N can
To use empirical value, it is also possible to be adjusted according to actual needs.The knot that name processor can be combined
Fruit stores in internal memory, and the storage organization of name processor memory can use knot as shown in Figure 2
Structure.
Further, after name processor obtains the Real Name of user by union operation, can be by
The Real Name of user exports to result database, or export and show and need display use in the Internet
The place of family name.This result database, for receiving user's surname of the user that name processor is exported
Name and the number of times that occurs as screen display title of this address name are also stored in tables of data, in this tables of data and also
Storage has the ID as tables of data major key.
Above-mentioned dissection process device can be realized by the accumulator with expanded function, and above-mentioned name processor can
To be realized by the combiner with expanded function, this expanded function extracts merit including, but not limited to data
Energy, data analysis function, the data storage function of support hash data structure, data statistics function etc..
The embodiment of the present invention directly utilizes existing data in the Internet, it is not necessary to third party is additionally provided number
According to, it is only necessary to carrying out data analysis and computing by multiple servers, cost is relatively low；And this programme obtains
The accuracy rate of the user's Real Name arrived is higher, is favorably improved the liveness of user, real set up with
Family relation is the Internet service of driving force.
The Internet that the embodiment of the present invention two provides obtains the system of address name, sees Fig. 3, this reality
Execute example so that system to comprise three data bases, 32, name processor 33 of 31, three dissection process devices
Illustrate with as a example by the scene of a result database 34, data acquisition facility (not shown)
The friend relation data got are stored in multiple data base, during dissection process device can within it be deposited
The result obtaining accumulation operations stores temporarily, and name processor is combined in also being able within it deposit
The result that operation obtains stores temporarily, and the result that name processor obtains after merging exports to result
In data base.Result database can within it deposit the structure of middle employing tables of data as shown in Table 1 above
Store the number of times occurred from the address name of name processor and this address name as screen display title
Dissection process device: can be served as by multiple stage high-performance server, when processing every friend relation data
Perform corresponding accumulation operations.Main use local memory uses hash data structure and list structure to combine
Mode preserves screen display title and the occurrence number thereof that certain user is arranged by good friend；Dissection process device is for it
Corresponding original data source can open a process, it is also possible to opens multiple process.
Further, the present embodiment can be supported data input and the batch processing mode of output, resolve
Processor also including, batch reads unit, is used for the data of form as shown in table 1 from each burst
Data base reads the friend relation data of predetermined bar number in a batch, reads 1000 the most every time
Bar, to reduce network I/O, saves network I/O cost.
Dissection process device is provided with resolution unit, is used for every the friend relation number read described in utilizing
ID according to, it may be judged whether the most stored have the screen display title of this user and going out of this screen display title
Occurrence number, if so, adds 1 to the occurrence number of corresponding screen display title, if it is not, to this user in internal memory
Screen display title and the occurrence number of this screen display title store, i.e. profit in the internal memory of dissection process device
The mode using hash data structure and list structure to combine with UserId increases a user data, this use newly
User data contains user by the screen display title set by good friend and occurrence number thereof.
Dissection process device is additionally provided with batch processing control unit, for judging that resolution unit is to working as
Before the friend relation data that read be disposed and associated databases there is also the good friend not added up
During relation data, instruction batch reads unit and carries out read operation next time.
In the aforesaid operations of dissection process device, should be noted that the one of the synchronization between thread and data structure
Cause property.
Accumulated result is remained stored in the local internal memory of dissection process device, until whole burst is former
Beginning data have processed.After all burst initial datas have calculated, starting to start consolidation procedure will
The result that multiple dissection process devices calculate merges operation.
Name processor: the foundation of merging is for being added the same screen display title of same user
Operation.Name processor can be served as by separate unit high-performance server, mainly by multiple stage dissection process device
Result of calculation merges.When different dissection process device accumulated results occur that same user has equally
Screen display title time result is merged, will appear from that number of times is maximum and screen display title more than predetermined threshold
As the address name of user, output is to result database afterwards, otherwise, abandons this data, to avoid
Take too much memory headroom.
Above-mentioned dissection process device can be realized by the accumulator with expanded function, and above-mentioned name processor can
To be realized by the combiner with expanded function, this expanded function extracts merit including, but not limited to data
Energy, data analysis function, the data storage function of support hash data structure, data statistics function etc..
Result database: preserve the name information of the user that name processor is exported, concrete content
Can be as shown in table 1.
Further, native system also includes granted unit, for obtaining user's at data acquisition facility
Before friend relation data, send request message to user, ask according to good friend's screen display name to this user
Claim to obtain address name, after obtaining the permission message of user, indicate described data acquisition facility to obtain and use
The friend relation data at family；Otherwise, forbid that described data acquisition facility obtains the friend relation of user.Logical
Cross this granted unit, before the Internet starting this programme obtains the system of address name, it is possible to main
Trend relative users confirms, to improve Consumer's Experience, and the legitimate interests of protection user；Or, when
When user registers in the Internet, prompt the user with and whether use this programme, arrange one as in registration web page
Tick boxes, when user selects to use this programme, starts this programme and obtains address name.
The embodiment of the present invention three also provides for a kind of method obtaining address name in the Internet, sees Fig. 4,
This programme uses the mode of a kind of parallel processing, specifically includes:
41: obtain the friend relation data of user, these friend relation data are stored in multiple data base,
Described friend relation data include each good friend screen display title to this user setup of user.Will distinguish
Initial data will be organized input to data base more.
42: the friend relation data in each data base are resolved respectively, count described screen display title
Occurrence number.The data in the most each data base are carried out accumulation process, obtain statistical result.
43: the occurrence number of all screen display titles counted is merged, will appear from number of times maximum and
Screen display name more than predetermined threshold is referred to as the address name of described user.
Further, this programme can also include step 44: by amalgamation result output to result database or
Person exports and shows position required in the Internet.
Further, friend relation data are stored in the tables of data of data base by this programme, described number
Include that ID, good friend's mark and corresponding good friend are to this user's according to every friend relation data in table
Screen display title, described ID and good friend identify the major key constituting tables of data.
Further, before union operation, by the screen display title of user counted and should in this programme
In the occurrence number stored memory of screen display title (in the internal memory of dissection process device), described internal memory uses
Hash data structure, the key (key) in hash data structure is ID, the value (Value) in hash data structure
For the address of the occurrence number of the screen display title He this screen display title that store this user, each use stored
The occurrence number of the screen display title at family and this screen display title constitutes a node, has between different nodes
List structure.
Further, this programme can also support the batch processing of data, such as, from number in step 42
The friend relation data of predetermined bar number are read, every the friend relation read described in utilization according to batch in storehouse
ID in data, it may be judged whether the most stored screen display title having this user and this screen display title
Occurrence number, if so, adds 1 to the occurrence number of corresponding screen display title, if it is not, to this use in internal memory
The screen display title at family and the occurrence number of this screen display title store；And, judging current reading
The friend relation data got are disposed and there is also the friend relation do not added up in associated databases
During data, instruction carries out read operation next time.
The embodiment of the present invention utilizes existing friend relation data in the Internet, is user by user good friend
The screen display name analysis arranged is calculated the Real Name of user such that it is able to need in the Internet
Place represents address name, contributes to promoting the extension of Internet service.
The embodiment of the present invention directly utilizes existing data in the Internet, it is not necessary to third party is additionally provided number
According to, it is only necessary to carrying out data analysis and computing by multiple servers, cost is relatively low；And this programme obtains
The accuracy rate of the user's Real Name arrived is higher, is favorably improved the liveness of user, real set up with
Family relation is the Internet service of driving force.
The embodiment of the present invention at least has the advantages that from the above mentioned
1: the initial data of calculating directly relies on data with existing, it is not necessary to user or third party provide data source；
2: the accuracy rate analyzing Real Name is higher, it is beneficial to drive user to enliven；
3: having only to can be realized by several the regular computings of high-performance server, cost is relatively low,；
4: support multiple data sources of burst, support concurrent operation, elapsed time is less；
5: support input and the batch processing of output, to save input and output I/O cost；
6: according to service needed, can be regular, a such as season calculates once, and the time is controlled, non-
The most convenient；
7: the scene of result of calculation applicable the Internet project is more, there is the feature of low-cost high-efficiency benefit；
8: operating procedure is simple, and required system administration or the workload of O&M are the least.
The foregoing is only presently preferred embodiments of the present invention, be not intended to limit the protection model of the present invention
Enclose.All any modification, equivalent substitution and improvement etc. made within the spirit and principles in the present invention, all
Comprise within the scope of the present invention.
Claims (10)
1. a Internet obtains the system of address name, it is characterised in that described system includes:
Data acquisition facility, is connected with multiple data bases, for obtaining the friend relation data of user,
These friend relation data being stored in the database, described friend relation data include each of user
Good friend's screen display title to this user setup；
Multiple dissection process devices, each dissection process device is connected, for logarithm with a data base respectively
Resolve according to the friend relation data in storehouse, count the occurrence number of described screen display title；
Name processor, is connected to described dissection process device, for the screen counting each dissection process device
The occurrence number of aobvious title merges, and will appear from maximum and more than predetermined threshold the screen display name of number of times and is referred to as
Address name for described user.
System the most according to claim 1, it is characterised in that described these friend relation data are deposited
Storage is specially in the database and with the form of tables of data, these friend relation data is stored in data base
In, every friend relation data in described tables of data include ID, good friend's mark and corresponding good friend
Screen display title to this user, described ID and good friend identify the major key constituting tables of data.
System the most according to claim 2, it is characterised in that
Described dissection process device is additionally operable in internal memory the screen display title to user and the appearance of this screen display title
Number of times stores；Concrete, use hash data structure to the screen display title of user and going out of this screen display title
Occurrence number stores, and the key key in hash data structure is ID, value Value in hash data structure
For the address of the occurrence number of the screen display title He this screen display title that store this user, each use stored
The occurrence number of the screen display title at family and this screen display title constitutes a node, has between different nodes
List structure.
System the most according to claim 3, it is characterised in that described dissection process device includes batch
Read unit, resolution unit and batch processing control unit,
Described batch reads unit, reads the friend relation data of predetermined bar number for batch from data base；
Described resolution unit, the ID in every the friend relation data read described in utilizing,
Judge whether the most stored screen display title having this user and the occurrence number of this screen display title, the most right
The occurrence number of corresponding screen display title adds 1, if it is not, screen display title and this screen to this user in internal memory
The occurrence number of aobvious title stores；
Described batch processing control unit, for judging that the resolution unit good friend to currently reading is closed
Coefficient is according to when being disposed and there is also the friend relation data do not added up in associated databases, and instruction is criticized
Amount reads unit and carries out read operation next time.
System the most according to claim 1, it is characterised in that described system also includes result data
Storehouse,
Described result database, for receiving address name and this use of the user that name processor is exported
Number of times that family name occurs as screen display title is also stored in tables of data, and in described tables of data, also storage has
ID as tables of data major key.
System the most according to claim 5, it is characterised in that described system also includes display unit,
For the address name of the user stored in result database is shown at webpage.
7. according to the system described in any one of claim 1 to 6, it is characterised in that described system is also wrapped
Include granted unit,
Described granted unit, before obtain the friend relation data of user at described data acquisition facility,
Send request message to user, ask according to good friend's screen display name acquiring address name to this user,
After obtaining the permission message of user, described data acquisition facility is indicated to obtain the friend relation data of user；
Otherwise, forbid that described data acquisition facility obtains the friend relation data of user.
8. the method obtaining address name in a Internet, it is characterised in that described method includes:
Obtain the friend relation data of user, these friend relation data are stored in multiple data base, institute
State friend relation data and include each good friend screen display title to this user setup of user；
Friend relation data in each data base are resolved respectively, counts going out of described screen display title
Occurrence number；
The occurrence number of all screen display titles counted is merged, will appear from number of times maximum and be more than
The screen display name of predetermined threshold is referred to as the address name of described user.
Method the most according to claim 8, it is characterised in that described by these friend relation data
It is stored in multiple data base to include:
Friend relation data being stored in the tables of data of data base, every good friend in described tables of data is closed
Coefficient is according to including ID, good friend's mark and corresponding good friend's screen display title to this user, described user
Mark and good friend identify the major key constituting tables of data.
Method the most according to claim 9, it is characterised in that to all screen displays counted
Before the occurrence number of title merges, described method also includes:
The occurrence number of the screen display title of the user counted He this screen display title is stored in internal memory, institute
Stating internal memory and use hash data structure, the key key in hash data structure is ID, the value in hash data structure
Value is the address of the screen display title storing this user and the occurrence number of this screen display title, is stored
The occurrence number of the screen display title of each user and this screen display title constitutes a node, different nodes it
Between there is list structure.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110380638.9A CN103136229B (en) | 2011-11-25 | 2011-11-25 | The Internet obtains the system and method for address name |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110380638.9A CN103136229B (en) | 2011-11-25 | 2011-11-25 | The Internet obtains the system and method for address name |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103136229A CN103136229A (en) | 2013-06-05 |
| CN103136229B true CN103136229B (en) | 2016-09-14 |
Family
ID=48496064
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110380638.9A Active CN103136229B (en) | 2011-11-25 | 2011-11-25 | The Internet obtains the system and method for address name |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103136229B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105574089B (en) * | 2015-12-10 | 2020-08-28 | 百度在线网络技术（北京）有限公司 | Knowledge graph generation method and device, and object comparison method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7558861B1 (en) * | 2002-10-24 | 2009-07-07 | NMS Communications Corp. | System and methods for controlling an application |
| CN102004788A (en) * | 2010-12-07 | 2011-04-06 | 北京开心人信息技术有限公司 | Method and system for intelligently positioning linkman of social networking services |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10373079B2 (en) * | 2008-12-18 | 2019-08-06 | Oracle International Corporation | Method and apparatus for generating recommendations from descriptive information |
-
2011
- 2011-11-25 CN CN201110380638.9A patent/CN103136229B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7558861B1 (en) * | 2002-10-24 | 2009-07-07 | NMS Communications Corp. | System and methods for controlling an application |
| CN102004788A (en) * | 2010-12-07 | 2011-04-06 | 北京开心人信息技术有限公司 | Method and system for intelligently positioning linkman of social networking services |
Non-Patent Citations (1)
| Title |
|---|
| "右键备注太麻烦？教你快速备注qq好友";techant;《http://www.ruancan.com/QQjiqiao/QQ-Haoyou-Beizhu.html》;20110829;文字部分第3、4段和第一幅图 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103136229A (en) | 2013-06-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106502902B (en) | Web page operational efficiency monitoring method and device | |
| CN104424229B (en) | A kind of calculation method and system that various dimensions are split | |
| CN101408877B (en) | System and method for loading tree node | |
| CN105930363A (en) | HTML5 webpage based user behavior analysis method and device | |
| CN108366096A (en) | A kind of information subscribing method, terminal and computer readable storage medium | |
| CN107688568A (en) | Acquisition method and device based on web page access behavior record | |
| CN104104717A (en) | Inputting channel data statistical method and device | |
| CN104346458B (en) | Date storage method and storage device | |
| CN108415964A (en) | Tables of data querying method, device, terminal device and storage medium | |
| CN104142975B (en) | Microblog information promotion method, device and system | |
| CN103699534B (en) | The display methods and device of data object in system directory | |
| CN105095251A (en) | Terminal automatic display method and device based on user habit | |
| CN112559513A (en) | Link data access method, device, storage medium, processor and electronic device | |
| CN102682011B (en) | Method, device and system for establishing domain description name information sheet and searching | |
| CN107346270A (en) | Method and system based on the sets cardinal calculated in real time | |
| CN106294402A (en) | The data search method of a kind of heterogeneous data source and device thereof | |
| CN105242873B (en) | The acquisition of the performance data of cloud computing system and storage method and device | |
| CN103136229B (en) | The Internet obtains the system and method for address name | |
| CN108268497A (en) | The method of data synchronization and device of relevant database | |
| CN103220379A (en) | Domain name reverse-resolution method and device | |
| WO2021082936A1 (en) | Method and apparatus for counting number of webpage visitors | |
| CN106910082A (en) | It is a kind of to transfer the method and apparatus that advertisement is pushed | |
| CN104216901B (en) | The method and system of information search | |
| CN101383738A (en) | Internet interaction affair monitoring method and system | |
| CN103077210B (en) | Cloud computing based data obtaining method and system |
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 | ||
| CP02 | Change in the address of a patent holder |
Address after: Room 818, 8 / F, 34 Haidian Street, Haidian District, Beijing 100080 Patentee after: BEIJING ULTRAPOWER SOFTWARE Co.,Ltd. Address before: 100089 Beijing city Haidian District wanquanzhuang Road No. 28 Wanliu new building 6 storey block A Room 601 Patentee before: BEIJING ULTRAPOWER SOFTWARE Co.,Ltd. |
|
| CP02 | Change in the address of a patent holder |