EP2076857A1 - Procédé et serveur de recherche d'un centre d'intérêt d'un utilisateur dans une zone géographique - Google Patents
Procédé et serveur de recherche d'un centre d'intérêt d'un utilisateur dans une zone géographiqueInfo
- Publication number
- EP2076857A1 EP2076857A1 EP07848364A EP07848364A EP2076857A1 EP 2076857 A1 EP2076857 A1 EP 2076857A1 EP 07848364 A EP07848364 A EP 07848364A EP 07848364 A EP07848364 A EP 07848364A EP 2076857 A1 EP2076857 A1 EP 2076857A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- interest
- geographical
- search
- user
- area
- 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.)
- Withdrawn
Links
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/36—Input/output arrangements for on-board computers
- G01C21/3679—Retrieval, searching and output of POI information, e.g. hotels, restaurants, shops, filling stations, parking facilities
-
- 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
Definitions
- the present invention relates to the general field of methods for searching relevant data in an information base.
- the invention more particularly relates to systems for guiding a user in the search for a point of interest located in a geographical area defined by a single location or along a route between two geographical points, from data associating interests and their geographical locations.
- a center of interest can be of different natures: it can be both an activity (trade offering a brand of product, hotel, restaurant, doctor, florist, pharmacy, dentist, pumps funeral, commissariat, tourist area with remarkable points, %), an organization (administration, company with geographically distributed establishments, %) than a resource (services offered on a network by objects or geographically distributed machines).
- an initial “category” is specified in which the center of interest is searched.
- an initial category within the meaning of the invention, may be “doctor” or "restaurant”.
- search systems allowing the user to search for a center of interest in a given geographical area (city, department, etc.). This is how most existing consumer directories sites operate, for example of the "Yellow Pages” or “White Pages” type, or derived from web-like search engines.
- the user can change the geographical area by searching, moving, enlarging or reducing it. This change will update the responses delivered by the system.
- these systems do not allow to deliver to the user the relevant answers nor to guide him in his search.
- the set of responses is sent to the user in the form of a list classified according to criteria that are not necessarily relevant to the user, or a selection of a limited number of responses among all the answers is performed according to a criterion that is not necessarily relevant for the user.
- some current search systems classify the responses delivered for the centers of interest according to their location in a neighborhood of the geographic search area.
- a list of neighborhoods covered at least in part by the geographical search area and the number of responses in each quarter of the list are proposed to the user in response to his search.
- the division into neighborhoods in these systems poses at least the following two problems: the list of neighborhoods is predefined and fixed; it has been established upstream, for example for a given city. As a result, it does not adapt to the user-defined search area. Thus, when the geographic area of research is limited to a neighborhood, no additional information is given to the user to guide his research within this neighborhood;
- a neighborhood is defined by a surface surrounding a particular monument or tourist area belonging to that neighborhood. As a result, these surfaces overlap. The same answer is counted in several neighborhoods. Therefore, in the case where a large number of responses is obtained, such a ranking does not limit the number of relevant responses delivered to the user. It is faced with a large number of results difficult to exploit and has no choice then to restart a new search by proposing a new initial category to try to limit the number of responses. He can not refine his search geographically.
- the invention relates to a method for finding a center of interest of a user that can be implemented. in a server adapted to communicate with a client terminal of the user and comprising a step of querying a data source describing points of interest associated with geographical location data, with a view to obtaining at least the number of interests defined by an initial category and a geographical area of research.
- This process comprises:
- the invention relates to a search server of a center of interest of a user, communicating with a client terminal of said user, and comprising means for querying a data source describing points of interest associated with data.
- geographical location with a view to obtaining at least the number of centers of interest defined by an initial category and a geographical area of research.
- This search server includes:
- the data describing the centers of interest are of the directory type. They concern both consumer directories and directories of organizations or resources that can be used by LDAP servers (Light weight
- These method and search server are therefore adapted to carry out a cartographic enumeration of the responses, that is to say, within the meaning of the invention, to cut the geographical area of research, preferably the entire geographical area, in geographical sub-areas contiguous and give for each geographical sub-area thus obtained the number of centers of interest according to the initial category therein.
- a division thus applies to any type of geographical area of research, Le., Urban or non-urban. Since the geographic sub-areas are contiguous, the user is assured that the same area of interest can belong to only one geographical sub-area.
- the number of replies per geographical sub-zone is therefore, for the majority of searches, less than the total number of replies, which allows the user to specify his search, for example by zooming in on a sub-zone which thus becomes the new geographical area of research.
- the user can refine his search by zooming on this sub-area. This gives rise to a new search, for which the geographic search area is defined by the zoomed area. This search results in a new sub-area cut-off allowing to count the answers in a smaller geographic area.
- obtaining the number of centers of interest contained in each of the geographical sub-areas is carried out by interrogating, for each geographical sub-area, the data source describing centers of interest. interest associated with geographic location data.
- information data of two different types can be generated and sent to the user. These are: - on the one hand, the number of relevant centers of interest, associated with a geographical area and a category of research; and on the other hand, responses corresponding to the centers of interest, i.e. directory type data or other information data associated with these centers of interest. Therefore, this means that during the query step of the data source, it is not necessary to generate the set of responses (i.e. for example the directory data corresponding to the centers of interest found) for this geographic area to obtain the number of relevant responses. This number can be obtained, alone, by querying the data source. In our example of realization, the responses will only be generated when their number is below a configurable threshold.
- the results of the cartographic enumeration are presented via the graphical interface of the user's client terminal in the form of a map on which are represented the geographical area of research, the delimitations of the geographical sub-areas. and the number of replies by geographical sub-area in the form of figures or pictograms of variable size.
- the enumeration by geographical sub-area thus appears directly on the map.
- the user can then select a particular sub-area to define a new geographic search area.
- the method according to the invention comprises a preliminary step of constructing the geographical search area from a series of polygons defining a search corridor of configurable width around a route calculated between a location origin and a destination location using a map data source.
- the search server according to the invention comprises means for constructing the geographical search area from a series of polygons defining a search corridor of configurable width around a route calculated between an original location and a location. destination location using a map data source.
- this method and search server also guide the user in his search for a point of interest along a route for example between two cities.
- the extent of the geographic search area is specified by a search distance around the route.
- the step of cutting the method according to the invention cuts the geographical search area into contiguous polygons covering the geographical search area.
- This mode of division makes it possible to completely cover the geographical area of research, whether it is a rectangle for example when the geographic search area is specified by a single location or a polygon when it is a route. It can be elementary polygons, identical or not depending on the areas to be cut.
- the method according to the invention comprises a step of sending the user the number of responses by secondary category.
- a sub-category designates a subset, in the data source describing points of interest, of an initial category specified for the search.
- Secondary categories are identified according to given rules, for a realization.
- the secondary categories identified by the rules are not predetermined and may change depending on the content of the data source.
- the association of the secondary categories corresponding to the initial category with the number of answers contained in each secondary category constitutes a count in secondary categories.
- the results of the counting in secondary categories are presented via the graphical interface of the user's client terminal in the form of a list with check boxes or any other graphic representation allowing the user to select multiple items from the list.
- the various steps of the method of finding a center of interest of a user are determined by instructions of computer programs.
- the invention also relates to a computer program on an information medium, this program being capable of being implemented in a search server or more generally in a computer, this program comprising instructions adapted to the implementation of the steps of a method of searching for a user's point of interest as described above.
- This program can use any programming language, and be in the form of source code, object code, or intermediate code between source code and object code, such as in a partially compiled form, or in any other form desirable shape.
- the invention also relates to a computer-readable information medium, comprising instructions of a computer program as mentioned above.
- the information carrier may be any entity or device capable of storing the program.
- the medium may comprise storage means, such as a ROM, for example a CD ROM or a microelectronic circuit ROM, or a magnetic recording medium, for example a floppy disk or a disk. hard.
- the information medium may be a transmissible medium such as an electrical or optical signal, which may be conveyed via an electrical or optical cable, by radio or by other means.
- the program according to the invention can be downloaded in particular on an Internet type network.
- the information carrier may be an integrated circuit in which the program is incorporated, the circuit being adapted to execute or to be used in the execution of the method in question.
- FIG. 1 shows, in its environment, a search server according to the invention in a particular embodiment
- FIG. 2 represents, in the form of flowcharts, the main steps of a method of searching for a center of interest of a user according to the invention in a particular embodiment
- FIG. 3 represents the different elements considered in the construction of a geographic search area associated with a route between two locations, in a particular embodiment
- FIG. 4 represents the result of a cartographic enumeration according to the invention, carried out on a geographical area associated with a single location and such that it can be presented to the user, in a particular embodiment.
- FIG. 1 represents a search server 20 according to the invention.
- This search server 20 is connected, via an access and transport network, to a client 10 of PC type having a graphics module.
- the client 10 may be a mobile terminal having a graphics module, such as a mobile phone or personal assistant PDA (Personal Digital Assistant).
- a graphics module such as a mobile phone or personal assistant PDA (Personal Digital Assistant).
- the search server 20 and the client 10 may be co-located, for example in a navigation equipment type GPS (Global Positioning System).
- GPS Global Positioning System
- the graphical interface of the client terminal 10 comprises different zones:
- the search server 20 may in another particular embodiment operate in traffic sharing or load sharing with another search server, not shown in FIG. 1.
- this search server 20 is connected to several data sources.
- these data sources are databases: a map database 31 and a database describing points of interest 32 and associated with geographical location data.
- the map data source 31 contains:
- Geocoding addresses can be performed by an external server specialized in geocoding and not shown in the figure, such as a geocoding web service.
- the search server 20 is also connected to a database 32 describing points of interest and associated with geographical location data.
- the database 32 is managed by a database management system using a predicate search language (SQL, SQL SIG, OQL, XQuery) with text search expressions.
- SQL predicate search language
- SQL SIG SQL SIG
- OQL OQL
- XQuery text search expressions
- the database 32 is managed by a database management system using a search language derived from the predicate logic with text search expressions.
- the database 32 is managed by search software implementing features similar to these query languages for the management of a database.
- this language or this search software proposes extensions of the information system type.
- Geographical Information System GIS
- the interest point database 32 contains sets of information items representing a focus of interest and that can be searched:
- the database 32 describing points of interest contains structured data of the general public directory type.
- the standard structure of consumer directory type data in Europe is described in the ITU El 15 standard.
- the interest point database 32 contains structured data of the organization directory type or LDAP resources.
- the standard structure of organizational directory or resource type data is described in IETF RFC 2256 "A summary of the X500 (96) User Scheme for use with LDPAv3".
- the data of the database 32 is associated with geographical location data.
- each center of interest is geocoded in the database 32 of the centers of interest, that is to say that it carries a geographical positioning information consisting of its geographical coordinates (X, Y) on a map and the geographic reference used to make the map (for example, Lambert II system).
- the data stored in the database 32 are geocoded by querying the cartographic database 31 or an external geocoding server not shown in the figure.
- the interest centers database 32 is structured according to several types of information:
- main category such as an activity for "Yellow Pages” directories or an organization or resource for "LDAP" type directories; - secondary categories; and
- the search server 20 comprises a central unit, not shown in the figure, a graphics protocol management module 234, a global search module 230, a card search module 231 and a research module of interests 232.
- the management module the graphic protocol 234 implements a protocol translating the elements entered by the user on the graphical interface of the client terminal 10 into messages that can be interpreted by the global search module 230.
- the graphics protocol management module 234 formats the data obtained in response to the search for interests of interest found in the database 32 so that they can be viewed by the user on the graphical user interface. its client terminal 10. This may be the results of the cartographic enumeration, or the enumeration in secondary categories or even the actual answers. This data is then sent by the module 234 to the client terminal 10.
- this protocol uses the XML language. It is also generic, in the sense that it is not related to the nature of the centers of interest, which can evolve or be changed, Le., It is not linked to a database or a particular type of directory.
- the global search module 230 routes the messages from the graphics protocol management module 234 to the various underlying modules 231 and 232, from all or part of the information contained in the message header.
- the map search module 231 uses the map database 31 to find the geographical coordinates of an address of type locality or locality plus street or locality plus street plus number in the street.
- the card search module 231 uses an external geocoding server not shown in the figure to obtain these geographical coordinates.
- the map search module 231 also uses the cartographic database 31:
- the card search module 31 is adapted to construct a geographic search area defined by a corridor of configurable width around this route.
- This corridor consists of different polygons, as shown in Figure 3, described later.
- the card search module 231 also comprises means for cutting a geographical area into a configurable number q of geographical sub-areas, covering the whole of this geographical area.
- the interest-seeking module 232 performs several types of searches in the interest-point database 32. In the particular embodiment of the invention described here, it realizes:
- the search server 20 also comprises a random access memory 21 and a read only memory 22.
- the read-only memory 22 of the search server 20 described here comprises a computer program according to the invention adapted to execute the main steps of the method of searching for a center of interest according to the invention, these main steps being represented in the form of flowchart in Fig. 2, described now.
- the user in order to launch the search method according to the invention, the user connects to the search server 20 and must enter the OR and QUOI zones proposed by the graphical interface.
- the OU zone defines the geographic search area in which the search is performed.
- the geographical search area can be provided directly by the GPS tracking system.
- the OR zone allows the user to enter:
- - a unique location, for example a city, a department or a region;
- the entry of the origin and destination fields of the route can be done by successively selecting on one or two maps an origin and a destination. This selection can be done for example with a "click" of the mouse on the map where the origin and destination of the route are.
- the user is also asked to specify a search distance d around the route, corresponding to the distance the user is willing to travel from his or her route to find a center. interest.
- the search distance is predefined.
- the user may specify other preferences for calculating the route, such as a means of transport.
- the QUOI input field corresponds to an initial category of interest.
- This initial category is interpreted by the search server 20 which associates it with a main category as defined in the data source 32 and depending on the type of data source, for example an activity in a directory such as "Yellow Pages", or a organization in an "LDAP" directory (Light weight Directory Access Protocol).
- the user does not necessarily enter a known initial category of the data source 32, that is to say exactly corresponding to a main category as defined in the data source 32. user can enter as initial category
- a main category of data source 32 is "restaurant”.
- the user can enter an initial misspelled category with respect to a main category of the data source 32.
- the search server 20 advantageously identifies the main category of the closest data source 32. of the initial category defined by the user (in the "restaurant” example), using techniques known to those skilled in the art. The search in the data source 32 is then performed from the main category thus obtained.
- the geographical coordinates corresponding to the field OR are determined during a step E12 by the card search module 231 from the map database 31 or an external geocoding server.
- the geographic search area corresponding to these coordinates is determined and sent to the user.
- the entered OR field corresponds to a single location
- the entered OR field is composed of a home location and a destination location.
- the map search module 231 determines a geographic search area in step E14, including the geographical coordinates of said location.
- said geographic search area is a rectangle including said user specified geographical location.
- a map search corresponding to the geographical search area is performed in the map base 31. Said map is sent to the user and displayed on the screen of his client terminal 10.
- a route calculation is performed in step E14 by the map search module 231, by consulting the cartographic database 31 or a remote external server. shown in the figure.
- this route takes into account certain preferences of the user, such as, for example, the mode of transport.
- the route thus calculated consists of different segments, each segment being identified using the geographical coordinates of its endpoints.
- a minimum length for each segment is defined, for example equal to the search distance d.
- a plurality of contiguous segments of the route are then grouped to form a new segment of length greater than or equal to the minimum length. This grouping is done as follows. Suppose that the route is defined by segments (Si, S 2 , .., S N ).
- segment S 1 is of length less than the minimum length, it is added vectorially with the following segment S 2 to give a new segment S ⁇ . If the length of the resulting segment is smaller than the minimum length, the resultant segment S 1 is added vectorially to the segment S 3 and so on until a segment of length greater than or equal to the minimum length is obtained. The same goes for the other segments constituting the route, until the last segment S N. The length of the last segment is not necessarily greater than or equal to the minimum length.
- the new segments thus obtained are determined by the geographical coordinates of their endpoints. The resulting route is thus made up of larger segments.
- the route is then represented on a map and sent to the user in the form of a list of segments. This list is stored.
- a search distance relative to the route is also requested from the user during step E14 to define the geographical search area.
- the user can at any time zoom in and move the map representing the overall route to position the geographical search area on a subset of the route.
- the list of segments is then updated to obtain the sub-list of segments corresponding to the portion of the route displayed on the screen.
- Receiving the value associated with the search distance d determines the geographic search area around the route. This is calculated as a series of polygons each constructed from a route segment and the search distance specified by the user (distance d on both sides of the segment).
- FIG. 3 represents a particular embodiment, allowing the search server 20 to determine the polygons constituting the geographical search area.
- the route is in this particular case consisting of 3 segments passing through the points A, B, C and D. The various steps of the construction of the polygons are described below.
- two parallel straight lines ⁇ i (A, B) and ⁇ 2 (A, B) to the segment are plotted at a distance d from the segment passing through points A and B, and on both sides of this segment.
- the polygons are obtained by connecting the points thus determined corresponding to the different segments, as shown in the figure.
- the polygon P (A, B) has vertices A 1 , B 1 , B 2 , A 2 , the polygon
- P (B, C) has for vertices the points B 1 , C 1 , C 2 , B 2 , and the polygon P (C, D) has at vertices the points C 1 , D 1 , D 2 , C 2 .
- the geographical area of research is defined by the union of the three polygons P (A, B), P (B, C) and P (C, D).
- a search of the secondary categories associated with the initial category entered in the QUOI field is performed for a plurality of predefined rules, in the geographic search zone defined in step E14.
- the secondary categories obtained depend on the content of the data source 32.
- This search is carried out by the interest search module by querying the database 32.
- the number of responses describing the centers of interest is also obtained during this step for each identified secondary category. The results of the stage
- the secondary categories are determined dynamically according to the contents of the interest database 32 and are not predefined statically beforehand in the form of nomenclature. Their number is calculated dynamically too. For example, for entering a field WHAT "Garages”, we can define the rules "brands", "services” and “services”.
- the search carried out by the interest search module 232 in the interest center 32 leads to the following result: - rule "marks”: 5 o secondary category "mark R”: 3 o secondary category "mark C »: 2 - "services” rule: 6 o "new vehicles” secondary category: 2 o "bodywork” secondary category: 2 o "garbage” secondary category: 2 - “service” rule: 0
- obtaining the number of centers of interest contained in each secondary category is performed by querying the data source 32 describing centers of interest. Indeed, as seen previously, it is not necessary to obtain the number of interests contained in a secondary category to generate the directory type data associated with these interests (that is, the answers strictly speaking). The consultation of the database 32 makes it possible to obtain this number without explicitly generating the responses. Responses will only be generated when their number is below the configurable threshold.
- the total number of responses describing points of interest corresponding to the initial category and to the geographic search area is obtained during a step E18 and compared to a threshold that can be parameterized during a step E20.
- the search requested by the user is considered to have generated too many responses.
- a new enumeration step is then performed, this time by geographical area, to reduce the number of relevant responses.
- cartographic counting is presented for reference in FIG. 4, described later for a particular embodiment, when the entered OR field is a single location.
- the geographic search area is first completely divided into q geographical sub-areas during a step E22, by the card search module 231.
- q is a predefined parameter value.
- the geographic search area is split: - in q contiguous rectangles for the large rectangle when the entered OR field is a single location;
- each geographical sub-zone is obtained as well as a representative point of the center of the sub-zone in step E24.
- This center makes it possible to define a geographical point of the sub-zone which will be affected by the number of localized responses in said geographical sub-zone.
- the center of each geographical sub-area is the centroid of localized responses in the geographical sub-area.
- the number of responses contained in each geographical sub-area is obtained by querying the database 32 of points of interest.
- the results of the cartographic enumeration and the enumeration in secondary categories are sent to the user during a step E26 as a global response to the search.
- the map count results and the sub-category count results are sent to the user in separate steps.
- results of a cartographic enumeration according to the invention in a particular embodiment are represented as displayed on the user's client terminal 10, when the geographic search area corresponds to a single location.
- the location is a city.
- the geographical area of search ZR is a rectangle containing the city entered in the OR field.
- the different streets of the city, for example the street R, are represented on the figure.
- the point is all the more important as the number of centers of interest in the area is important. This point is located at the location of the centroid of localized responses in the geographic sub-area.
- the user can then refine his search in different ways:
- step E28 The reception and interpretation of the selection of the user by the search server 20 in response to step E26 is performed in step E28.
- step E30 If the answer is the selection of one or more secondary categories (step E30), then the method is repeated starting from step E 18 for calculating the total number of responses corresponding to the selected secondary categories.
- the search then focuses on the initial enriched category of the selected secondary categories.
- the geographic search area remains unchanged. If the answer is the selection of a geographical sub-area (step E30), then the method is repeated starting from step E 18 for calculating the total number of responses corresponding to the selected secondary categories.
- the search then focuses on the initial enriched category of the selected secondary categories.
- the geographic search area remains unchanged. If the answer is the selection of a geographical sub-area (step E30).
- step E32 then the method is repeated from the step E16 search and enumeration of secondary categories for the selected geographical sub-area which becomes the new geographic search area.
- the initial category remains unchanged.
- a search for the results is carried out at step E34 for the geographical search area and the initial category (or the initial enriched category of the last selected secondary categories).
- the sub-category count and the responses are returned to the user as the overall response in step E36.
- the counting in secondary categories is displayed on the screen of the user terminal 10 of the user as above, in the form of a list with check boxes or any other device allowing selection. several items in the list.
- a subset of the responses is also displayed on the map in the form of pictograms.
- the geographical locations of the responses are slightly discarded when they are not too numerous to be displayed on the map but overlap.
- the same subset of responses is displayed in a list of responses.
- the user can modify the answers displayed on the map by browsing the rest of the list of responses that is not initially displayed. In a variant, it can modify the responses displayed on the map by selecting additional secondary categories.
- step E42 receiving a new entry of the OR field only: if the new user-defined geographical area is outside the previously loaded card on which the previous search was performed, then the process is resumed at from step E12 of determining the geographic coordinates of the new geographical area.
- the initial category remains unchanged and the new search box is the user defined geographical area; o if the new user-defined geographical area is contained in the initially loaded map, then the process is resumed from the sub-category enumeration step E16.
- the geographic search area is the new user-defined area, while the initial search category remains unchanged;
- step E50 the process is taken from the step E 16 of counting in secondary categories.
- the geographical search area remains unchanged, while the initial category is defined by the category entered in the QUOI field;
- step E48 the process is resumed from step E 12, for the initial category defined in the field WHAT and the search area defined by the field OR , newly seized.
- step E40 If no new input is made by the user and therefore is not received by the search server 20, then the process ends in step E40.
- a result location of a center of interest according to the method according to the invention can serve as a starting point for a new search.
- a first search that led to the selection of a hotel can serve as a starting point for a second search for restaurants near this hotel.
Landscapes
- Engineering & Computer Science (AREA)
- Remote Sensing (AREA)
- Radar, Positioning & Navigation (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Automation & Control Theory (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Navigation (AREA)
Abstract
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR0653927 | 2006-09-25 | ||
PCT/FR2007/051994 WO2008037914A1 (fr) | 2006-09-25 | 2007-09-21 | Procédé et serveur de recherche d'un centre d'intérêt d'un utilisateur dans une zone géographique |
Publications (1)
Publication Number | Publication Date |
---|---|
EP2076857A1 true EP2076857A1 (fr) | 2009-07-08 |
Family
ID=37885891
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP07848364A Withdrawn EP2076857A1 (fr) | 2006-09-25 | 2007-09-21 | Procédé et serveur de recherche d'un centre d'intérêt d'un utilisateur dans une zone géographique |
Country Status (2)
Country | Link |
---|---|
EP (1) | EP2076857A1 (fr) |
WO (1) | WO2008037914A1 (fr) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106095795A (zh) * | 2016-05-31 | 2016-11-09 | 成都德善能科技有限公司 | 一种基于物理地址的就医查询系统及查询方法 |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111065115B (zh) * | 2019-12-04 | 2023-03-14 | 哈尔滨海能达科技有限公司 | 调度系统资源树生成方法、调度装置及计算机存储介质 |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6700574B1 (en) * | 1999-10-29 | 2004-03-02 | Siemens Transportation Systems, Inc. | Spatial data object indexing engine |
KR100574652B1 (ko) * | 2003-10-01 | 2006-04-28 | 팅크웨어(주) | 지도 검색 서비스 제공 방법 및 시스템 |
-
2007
- 2007-09-21 WO PCT/FR2007/051994 patent/WO2008037914A1/fr active Application Filing
- 2007-09-21 EP EP07848364A patent/EP2076857A1/fr not_active Withdrawn
Non-Patent Citations (1)
Title |
---|
See references of WO2008037914A1 * |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106095795A (zh) * | 2016-05-31 | 2016-11-09 | 成都德善能科技有限公司 | 一种基于物理地址的就医查询系统及查询方法 |
Also Published As
Publication number | Publication date |
---|---|
WO2008037914A1 (fr) | 2008-04-03 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
AU2001259979B2 (en) | Method and system for providing geographically targeted information and advertising | |
US10182108B2 (en) | Obtaining and displaying virtual earth images | |
US9384291B2 (en) | Generating geographical keywords for geotargeting search engine-offered advertisements | |
US9746342B2 (en) | Systems and methods for generating electronic map displays with points-of-interest based on density thresholds | |
US7761350B1 (en) | Biasing of search result clustering to ensure more effective point of interest (POI) targeting | |
US9400189B2 (en) | Systems and methods for generating electronic map displays with points-of-interest information | |
CA2782369C (fr) | Recherche basee sur une localisation | |
US20160097654A1 (en) | Systems and methods for generating electronic map displays with points-of-interest information based on reference locations | |
US20100305855A1 (en) | Location relevance processing system and method | |
US20100302056A1 (en) | Location discovery system and method | |
US20130311460A1 (en) | Systems and methods to sort information related to entities having different locations | |
FR2840088A1 (fr) | Moteur de recherche et base de donnees, et procedes pour leur mise en oeuvre | |
US20090265345A1 (en) | Systems and methods for generating user specified information from a map | |
KR20130031387A (ko) | 맵에서의 엔티티 기반 탐색 결과 및 클러스터 | |
FR2797066A1 (fr) | Procede, systeme et produit logiciel pour chainer dynamiquement des ressources lorsque des copies sont conservees en differents sites de stockage | |
US20010051973A1 (en) | System, method and computer program product for a locator service | |
EP2076857A1 (fr) | Procédé et serveur de recherche d'un centre d'intérêt d'un utilisateur dans une zone géographique | |
FR2882846A1 (fr) | Procede de localisation au sein d'un reseau d'un element associe a une position geographique, serveur de localisation et programme d'ordinateur correspondants | |
EP1110197A1 (fr) | Procede de visualisation de lieux geographiques | |
FR2984067A1 (fr) | Adaptation d'information contextuelle. | |
CN104866529A (zh) | 用于向移动设备提供位置相关内容的计算机实现的方法 | |
WO2023183005A1 (fr) | Carte temporelle pour une ambiance de quartier et d'entreprise régionale et une sémantique sociale | |
FR3004251A1 (fr) | Procede et systeme d'assistance a la gestion de taches et a la navigation | |
WO2011144435A1 (fr) | Système de traitement de données relatives à des bâtiments | |
WO2015155478A1 (fr) | Procédé et dispositif d'accès à de l'information locale par reconnaissance de plan |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20090420 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC MT NL PL PT RO SE SI SK TR |
|
RIN1 | Information on inventor provided before grant (corrected) |
Inventor name: CHERBONNEL, BENEDICTE Inventor name: MIQUEL, PAUL Inventor name: LE BRUN, GILLES Inventor name: LEPETIT, YANN Inventor name: MARISSAL, PIERRE Inventor name: NICOLAS, CELINE |
|
DAX | Request for extension of the european patent (deleted) | ||
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: ORANGE |
|
17Q | First examination report despatched |
Effective date: 20151013 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN |
|
18D | Application deemed to be withdrawn |
Effective date: 20160224 |