CN103902626A - Interest point search method and device and equipment with device - Google Patents
Interest point search method and device and equipment with device Download PDFInfo
- Publication number
- CN103902626A CN103902626A CN201210588046.0A CN201210588046A CN103902626A CN 103902626 A CN103902626 A CN 103902626A CN 201210588046 A CN201210588046 A CN 201210588046A CN 103902626 A CN103902626 A CN 103902626A
- Authority
- CN
- China
- Prior art keywords
- character
- node
- interest
- point
- information
- 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.)
- Granted
Links
Images
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/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
- G01C21/3476—Special cost functions, i.e. other than distance or default speed limit of road segments using point of interest [POI] information, e.g. a route passing visible POIs
Abstract
The invention relates to an interest point search method and device and equipment with the device. The method comprises the steps: S1, receiving the mth character input by a user, wherein m is an integer larger than 0 and the initial value of m is 1; S2, searching for a node where the mth character input by the user is located in the mth-stage node level of an index file block, and reading a character in a child node of the node as an associational character for the user to input selectively; S3, detecting whether the user inputs a new character, if the user inputs a new character, m=m+1, and the S1 and the S2 are executed repeatedly, and if the user does not input a new character and an inquiry instruction is received, an interest point is searched for according to the last received character. According to the method, the searching efficiency of the interest point is improved, and the resources are saved.
Description
Technical field
The present invention relates to searching system, relate in particular to a kind of interest point search method, interest point search device and the equipment with this interest point search device.
Background technology
Universal along with airmanship, people can be by the interested point of interest of the portable set such as mobile phone, computer quick-searching (Point of Interest, POI), for example, the position in city such as fast searching dining room, hotel, company, road etc.
In prior art, there are two kinds of interest point search methods, a kind of be based on tree indexing means, another kind is inverted index method.Indexing means based on tree for example, when data volume large (ten million magnitude), if what searching system need to support that in POI title, any one word starts searches, index data file is too huge, reduce recall precision, cannot be used for current PND(Portable Navigation Devices, Portable Automatic navigator) hardware platform.Inverted index cannot be supported character association function, cannot realize the quick location of searched targets, and because its data volume that need to store is large, higher to memory requirements.
Summary of the invention
Provide hereinafter about brief overview of the present invention, to the basic comprehension about some aspect of the present invention is provided.Should be appreciated that this general introduction is not about exhaustive general introduction of the present invention.It is not that intention is determined key of the present invention or pith, and nor is it intended to limit the scope of the present invention.Its object is only that the form of simplifying provides some concept, using this as the preorder in greater detail of discussing after a while.
A fundamental purpose of the present invention is to overcome the defect of prior art, and a kind of interest point search method and interest point search device that improves interest point search efficiency is provided.
Another fundamental purpose of the present invention is to overcome the defect of prior art, and a kind of equipment with this interest point search device is provided.
For achieving the above object, the invention provides a kind of interest point search method, comprising:
S1: receive m character of user's input, m is greater than 0 integer, and the initial value of m is 1;
S2: search the node at m character place of user input in the m level node layer of indexed file piece, and read character in the child node of this node as association's character, select to input for user;
S3: detect user and whether input new character, if so, make m=m+1, repeat S1 and S2;
S4: if user does not input new character, and receive query statement, according to last the character searching interest point receiving.
For achieving the above object, the present invention also provides a kind of interest point search device, comprising:
Memory module, comprising: index file piece, comprise at least one-level node layer, and each node of every grade of node layer stores a character;
Receive character module, receives m the character that user inputs, and the initial value of m is 1;
Association module, the m level node layer of indexed file piece is searched the node at m character place of user input, and reads character in the child node of this node as association's character, selects to input for user;
Detection module, detects user and whether inputs new character, if so, makes m=m+1;
Retrieval module: do not input new character and receive query statement in the case of user, according to last the character searching interest point receiving.
For achieving the above object, the present invention also provides a kind of equipment to comprise above-mentioned interest point search device.
Interest point search method of the present invention, interest point search device and the equipment with this device are stored in character in index file piece with the form of node layer, can realize input association function by the character reading in the child node of each character place node, and according to last the character searching interest point receiving, be convenient to quick-searching to interest point information, and without too huge data volume, therefore, promoted the efficiency of interest point search.
Accompanying drawing explanation
Below with reference to the accompanying drawings illustrate embodiments of the invention, can understand more easily above and other objects, features and advantages of the present invention.Parts in accompanying drawing are just in order to illustrate principle of the present invention.In the accompanying drawings, same or similar technical characterictic or parts will adopt same or similar Reference numeral to represent.
Fig. 1 is the process flow diagram of a kind of embodiment of interest point search method of the present invention.
Fig. 2 is the process flow diagram of the another kind of embodiment of interest point search method of the present invention.
Fig. 3 is the data store organisation schematic diagram of a kind of embodiment of memory module.
Fig. 4 is the block scheme of a kind of embodiment of interest point search device of the present invention.
Fig. 5 shows the exemplary plot of a kind of storage mode in point of interest title indexed file piece.
Embodiment
Embodiments of the invention are described with reference to the accompanying drawings.The element of describing in an accompanying drawing of the present invention or a kind of embodiment and feature can combine with element and feature shown in one or more other accompanying drawing or embodiment.It should be noted that for purposes of clarity, in accompanying drawing and explanation, omitted expression and the description of unrelated to the invention, parts known to persons of ordinary skill in the art and processing.
The invention provides a kind of interest point search method, comprising:
S1: receive m character of user's input, m is greater than 0 integer, and the initial value of m is 1;
S2: search the node at m character place of user input in the m level node layer of indexed file piece, and read character in the child node of this node as association's character, select to input for user;
S3: detect user and whether input new character, if so, make m=m+1, repeat S1 and S2;
S4: if user does not input new character, and receive query statement, according to last the character searching interest point receiving.
Alternatively, index file piece is used for storing point of interest title, and index file piece comprises first order node layer to the n level node layer successively, and n is greater than 0 integer; Every grade of node layer comprises that at least one stores the node of a character and the address information corresponding with this character, at least one node in node layer to the n level node layer of the second level has father node in its previous stage node layer, the character of storing in an each father node and one node is wherein two continuous characters of a point of interest title, corresponding at least one interest point information of each point of interest title;
Each interest point information is stored in solid data blocks of files, and address information corresponding to each character is for determining the corresponding interest point information of point of interest title that this character place node the is corresponding memory location in solid data blocks of files.
Alternatively, before the 1st character of reception user input, also comprise:
The character reading in first order node layer is selected input for user.
Alternatively, be specially according to last the character searching interest point receiving:
According to the address information of last the character place node storage receiving, in inverted index data block, obtain the offset information of each interest point information in solid data blocks of files, in solid data blocks of files, obtain the corresponding interest point information of point of interest title that this node is corresponding according to offset information, address information is first offset information that point of interest title that this node is corresponding is pointed in inverted index data block; Or
According to the address information of last the character place node storage receiving, in solid data blocks of files, obtain the corresponding interest point information of point of interest title that this node is corresponding, address information is the start address that the corresponding interest point information of point of interest title that this node is corresponding is stored in solid data blocks of files.
Alternatively, first order node layer stores the character in all point of interest titles.
Alternatively, the point of interest title of storing in index file piece is different, and multiple interest point information Coutinuous stores corresponding to same point of interest title are in solid data blocks of files.
Interest point search device of the present invention can be applicable to the hardware device of various support navigation features, for example, can be applicable to mobile phone, computer, automatic navigator etc. and carries out POI(Point of Interest, point of interest) retrieve, locate.
With reference to figure 1, a kind of embodiment of interest point search method of the present invention comprises the following steps:
S1: receive m character of user's input, m is greater than 0 integer, and the initial value of m is 1.
S2: search the node at m character place of user input in the m level node layer of indexed file piece, and read character in the child node of this node as association's character, select to input for user;
S3: detect user and whether input new character, if so, make m=m+1, repeat S1 and S2;
S4: if user does not input new character, and receive query statement, according to last the character searching interest point receiving.
With reference to figure 2, alternatively, before step S1, also comprise:
S0: the character reading in first order node layer is selected input as association's character for user.For example, open after interest point search function user, interest point search device receives start signal, read the character in all nodes in first order node layer, and the display that the character reading is sent to this device or equipment is shown, user can select one to input to receive character module in the character showing.By this step, can after opening interest point search device, read association's character and select for user the first character that will input, without manually writing, make the use of interest point search more friendly, also promote recall precision.
When user need to retrieve for example point of interest " Tian An-men ", and while obtaining the interest point information in " Tian An-men ", first input character " " my god "; input character " peace " again; the first character that step S1 receives is " " my god ", second character is " peace ", if user continues input character " door ", the 3rd character receiving in step S1 is " door "; Also input character " peace " first of user, then input character " door ", the first character that step S1 receives is " peace ", second character is " door ".
In step S2, when receive first character for example " my god " time, in index file piece 14 as shown in Figure 3, search character " my god " node at place, and read character in the child node of this node as association's character, select input for user.For example, when character " my god " association's character in the child node of place node is while comprising respectively D score, " peace ", user can select input character " peace ".
Find user input first character " my god " after, detect whether there is new character input by execution step S3, when retrieving the new character of input, for example when " peace ", make the value of m add 1, and perform step S1 and S2, to receive this new character (second character) " peace ", and in indexed file piece 14, search the node at character " peace " place, and read character in the child node of this node as association's character, select input for user.
If user think according to input character " my god " and " peace " enough found point of interest " Tian An-men ", can not continue input character and start inquiry, in step S3, detect and there is no new character input, if now query function is activated, perform step S4 to search point of interest according to last character " peace " receiving " Tian An-men ".
The data store organisation of a kind of embodiment to the memory module 10 shown in Fig. 3 is described in detail below, and this memory module 10 comprises index file piece 14 as shown in Figure 3, also comprises solid data blocks of files 12.
Solid data blocks of files 12 is for storing the entity information of point of interest, it is interest point information, this interest point information can comprise, for example point of interest title, the particular location of point of interest in certain city, the information such as the classification of distance, track route and/or this point of interest of the current position of distance users, when this interest point information is read for user while checking, user can be according to content wherein quick locating points of interest.
Each interest point information has default memory address in solid data blocks of files 12, has default side-play amount.Particularly, when point of interest title that multiple interest point informations are corresponding is identical, the plurality of interest point information Coutinuous store, as long as find the reference position of the plurality of interest point information of Coutinuous store, can read any one in the plurality of interest point information fast.
As shown in Figure 3, index file piece 14 is for the character of the version storage point of interest title with " tree ".
Should " tree " can comprise first order node layer to the n level node layer C1-Cn, n is greater than 0 integer, the value (or degree of depth of tree) of n can be determined by the longest point of interest title of storing, for example, for example, in the time that a certain point of interest has the longest character length (having maximum Chinese characters), this length is the value of n.
Every grade of node layer comprises one or more nodes, stores one and be included in a character in point of interest title in each node.M the character receiving in step S1 is the character being stored in m level node layer, and m is greater than 0 and be less than or equal to n.Therefore, in step S2, user can in first order node layer, search character " my god " node at place, in the node layer of the second level, search the node at character " peace " place, by that analogy.
The vertically storage in " tree " in order of character in each point of interest title,, part or all of node in node layer to the n level node layer of the second level has corresponding father node in its previous stage node layer, and the character of storing in an each father node and one node is wherein two continuous characters of a point of interest.For example, when the character receiving in step S1 " my god " time, in step S2 character " my god " association's character of reading in the child node of place node both can comprise " peace ", also can comprise D score (all over the world), " my god " (everyday) etc.
In the example in above-mentioned " Tian An-men ", if user continues input " door " afterwards at input character " peace ", because " door " is last character of this point of interest, do not associate character for reading, in step S3, there is no the input of new character by being defaulted as, automatically start query function, and in step S4 according to this last character " door " searching interest point.
Wherein in first order node layer C1, store the character occurring in all point of interest titles.Therefore, in the time searching for example point of interest " Tian An-men ", both can character " my god " start to search, also can start to search by character " peace ".
In each node, also store and the corresponding address information of character wherein, this address information can be the corresponding interest point information of point of interest title that corresponding character place node the is corresponding start address in solid data blocks of files, or be the information of falling row, respectively both of these case be described below:
As shown in Figure 3, when address information is when arranging information, memory module 10 also comprises inverted index data block 16, for storing the offset information of each interest point information in solid data blocks of files, according to this offset information, can be in solid data file fast finding to the memory address of the entity information of this target point of interest of storage.
Each point of interest title that in index file piece 14, each node is corresponding is pointed to a corresponding offset information in inverted index data block 16.The information of falling row that each character is corresponding is: the reference position that the point of interest title that this character place node is corresponding is pointed in inverted index data block 16, first offset information of pointing to.For example, the information of falling row that character " peace " is corresponding can comprise the reference position that reference position that point of interest " Tian An-men " points in inverted index data block 16 and point of interest " Tian An square " point in inverted index data block 16, when " Tian An square " has multiple, be that multiple points of interest are while having identical title, corresponding multiple offset information are deposited continuously, and this point of interest title " Tian An square " is in inverted index data block 16 middle fingers first offset information wherein.
Therefore, when arranging information, when execution step S4, according to the information of falling row corresponding to last character receiving, obtain the address of corresponding interest point information in solid data blocks of files 12 in address information corresponding to character.
As the optional embodiment of one, also can directly by the corresponding interest point information of point of interest title corresponding each character place node, the start address in solid data blocks of files 12 be stored in corresponding node, for example, can be in the node of store character " peace " interest point information of storage " Tian An-men " the simultaneously start address in solid data blocks of files 12, and the start address of the interest point information on " Tian An square " in solid data blocks of files 12.
In this optional embodiment, when execution step S4, can, directly according to the start address of storing in last character place node of input, in solid data blocks of files 12, obtain interest point information.
Multiple interest point information Coutinuous stores corresponding to same point of interest title are in solid data blocks of files 12.The address information of therefore, storing in the node of each character place is the corresponding interest point information of point of interest title that this node the is corresponding start address in solid data blocks of files 12; Or the offset information Coutinuous store of multiple interest point informations with same interest point title in solid data blocks of files 12 is in inverted index data block 16.And this point of interest title can only be stored once in indexed file piece 14, and the offset information with the plurality of interest point information of same interest point title is deposited continuously in inverted index data block 16, store address information in the node of the each character in this point of interest title and be this point of interest title inverted index data block 16 pointed be first in multiple offset information of depositing continuously.For example, when point of interest A, B, C, D have identical point of interest title, point of interest A, B, C, the D offset information Coutinuous store in solid data blocks of files 12 is in inverted index data block 16, if the offset information of this Coutinuous store is respectively d, (d+1), (d+2), (d+3), this point of interest title is pointed to offset information d.According to this offset information d, can in solid data blocks of files 12, read by the entity information of quick locating points of interest A, B, C, D.
The present invention also provides a kind of interest point search device, comprising:
Memory module, comprising: index file piece, comprise at least one-level node layer, and each node of every grade of node layer stores a character;
Receive character module, receives m the character that user inputs, and the initial value of m is 1;
Association module, the m level node layer of indexed file piece is searched the node at m character place of user input, and reads character in the child node of this node as association's character, selects to input for user;
Detection module, detects user and whether inputs new character, if so, makes m=m+1;
Retrieval module: do not input new character and receive query statement in the case of user, according to last the character searching interest point receiving.
Alternatively, memory module also comprises solid data blocks of files, for storing interest point information;
Index file piece is used for storing point of interest title, and index file piece comprises first order node layer to the n level node layer successively, and n is greater than 0 integer; Every grade of node layer comprises that at least one stores the node of a character and the address information corresponding with this character, at least one node in node layer to the n level node layer of the second level has father node in its previous stage node layer, and the character of storing in an each father node and one node is wherein two continuous characters of a point of interest title;
Address information corresponding to each character is for determining the corresponding interest point information of point of interest title that this character place node the is corresponding memory location in solid data blocks of files.
Alternatively, first order node layer stores the character in all point of interest titles.
Alternatively, the point of interest title of storing in index file piece is different, and multiple interest point information Coutinuous stores corresponding to same point of interest title are in described solid data blocks of files.
Alternatively, memory module also comprises inverted index data block, for storing the offset information of each interest point information in described solid data blocks of files, the address information that each character is corresponding is first offset information that point of interest title that its place node is corresponding is pointed in described inverted index data block.
Alternatively, the address information that each character is corresponding is the start address that the corresponding interest point information of point of interest title that its place node is corresponding is stored in solid data blocks of files.
With reference to figure 4, the first embodiment of interest point search device of the present invention comprises this memory module 10, receive character module 20, association module 30, detection module 40 and retrieval module 50.
In the present embodiment, memory module 10 can be the storer in the equipment of being located at this interest point search device of application, and it comprises solid data blocks of files 12, index file piece 14, alternatively, also can comprise inverted index data block 16.
Solid data blocks of files 12 is for storing the entity information of point of interest, it is interest point information, this interest point information can comprise, for example point of interest title, the particular location of point of interest in certain city, the information such as the classification of distance, track route and/or this point of interest of the current position of distance users, when this interest point information is read for user while checking, user can be according to content wherein quick locating points of interest.
Each interest point information has default memory address in solid data blocks of files 12, has default side-play amount.Particularly, when point of interest title that multiple interest point informations are corresponding is identical, the plurality of interest point information Coutinuous store, as long as find the start address of the plurality of interest point information of Coutinuous store, can read any one in the plurality of interest point information fast.
Inverted index data block 16 is for storing the offset information of each interest point information in solid data blocks of files, according to this offset information, can be in solid data file fast finding to the address of the entity information of this target point of interest of storage.Each point of interest title of storing in index file piece 14 is pointed to a corresponding offset information in inverted index data block 16, that is, each character place point of interest title corresponding to node pointed to an offset information.In other embodiments, also can directly the memory address of this interest point information be stored in the node at corresponding character place, and without the mode that adopts inverted index.
Storage mode in each point of interest title indexed file piece 14 has done detailed introduction above, the example providing below in conjunction with Fig. 5 is further described it:
As shown in Figure 5, take point of interest title " Oriental Pearl ", " Donglaishun ", " East Asia hotel ", " east aviation " as example, because the longest point of interest name is called 5, the degree of depth of " tree " can be 5, and in the time having root node, the degree of depth of " tree " can be 6.
In first order node layer C1, the node of store character " east " has three child nodes in the node layer C2 of the second level, is respectively used to store character " side ", " coming " and " Asia ".The start address of the interest point information that wherein the corresponding address information of character " side " can be point of interest title " Oriental Pearl " that its place node is corresponding and " east aviation " in solid data blocks of files 16, also can be point of interest title " Oriental Pearl " and " east aviation " reference position of sensing in inverted index data block 16 respectively that its place node is corresponding, interest is called the roll and is claimed first offset information that " Oriental Pearl " and " east aviation " points in inverted index data block 16.The corresponding address information of character " Asia " can be first offset information that " East Asia hotel " points in inverted index data block 16, or the start address of the interest point information of " East Asia hotel " in solid data blocks of files.
In the node layer C2 of the second level, the node of store character " side " has two child nodes in third level node layer C3, be respectively used to store character " bright " and " boat ", the node that store character " comes " has a child node in third level node layer C3, for store character " suitable ", the node of store character " Asia " has a child node in third level node layer C3, for store character " greatly ".
In third level node layer C3, the node of store character " greatly " has a child node in fourth stage node layer C4, for store character " wine "; The node of store character " bright " has a child node in fourth stage node layer C4, and for store character " pearl ", the node of store character " suitable " does not have child node or child node for empty in fourth stage node layer C4.
In fourth stage node layer C4, the node of store character " wine " has a child node in level V node layer C5, for store character " shop "; The node of store character " pearl " does not have child node or child node for empty in level V node layer C5.
Alternatively, in above-mentioned node layer at different levels, character in the child node of any node can be according to the order sequence of the character length increasing or decreasing of the point of interest title at its place, the node of store character in first order node layer " east " is example, the character " side " of storing in its child node, " come " " Asia ", because point of interest title " East Asia hotel " character length at character " Asia " place is the longest, the point of interest title " Oriental Pearl " at character " side " place and " east aviation " length are taken second place, it is the shortest that character " carrys out " point of interest title " Donglaishun " length at place, therefore the character in the child node of character " east " place node is followed successively by " Asia ", " side " " comes ".In the time that character length is identical, character in the child node of corresponding node can be according to the sequence of spelling lexicographic order, for example, in some layer of the second level, store character " bright " and " boat " in the child node of character " side " place node, due to the spelling letter of character " boat " at character " bright " before, character " boat " place node is at character " boat " before.
Alternatively, in above-mentioned node layer at different levels, the character in the child node of any node can be spelt alphabetical order sequence according to it, and the character that spelling letter is identical can be according to the order sequence of the character length increasing or decreasing of the point of interest title at its place.
Receive character module 20 is for receiving m character of user's input, and the initial value of m is 1.Particularly, user can be by the input equipment of the hardware device of this interest point search device of carrying to receive character module 20 input characters.The input equipment of this hardware device can be keyboard, touch-screen, mouse etc.
Association module 30 is for searching the node at m character place of user input, and reads character in the child node of this node as association's character, selects to input for user.Particularly, association module 30 is for searching m character of user's input at m agent node.
Whether detection module 40 inputs new character for detection of user, if so, makes m=m+1.
Particularly, when association module 30 reads after the first character of user input, m is 1, searches the node at this first character place in first order node layer, and reads character in the child node of this node as association's character; When user selects or inputs second character to receive character module 10 in association's character, detection module 40 makes m add 1, association module 30 is searched the node at second character place in the node layer of the second level, and read character in the child node of this node as association's character, circulate with this, there is no new character input until detection module 40 detects, and start query function.In the present embodiment, when association module 30 is no longer when reading character, detection module 40 acquiescences do not have new character input, trigger retrieval module 50 and work, to start search function.Retrieval module 50 also can directly receive user's query statement and work to trigger retrieval module 50, and particularly, user can be by the input equipment of the hardware device of this interest point search device of carrying to retrieval module 50 input inquiry instructions.
For partial character, the point of interest name at its place is called multiple, and the address information that this character is corresponding represents multiple side-play amounts; And for another part character, the point of interest title at its place only has one, the address information that this character is corresponding is pointed to a side-play amount.For two nodes of father and son, point of interest title corresponding to the information of falling row in child node is less, the offset information of pointing to is also less, therefore, retrieval module 50 obtains the address of corresponding interest point information in solid data blocks of files 12 according to the corresponding address information of character below in same point of interest title, compare character above, operand is little and can obtain and the immediate information of searched targets.
For example, when user successively input character " east ", " side ", " bright ", " pearl ", the address information that this character " pearl " is corresponding can be: the start address of the interest point information of " Oriental Pearl " in solid data blocks of files 12; And address information corresponding to character " side " is: the interest point information start address in solid data blocks of files 12 respectively of the point of interest title " Oriental Pearl " at its place and " east aviation "; Visible, retrieval module 50 can obtain interest point information according to address information corresponding to character " pearl ", can find more quickly and accurately " Oriental Pearl " information, for reference.
Therefore,, when retrieval module 50 is worked, address information corresponding to last character receiving according to receive character module 20, obtains the address of corresponding interest point information in solid data blocks of files 12, and reads the interest point information under this address.
Alternatively, the friendliness using in order to promote user, association module 30 can be after starting interest point search device of the present invention, and the character reading before user inputs character in first order node layer is selected for user as association's character.
The present invention also provides a kind of equipment, comprises above-mentioned interest point search device.
Alternatively, the said equipment is Portable Automatic navigator, CPND(Connectable Portable Navigation Devices, Portable Automatic navigator that can communication), hand-held navigator, GIS(Geographic Information System) data acquisition equipment.
Interest point search method of the present invention, device and the equipment with this device are stored in character in index file piece with the form of node layer, can realize input association function by the character reading in the child node of each character place node, and according to last the character searching interest point receiving, be convenient to quick-searching to interest point information, and without too huge data volume, therefore, promoted the efficiency of interest point search.
In the system and method for the present invention, obviously, each parts or each step reconfigure after can decomposing, combine and/or decomposing.These decomposition and/or reconfigure and should be considered as equivalents of the present invention.Simultaneously, in the above in the description of the specific embodiment of the invention, describe and/or the feature that illustrates can be used in same or similar mode in one or more other embodiment for a kind of embodiment, combined with the feature in other embodiment, or substitute the feature in other embodiment.
Should emphasize, term " comprises/comprises " existence that refers to feature, key element, step or assembly while use herein, but does not get rid of the existence of one or more further feature, key element, step or assembly or add.
Although described the present invention and advantage thereof in detail, be to be understood that in the case of not exceeding the spirit and scope of the present invention that limited by appended claim and can carry out various changes, alternative and conversion.And scope of the present invention is not limited only to the specific embodiment of the described process of instructions, equipment, means, method and step.One of ordinary skilled in the art will readily appreciate that from disclosure of the present invention, can use the essentially identical function of corresponding embodiment or process, equipment, means, method or the step acquisition result essentially identical with it, that existing and will be developed future carried out with at this according to the present invention.Therefore, appended claim is intended to comprise such process, equipment, means, method or step in their scope.
Claims (13)
1. an interest point search method, is characterized in that, comprising:
S1: receive m character of user's input, m is greater than 0 integer, and the initial value of m is 1;
S2: search the node at m character place of user input in the m level node layer of indexed file piece, and read character in the child node of this node as association's character, select to input for user;
S3: detect user and whether input new character, if so, make m=m+1, repeat S1 and S2;
S4: if user does not input new character, and receive query statement, according to last the character searching interest point receiving.
2. interest point search method according to claim 1, is characterized in that,
Described index file piece is used for storing point of interest title, and described index file piece comprises first order node layer to the n level node layer successively, and n is greater than 0 integer; Every grade of node layer comprises that at least one stores the node of a character and the address information corresponding with this character, at least one node in node layer to the n level node layer of the second level has father node in its previous stage node layer, the character of storing in an each father node and one node is wherein two continuous characters of a point of interest title, corresponding at least one interest point information of each described point of interest title;
Each described interest point information is stored in solid data blocks of files, and address information corresponding to each described character is for determining the corresponding interest point information of point of interest title that this character place node the is corresponding memory location in described solid data blocks of files.
3. interest point search method according to claim 2, is characterized in that, the 1st character that receives user's input also comprises before:
The character reading in first order node layer is selected input for user.
4. interest point search method according to claim 2, is characterized in that, is specially according to last the character searching interest point receiving:
According to the address information of last the character place node storage receiving, in inverted index data block, obtain the offset information of each described interest point information in described solid data blocks of files, in described solid data blocks of files, obtain the corresponding interest point information of point of interest title that this node is corresponding according to described offset information, described address information is first offset information that point of interest title that this node is corresponding is pointed in inverted index data block; Or
According to the address information of last the character place node storage receiving, in described solid data blocks of files, obtain the corresponding interest point information of point of interest title that this node is corresponding, described address information is the start address that the corresponding interest point information of point of interest title that this node is corresponding is stored in described solid data blocks of files.
5. interest point search method according to claim 2, is characterized in that, described first order node layer stores the character in all described point of interest titles.
6. interest point search method according to claim 2, is characterized in that, the point of interest title of storing in described index file piece is different, and multiple interest point information Coutinuous stores corresponding to same point of interest title are in described solid data blocks of files.
7. an interest point search device, is characterized in that, comprising:
Memory module, comprising: index file piece, comprise at least one-level node layer, and each node of every grade of node layer stores a character;
Receive character module, receives m the character that user inputs, and the initial value of m is 1;
Association module, searches the node at m character place of user input in the m level node layer of described index file piece, and reads character in the child node of this node as association's character, selects to input for user;
Detection module, detects user and whether inputs new character, if so, makes m=m+1;
Retrieval module: do not input new character and receive query statement in the case of user, according to last the character searching interest point receiving.
8. interest point search device according to claim 7, is characterized in that,
Described memory module also comprises solid data blocks of files, for storing interest point information;
Described index file piece is used for storing point of interest title, and described index file piece comprises first order node layer to the n level node layer successively, and n is greater than 0 integer; Every grade of node layer comprises that at least one stores the node of a character and the address information corresponding with this character, at least one node in node layer to the n level node layer of the second level has father node in its previous stage node layer, and the character of storing in an each father node and one node is wherein two continuous characters of a point of interest title;
Address information corresponding to each described character is for determining the corresponding interest point information of point of interest title that this character place node the is corresponding memory location in described solid data blocks of files.
9. interest point search device according to claim 8, is characterized in that, described first order node layer stores the character in all described point of interest titles.
10. interest point search device according to claim 8, is characterized in that, the point of interest title of storing in described index file piece is different, and multiple interest point information Coutinuous stores corresponding to same point of interest title are in described solid data blocks of files.
11. interest point search devices according to claim 8, it is characterized in that, described memory module also comprises inverted index data block, for storing the offset information of each interest point information in described solid data blocks of files, the address information that each character is corresponding is first offset information that point of interest title that its place node is corresponding is pointed in described inverted index data block.
12. interest point search devices according to claim 8, is characterized in that, the address information that each character is corresponding is the start address that the corresponding interest point information of point of interest title that its place node is corresponding is stored in described solid data blocks of files.
13. 1 kinds of equipment, is characterized in that, comprise the interest point search device described in claim 7-12 any one.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210588046.0A CN103902626B (en) | 2012-12-30 | 2012-12-30 | Interest point search method, device and the equipment with the device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210588046.0A CN103902626B (en) | 2012-12-30 | 2012-12-30 | Interest point search method, device and the equipment with the device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103902626A true CN103902626A (en) | 2014-07-02 |
| CN103902626B CN103902626B (en) | 2018-04-06 |
Family
ID=50993953
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210588046.0A Active CN103902626B (en) | 2012-12-30 | 2012-12-30 | Interest point search method, device and the equipment with the device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103902626B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105550285A (en) * | 2015-12-10 | 2016-05-04 | 北京奇虎科技有限公司 | Method and device for building POI dictionary |
| CN106874333A (en) * | 2016-08-11 | 2017-06-20 | 阿里巴巴集团控股有限公司 | Character string storage, search method and device |
| CN108363698A (en) * | 2018-03-13 | 2018-08-03 | 腾讯大地通途（北京）科技有限公司 | Point of interest relation recognition method and device |
| CN110019645A (en) * | 2017-09-28 | 2019-07-16 | 北京搜狗科技发展有限公司 | Index base construction method, searching method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1783066A (en) * | 2004-11-29 | 2006-06-07 | 佛山市顺德区瑞图万方科技有限公司 | Method for establishing associated input system and correspondent associated input system and method |
| CN102110125A (en) * | 2009-12-29 | 2011-06-29 | 比亚迪股份有限公司 | Retrieval method for quickly searching points of interest according to Chinese characters |
| CN102147795A (en) * | 2010-02-05 | 2011-08-10 | 北京四维图新科技股份有限公司 | Method and device for searching points of interest as well as navigation system |
| CN102591984A (en) * | 2012-01-10 | 2012-07-18 | 武汉光庭科技有限公司 | Optimizing method of query speed of point of interest data in navigation data |
| CN102759988A (en) * | 2011-04-27 | 2012-10-31 | 北京四维图新科技股份有限公司 | Dynamic pinyin feedback method and device |
-
2012
- 2012-12-30 CN CN201210588046.0A patent/CN103902626B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1783066A (en) * | 2004-11-29 | 2006-06-07 | 佛山市顺德区瑞图万方科技有限公司 | Method for establishing associated input system and correspondent associated input system and method |
| CN102110125A (en) * | 2009-12-29 | 2011-06-29 | 比亚迪股份有限公司 | Retrieval method for quickly searching points of interest according to Chinese characters |
| CN102147795A (en) * | 2010-02-05 | 2011-08-10 | 北京四维图新科技股份有限公司 | Method and device for searching points of interest as well as navigation system |
| CN102759988A (en) * | 2011-04-27 | 2012-10-31 | 北京四维图新科技股份有限公司 | Dynamic pinyin feedback method and device |
| CN102591984A (en) * | 2012-01-10 | 2012-07-18 | 武汉光庭科技有限公司 | Optimizing method of query speed of point of interest data in navigation data |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105550285A (en) * | 2015-12-10 | 2016-05-04 | 北京奇虎科技有限公司 | Method and device for building POI dictionary |
| CN105550285B (en) * | 2015-12-10 | 2018-12-14 | 北京奇虎科技有限公司 | Construct the method and device of POI dictionary |
| CN106874333A (en) * | 2016-08-11 | 2017-06-20 | 阿里巴巴集团控股有限公司 | Character string storage, search method and device |
| CN110019645A (en) * | 2017-09-28 | 2019-07-16 | 北京搜狗科技发展有限公司 | Index base construction method, searching method and device |
| CN108363698A (en) * | 2018-03-13 | 2018-08-03 | 腾讯大地通途（北京）科技有限公司 | Point of interest relation recognition method and device |
| CN108363698B (en) * | 2018-03-13 | 2021-05-14 | 腾讯大地通途（北京）科技有限公司 | Method and device for identifying relation of interest points |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103902626B (en) | 2018-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110008300B (en) | Method and device for determining alias of POI (Point of interest), computer equipment and storage medium | |
| CN100376871C (en) | Map information retrieving | |
| CN101968789A (en) | Method and system for browsing data and computer program product used thereby | |
| CN104112020A (en) | Frame type retrieval method for navigation equipment | |
| CN102456055B (en) | Method and device for retrieving interest points | |
| CN102831224B (en) | Generation method and device are suggested in a kind of method for building up in data directory library, search | |
| CN101873525A (en) | Method and device for storing contact information in mobile terminal | |
| CN103902626A (en) | Interest point search method and device and equipment with device | |
| US7218246B2 (en) | Map display device and program therefor | |
| US20110022989A1 (en) | Method and system for navigating data and storage medium using the method | |
| CN106326233A (en) | Address prompting method and device | |
| JP2010225035A (en) | Device, method, and program for searching information | |
| JP4524327B1 (en) | Information search apparatus and information search program | |
| CN103914455A (en) | Method and device for retrieving interest points | |
| CN101726312A (en) | Method and device for retrieving interest points | |
| EP2783308A1 (en) | Full text search based on interwoven string tokens | |
| JP4873529B2 (en) | Facility search apparatus and method and program thereof | |
| CN108920610B (en) | Novel indexing method and device | |
| CN102999596A (en) | Method, system and terminal for searching text label | |
| CN113449055A (en) | Map retrieval method, system and related equipment | |
| KR101050400B1 (en) | Index database device for initial search, string search system and method using same | |
| CN101769752A (en) | Search method of intersection | |
| Au Yeung et al. | Web search disambiguation by collaborative tagging | |
| JP4469410B1 (en) | Information search apparatus, information search method, and computer program | |
| CN105243115B (en) | Orientation on map method, Orientation on map device and terminal |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20180129 Address after: Shanghai City, Minhang District Pujiang 201112 Wan Fang Town No. 651 unit 4 floor Applicant after: Shanghai Unistrong Technology Co., Ltd. Address before: 1-3 building 159 unit 12-13, 200233 Shanghai city Xuhui District Tianzhou Road Applicant before: Shanghai Yiluo Information Science and Technology Co., Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |