WO2013071773A1 - 在社交网络中查找附近用户的方法和服务器 - Google Patents
在社交网络中查找附近用户的方法和服务器 Download PDFInfo
- Publication number
- WO2013071773A1 WO2013071773A1 PCT/CN2012/079561 CN2012079561W WO2013071773A1 WO 2013071773 A1 WO2013071773 A1 WO 2013071773A1 CN 2012079561 W CN2012079561 W CN 2012079561W WO 2013071773 A1 WO2013071773 A1 WO 2013071773A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- user
- grid
- client
- location information
- distance
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000003491 array Methods 0.000 claims abstract description 13
- 238000012163 sequencing technique Methods 0.000 abstract 2
- 238000010586 diagram Methods 0.000 description 6
- 230000001174 ascending effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
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
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2457—Query processing with adaptation to user needs
- G06F16/24578—Query processing with adaptation to user needs using ranking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9535—Search customisation based on user profiles and personalisation
-
- 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
Definitions
- the present invention relates to the Internet technology, and more particularly to a method and server for finding nearby users in a social network. Background of the invention
- users may need to find out who is nearby and contact them to make friends or ask for help.
- the server divides the surface of the earth into a series of grid arrays of equal area according to the latitude and longitude information; for any user, it is assumed that the user X, when it needs to find nearby users, will pass
- the client used by the client reports the location information and the user identifier to the server.
- the client may be a mobile terminal or the like, and the location information may be latitude and longitude information.
- the server After receiving the location information reported by the user X, the server first determines the location.
- the grid in which the information is located, after which other users in the same grid are found, and the user IDs of other users found and the distance to the user X are returned to the client of the user X.
- FIG. 1 is a schematic diagram of the position of user X, as shown in FIG.
- the adjacent grids are grid A and grid B, respectively, user X and user Z are in grid A, user Y is in grid B, and for user X, it is with user Y.
- the distance between them will be closer than the distance between users Z. If you want to ask for help, etc., user Y is obviously more suitable than user Z, but according to the existing method, user X will only find user Z, but cannot find To user Y, the search result is not accurate enough. Summary of the invention
- the present invention provides a method and server for finding nearby users in a social network, which can improve the accuracy of the search results.
- a method of finding nearby users in a social network including:
- the retrieved users are sorted according to the distance from the user X in the order of near to far, and the user ID of each user after sorting and the distance from the user X are returned to the client of the user X.
- a method of finding nearby users in a social network including:
- a server comprising:
- a first processing module configured to divide the surface of the earth into a series of grid arrays of equal area in advance, and respectively set a list for each grid;
- a second processing module configured to determine, after receiving the location information and the user identifier reported by the client of any user X, the grid Y in which the received location information is located, and corresponding to the user X, only in the mesh Y
- the order is sorted for each user that is found, and the user ID of each user after sorting and the distance from the user X are returned to the client of the user X.
- a server comprising:
- a first processing module configured to divide the surface of the earth into a series of grid arrays of equal area in advance, and respectively set a list for each grid;
- a second processing module configured to determine, after receiving the location information and the user identifier reported by the client of any user X, the grid Y in which the received location information is located, and corresponding to the user X, only in the mesh Y
- the user ID of the user X, the latest location information, and the latest last time are saved in the list; find out the other grids in the grid Y and the grid Y that forms the N-grid structure and centered on the grid Y.
- n an odd number greater than or equal to 3; Synthesize the distance between the user X and the reporting time to sort the found users, and sort the user IDs of the users and the users The distance between X is returned to the customer of user X The closer the distance to the user X is, the higher the ranking is, and the closer the reporting time is to the current time, the higher the ranking.
- Figure 1 is a schematic diagram of the location of the user X;
- FIG. 2 is a flow chart of a first embodiment of a method for searching for nearby users in a social network according to the present invention
- FIG. 3 is a schematic diagram of a 9-grid structure formed by a grid Y and its surrounding grids;
- FIG. 4 is a flow chart of a second embodiment of a method for finding nearby users in a social network according to the present invention.
- FIG. 5 is a schematic structural diagram of a server embodiment of the present invention. Mode for carrying out the invention
- the present invention proposes an improved scheme for finding nearby users, which can improve the accuracy of the search results.
- the embodiments of the present invention will be further described in detail below with reference to the accompanying drawings.
- FIG. 2 is a flow chart of a first embodiment of a method for finding nearby users in a social network according to the present invention. As shown in Figure 2, the following steps are included:
- Step 21 Divide the surface of the earth into a series of grids of equal area in advance, and set a list for each grid.
- the surface of the earth can be divided into a series of grid arrays of equal area according to the latitude and longitude information.
- the size of each grid can be determined according to actual needs, for example, 1 square kilometer.
- Step 22 After receiving the location information and the user identifier reported by the client of any user X, determine the grid Y in which the received location information is located, and save only the list corresponding to the grid Y for the user X. User X's user ID and the latest location information.
- the location information generally refers to latitude and longitude information. Since each grid is divided according to latitude and longitude information, in this step, the grid in which the received location information is located can be easily determined.
- user X is used to represent any user
- grid Y is used to represent the grid in which user X is located.
- the received user identifier and location information can be saved to the list corresponding to the grid Y, so that if other users are to find nearby users in the grid Y, then the user X will be Find it.
- the user X may have more than one request for searching for a nearby user, and accordingly, the number of times the user identifier and the location information are reported may be more than once.
- the mesh Y corresponds. The user ID and the latest location information of User X are saved in the list to ensure the uniqueness of the user information.
- n can be determined according to actual needs. For example, for the densely populated areas of Guangzhou, Beijing, Shanghai, etc., the value of N can be 3, while for the relatively sparse population of Qinghai, Inner Mongolia, etc., the value of N Can be 5 or 7 etc.
- Figure 3 is a schematic diagram of the 9-grid structure formed by the grid Y and its surrounding grid.
- the N-square described in this step is the 9-grid shown in Figure 3, then the users in the list corresponding to the 9 grids are the found users, of course, except for the user X itself.
- Step 24 Sort the found users according to the distance from the user X in the order of near to far, and return the sorted user IDs of the users and the distance between the user X and the user X to the client of the user X. .
- the location information of the user X is also known, so the distance between each user and the user X found can be calculated and the sorting can be completed.
- the search range of the method in the embodiment is obviously increased, and the number of users found is also significantly increased, and for the user X, those users who are ranked lower are basically not concerned. , therefore, there is no need to return these users to user X, Reduce data transfer, save bandwidth resources, and more.
- the sorting after the sorting is completed, it may be first determined whether the number of users found is less than or equal to M, and if so, the user ID of each user after sorting and the distance between the user X and the user X are returned to the client of the user X. Otherwise, only the user ID of each user in the first M position after sorting and the distance from the user X are returned to the client of user X, where M is a positive integer greater than 1, and the specific value may be determined according to actual needs. .
- some other information such as the user's avatar, may be returned.
- FIG. 4 is a flow chart of a second embodiment of a method for finding nearby users in a social network according to the present invention. As shown in Figure 4, the following steps are included:
- Step 41 Divide the surface of the earth into a series of grids of equal area in advance, and set a list for each grid.
- Step 42 After receiving the location information and the user identifier reported by the client of any user X, determine the grid Y in which the received location information is located, and save only the list corresponding to the grid Y for the user X.
- Step 44 Synthesize the distances with the user X and the reporting time to sort the searched users, and return the user IDs of the sorted users and the distances with the user X to the client of the user X; The closer the distance to the user X, the higher the ranking, the closer the reporting time is to the current time, and the higher the ranking.
- the factor of reporting time is further considered, and correspondingly, in step 42, it is required to be in the list corresponding to the grid Y. Further save the time on the user X "3 ⁇ 4 user identification and location information.
- the value indicates the distance between the user i and the user X, and ⁇ indicates the length of time between the current time and the reporting time of the user i.
- the users are sorted according to the order of weights from small to large.
- the sorting After the sorting is completed, it may be first determined whether the number of users found is less than or equal to M. If yes, the user ID of each user after sorting and the distance between the user X and the user X are returned to the client of the user X. Otherwise, Only the user ID of each user who is in the top M position after sorting and the distance from the user X are returned to the client of the user X, and M is a positive integer greater than 1.
- the client X user when the client X user obtains the location information of the user, the following information may be used, that is, the location information of the user is obtained in the manner of the mode 1 to the mode L, and once the acquisition succeeds, the report is performed; otherwise, according to The next way is to obtain, L is a positive integer greater than 1; for different ways, the smaller the number, the higher the accuracy of the acquired location information.
- mode 1 can obtain location information through a Global Positioning System (GPS) function
- mode 2 can obtain location information by using a cell identifier (Cell ID) of the base station where the base station is located.
- Cell ID cell identifier
- the mode 3 can obtain location information by using a Media Access Control (MAC) address of the connected wireless fidelity (WiFi) access point, and the specific implementation is all prior art.
- MAC Media Access Control
- FIG. 5 is a schematic structural diagram of a server embodiment of the present invention. As shown in Figure 5, it includes: a first processing module, configured to divide the surface of the earth into a series of grid arrays of equal area in advance, and respectively set a list for each grid;
- a second processing module configured to determine, after receiving the location information and the user identifier reported by the client of any user X, the grid Y in which the received location information is located, and corresponding to the user X, only in the mesh Y
- the order is sorted for each user that is found, and the user ID of each user after sorting and the distance from the user X are returned to the client of the user X.
- the second processing module may be further configured to: after the sorting, determine whether the number of the found users is less than or equal to M, and if yes, return the distance between the user identifiers of the sorted users and the user X to User X's client, otherwise, only the user ID of each user in the first M position after sorting and the distance from user X are returned to the client of user X, where M is a positive integer greater than 1.
- a first processing module configured to divide the surface of the earth into a series of grid arrays of equal area in advance, and respectively set a list for each grid;
- a second processing module configured to determine, after receiving the location information and the user identifier reported by the client of any user X, the grid Y in which the received location information is located, and corresponding to the user X, only in the mesh Y
- the user ID of the user X, the latest location information, and the latest last time are saved in the list; find out the other grids in the grid Y and the grid Y that forms the N-grid structure and centered on the grid Y.
- n an odd number greater than or equal to 3; Synthesize the distance between the user X and the reporting time to sort the found users, and sort the user IDs of the users and the users The distance between X is returned to the client of user X; wherein, the closer the distance to user X is, the higher the ranking is, and the time is reported from the current time. The closer the time, the higher the ranking.
- the second processing module can separately calculate the weight of each user i that is found out.
- ⁇ ⁇ * + ⁇ * ⁇ , where a and b are weighting coefficients, representing the distance between user i and user X, 7; indicating the length of time between the current time and the reporting time of user i; Each user is sorted in ascending order.
- the second processing module is further configured to: after the sorting, determine whether the number of the found users is less than or equal to M, and if yes, return the user ID of the sorted users and the distance between the users and the user X to the user.
- the client of X otherwise, only returns the user ID of each user who is in the top M position after sorting and the distance between the user X and the user X, and M is a positive integer greater than 1.
- the solution of the present invention not only the search in the grid where the user X is located, but also the surrounding mesh of the grid in which it is located is also searched, and the distance of the found user according to the distance from the user X is Sorting in order from near to far, so that even if a user is not in the same grid as user X, if it is closer to user X, it will be found and preferentially displayed to user X, thereby improving The accuracy of the search result; Moreover, the solution of the present invention can further consider the factor of reporting time when sorting, and the closer the reporting time is to the current time, the more likely the user X is to contact the user, so the ranking will be The higher the front, the further the accuracy of the search results.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- General Engineering & Computer Science (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Remote Sensing (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- Computational Linguistics (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Information Transfer Between Computers (AREA)
- Telephonic Communication Services (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Mobile Radio Communication Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
Claims
Priority Applications (17)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
MYPI2014701182A MY187997A (en) | 2011-11-16 | 2012-02-08 | Method and server for searching for nearby user in social networking services |
MX2014005906A MX2014005906A (es) | 2011-11-16 | 2012-08-02 | Metodo y servidor para buscar un usuario cercano en servicios de redes sociales. |
NZ625092A NZ625092B2 (en) | 2011-11-16 | 2012-08-02 | Method and server for searching for nearby user in social networking services |
SG11201402179SA SG11201402179SA (en) | 2011-11-16 | 2012-08-02 | Method and server for searching for nearby user in social network |
JP2014541513A JP5833768B2 (ja) | 2011-11-16 | 2012-08-02 | ソーシャルネットワークサービスにおける近傍ユーザを検索するための方法およびサーバ |
AU2012339408A AU2012339408B2 (en) | 2011-11-16 | 2012-08-02 | Method and server for searching for nearby user in social network |
CA2854874A CA2854874C (en) | 2011-11-16 | 2012-08-02 | Method and server for searching for nearby user in social networking services |
AP2014007669A AP2014007669A0 (en) | 2011-11-16 | 2012-08-02 | Method and server for searchin for nearby user in social networking services |
IN3684CHN2014 IN2014CN03684A (zh) | 2011-11-16 | 2012-08-02 | |
BR112014011716A BR112014011716A2 (pt) | 2011-11-16 | 2012-08-02 | modo e servidor para buscar usuário próximo em serviços de rede social |
EP12849877.1A EP2782026A4 (en) | 2011-11-16 | 2012-08-02 | PROCESS AND SERVER TO SEARCH FOR NEAR USERS ON A SOCIAL NETWORK |
KR1020147016314A KR101530304B1 (ko) | 2011-11-16 | 2012-08-02 | 소셜 네트워킹 서비스들에서 인접 사용자를 검색하는 방법 및 서버 |
RU2014123473/08A RU2571573C1 (ru) | 2011-11-16 | 2012-08-02 | Способ и сервер для поиска соседнего пользователя в службах социальных сетей |
US14/277,319 US9092532B2 (en) | 2011-11-16 | 2014-05-14 | Method and server for searching for nearby user in social networking services |
PH12014501098A PH12014501098B1 (en) | 2011-11-16 | 2014-05-15 | Method and server for searching for nearby user in social networking services |
ZA2014/03647A ZA201403647B (en) | 2011-11-16 | 2014-05-20 | Method and server for searching for nearby user in social networking services |
HK15100641.6A HK1200227A1 (zh) | 2011-11-16 | 2015-01-20 | 在社交網絡中查找附近用戶的方法和服務器 |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201110363120.4 | 2011-11-16 | ||
CN201110363120.4A CN102571910B (zh) | 2011-11-16 | 2011-11-16 | 在社交网络中查找附近用户的方法和服务器 |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/277,319 Continuation US9092532B2 (en) | 2011-11-16 | 2014-05-14 | Method and server for searching for nearby user in social networking services |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2013071773A1 true WO2013071773A1 (zh) | 2013-05-23 |
Family
ID=46416376
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2012/079561 WO2013071773A1 (zh) | 2011-11-16 | 2012-08-02 | 在社交网络中查找附近用户的方法和服务器 |
Country Status (19)
Country | Link |
---|---|
US (1) | US9092532B2 (zh) |
EP (1) | EP2782026A4 (zh) |
JP (1) | JP5833768B2 (zh) |
KR (1) | KR101530304B1 (zh) |
CN (1) | CN102571910B (zh) |
AP (1) | AP2014007669A0 (zh) |
AU (1) | AU2012339408B2 (zh) |
BR (1) | BR112014011716A2 (zh) |
CA (1) | CA2854874C (zh) |
CL (1) | CL2014001285A1 (zh) |
HK (1) | HK1200227A1 (zh) |
IN (1) | IN2014CN03684A (zh) |
MX (1) | MX2014005906A (zh) |
MY (1) | MY187997A (zh) |
PH (1) | PH12014501098B1 (zh) |
RU (1) | RU2571573C1 (zh) |
SG (1) | SG11201402179SA (zh) |
WO (1) | WO2013071773A1 (zh) |
ZA (1) | ZA201403647B (zh) |
Families Citing this family (23)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8321525B2 (en) * | 2007-11-27 | 2012-11-27 | Loyalblocks Ltd. | Method, device and system for creating a virtual local social network |
CN102571910B (zh) * | 2011-11-16 | 2014-08-13 | 腾讯科技(深圳)有限公司 | 在社交网络中查找附近用户的方法和服务器 |
CN102882957A (zh) * | 2012-09-19 | 2013-01-16 | 上海斐讯数据通信技术有限公司 | 移动终端交友系统及方法 |
US9060241B2 (en) * | 2012-11-19 | 2015-06-16 | Htc Corporation | Personal communication device and method for presenting digital items thereof |
JP2015069550A (ja) * | 2013-09-30 | 2015-04-13 | カシオ計算機株式会社 | 通信システム、情報処理装置、及び通信方法 |
CN104506623A (zh) * | 2014-12-24 | 2015-04-08 | 天脉聚源(北京)科技有限公司 | 一种用于显示社交网络网友信息的方法及装置 |
KR102118053B1 (ko) * | 2015-02-09 | 2020-06-02 | 엘지전자 주식회사 | 이동 단말기 및 그 제어 방법 |
CN104965910A (zh) * | 2015-06-30 | 2015-10-07 | 天脉聚源(北京)科技有限公司 | 一种动态显示社交网络成员信息的方法及装置 |
CN105005602A (zh) * | 2015-06-30 | 2015-10-28 | 天脉聚源(北京)科技有限公司 | 一种显示社交网络成员信息的方法及装置 |
CN104994005A (zh) * | 2015-06-30 | 2015-10-21 | 天脉聚源(北京)科技有限公司 | 一种实现社交网络成员交换位置信息的方法及装置 |
CN104965911A (zh) * | 2015-06-30 | 2015-10-07 | 天脉聚源(北京)科技有限公司 | 一种显示社交网友信息的方法及装置 |
CN105069687A (zh) * | 2015-06-30 | 2015-11-18 | 天脉聚源(北京)科技有限公司 | 一种立体显示社交网络成员信息的方法及装置 |
US10380146B2 (en) * | 2015-08-17 | 2019-08-13 | Oath Inc. | Locale of interest identification |
CN105392117B (zh) * | 2015-10-19 | 2020-06-02 | 腾讯科技(深圳)有限公司 | 一种查询近距离对象的方法和装置 |
CN107273376B (zh) | 2016-04-07 | 2020-08-04 | 阿里巴巴集团控股有限公司 | 目标位置搜索方法和装置 |
CN106303603B (zh) * | 2016-08-16 | 2019-04-23 | 武汉斗鱼网络科技有限公司 | 一种基于地图服务实现附近主播搜索的系统及方法 |
CN106502921A (zh) * | 2016-10-25 | 2017-03-15 | 电子科技大学 | 一种基于用户活跃度的社交网络新动态队列缓存方法 |
CN109714246A (zh) * | 2017-10-26 | 2019-05-03 | 触信(厦门)智能科技有限公司 | 一种即时互动式好友添加方法 |
CN108376157B (zh) * | 2018-02-08 | 2022-06-07 | 腾讯科技(深圳)有限公司 | 目标用户查询方法、系统和装置 |
US10394859B1 (en) * | 2018-10-19 | 2019-08-27 | Palantir Technologies Inc. | Systems and methods for processing and displaying time-related geospatial data |
CN111695044B (zh) * | 2019-03-11 | 2023-08-18 | 北京柏林互动科技有限公司 | 用户排名的数据处理方法、装置及电子设备 |
US10805374B1 (en) | 2019-08-19 | 2020-10-13 | Palantir Technologies Inc. | Systems and methods for providing real-time streaming data processing at edge servers |
CN111782872B (zh) | 2020-06-30 | 2023-08-08 | 北京百度网讯科技有限公司 | 查询方法、装置、电子设备以及存储介质 |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1908588A (zh) * | 2006-08-17 | 2007-02-07 | 北京航空航天大学 | 一种基于小网格路网组织结构的快速地图匹配方法 |
CN101203041A (zh) * | 2007-04-19 | 2008-06-18 | 高建宏 | 利用移动定位技术实现自动联接附近出租车的方法和系统 |
CN101783080A (zh) * | 2009-12-25 | 2010-07-21 | 深圳市同洲电子股份有限公司 | 移动终端获取停车场车位信息的方法 |
WO2011003232A1 (en) * | 2009-07-07 | 2011-01-13 | Google Inc. | Query parsing for map search |
CN102147261A (zh) * | 2010-12-22 | 2011-08-10 | 南昌睿行科技有限公司 | 一种交通车辆gps数据地图匹配的方法与系统 |
CN102162854A (zh) * | 2011-01-11 | 2011-08-24 | 厦门雅迅网络股份有限公司 | 基于gps数据实时获得位置信息的方法 |
CN102571910A (zh) * | 2011-11-16 | 2012-07-11 | 腾讯科技(深圳)有限公司 | 在社交网络中查找附近用户的方法和服务器 |
Family Cites Families (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2593999B2 (ja) * | 1992-05-13 | 1997-03-26 | 住友電気工業株式会社 | ナビゲーション装置 |
JP2001188837A (ja) * | 1999-12-28 | 2001-07-10 | Ntt Data Corp | 移動情報処理端末、野外情報管理装置、現場指揮・支援システム |
AU2001252505A1 (en) * | 2000-04-18 | 2001-10-30 | Valis Limited | System and method for the provision of services for communities based on cellular phones and mobile terminals |
JP2005123970A (ja) * | 2003-10-17 | 2005-05-12 | Vodafone Kk | プレゼンス表示システムにおけるサーバー装置及びクライアント装置 |
US7319878B2 (en) * | 2004-06-18 | 2008-01-15 | Qualcomm Incorporated | Method and apparatus for determining location of a base station using a plurality of mobile stations in a wireless mobile network |
US20080194238A1 (en) * | 2004-11-11 | 2008-08-14 | Sun Tae Kwon | Wireless Terminal Having Information Exchange Facility, Information Exchange System and Method Using the Wireless Terminal |
JP4756345B2 (ja) * | 2006-02-28 | 2011-08-24 | 日本電気株式会社 | 情報処理装置、情報検索システム、情報検索方法、プログラム |
CN101063613A (zh) * | 2006-04-27 | 2007-10-31 | 环达电脑(上海)有限公司 | 通过导航装置获取地图的方法 |
EP2132646A4 (en) * | 2007-02-28 | 2010-05-05 | Facebook Inc | SYSTEMS AND METHOD FOR THE AUTOMATIC LOCALIZATION OF MEMBERS OF SOCIAL NETWORKS ON A WEB BASE |
US7934224B2 (en) * | 2007-06-29 | 2011-04-26 | France Telecom | Method, interface and apparatus for discovering a location of a device |
US7882102B2 (en) * | 2007-09-10 | 2011-02-01 | Mitac International Corporation | Nearest-neighbor geographic search |
RU82897U1 (ru) * | 2008-04-29 | 2009-05-10 | Сергей Григорьевич Мисский | Система знакомства по мобильному телефону с функцией определения пространственного положения |
US8655960B2 (en) * | 2008-06-19 | 2014-02-18 | Verizon Patent And Licensing Inc. | Location-aware instant messaging |
KR101545703B1 (ko) * | 2009-01-12 | 2015-08-20 | 삼성전자 주식회사 | 이동단말의 위치정보를 활용한 위치 서비스 제공 및 수신방법 |
US20100205242A1 (en) * | 2009-02-12 | 2010-08-12 | Garmin Ltd. | Friend-finding system |
US20110055264A1 (en) * | 2009-08-28 | 2011-03-03 | Microsoft Corporation | Data mining organization communications |
US8090351B2 (en) * | 2009-09-01 | 2012-01-03 | Elliot Klein | Geographical location authentication method |
CN102088419B (zh) * | 2009-12-07 | 2012-08-15 | 倪加元 | 一种在社交网络中查找好友信息的方法和系统 |
CN101873525A (zh) * | 2010-06-21 | 2010-10-27 | 中兴通讯股份有限公司 | 移动终端中联系人信息储存的方法及装置 |
CN102004793B (zh) * | 2010-12-08 | 2013-09-04 | 厦门雅迅网络股份有限公司 | 一种设计和生成网格空间索引文件的方法及进行信息查询的方法 |
CN102098388A (zh) * | 2011-01-31 | 2011-06-15 | 宇龙计算机通信科技(深圳)有限公司 | 联系人排序方法及终端 |
US9208511B2 (en) * | 2011-08-22 | 2015-12-08 | Simple Rules, Inc. | System and method for location-based recommendations |
-
2011
- 2011-11-16 CN CN201110363120.4A patent/CN102571910B/zh active Active
-
2012
- 2012-02-08 MY MYPI2014701182A patent/MY187997A/en unknown
- 2012-08-02 MX MX2014005906A patent/MX2014005906A/es active IP Right Grant
- 2012-08-02 WO PCT/CN2012/079561 patent/WO2013071773A1/zh active Application Filing
- 2012-08-02 AU AU2012339408A patent/AU2012339408B2/en active Active
- 2012-08-02 AP AP2014007669A patent/AP2014007669A0/xx unknown
- 2012-08-02 IN IN3684CHN2014 patent/IN2014CN03684A/en unknown
- 2012-08-02 CA CA2854874A patent/CA2854874C/en active Active
- 2012-08-02 SG SG11201402179SA patent/SG11201402179SA/en unknown
- 2012-08-02 BR BR112014011716A patent/BR112014011716A2/pt not_active Application Discontinuation
- 2012-08-02 RU RU2014123473/08A patent/RU2571573C1/ru active
- 2012-08-02 EP EP12849877.1A patent/EP2782026A4/en not_active Ceased
- 2012-08-02 JP JP2014541513A patent/JP5833768B2/ja active Active
- 2012-08-02 KR KR1020147016314A patent/KR101530304B1/ko active IP Right Grant
-
2014
- 2014-05-14 US US14/277,319 patent/US9092532B2/en active Active
- 2014-05-15 PH PH12014501098A patent/PH12014501098B1/en unknown
- 2014-05-15 CL CL2014001285A patent/CL2014001285A1/es unknown
- 2014-05-20 ZA ZA2014/03647A patent/ZA201403647B/en unknown
-
2015
- 2015-01-20 HK HK15100641.6A patent/HK1200227A1/zh unknown
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1908588A (zh) * | 2006-08-17 | 2007-02-07 | 北京航空航天大学 | 一种基于小网格路网组织结构的快速地图匹配方法 |
CN101203041A (zh) * | 2007-04-19 | 2008-06-18 | 高建宏 | 利用移动定位技术实现自动联接附近出租车的方法和系统 |
WO2011003232A1 (en) * | 2009-07-07 | 2011-01-13 | Google Inc. | Query parsing for map search |
CN101783080A (zh) * | 2009-12-25 | 2010-07-21 | 深圳市同洲电子股份有限公司 | 移动终端获取停车场车位信息的方法 |
CN102147261A (zh) * | 2010-12-22 | 2011-08-10 | 南昌睿行科技有限公司 | 一种交通车辆gps数据地图匹配的方法与系统 |
CN102162854A (zh) * | 2011-01-11 | 2011-08-24 | 厦门雅迅网络股份有限公司 | 基于gps数据实时获得位置信息的方法 |
CN102571910A (zh) * | 2011-11-16 | 2012-07-11 | 腾讯科技(深圳)有限公司 | 在社交网络中查找附近用户的方法和服务器 |
Non-Patent Citations (1)
Title |
---|
See also references of EP2782026A4 * |
Also Published As
Publication number | Publication date |
---|---|
HK1200227A1 (zh) | 2015-07-31 |
KR20140094001A (ko) | 2014-07-29 |
AP2014007669A0 (en) | 2014-05-31 |
CL2014001285A1 (es) | 2015-01-16 |
CA2854874C (en) | 2019-07-09 |
KR101530304B1 (ko) | 2015-06-19 |
US20140258281A1 (en) | 2014-09-11 |
SG11201402179SA (en) | 2014-09-26 |
JP5833768B2 (ja) | 2015-12-16 |
JP2014533852A (ja) | 2014-12-15 |
EP2782026A1 (en) | 2014-09-24 |
MY187997A (en) | 2021-11-08 |
AU2012339408A1 (en) | 2014-07-10 |
PH12014501098A1 (en) | 2014-07-28 |
US9092532B2 (en) | 2015-07-28 |
BR112014011716A2 (pt) | 2017-05-09 |
CA2854874A1 (en) | 2013-05-23 |
NZ625092A (en) | 2015-08-28 |
PH12014501098B1 (en) | 2014-07-28 |
MX2014005906A (es) | 2014-06-05 |
ZA201403647B (en) | 2015-08-26 |
AU2012339408B2 (en) | 2015-10-29 |
EP2782026A4 (en) | 2014-12-03 |
CN102571910A (zh) | 2012-07-11 |
CN102571910B (zh) | 2014-08-13 |
IN2014CN03684A (zh) | 2015-09-04 |
RU2571573C1 (ru) | 2015-12-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2013071773A1 (zh) | 在社交网络中查找附近用户的方法和服务器 | |
CN102546656B (zh) | 在社交网络中查找用户的方法、系统和装置 | |
JP6689515B2 (ja) | ユーザ地理的ロケーションのタイプを識別するための方法および装置 | |
CN109672980B (zh) | 确定兴趣点对应的无线局域网热点的方法、装置及存储介质 | |
WO2015154438A1 (zh) | 定位方法及装置 | |
JP2016503937A (ja) | 活動領域の検索および決定 | |
KR20120117865A (ko) | 위치 데이터베이스를 이용한 모바일 장치의 위치 결정 | |
CN103942221B (zh) | 检索方法及设备 | |
WO2015018233A1 (zh) | 终端设备位置确定方法和终端设备 | |
CN104935462B (zh) | 一种端服务器部署方法及装置 | |
CN105550221B (zh) | 信息搜索方法及装置 | |
CN111639092B (zh) | 一种人员流动分析方法、装置、电子设备及存储介质 | |
WO2012159372A1 (zh) | 用户数量计算方法及系统 | |
WO2017008653A1 (zh) | Poi服务提供方法、poi数据处理方法及装置 | |
CN106161553B (zh) | 社区应用信息推送方法和系统 | |
EP3149978B1 (en) | System for providing location-based social networking services to users of mobile devices | |
CN108600413B (zh) | 定位方法及装置和电子设备 | |
CN114881430A (zh) | 一种基于网络地图服务的社区生活便利度评价方法 | |
Waluyo et al. | Mobile query services in a participatory embedded sensing environment | |
Jardak et al. | Extremely large-scale sensing applications for planetary WSNs | |
CN109769202B (zh) | 流量数据的定位方法及装置、存储介质、服务器 | |
US20190098442A1 (en) | Method of operating a device, the device shown carrying out the method, and a system including the deice and a server in a system providing location-based social networking services to users of mobile devices | |
CN114168838A (zh) | 兴趣点在线搜索排序方法与系统、以及云端搜索服务平台 | |
CN108337644B (zh) | 一种数据处理方法及装置 | |
NZ625092B2 (en) | Method and server for searching for nearby user in social networking services |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 12849877 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: P436/2014 Country of ref document: AE |
|
ENP | Entry into the national phase |
Ref document number: 2854874 Country of ref document: CA |
|
ENP | Entry into the national phase |
Ref document number: 2014541513 Country of ref document: JP Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2014001285 Country of ref document: CL Ref document number: 12014501098 Country of ref document: PH Ref document number: MX/A/2014/005906 Country of ref document: MX |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
ENP | Entry into the national phase |
Ref document number: 20147016314 Country of ref document: KR Kind code of ref document: A Ref document number: 2014123473 Country of ref document: RU Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2012849877 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 2012339408 Country of ref document: AU Date of ref document: 20120802 Kind code of ref document: A |
|
REG | Reference to national code |
Ref country code: BR Ref legal event code: B01A Ref document number: 112014011716 Country of ref document: BR |
|
ENP | Entry into the national phase |
Ref document number: 112014011716 Country of ref document: BR Kind code of ref document: A2 Effective date: 20140515 |