CN111008341A

CN111008341A - Data search processing method and device, electronic equipment and storage medium

Info

Publication number: CN111008341A
Application number: CN201911071853.3A
Authority: CN
Inventors: 唐笑龙
Original assignee: Beike Technology Co Ltd
Current assignee: Beike Technology Co Ltd
Priority date: 2019-11-05
Filing date: 2019-11-05
Publication date: 2020-04-14

Abstract

The embodiment of the disclosure discloses a data search processing method and device, an electronic device and a storage medium, wherein the method comprises the following steps: searching based on the search condition in the search request to obtain related information of at least one target object; the related information of the target object comprises the geographical position information of the target object; clustering the at least one target object based on the geographic position information of the at least one target object to obtain at least one group which is not overlapped when the at least one target object is displayed in a map by using a current scale; wherein a group comprises one or more target objects, and the scale is the ratio between the length of a line segment on the map and the length of a corresponding line segment in the actual scene represented; and displaying the target object with the highest ranking score in each group of the at least one group in the map. The embodiment of the disclosure can avoid mutual occlusion among the groups and can display the target object with the highest ranking score in each group.

Description

Data search processing method and device, electronic equipment and storage medium

Technical Field

The present disclosure relates to data processing technologies, and in particular, to a data search processing method and apparatus, an electronic device, and a storage medium.

Background

With the development of software technology, various search applications (such as software programs, browsers, etc.) have been developed, and various search functions are provided for users, so that convenience is provided for various aspects of life, work, etc. of the users. The user may search for a certain target object in the search class application, for example, the user may search for food, shopping malls, banks, etc. near a certain location in the map class application, may search for properties of a certain area or cell in the property business class application, etc., wherein the search result with the geographical location information is displayed in the map scene.

Disclosure of Invention

The embodiment of the disclosure provides a data search processing method and device, electronic equipment and a storage medium.

In one aspect provided by the embodiments of the present disclosure, a data search processing method is provided, including:

searching based on the search condition in the search request to obtain related information of at least one target object; the related information of the target object comprises the geographical position information of the target object;

clustering the at least one target object based on the geographic position information of the at least one target object to obtain at least one group which is not overlapped when the at least one target object is displayed in a map by using a current scale; wherein a group comprises one or more target objects, and the scale is the ratio between the length of a line segment on the map and the length of a corresponding line segment in the actual scene represented;

and displaying the target object with the highest ranking score in each group of the at least one group in the map.

Optionally, in the data search processing method of any embodiment, the method further includes:

in response to detecting that the scale changes, taking the changed scale as a current scale, starting to perform the operation of clustering the at least one target object based on the geographic position information of the at least one target object to obtain at least one group which does not overlap when the current scale is displayed in a map.

Optionally, in the data search processing method of any embodiment, after obtaining the related information of the at least one target object, the method further includes:

and acquiring the ranking score of each target object in the at least one target object according to a preset mode.

Optionally, in the data search processing method of any embodiment, the obtaining, according to a preset manner, a ranking score of each target object in the at least one target object includes:

obtaining a ranking score of each target object in the at least one target object based on the user portrait and/or data correlation; wherein the user representation includes user information of a user sending the search request; the data correlation is used to represent a correlation between a target object and the search condition.

Optionally, in the data search processing method of any embodiment, the obtaining a ranking score of each target object of the at least one target object based on the user representation and the data correlation includes:

and acquiring the ranking score of each target object in the at least one target object based on the user portrait and the data correlation and the weight of the user portrait and the data correlation.

Optionally, in the data search processing method of any embodiment, the geographic location information of the target object includes: longitude coordinates and latitude coordinates of a geographic location where the target object is located.

Optionally, in the data search processing method of any embodiment, the clustering the at least one target object based on the geographic location information of the at least one target object to obtain at least one group that does not overlap with each other when displayed in a map at a current scale includes:

respectively aiming at any two target objects in the at least one target object, calculating whether display marks of any two target objects are overlapped or not based on longitude coordinates and latitude coordinates of any two target objects, sizes of preset display marks and a current scale; the display mark is a display symbol of the target object on the map;

dividing the target objects with overlapping display marks into a group to obtain at least one group which is not overlapped when displayed in the map.

Optionally, in the data search processing method of any embodiment, the information related to the target object further includes: introduction information of the target object.

Optionally, in the data search processing method of any embodiment, the displaying, in the map, a target object with a highest ranking score in each of the at least one group includes:

displaying a display mark and introduction information of a target object with the highest ranking score in each group of the at least one group in the map; alternatively, the first and second electrodes may be,

displaying a display mark of a target object with the highest ranking score in each group of the at least one group in the map; in response to receiving a trigger signal for one showing mark, showing introduction information of a target object corresponding to the one showing mark in the map.

In another aspect provided by the embodiments of the present disclosure, a data search processing apparatus is provided, including:

the searching module is used for searching based on the searching condition in the searching request to obtain the related information of at least one target object; the related information of the target object comprises the geographical position information of the target object;

the clustering module is used for clustering the at least one target object based on the geographic position information of the at least one target object to obtain at least one group which is not overlapped when the current scale is displayed in a map; wherein a group comprises one or more target objects, and the scale is the ratio between the length of a line segment on the map and the length of a corresponding line segment in the actual scene represented;

and the display module is used for displaying the target object with the highest ranking score in each group of the at least one group in the map.

Optionally, in the data search processing apparatus of any embodiment, the clustering module is further configured to cluster the at least one target object based on the geographic location information of the at least one target object with the changed scale as a current scale when the scale is changed, so as to obtain at least one group that does not overlap with each other when the current scale is displayed in the map.

Optionally, in the data search processing apparatus of any embodiment, the apparatus further includes:

and the sorting module is used for acquiring the sorting score of each target object in the at least one target object according to a preset mode.

Optionally, in the data search processing apparatus of any embodiment, the sorting module is specifically configured to: obtaining a ranking score of each target object in the at least one target object based on the user portrait and/or data correlation; wherein the user representation includes user information of a user sending the search request; the data correlation is used to represent a correlation between a target object and the search condition.

Optionally, in the data search processing apparatus of any embodiment, the sorting module is specifically configured to: and acquiring the ranking score of each target object in the at least one target object based on the user portrait and the data correlation and the weight of the user portrait and the data correlation.

Optionally, in the data search processing apparatus of any embodiment, the geographic location information of the target object includes: longitude coordinates and latitude coordinates of a geographic location where the target object is located.

Optionally, in the data search processing apparatus of any embodiment, the clustering module is specifically configured to:

Optionally, in the data search processing apparatus of any embodiment, the information about the target object further includes: introduction information of the target object.

Optionally, in the data search processing apparatus of any embodiment, the presentation module is specifically configured to:

In another aspect provided by the embodiments of the present disclosure, an electronic device is provided, which includes:

a memory for storing a computer program;

and a processor, configured to execute the computer program stored in the memory, and when the computer program is executed, implement the data search processing method according to any of the above embodiments.

In a further aspect provided by the embodiments of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored, where the computer program is executed by a processor to implement the data search processing method according to any of the above embodiments.

Based on the data search processing method and apparatus, the electronic device, and the storage medium provided by the above embodiments of the present disclosure, after a search is performed based on a search condition in a search request to obtain related information of at least one target object, the at least one target object is clustered based on geographic position information of the at least one target object to obtain at least one group which is not overlapped with each other when displayed in a map by a current scale, and a target object with a highest ranking score in each group is displayed in the map. Therefore, the clustering of the target objects in the search results based on the geographic positions is realized, the non-overlapping groups are displayed in the map, the mutual shielding of the target objects among the groups can be avoided, and the display efficiency of the search results is improved; and only the target object with the highest ranking score is displayed in the same group, so that the target object with the highest user relevance is displayed for the user, the user experience is improved, and the search efficiency of the user and the application effect based on the search result are improved.

The technical solution of the present disclosure is further described in detail by the accompanying drawings and examples.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description, serve to explain the principles of the disclosure.

The present disclosure may be more clearly understood from the following detailed description, taken with reference to the accompanying drawings, in which:

fig. 1 is a flowchart of an embodiment of a data search processing method according to the present disclosure.

Fig. 2 is a flowchart of another embodiment of the data search processing method of the present disclosure.

Fig. 3 is a flowchart of another embodiment of the data search processing method of the present disclosure.

Fig. 4 is a schematic diagram illustrating a calculation of whether the presentation signs of two target objects intersect in the embodiment of the present disclosure.

Fig. 5 is a schematic diagram of a clustering process in an embodiment of the disclosure.

Fig. 6 is a schematic process diagram of an embodiment of the data search processing method of the present disclosure.

Fig. 7 is a schematic structural diagram of an embodiment of a data search processing apparatus according to the present disclosure.

Fig. 8 is a schematic structural diagram of another embodiment of the data search processing device of the present disclosure.

Fig. 9 is a block diagram of an electronic device of one embodiment of the present disclosure.

Detailed Description

Various exemplary embodiments of the present disclosure will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, the numerical expressions, and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless specifically stated otherwise.

It will be understood by those of skill in the art that the terms "first," "second," and the like in the embodiments of the present disclosure are used merely to distinguish one element from another, and are not intended to imply any particular technical meaning, nor is the necessary logical order between them.

It is also understood that in embodiments of the present disclosure, "a plurality" may refer to two or more and "at least one" may refer to one, two or more.

It is also to be understood that any reference to any component, data, or structure in the embodiments of the disclosure, may be generally understood as one or more, unless explicitly defined otherwise or stated otherwise.

In addition, the term "and/or" in the present disclosure is only one kind of association relationship describing an associated object, and means that three kinds of relationships may exist, for example, a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" in the present disclosure generally indicates that the former and latter associated objects are in an "or" relationship.

It should also be understood that the description of the various embodiments of the present disclosure emphasizes the differences between the various embodiments, and the same or similar parts may be referred to each other, so that the descriptions thereof are omitted for brevity.

Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the convenience of description.

The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses.

Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.

It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.

The disclosed embodiments may be applied to electronic devices such as terminal devices, computer systems, servers, etc., which are operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known terminal devices, computing systems, environments, and/or configurations that may be suitable for use with electronic devices, such as terminal devices, computer systems, servers, and the like, include, but are not limited to: personal computer systems, server computer systems, thin clients, thick clients, hand-held or laptop devices, microprocessor-based systems, set-top boxes, programmable consumer electronics, networked personal computers, minicomputer systems, mainframe computer systems, distributed cloud computing environments that include any of the above, and the like.

Electronic devices such as terminal devices, computer systems, servers, etc. may be described in the general context of computer system-executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, etc. that perform particular tasks or implement particular abstract data types. The computer system/server may be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in both local and remote computer system storage media including memory storage devices.

Summary of the application

In the process of implementing the present disclosure, the inventors find, through research, that the existing search application focuses on the completeness of the search result when returning the search result, and returns all the search results that can be displayed in a visual range. Because a map scene generally describes a target object by a "point tracing method", that is, points are found on a map by latitude and longitude, and the target object is displayed in a shape of a circle or an ellipse. However, for search results with the same geographic location or adjacent geographic locations, for example, for a house property, the longitude and latitude of many adjacent cells or the house property of the same cell are very close, so that the search result display in a map scene can be shielded and covered mutually, a user cannot acquire and identify the search results effectively, and the user experience is reduced.

In the embodiment of the disclosure, after the search result is obtained for the data with the geographic position attribute, the search result is subjected to data clustering according to the geographic position, and at least one group which is not overlapped with each other when displayed in a map is obtained, so that the data among the groups cannot be covered and blocked under the current scale, and the target object with the highest ranking score in the groups is displayed in the map, so that a user can pay attention to the search result which is most interested in under the same or similar geographic position.

Exemplary method

Fig. 1 is a flowchart of an embodiment of a data search processing method according to the present disclosure. As shown in fig. 1, the data search processing method of the embodiment includes:

and 102, searching based on the search condition in the search request to obtain the related information of at least one target object.

The related information of the target object comprises the geographical position information of the target object.

After a search result (i.e., the related information of the at least one target object) is obtained by performing a search based on the search condition in the search request, the related information of the at least one target object may be returned in the form of a data set.

And 104, clustering at least one target object based on the geographical position information of the at least one target object to obtain at least one group which does not overlap when the at least one target object is displayed in a map by using the current scale.

Wherein each group comprises one or more target objects; the scale (scale) is the ratio between the length of a line segment on the map and the length of the corresponding line segment in the actual scene represented.

And 106, displaying the target object with the highest ranking score in each group of the at least one group in the map.

Based on the data search processing method provided by the above embodiment of the present disclosure, after the search is performed based on the search condition in the search request to obtain the related information of at least one target object, the at least one target object is clustered based on the geographic location information of the at least one target object to obtain at least one group which is not overlapped with each other when displayed in the map by the current scale, and the target object with the highest ranking score in each group is displayed in the map. Therefore, the clustering of the target objects in the search results based on the geographic positions is realized, the non-overlapping groups are displayed in the map, the mutual shielding of the target objects among the groups can be avoided, and the display efficiency of the search results is improved; and only the target object with the highest ranking score is displayed in the same group, so that the target object with the highest user relevance is displayed for the user, the user experience is improved, and the search efficiency of the user and the application effect based on the search result are improved.

In the foregoing data search processing method embodiment, in operation 104, when the at least one searched target object is clustered for the first time, the current scale may be a scale preset in a device that executes the data search processing method embodiment of the present disclosure, or the current scale may also be a scale preset by a user, that is, the device may cluster the at least one searched target object for the first time according to the preset scale.

In another embodiment of the data search processing method of the present disclosure, in response to detecting that the scale changes, the operation 104 is restarted with the changed scale as the current scale, that is, clustering at least one target object based on the geographic location information of the at least one target object again to obtain at least one group that does not overlap with each other when the current scale is displayed in the map; and displaying the target object with the highest ranking score in each group of the at least one group in the map.

Based on the embodiment, as the scale is enlarged by the user and the display mark of the target object (namely, the size of the display symbol of the target object on the map) is not changed, the search result data in the visible range can be clustered again, and the groups are not covered by shielding, some target objects which cannot be displayed under the smaller scale before can be displayed, and as the scale is enlarged, the target object with the highest score in the group can be displayed. By analogy, as long as the scale is enlarged to a certain degree, all target objects in the search result within the visible range can be displayed without mutual occlusion.

Fig. 2 is a flowchart of another embodiment of the data search processing method of the present disclosure. As shown in fig. 2, on the basis of the embodiment shown in fig. 1, after operation 102, the method may further include:

202, obtaining the ranking score of each target object in the at least one target object according to a preset mode.

Based on the embodiment, the ranking scores of the target objects in the search result can be calculated according to a preset mode, so that the target objects are ranked according to the ranking scores of the target objects, and the target objects with the highest ranking scores are displayed on the map in each group after clustering, so that the target objects which are most likely to be interested by the user can be displayed based on the mode, and the user experience is improved.

In some optional implementations of the embodiment of the present disclosure, in operation 302, a ranking score of each target object of the at least one target object may be obtained based on a user representation and/or data relevance of a user who sent the search request.

Where the user representation includes user information of the user sending the search request, such as but not limited to: the user information may be obtained from information provided by the user when registering with a device implementing the method of the embodiments of the present disclosure, or from information provided by the user when registering with other applications or websites. However, the acquisition of the user information by the embodiments of the present disclosure is not limited thereto. The user representation can be abstracted into a tagged user model as one of the influencing factors for accurately finding the target object which is interested by the user from the search result.

The data correlation is used to indicate the correlation between the target object and the search condition, that is, the matching degree between each target object in the search result and the search condition. For example, if the search condition input by the user is the search keyword "shang di xi li", then when performing a search, a search may be performed based on the search keyword "shang di", "xi li", and "shang di xi li", and the obtained search result includes target objects matching the keywords "shang di", "xi li", and then the relevance between the search result and the search condition may be ranked from high to low: a target object matching the keyword "shang di xi li", a target object matching the keyword "shang di", and a target object matching the keyword "xi li".

Based on the embodiment, by utilizing the user portrait data and the data correlation, the target objects with the highest correlation with the user and/or the highest correlation with the search condition can be displayed in the process of solving the problem of shielding coverage among the target objects, so that the reduction of the user experience is avoided to the maximum extent.

For example, in some alternative examples, the ranking score for each of the at least one target object may be obtained based on the user representation and data relevance, and a weight of the user representation and data relevance. Assuming that the user representation is denoted as U, the data correlation is denoted as Q, and the weights of the user representation and the data correlation are denoted as ρ 1, ρ 2, respectively, the ranking score of each target object can be calculated as follows: score ═ ρ 1 × Q + ρ 2 × U. After ρ 1 and ρ 2 are normalized, ρ 1+ ρ 2 is 1, and specific values of ρ 1 and ρ 2 may be adjusted according to actual conditions, for example, values of ρ 1 and ρ 2 may default to 0.5, respectively.

Based on the embodiment, by utilizing the user portrait data and the data correlation, the target object with the highest comprehensive degree of the user correlation and the data correlation with the search condition, namely the target object which is most concerned by the user and is most matched with the search condition, can be displayed in the process of solving the problem of shielding coverage between the target objects, so that the user experience is improved.

In some optional implementations of the embodiment of the present disclosure, the related information of the target object may further include: introduction information of the target object (e.g., name, location, attribute information of the target object, contact information, etc.). For example, when the target object is a property, the introduction information of the property may include, but is not limited to: the name of the cell, the number of the building, the floor, the orientation, the property of the house (commercial, residential, appropriate), etc. The geographical location information of the target object may include: longitude and latitude coordinates of the geographic location of the target object.

Fig. 3 is a flowchart of another embodiment of the data search processing method of the present disclosure. As shown in fig. 3, based on the embodiment shown in fig. 1 or fig. 2, the operation 104 may include:

1042, respectively calculating, for any two target objects of the at least one target object, whether there is an overlap between the presentation marks of any two target objects based on the longitude and latitude coordinates of any two target objects, the size of the preset presentation mark, and the current scale.

The display mark is a display symbol of the target object on the map. The legend may be, for example, circular, oval, square, rectangular, triangular, and any other shape, and when the legend is circular or oval, it may be represented as a bubble (bubble), which may be a circle of radius R if the legend is circular, using the notation P_iAnd (5) identifying. P_iMay contain the latitude and longitude coordinates of the target object and the ranking score, expressed as: p_i.x，P_i.y，P_iScore or X_i，Y_i，scorei。

1044, dividing the target objects with the overlapping display marks into a group, and obtaining at least one group which is not overlapped with each other when displayed in the map.

All the target objects on the map can be represented as display symbols, the display symbols contain longitude and latitude coordinates, so that a plurality of target objects in the search result can be abstracted into the display symbols on the plurality of maps, the target objects in the search result are clustered based on the longitude and latitude coordinates, then the target objects are grouped, and the display symbols of the target objects among all the groups are ensured not to be covered and shielded.

Operation 1042 is described below using an example. Assume that, based on operation 102, a database is searched based on the search condition in the search request, and the obtained search result includes a plurality of target object data, which can be respectively represented as: p₁(X₁,Y₁)，P₂(X₂,Y₂)，......，P_n(X_n,Y_n) The target object is shown as a circle of radius R (denoted as a bubble) as shown in fig. 4. In one specific example, operation 1042 may calculate whether there is an overlap between the exposition flags of any two target objects by:

firstly, converting the longitude and latitude coordinates of each target object from an angle to a radian through the following formula (1):

wherein PI is a circumference ratio. Then, whether the display marks of the two target objects intersect is judged by the following formula (2):

wherein two target objects satisfying formula (2) may be clustered into one group.

And (3) respectively executing the formulas (1) and (2) aiming at the display marks of any two target objects in the search result, judging whether the display marks of the two target objects are crossed, if so, clustering the two target objects into a group, wherein the two target objects have shielding and covering conditions. By the method, all the target objects in the search result can be clustered, and because the display marks of any two target objects in different groups are not shielded or covered, the different groups are not shielded or covered.

Fig. 5 is a schematic diagram of a clustering process in the embodiment of the disclosure. Assuming that 12 target objects are included in the search result, each integer {1,10,11,12,5,6,7,2,3,4,8,9} in 1-12 is used as an Identifier (ID) of a presentation marker (e.g. a bubble) of the corresponding target object, assuming that the presentation markers {1,3,4,6}, {2,5,12}, {7,8,9}, {10,11} meet the clustering condition and the numbers indicate the weights of the corresponding presentation markers, respectively, the clustering process of {1,10,11,12,5,6,7,2,3,4,8,9} is as shown in fig. 5, and by clustering {1,10,11,12,5,6,7,2,3,4,8,9} into four groups: {1,3,4,6}, {2,5,12}, {7,8,9}, and {10,11}, thus obtaining a set of presentation markers of target objects of four groups which are not occluded with each other. And then, taking the first element with the highest ranking of each group in each group display mark set, and finally obtaining a display mark set of the target object displayed under the scale as {6,11,12,9 }.

And gradually obtaining the optimal bubble set bubble in the visible range as the user enlarges the scale s.

In some optional implementations of the embodiment of the present disclosure, in operation 106, when the target object with the highest ranking score in each of the at least one group is displayed in the map, the display mark and the introduction information of the target object with the highest ranking score in each of the at least one group may be directly displayed in the map.

Alternatively, in some optional implementations of the embodiment of the present disclosure, in operation 106, a presentation flag of a target object with a highest ranking score among the at least one group may be presented in the map; in response to receiving a trigger signal for a display mark, the introduction information of the target object corresponding to the display mark is displayed in the map.

The following takes the search of house resources as an example, and the embodiment of the present disclosure can be further explained with reference to fig. 6:

a user inputs certain search conditions to initiate a search request, wherein the search request comprises the search conditions, such as 'Shandi Xilisecond-hand house';

after receiving a search request sent by a user, the base stationThe property meeting the search condition is screened from the property information database under the search condition to obtain a search result, which can be represented as a property (corresponding to the target object in the above embodiment) set, and an element P in the property set_i<X_i,Y_i,info>(namely, the property i) is a triple, and the triple comprises longitude and latitude coordinates and introduction information of the property;

respectively calculating the ranking score of each property in the search result based on the user portrait and the data correlation and the weight of the user portrait and the data correlation; element P in a set of properties_i<X_i,Y_i,score_i,info>Becoming a quadruple;

clustering is carried out on each quadruple in the house set according to a preset mode, and elements in the house set are divided into n groups according to a certain mode: group 1, group 2, group 3, …, group n;

and aiming at a plurality of groups obtained after clustering, data are scattered and uniformly displayed to users by taking the groups as units, and each group displays the display mark of the property with the highest ranking score.

Any one of the data search processing methods provided by the embodiments of the present disclosure may be executed by any suitable device having data processing capability, including but not limited to: terminal equipment, a server and the like. Alternatively, any of the data search processing methods provided by the embodiments of the present disclosure may be executed by a processor, for example, the processor may execute any of the data search processing methods mentioned by the embodiments of the present disclosure by calling a corresponding instruction stored in a memory. And will not be described in detail below.

Those of ordinary skill in the art will understand that: all or part of the steps for implementing the method embodiments may be implemented by hardware related to program instructions, and the program may be stored in a computer readable storage medium, and when executed, the program performs the steps including the method embodiments; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.

Exemplary devices

Fig. 7 is a schematic structural diagram of an embodiment of a data search processing apparatus according to the present disclosure. The data search processing device of this embodiment may be disposed in an electronic device such as a terminal device or a server, and executes the data search processing method of any of the above embodiments of the present disclosure. As shown in fig. 7, the data search processing apparatus of this embodiment includes:

and the searching module is used for searching based on the searching condition in the searching request to obtain the related information of at least one target object, wherein the related information of the target object comprises the geographical position information of the target object.

And the clustering module is used for clustering at least one target object based on the geographic position information of the at least one target object to obtain at least one group which is not overlapped when the current scale is displayed in a map. Wherein each group comprises one or more target objects and the scale is the ratio between the length of a line segment on the map and the length of the corresponding line segment in the actual scene represented.

And the display module is used for displaying the target object with the highest ranking score in each group of at least one group in the map.

Based on the data search processing device provided by the above embodiment of the present disclosure, after the related information of at least one target object is obtained by searching based on the search condition in the search request, the at least one target object is clustered based on the geographic location information of the at least one target object, so as to obtain at least one group which does not overlap with each other when displayed in the map by the current scale, and the target object with the highest ranking score in each group is displayed in the map. Therefore, the clustering of the target objects in the search results based on the geographic positions is realized, the non-overlapping groups are displayed in the map, the mutual shielding of the target objects among the groups can be avoided, and the display efficiency of the search results is improved; and only the target object with the highest ranking score is displayed in the same group, so that the target object with the highest user relevance is displayed for the user, the user experience is improved, and the search efficiency of the user and the application effect based on the search result are improved.

In addition, in another embodiment of the data search processing apparatus of the present disclosure, the clustering module may be further configured to cluster the at least one target object based on the geographic location information of the at least one target object by using the changed scale as a current scale when the scale is changed, so as to obtain at least one group that does not overlap with each other when the current scale is displayed in the map.

Fig. 8 is a schematic structural diagram of another embodiment of the data search processing device of the present disclosure. As shown in fig. 8, compared with the above-described embodiment, the data search processing apparatus of this embodiment may further include: and the sorting module is used for acquiring the sorting score of each target object in the at least one target object according to a preset mode.

In some optional implementations of the embodiments of the present disclosure, the sorting module is specifically configured to: obtaining a ranking score of each target object in at least one target object based on the user portrait and/or data correlation; wherein the user representation comprises user information of a user sending the search request; the data correlation is used to represent the correlation between the target object and the search condition.

In some optional examples, the ranking module is specifically configured to: and acquiring the ranking score of each target object in the at least one target object based on the user portrait and the data correlation and the weight of the user portrait and the data correlation.

In some optional implementations of embodiments of the present disclosure, the information related to the target object further includes: introduction information of the target object. The geographical location information of the target object may include: longitude and latitude coordinates of the geographic location of the target object.

Accordingly, in this embodiment, the clustering module is specifically configured to: respectively aiming at any two target objects in at least one target object, calculating whether display marks of any two target objects are overlapped or not based on longitude coordinates and latitude coordinates of any two target objects, the size of a preset display mark and a current scale, wherein the display mark is a display symbol of the target object on a map; dividing the target objects with overlapping display marks into a group to obtain at least one group which is not overlapped when displayed in the map.

In some optional implementations of embodiments of the present disclosure, the display module is specifically configured to: displaying a display mark and introduction information of a target object with the highest ranking score in each group of at least one group in a map; or displaying a display mark of the target object with the highest ranking score in each group of at least one group in the map; in response to receiving a trigger signal for a display mark, the introduction information of the target object corresponding to the display mark is displayed in the map.

Exemplary electronic device

In addition, an embodiment of the present disclosure also provides an electronic device, including:

a memory for storing a computer program;

Next, an electronic apparatus according to an embodiment of the present disclosure is described with reference to fig. 9. The electronic device may be either or both of the first device and the second device, or a stand-alone device separate from them, which stand-alone device may communicate with the first device and the second device to receive the acquired input signals therefrom.

FIG. 9 illustrates a block diagram of an electronic device in accordance with one embodiment of the present disclosure. As shown in fig. 9, the electronic device includes one or more processors and memory.

The processor may be a Central Processing Unit (CPU) or other form of processing unit having data processing capabilities and/or instruction execution capabilities, and may control other components in the electronic device to perform desired functions.

The memory may include one or more computer program products that may include various forms of computer-readable storage media, such as volatile memory and/or non-volatile memory. The volatile memory may include, for example, Random Access Memory (RAM), cache memory (cache), and/or the like. The non-volatile memory may include, for example, Read Only Memory (ROM), hard disk, flash memory, etc. One or more computer program instructions may be stored on the computer-readable storage medium and executed by a processor to implement the data search processing methods of the various embodiments of the present disclosure described above and/or other desired functions. Various contents such as an input signal, a signal component, a noise component, etc. may also be stored in the computer-readable storage medium.

In one example, the electronic device may further include: an input device and an output device, which are interconnected by a bus system and/or other form of connection mechanism (not shown).

The input device may also include, for example, a keyboard, a mouse, and the like.

The output device may output various information including the determined distance information, direction information, and the like to the outside. The output devices may include, for example, a display, speakers, a printer, and a communication network and remote output devices connected thereto, among others.

Of course, for simplicity, only some of the components of the electronic device relevant to the present disclosure are shown, and components such as buses, input/output interfaces, and the like are omitted. In addition, the electronic device may include any other suitable components, depending on the particular application.

Exemplary computer program product and computer-readable storage Medium

In addition, the embodiment of the present disclosure also provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the data search processing method described in any of the above embodiments is implemented.

In addition to the methods and apparatus described above, embodiments of the present disclosure may also be a computer program product comprising computer program instructions that, when executed by a processor, cause the processor to perform the steps in the data search processing method according to various embodiments of the present disclosure described in the "exemplary methods" section above of this specification.

The computer program product may write program code for carrying out operations for embodiments of the present disclosure in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server.

Furthermore, embodiments of the present disclosure may also be a computer-readable storage medium having stored thereon computer program instructions that, when executed by a processor, cause the processor to perform steps in a data search processing method according to various embodiments of the present disclosure described in the "exemplary methods" section above in this specification.

The computer-readable storage medium may take any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may include, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The foregoing describes the general principles of the present disclosure in conjunction with specific embodiments, however, it is noted that the advantages, effects, etc. mentioned in the present disclosure are merely examples and are not limiting, and they should not be considered essential to the various embodiments of the present disclosure. Furthermore, the foregoing disclosure of specific details is for the purpose of illustration and description and is not intended to be limiting, since the disclosure is not intended to be limited to the specific details so described.

In the present specification, the embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts in the embodiments are referred to each other. For the system embodiment, since it basically corresponds to the method embodiment, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the method embodiment.

The block diagrams of devices, apparatuses, systems referred to in this disclosure are only given as illustrative examples and are not intended to require or imply that the connections, arrangements, configurations, etc. must be made in the manner shown in the block diagrams. These devices, apparatuses, devices, systems may be connected, arranged, configured in any manner, as will be appreciated by those skilled in the art. Words such as "including," "comprising," "having," and the like are open-ended words that mean "including, but not limited to," and are used interchangeably therewith. The words "or" and "as used herein mean, and are used interchangeably with, the word" and/or, "unless the context clearly dictates otherwise. The word "such as" is used herein to mean, and is used interchangeably with, the phrase "such as but not limited to".

The methods and apparatus of the present disclosure may be implemented in a number of ways. For example, the methods and apparatus of the present disclosure may be implemented by software, hardware, firmware, or any combination of software, hardware, and firmware. The above-described order for the steps of the method is for illustration only, and the steps of the method of the present disclosure are not limited to the order specifically described above unless specifically stated otherwise. Further, in some embodiments, the present disclosure may also be embodied as programs recorded in a recording medium, the programs including machine-readable instructions for implementing the methods according to the present disclosure. Thus, the present disclosure also covers a recording medium storing a program for executing the method according to the present disclosure.

It is also noted that in the devices, apparatuses, and methods of the present disclosure, each component or step can be decomposed and/or recombined. These decompositions and/or recombinations are to be considered equivalents of the present disclosure.

The previous description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects without departing from the scope of the disclosure. Thus, the present disclosure is not intended to be limited to the aspects shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

The foregoing description has been presented for purposes of illustration and description. Furthermore, this description is not intended to limit embodiments of the disclosure to the form disclosed herein. While a number of example aspects and embodiments have been discussed above, those of skill in the art will recognize certain variations, modifications, alterations, additions and sub-combinations thereof.

Claims

1. A data search processing method, comprising:

2. The method of claim 1, further comprising:

3. The method according to claim 1 or 2, wherein after obtaining the information related to the at least one target object, the method further comprises:

4. The method according to claim 3, wherein the obtaining the ranking score of each target object of the at least one target object according to a preset manner comprises:

5. The method of claim 4, wherein obtaining a ranking score for each of the at least one target object based on the user representation and the data relevance comprises:

6. The method of any of claims 1-5, wherein the geographic location information of the target object comprises: longitude coordinates and latitude coordinates of a geographic location where the target object is located.

7. The method of claim 6, wherein the clustering the at least one target object based on the geographic location information of the at least one target object, resulting in at least one group that does not overlap when displayed in a map at a current scale, comprises:

8. A data search processing apparatus characterized by comprising:

9. An electronic device, comprising:

a memory for storing a computer program;

a processor for executing the computer program stored in the memory, and when the computer program is executed, implementing the data search processing method of any one of claims 1 to 7.

10. A computer-readable storage medium, on which a computer program is stored, the computer program, when being executed by a processor, implementing the data search processing method of any one of claims 1 to 7.