CN108288228B - Social network information acquisition method and device - Google Patents
Social network information acquisition method and device Download PDFInfo
- Publication number
- CN108288228B CN108288228B CN201710012904.XA CN201710012904A CN108288228B CN 108288228 B CN108288228 B CN 108288228B CN 201710012904 A CN201710012904 A CN 201710012904A CN 108288228 B CN108288228 B CN 108288228B
- Authority
- CN
- China
- Prior art keywords
- information
- account
- time
- social network
- user
- 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
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000009792 diffusion process Methods 0.000 claims description 16
- 230000008901 benefit Effects 0.000 abstract description 7
- 230000008569 process Effects 0.000 description 9
- 238000010586 diagram Methods 0.000 description 4
- 238000001914 filtration Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Computing Systems (AREA)
- Health & Medical Sciences (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a social network information acquisition method and a social network information acquisition device, wherein the method comprises the following steps: receiving a request from a user to obtain information from a social network; after receiving the request, searching at least one account having a social relationship with the user from the social network; searching the publishing time of the information published for the last times by each account in at least one account from the publishing times of the information published by a plurality of pre-stored accounts on the social network; selecting a plurality of latest release times from the searched release times according to the sequence of the searched release times; and acquiring information released by the accounts corresponding to the latest multiple release times at the latest multiple release times, and returning the information to the user. Compared with the prior art, the technical scheme of the invention has the advantages that the number of the information to be read is very small, and the information reading expense is greatly reduced.
Description
Technical Field
The invention relates to the technical field of social networks, in particular to a method and a device for acquiring social network information.
Background
In the social network service architecture, different services have different service architecture types according to the characteristics of the services. But as a summary, all architectures do not depart from two models, one is a write diffusion model and one is a read diffusion model.
The read diffusion is a common model in a Social Network service architecture, and when an account a issues a piece of information in SNS (all called Social Network Services, i.e. Social Network service) interaction, the information is only stored in a storage unit of the account a, and when other accounts such as Z need to obtain the information issued by the account a (e.g. view the dynamics of friends), the relevant information needs to be read from the storage unit of the account a. If Z has 3 buddies a, B, and C, the buddy dynamic of Z needs to be read from the storage units of a, B, and C, respectively, and during reading, it appears to spread to the entire buddy list.
Currently, based on the read diffusion model, the architecture and flow of the conventional SNS dynamic information reading are shown in fig. 1. The whole process of the primary friend SNS data pulling and displaying is as follows:
(1) the front end sends a request to the server and tries to acquire the latest 10 SNS dynamic information of all friends of the user A from the server;
(2) the server accesses the friend relation service to acquire all friends of A, and 100 friends (including A) such as A, B, C, D are assumed;
(3) the server goes into an SNS information storage service and tries to acquire all the friends of the A, SNS information stored by the server respectively, namely dynamic information of 100 friends such as the A, the B, the C and the D are accessed respectively;
(4) the server sorts the acquired information, such as the latest 10 pieces of information of A, the latest 10 pieces of information of B and the like according to time, and screens out the latest 10 pieces of dynamic information (the dynamic information may only have 5 accounts, such as A, D and the like);
(5) and the server returns the screened 10 pieces of latest dynamic information to the front end, so that the SNS dynamic information reading is completed at one time.
In the whole process, only the dynamic information of 5 accounts such as a and D may be finally combined into the latest 10 SNS dynamic information and returned to the front end, and the pulling of the other 95 accounts is completely redundant, so that it can be found how many friends (or attendees) the user a has, and how many dynamic information of friends needs to be read during reading. Therefore, the reading model has the disadvantages that when the display is read, data of a plurality of account objects need to be pulled, and the cost is heavy.
Disclosure of Invention
In view of this, the present invention provides a method and an apparatus for acquiring social network information, so as to reduce overhead occupied in the process of acquiring information when acquiring social network information for a user.
The technical scheme adopted by the invention for solving the technical problems is as follows:
according to an aspect of the present invention, there is provided a social network information acquiring method, including:
receiving a request from a user to obtain information from a social network;
after receiving the request, searching at least one account having a social relationship with the user from the social network;
searching the publishing time of the information published for the last time by each account in the at least one account from the publishing times of the information published on the social network by the plurality of pre-stored accounts;
selecting a plurality of latest release times from the searched release times according to the sequence of the searched release times;
and acquiring information issued by the accounts corresponding to the latest issuing time at the latest issuing time, and returning the information to the user.
According to another aspect of the present invention, there is provided a social network information acquiring apparatus including:
the request receiving module receives a request for acquiring information from a social network from a user;
the account searching module searches at least one account having a social relationship with the user from the social network after receiving the request;
the time searching module is used for searching the issuing time of information issued by each account in the at least one account for the most recent times from the issuing times of information issued by a plurality of pre-stored accounts on the social network;
the time selection module is used for selecting a plurality of latest release times from the searched release times according to the sequence of the searched release times;
and the information returning module is used for acquiring the information which is released by the account corresponding to the latest multiple release times at the latest multiple release times and returning the information to the user.
According to the technical scheme, the social network information acquisition method and device disclosed by the invention have the following beneficial effects:
according to the technical scheme of the invention, when the social network information is acquired for the user, all information issued by each account having a social relationship with the user is not read, and then a plurality of pieces of recent information are selected, but the time for issuing the information by each account is acquired firstly, the recent issuing times are selected according to the sequence of the issuing times, further the accounts corresponding to the issuing times are selected, and the information issued at the issuing times is only required; compared with the prior art, the technical scheme of the invention has the advantages that the number of the information to be read is very small, and the information reading expense is greatly reduced.
Drawings
FIG. 1 is a schematic diagram of a read model of a prior art solution;
fig. 2 is a flowchart of a social network information obtaining method according to an embodiment of the present invention;
fig. 3 is a flowchart of a social network information obtaining method according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a read model according to an embodiment of the invention;
fig. 5 is a block diagram of a social network information acquiring apparatus according to an embodiment of the present invention;
fig. 6 is a block diagram of a social network information acquiring apparatus according to an embodiment of the present invention.
The implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.
Detailed Description
In order to make the technical problems, technical solutions and advantageous effects to be solved by the present invention clearer and clearer, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
As shown in fig. 2, an embodiment of the present invention provides a social network information obtaining method, which is applied to a server for reading information for a user in a social network scenario, and the method of the embodiment includes:
step S210, receiving a request from a user to obtain information from a social network.
In this embodiment, the user may specifically log in the social networking tool to view the dynamic information of the friend.
Step S220, after receiving the request, searching at least one account having a social relationship with the user from the social network.
In the technical scheme of this embodiment, the social relationship is not limited, and the account with the social relationship may be a friend of the user, or an account that the user has unilateral attention or mutual attention.
In step S230, the publishing time of the information published for the last plurality of times by each account in the at least one account is searched from the publishing times of the information published on the social network by the plurality of pre-stored accounts.
In this embodiment, unlike the prior art, the time for updating the dynamic information for each account is stored.
Step S240, selecting a plurality of latest release times from the searched release times according to the sequence of the searched release times.
In this embodiment, because the amount of the dynamic information that the user terminal can display, which is required by the user, is often limited, it is not necessary to read all the information, but only a few pieces of dynamic information that are issued recently need to be read, and accordingly, in this embodiment, the latest update time needs to be read.
Step S250, obtaining information released by the account corresponding to the latest multiple release times at the latest multiple release times, and returning the information to the user.
In this embodiment, the information that the server needs to read is information corresponding to the latest multiple publishing times, and in the prior art, all information needs to be read, and a plurality of pieces of information that are updated recently are selected according to the publishing times, so compared with the prior art, the number of information that needs to be read in this embodiment is greatly reduced, and the overhead of the server is greatly reduced.
As shown in fig. 3, an embodiment of the present invention provides a social network information obtaining method, where the method of the embodiment includes:
step S310, when each account publishes information, storing corresponding publishing time.
In this embodiment, when each account publishes new dynamic information, writing the dynamic information into the gicsvr through a write-in server not only writes the dynamic information into the SNS information storage cluster, but also writes the current update time into the friend update time summary service, so that all the account dynamic update time information is stored in the friend update time summary service, and generally, only the latest N times (N is generally about 10) of updating the dynamic information of each account need to be stored, and not much storage space is occupied.
Step S320, receiving a request from a user to obtain information from the social network, where the request includes the information amount of the information that the user needs to obtain.
In this embodiment, for example, the front end sends a request to the server according to the technical solution of this embodiment, and attempts to acquire the latest 10 SNS pieces of dynamic information of all the friends of the user a.
Step S330, after receiving the request, at least one account having a social relationship with the user is searched from the social network.
In this embodiment, the server accesses the buddy relationship service to obtain all buddies of a, assuming that there are 100 buddies (including a itself), such as A, B, C, D.
Step S340, according to the information quantity, calculating the quantity of the release time of each account to be searched.
In this embodiment, for example, if a user needs to obtain 10 pieces of information, each user obtains the time of 10 pieces of information issued by the user, and if the user needs to obtain 20 pieces of information, each user obtains the time of 20 pieces of information issued by the user.
Another implementation manner of this embodiment is: and analyzing the strength of the social relationship between the user and each account, and calculating the number of the release time of each account to be searched according to the analysis result.
In this embodiment, the strength of the social relationship is not limited, for example: the mutual attention relationship is stronger than the unilateral attention relationship. In this embodiment, for friends that the user pays attention to each other, the distribution time of more information is obtained, and for accounts that the user pays attention to unilaterally, the distribution time of less information is obtained, so that account information with close contact is preferentially provided to the user.
In step S350, the publishing time of the information published for the last plurality of times by each account in the at least one account is searched from the publishing times of the information published on the social network by the plurality of pre-stored accounts.
In this embodiment, the server accesses the buddy update time summary service to obtain the latest 10 dynamic update times of 100 accounts such as A, B, C, D.
And step S360, selecting a plurality of latest release times according to the searched sequence of the release times and the size of the information quantity.
In this embodiment, the server locally ranks the dynamic update times of 1000 (10 time records multiplied by 100 accounts) of 100 total accounts such as A, B, C, D, and then traverses the latest 10 records to obtain the accounts to which the respective accounts belong (5 accounts such as a and D are assumed), and obtains the number of each account in the latest 10 records, which are respectively recorded as numberra, numberrd, and the like.
Step S370, obtaining information released by the account corresponding to the latest multiple release times at the latest multiple release times, and returning the information to the user.
In this embodiment, the server goes to the SNS information storage service and tries to acquire the latest Number pieces of dynamic information of each of 5 accounts, such as a and D. And the server sequences the acquired latest Number pieces of dynamic information of the 5 accounts such as A, D and the like, such as the latest Number rA pieces of information of the A, the latest Number rD pieces of information of the D and the like according to time to obtain 10 latest SNS dynamic information. And the server returns the 10 pieces of the latest SNS dynamic information to the front end, so that the SNS dynamic information reading is completed at one time.
Based on the technical scheme of the embodiment, it can be found that in the process of reading information by the server to the SNS information storage service, 100 accounts to be accessed are reduced to be within fixed 10 (the flow is 5), and the behavior of read diffusion is effectively controlled.
The architecture of the technical scheme of the embodiment is shown in fig. 4, compared with the prior art, the method and the device for reading the SNS dynamic information have the advantages that a friend update time summary service is added, friend (attention person) filtering is performed on a reading process of a read diffusion model, reading of most of redundant account dynamic information in the SNS dynamic information reading process is optimized, and therefore the read diffusion cost is effectively optimized. More SNS service scenes can use the read diffusion model, so that the advantage of saving storage resources of the read diffusion model can be fully played.
As shown in fig. 5, an embodiment of the present invention provides a social network information obtaining apparatus, which is applied to a server for reading information for a user in a social network scenario, where the apparatus of the embodiment includes:
the request receiving module 510 receives a request from a user to obtain information from a social network.
In this embodiment, the user may specifically log in the social networking tool to view the dynamic information of the friend.
The account lookup module 520, upon receiving the request, looks up at least one account having a social relationship with the user from the social network.
In the technical scheme of this embodiment, the social relationship is not limited, and the account with the social relationship may be a friend of the user, or an account that the user has unilateral attention or mutual attention.
The time searching module 530 searches the published time of the information published on the social network by each account in the at least one account for the most recent times from the published times of the information published on the social network by the plurality of pre-stored accounts.
In this embodiment, unlike the prior art, the time for updating the dynamic information for each account is stored.
The time selection module 540 selects a plurality of latest release times from the searched release times according to the sequence of the searched release times.
In this embodiment, because the amount of the dynamic information that the user terminal can display, which is required by the user, is often limited, it is not necessary to read all the information, but only a few pieces of dynamic information that are issued recently need to be read, and accordingly, in this embodiment, the latest update time needs to be read.
The information returning module 550 obtains the information released by the account corresponding to the latest multiple release times at the latest multiple release times, and returns the information to the user.
In this embodiment, the information that the server needs to read is information corresponding to the latest multiple publishing times, and in the prior art, all information needs to be read, and a plurality of pieces of information that are updated recently are selected according to the publishing times, so compared with the prior art, the number of information that needs to be read in this embodiment is greatly reduced, and the overhead of the server is greatly reduced.
As shown in fig. 6, an embodiment of the present invention provides a social network information acquiring apparatus, and a method of the embodiment includes:
the storage module 610 stores the corresponding publishing time when each account publishes information.
In this embodiment, when each account publishes new dynamic information, writing the dynamic information into the gicsvr through a write-in server not only writes the dynamic information into the SNS information storage cluster, but also writes the current update time into the friend update time summary service, so that all the account dynamic update time information is stored in the friend update time summary service, and generally, only the latest N times (N is generally about 10) of updating the dynamic information of each account need to be stored, and not much storage space is occupied.
The request receiving module 620 receives a request from a user to obtain information from a social network, where the request includes the amount of information that the user needs to obtain information.
In this embodiment, for example, the front end sends a request to the server according to the technical solution of this embodiment, and attempts to acquire the latest 10 SNS pieces of dynamic information of all the friends of the user a.
The account lookup module 630, upon receiving the request, looks up at least one account having a social relationship with the user from the social network.
In this embodiment, the server accesses the buddy relationship service to obtain all buddies of a, assuming that there are 100 buddies (including a itself), such as A, B, C, D.
And the time searching module 640 calculates the number of the issuing time of each account to be searched according to the number of the information.
In this embodiment, for example, if a user needs to obtain 10 pieces of information, each user obtains the time of 10 pieces of information issued by the user, and if the user needs to obtain 20 pieces of information, each user obtains the time of 20 pieces of information issued by the user.
Another implementation manner of this embodiment is: and analyzing the strength of the social relationship between the user and each account, and calculating the number of the release time of each account to be searched according to the analysis result.
In this embodiment, the strength of the social relationship is not limited, for example: the mutual attention relationship is stronger than the unilateral attention relationship. In this embodiment, for friends that the user pays attention to each other, the distribution time of more information is obtained, and for accounts that the user pays attention to unilaterally, the distribution time of less information is obtained, so that account information with close contact is preferentially provided to the user.
The time searching module 640 searches the publishing time of the information published for the last plurality of times by each account in the at least one account from the pre-stored publishing times of the information published by the plurality of accounts on the social network.
In this embodiment, the server accesses the buddy update time summary service to obtain the latest 10 dynamic update times of 100 accounts such as A, B, C, D.
The information returning module 650 selects a plurality of latest release times according to the sequence of the found release times and the size of the information quantity.
In this embodiment, the server locally ranks the dynamic update times of 1000 (10 time records multiplied by 100 accounts) of 100 total accounts such as A, B, C, D, and then traverses the latest 10 records to obtain the accounts to which the respective accounts belong (5 accounts such as a and D are assumed), and obtains the number of each account in the latest 10 records, which are respectively recorded as numberra, numberrd, and the like.
The information returning module 660 obtains the information that the accounts corresponding to the latest multiple release times release at the latest multiple release times, and returns the information to the user.
In this embodiment, the server goes to the SNS information storage service and tries to acquire the latest Number pieces of dynamic information of each of 5 accounts, such as a and D. And the server sequences the acquired latest Number pieces of dynamic information of the 5 accounts such as A, D and the like, such as the latest Number rA pieces of information of the A, the latest Number rD pieces of information of the D and the like according to time to obtain 10 latest SNS dynamic information. And the server returns the 10 pieces of the latest SNS dynamic information to the front end, so that the SNS dynamic information reading is completed at one time.
Based on the technical scheme of the embodiment, it can be found that in the process of reading information by the server to the SNS information storage service, 100 accounts to be accessed are reduced to be within fixed 10 (the flow is 5), and the behavior of read diffusion is effectively controlled.
The architecture of the technical scheme of the embodiment is shown in fig. 4, compared with the prior art, the method and the device for reading the SNS dynamic information have the advantages that a friend update time summary service is added, friend (attention person) filtering is performed on a reading process of a read diffusion model, reading of most of redundant account dynamic information in the SNS dynamic information reading process is optimized, and therefore the read diffusion cost is effectively optimized. More SNS service scenes can use the read diffusion model, so that the advantage of saving storage resources of the read diffusion model can be fully played.
In addition, it is understood by those skilled in the art that all or part of the steps in the above method embodiments may be implemented by related hardware, and the corresponding program may be stored in a computer readable storage medium, where the above mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk.
The preferred embodiments of the present invention have been described above with reference to the accompanying drawings, and are not to be construed as limiting the scope of the invention. Those skilled in the art can implement the invention in various modifications, such as features from one embodiment can be used in another embodiment to yield yet a further embodiment, without departing from the scope and spirit of the invention. Any modification, equivalent replacement and improvement made within the technical idea of using the present invention should be within the scope of the right of the present invention.
Claims (9)
1. The method for acquiring the social network information is applied to a social network service architecture based on a read diffusion model, and comprises the following steps:
when each account publishes information, the published information is written into the information storage service, and the corresponding publishing time is written into the friend update time summary service,
the friend update time summary service is used for storing the time of updating the dynamic information of each account for the last N times;
receiving a request from a user to obtain information from a social network;
after receiving the request, searching at least one account having a social relationship with the user from the social network;
searching the release time of the information released by each account in the at least one account for the most recent times from the release time of the information released by a plurality of accounts in the friend update time summary service on the social network;
selecting a plurality of latest release times from the searched release times according to the sequence of the searched release times;
and acquiring information released by the accounts corresponding to the latest multiple release times at the latest multiple release times from the information storage service, and returning the information to the user.
2. The method according to claim 1, wherein the request includes the amount of information the user needs to obtain; selecting a plurality of latest release times from the found release times, specifically including:
and selecting the latest multiple release times according to the size of the information quantity.
3. The method of claim 2, prior to finding a publication time for each of the at least one account to publish information a plurality of recent times, further comprising:
and calculating the number of the release time of each account to be searched according to the information number.
4. The method of claim 1, prior to finding a publication time for each of the at least one account to publish information a plurality of recent times, further comprising:
and analyzing the strength of the social relationship between the user and each account, and calculating the number of the release time of each account to be searched according to the analysis result.
5. The device for acquiring the social network information is applied to a social network service architecture based on a read diffusion model, and comprises the following components:
the storage module is used for writing the issued information into the information storage service and writing the corresponding issuing time into the friend update time summary service when each account issues the information;
the friend update time summary service is used for storing the time of updating the dynamic information of each account for the last N times;
the request receiving module receives a request for acquiring information from a social network from a user;
the account searching module searches at least one account having a social relationship with the user from the social network after receiving the request;
the time searching module is used for searching the release time of the information released by each account in the at least one account for multiple times in the latest time from the release time of the information released by the accounts in the friend update time summary service on the social network;
the time selection module is used for selecting a plurality of latest release times from the searched release times according to the sequence of the searched release times;
and the information returning module is used for acquiring the information which is released by the accounts corresponding to the latest multiple release times at the latest multiple release times from the information storage service and returning the information to the user.
6. The apparatus according to claim 5, wherein the request includes the amount of information the user needs to obtain;
and the time selection module selects the latest multiple release times according to the size of the information quantity.
7. The apparatus of claim 6,
and the time searching module calculates the number of the issuing time of each account to be searched according to the information number.
8. The apparatus of claim 7,
the time searching module analyzes the strength of the social relationship between the user and each account, and calculates the number of the release time of each account to be searched according to the analysis result.
9. A computer-readable storage medium storing executable instructions for causing a processor to implement the social network information acquiring method of any one of claims 1 to 4 when executed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710012904.XA CN108288228B (en) | 2017-01-09 | 2017-01-09 | Social network information acquisition method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710012904.XA CN108288228B (en) | 2017-01-09 | 2017-01-09 | Social network information acquisition method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108288228A CN108288228A (en) | 2018-07-17 |
| CN108288228B true CN108288228B (en) | 2020-12-04 |
Family
ID=62819173
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710012904.XA Active CN108288228B (en) | 2017-01-09 | 2017-01-09 | Social network information acquisition method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108288228B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109658276A (en) * | 2018-11-22 | 2019-04-19 | 东软集团股份有限公司 | Approaches to IM, device, storage medium and the electronic equipment of social networks |
| CN111083037B (en) * | 2019-10-22 | 2022-02-01 | 贝壳技术有限公司 | Method, device, medium and electronic equipment for realizing instant messaging |
| CN112751892B (en) * | 2019-10-30 | 2022-06-17 | 腾讯科技（深圳）有限公司 | Information distribution method, device, equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102236678A (en) * | 2010-04-26 | 2011-11-09 | 腾讯科技（深圳）有限公司 | Method and system for managing dynamic information of friends, and server for managing information of friends |
| CN102510357A (en) * | 2011-09-26 | 2012-06-20 | 深圳中兴网信科技有限公司 | Synchronous method of enterprise organization structure address book and system thereof |
| CN102999527A (en) * | 2011-09-16 | 2013-03-27 | 腾讯科技（深圳）有限公司 | Dynamic information pushing method and system in SNS (social networking services) network |
| US10057152B2 (en) * | 2013-03-13 | 2018-08-21 | Microsoft Technology Licensing, Llc | Providing an unseen message count across devices |
-
2017
- 2017-01-09 CN CN201710012904.XA patent/CN108288228B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102236678A (en) * | 2010-04-26 | 2011-11-09 | 腾讯科技（深圳）有限公司 | Method and system for managing dynamic information of friends, and server for managing information of friends |
| CN102999527A (en) * | 2011-09-16 | 2013-03-27 | 腾讯科技（深圳）有限公司 | Dynamic information pushing method and system in SNS (social networking services) network |
| CN102510357A (en) * | 2011-09-26 | 2012-06-20 | 深圳中兴网信科技有限公司 | Synchronous method of enterprise organization structure address book and system thereof |
| US10057152B2 (en) * | 2013-03-13 | 2018-08-21 | Microsoft Technology Licensing, Llc | Providing an unseen message count across devices |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108288228A (en) | 2018-07-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106911780B (en) | Service ID generation method, device and system | |
| WO2017167065A1 (en) | Page resource delivery method and apparatus | |
| WO2017211191A1 (en) | Method and device for pushing information | |
| CN108288228B (en) | Social network information acquisition method and device | |
| CN104572845B (en) | Document distribution method, device, equipment and system | |
| CN110134648A (en) | Log processing method, device, equipment, system and computer readable storage medium | |
| CN108419089A (en) | Module data processing method, device, equipment and storage medium | |
| CN108804234B (en) | Data storage system and method of operation thereof | |
| CN105869057B (en) | Comment storage device, comment reading method and device, and comment writing method and device | |
| CN108399186A (en) | A kind of collecting method and device | |
| CN106326499B (en) | A kind of data processing method and device | |
| US20200074509A1 (en) | Business data promotion method, device, terminal and computer-readable storage medium | |
| CN111028009A (en) | Method and device for processing retrievable service entity | |
| CN111967970B (en) | Bank product recommendation method and device based on spark platform | |
| CN102999527A (en) | Dynamic information pushing method and system in SNS (social networking services) network | |
| CN106897224B (en) | Method and device for determining software testing range | |
| CN111061654B (en) | Cache refreshing processing method and device and electronic equipment | |
| CN117194907A (en) | Low-value data theme identification method for data center | |
| CN112818654A (en) | Message storage method, message generation method, message storage device, electronic equipment and computer readable medium | |
| CN110705898A (en) | Flow information processing method and related equipment | |
| CN114691630B (en) | Smart supply chain big data sharing method and system | |
| CN116071133A (en) | Cross-border electronic commerce environment analysis method and system based on big data and computing equipment | |
| CN108197164A (en) | Business data storage method and device | |
| CN110674156B (en) | Multi-machine room data synchronization method, computing equipment and computer storage medium | |
| CN113742581A (en) | List generation method and device, electronic equipment and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |