CN115329319B

CN115329319B - Space operator searching system based on elastic search technology

Info

Publication number: CN115329319B
Application number: CN202211058974.6A
Authority: CN
Inventors: 谭龙生; 汪蓓; 曾航; 周宏文; 戴一明; 罗波; 唐小洪; 沙漠; 张小敏; 雷秋霞; 柴垚; 向友云; 罗鲜华; 王俊秀; 唐险峰
Original assignee: Chongqing Planning And Natural Resources Information Center
Current assignee: Chongqing Planning And Natural Resources Information Center
Priority date: 2022-08-31
Filing date: 2022-08-31
Publication date: 2023-05-19
Anticipated expiration: 2042-08-31
Also published as: CN115329319A

Abstract

The invention provides a space operator searching system based on an elastic search technology, which comprises the following steps: s1, searching a user login searching platform; s2, after the search user logs in the search platform, the search platform searches according to the search word input by the user to obtain a search result. The invention can display the search result on the client after the search platform is logged in safely.

Description

Space operator searching system based on elastic search technology

Technical Field

The invention relates to the technical field of geographic information, in particular to a space operator searching system based on an elastic search technology.

Background

The explosion of data grows, placing more demands on searching. Among the many requirements, fast search response and accurate results are the most fundamental and most interesting requirements. In a fast aspect, there are numerous underlying search engines that offer a good solution, with open-source Solr and elastic search making a significant contribution to the search field. Patent application number 2018109074899, named as "file index system and method based on full text search of elastomer search", discloses a method comprising a user operation management module, a file system, a E l a s t i c S e a r c h cluster module, a database system and an elastomer search client module, wherein the search of the file content by the system is completely real-time, the search result at any moment will not have outdated and erroneous, and the resource waste caused by elastomer search when executing full text search of the file system is effectively reduced; the method can realize bidirectional communication between the file and the elastic search, support the acquisition of the path of the file where the search result is located, and execute more operations on the hit file.

Disclosure of Invention

The invention aims at least solving the technical problems in the prior art, and particularly creatively provides a space operator searching system based on an elastic search technology.

In order to achieve the above object of the present invention, the present invention provides a space operator searching system based on the elastic search technology, which comprises a search user login module, a space graphic importing module, a space graphic search module and a land block graphic display module;

the data output end of the search user login module is connected with the data input end of the space graphic importing module, the data output end of the space graphic importing module is connected with the data input end of the space graphic search module, and the data output end of the space graphic search module is connected with the data input end of the land block graphic display module;

the search user login module is used for searching a user login search platform;

the space graphic importing module is used for retrieving a space graphic imported by a user at the client;

the space pattern retrieval module is used for retrieving the space pattern related to the space pattern obtained by the retrieval platform according to the space pattern imported by the retrieval user after the retrieval user logs in the retrieval platform;

the plot graph display module is used for displaying plot graphs.

In a preferred embodiment of the present invention, the spatial pattern import module comprises the steps of:

s21, the client judges whether an uploading space graphic triggering command is received or not:

if the client receives the uploading space graphic triggering command, executing the next step;

if the client side does not receive the space graphic uploading triggering command, continuing to wait, and returning to the step S21;

s22, the client acquires the spatial pattern imported by the search user in the uploading frame, and the client transmits the acquired spatial pattern to the search platform after acquiring the spatial pattern imported by the search user in the uploading frame;

the space graph retrieval module comprises the following steps:

s23, after the search platform receives the space graphics sent by the client, extracting graphics coordinates of the received space graphics to obtain a graphics coordinate set;

s24, the searching platform searches to obtain a graph intersected with the received space graph according to the graph coordinate set;

and S25, displaying the graphic data retrieved by the retrieval platform on the client, wherein the graphic data comprises the area and the perimeter of each graphic.

In a preferred embodiment of the present invention, the following steps are included in step S24:

S241，H＝{H ₁ ,H ₂ ,H ₃ ,…,H _h Where H represents a set of graphics coordinates, H ₁ Represents the 1 st coordinate, H, extracted from the received spatial pattern ₂ Represents the 2 nd coordinate, H, extracted from the received spatial pattern ₃ Representing the reception of the received3 rd coordinate, H, of the extracted spatial pattern _h Representing an h coordinate extracted from the received space graph, wherein h represents the total number of coordinates in the received space graph; [ H ] ₁ ∪H ₂ ∪H ₃ ∪…∪H _h ]For the space graph received by the search platform, the U represents that the set logic accords with the union; let self-increment h' =1;

s242, judging the H' coordinate H _h′ Whether or not in the graphic set g= { G ₁ ,G ₂ ,G ₃ ,…G _g In }, G ₁ Represents the 1 st plot pattern, G ₂ Representing the 2 nd plot pattern, G ₃ Representing the 3 rd plot pattern, G _g G represents the g-th plot graph, g represents the total number of plots; g ₁ ∪G ₂ ∪G ₃ ∪…∪G _g For the whole plot graph, the U-shaped set logic accords with the union;

g′＝1、2、3、……、g，g″＝1、2、3、……、g，g′≠g″；

if the H' th coordinate H _h′ In the graphic set g= { G ₁ ,G ₂ ,G ₃ ,…G _g In }, the H' th coordinate H _h′ The corresponding land pattern is placed in a land collection set, and h '=h' +1; executing the next step;

if the H' th coordinate H _h′ Not in graphic set g= { G ₁ ,G ₂ ,G ₃ ,…G _g In } h '=h' +1; executing the next step;

s243, judging the size relation between h' and h:

if h '> h, h' represents self-increment, and h represents the total number of coordinates in the received space graph, executing the next step;

If h 'is less than or equal to h, h' represents self-increment, h represents the total number of coordinates in the received space graph, and the step S242 is returned;

s244, judging the size relation between the number of the plot graphs in the plot collection set and the total number of coordinates in the received space graph:

if h '< h, h' represents the number of the plot graphs in the plot collection set, and h represents the total number of coordinates in the received space graph, deleting the plot graphs in the plot collection set which are the same; executing the next step;

if h "=h, h" represents the number of the plot graphs in the plot collection set, and h represents the total number of coordinates in the received space graph, then judging whether the plot graphs in the plot collection set are the same or not:

if the plot patterns in the plot collection set are the same, no pattern intersecting with the received space pattern is obtained by searching;

if the plot graphs in the plot collection set are not identical, deleting the plot graphs in the plot collection set, and executing the next step;

s245, extracting the land block graphs in the land block collection set after deleting the same land block graphs in the land block collection set, namely the land block graphs intersected with the received space graph.

In a preferred embodiment of the present invention, in step S25, the area of each pattern is calculated by:

Wherein plex is _u The area of the pixel point u;

U _s representing the total number of pixel points of the s-th land block graph;

S _s representing the area of the s-th land pattern; s=1, 2, 3, … …, S' represents the total number of plot patterns intersecting the received spatial pattern;

the perimeter calculation method of each graph comprises the following steps:

wherein plex is _u The area of the pixel point u;

l _s representing the total number of pixel points on the contour line of the s-th land block graph;

L _s representing the perimeter of the s-th plot pattern; s=1, 2, 3, … …, S' represents the total number of plot patterns intersecting the received spatial pattern;

the method for calculating the intersection area of each plot graph comprises the following steps:

wherein plex is _u The area of the pixel point u;

U′ _s′ representing the total number of pixel points of the s' th intersecting land block graph;

S′ _s′ representing the area of the s' th intersecting plot pattern; s' =1, 2, 3, … …, S "represents the total number of intersecting land pattern present in the land pattern intersecting the received spatial pattern;

the calculation method of the intersecting perimeter of each plot graph comprises the following steps:

wherein plex is _u The area of the pixel point u;

l′ _s′ representing the total number of pixel points on the contour line of the s' th intersecting land block graph;

L′ _s′ representing the perimeter of the s' th intersecting plot pattern; s' =1, 2, 3, … …, S "represents the total number of intersecting land pattern present in the land pattern intersecting the received spatial pattern.

In a preferred embodiment of the invention, the user login module comprises the following steps:

s11, obtaining a search account number, a search password, a verification code and a client ID code which are input by a search user;

s12, fusing the retrieval password and the verification code obtained in the step S11 to obtain a two-code fusion code;

s13, mapping the two-code fusion code obtained in the step S12 into a two-code mapping code;

s14, converting the two-code mapping code obtained in the step S13 into two-code security codes and two-code security images;

and S15, uploading the two-code security code and the two-code security image obtained in the step S14 and the retrieval account number and the client ID code obtained in the step S11 to a retrieval platform for verification.

In a preferred embodiment of the present invention, the method of converting the two-code mapping code into the two-code security code in step S14 includes the steps of:

s141, converting the two-code mapping code in the step S13 into a two-dimensional code;

s142, converting the two-code mapping code in the step S13 into a binary value;

s143, sequentially writing binary values in the step S142 into black frames of the two-dimensional codes in the step S142 from left to right and from top to bottom;

s144, writing the value 1 into a white frame of the two-dimensional code, and taking the last black frame written as an end point;

S145, sequentially taking out the numerical values in the two-dimensional codes from left to right and from top to bottom;

s146, converting the numerical value extracted in the step S145 into a safety character with the same system as the two-code mapping code, wherein the safety character is the two-code safety code;

s147, extracting an image of the two-dimensional code written with the

numerical values

0 and 1, wherein the image is the two-code security image.

In a preferred embodiment of the present invention, the method of retrieving platform verification in step S15 comprises the steps of:

s151, after receiving the two-code security code and the two-code security image sent by the client, and the retrieval account number and the client ID code, the retrieval platform obtains the two-code security platform code and the two-code security platform image, and the retrieval platform account number and the client ID platform code respectively;

s152, converting the binary security platform code obtained in the step S151 into a binary platform value;

s153, sequentially writing binary platform values into the boxes of the two-code security platform images in the step S151 from left to right and from top to bottom;

s154, sequentially taking out numerical values from the black frames of the two-code security platform image according to the sequence from left to right and from top to bottom;

s155, converting the numerical value extracted in the step S154 into a binary mapping platform code with the same system as the binary mapping code; reversely mapping the two-code mapping platform code into a two-code platform code;

S156, searching according to the client ID platform code obtained in the step S151 to obtain a verification code sent by a retrieval platform;

s157, according to the verification code obtained in the step S156 and the two-code platform code obtained in the step S155, obtaining an analysis password and an analysis verification code;

s158, judging whether the analysis verification code obtained in the step S157 is consistent with the verification code obtained in the step S156:

if the resolved verification code obtained in step S157 is consistent with the verification code obtained in step S156, executing the next step;

if the resolved verification code obtained in the step S157 is inconsistent with the verification code obtained in the step S156, the verification code is re-input, or the search account number, the search password and the verification code are re-input, and the step S11 is returned;

s159, searching according to the search platform account number obtained in the step S151 to obtain a search platform password corresponding to the search platform account number, and judging whether the search platform password is consistent with the analysis password obtained in the step S157 or not:

if the password of the search platform is consistent with the analysis password obtained in the step S157, the search user successfully logs in the search platform;

if the search platform password is inconsistent with the analysis password obtained in step S157, the search password and the verification code are re-input, or the search account number, the search password and the verification code are re-input, and the step S11 is returned.

In a preferred embodiment of the present invention, the method for obtaining the two-code fusion code in step S12 includes the following steps:

s121, judging the relation between the bit number of the search password obtained in the step S11 and the bit number of the verification code obtained in the step S11:

if A ₁ -A ₂ ≤A ₀ ，and

Wherein A is ₁ Representing the number of bits of the search password obtained in step S11, A ₂ Representing the number of bits of the verification code obtained in step S11, A ₀ A first threshold value representing a preset number of bits, and representing a logical relationship and,

indicating that the symbol of the element set does not belong to, Z ⁺ Representing a positive integer set, executing step S122;

if A ₁ -A ₂ ≥A ₀ ′，and

Wherein A is ₁ Representing the number of bits of the search password obtained in step S11, A ₂ Representing the number of bits of the verification code obtained in step S11, A ₀ ' represents a second threshold value of the preset number of bits, A ₀ ′-A ₀ =1, and represents a logical relationship and, +.>

Indicating that the symbol of the element set does not belong to, Z ⁺ Representing a positive integer set, executing step S123; />

If it is

Wherein A is ₁ Representing the number of bits of the search password obtained in step S11, A ₂ Representing the number of digits of the verification code obtained in step S11, wherein E represents the symbol of the element set belonging to Z ⁺ Representing a positive integer set, executing step S124;

S122，

wherein B represents a two-code fusion code;

B ₁ Representing the 1 st character of the search password obtained in the step S11 from left to right; namely, the first character of the search password obtained in the step S11 is counted from left to right;

B ₂ representing the 2 nd character of the search password obtained in the step S11 from left to right;

B ₃ representing the 3 rd character of the search password obtained in the step S11 from left to right;

a is the search password obtained in step S11 ₁ Bit characters; namely, the last character of the search password obtained in the step S11 from left to right;

b ₁ representing the 1 st bit character of the verification code obtained in the step S11 from left to right; namely, the first character of the verification code obtained in the step S11 is counted from left to right;

b ₂ representing the 2 nd character of the verification code obtained in the step S11 from left to right;

b ₃ representing the 3 rd character of the verification code obtained in the step S11 from left to right;

a is the verification code obtained in the step S11 from left to right ₂ Bit characters; namely, the last character of the verification code obtained in the step S11 from left to right;

S123，

wherein B represents a two-code fusion code;

B ₁ indicating that the search password obtained in step S11 is from left Bit 1 character counted to the right; namely, the first character of the search password obtained in the step S11 is counted from left to right;

S124，

wherein B represents a two-code fusion code;

B ₂ Representing the acquisition in step S11The 2 nd character of the received search password from left to right;

a is the search password obtained in step S11 ₂ Bit characters;

a is the search password obtained in step S11 ₂ +1-bit characters;

a is the search password obtained in step S11 ₂ +2-bit characters;

a is the search password obtained in step S11 ₂ +3-bit characters;

b ₃ representing the 3 rd bit of the verification code obtained in the step S11 from left to rightA character;

a is the verification code obtained in the step S11 from left to right ₂ Bit characters; namely, the last character of the verification code obtained in step S11 from left to right.

In a preferred embodiment of the present invention, the method for obtaining the parsing of the password and the parsing of the verification code in step S157 includes the steps of:

s1571, judging the relationship between the number of bits of the two-code platform code obtained in the step S155 and the number of bits of the verification code obtained in the step S156:

if A ₁ ′-2A ₂ ′≤A ₀ ，and

Wherein A is ₁ ' representing the number of bits of the two-code platform code obtained in step S155, A ₂ ' represents the number of bits of the verification code obtained in step S156, A ₀ A first threshold value representing a preset number of bits and representing a logical relationship and +.>

Indicating that the symbol of the element set does not belong to, Z ⁺ Representing a positive integer set, executing step S1572;

if A ₁ ′-2A ₂ ′≤A ₀ ′，and

Wherein A is ₁ ' representing the number of bits of the two-code platform code obtained in step S155, A ₂ ' represents the number of bits of the verification code obtained in step S156, A ₀ ' represents a second threshold value of the preset number of bits, A ₀ ′-A ₀ =1, and represents a logical relationship and, +.>

Indicating that the symbol of the element set does not belong to, Z ⁺ Representing a positive integer set, executing step S1573;

if it is

Wherein A is ₁ ' representing the number of bits of the two-code platform code obtained in step S155, A ₂ ' represent the number of digits of the verification code obtained in step S156, E represents the symbol of the element set belonging to, Z ⁺ Representing a positive integer set, executing step S1574;

S122，

wherein B' represents a two-code platform code;

B ₁ ' the 1 st character representing the number of the analysis password obtained in step S157 from left to right; namely, the first character of the analysis password obtained in step S157 is counted from left to right;

B ₂ ' the 2 nd character representing the number of the analysis password obtained in step S157 from left to right;

B ₃ ' the 3 rd character representing the number of the analysis password obtained in step S157 from left to right;

a is the analysis password obtained in step S157 ₁ ′-A ₂ ' bit characters; that is, the last character of the analysis password obtained in step S157 from left to right;

b ₂ ' the 2 nd character which represents the analysis verification code obtained in step S157 from left to right;

b ₃ ' the 3 rd character representing the number of the analysis verification code obtained in the step S157 from left to right;

a is the analysis verification code obtained in the step S157 ₂ ' bit characters; that is, the last character of the resolution verification code obtained in step S157 from left to right;

S123，

Wherein B' represents a two-code platform code;

S124，

Wherein B' represents a two-code platform code;

a is the analysis password obtained in step S157 ₂ ' bit characters;

a is the analysis password obtained in step S157 ₂ ' 1-bit characters;

a is the analysis password obtained in step S157 ₂ ' 2-bit characters; />

Indicating that the analysis password obtained in step S157 is obtained fromA number A from left to right ₂ ' 3-bit characters;

a is the analysis verification code obtained in the step S157 ₂ ' bit characters; that is, the last character of the resolution verification code obtained in step S157 is counted from left to right.

In a preferred embodiment of the present invention, step S141 is to convert the two-code mapping code in step S13 into a two-dimensional code; and rotating the obtained two-dimensional code clockwise or anticlockwise by alpha, wherein alpha=pi/2, pi and 3 pi/2.

In a preferred embodiment of the present invention, in step S159, the encrypted analysis password obtained in step S157 is encrypted to obtain a hidden analysis password, and the method for obtaining the hidden analysis password is as follows:

wherein the Securely parse actual password represents a suppressed resolution password;

MD5 hash rule method represents a hash algorithm using MD 5;

representing an analysis password;

B ₁ ' 1 st character representing the number of the parsing cipher from left to right; the first character of the password is analyzed from left to right;

B ₂ ' bit 2 character representing the number of the parsing cipher from left to right;

B ₃ ' the 3 rd character representing the parse code from left to right;

a represents the number A of the analysis password from left to right ₁ ′-A ₂ ' bit characters; that is, the last character of the password is analyzed from left to right;

searching according to the search platform account number obtained in the step S151 to obtain a search platform password corresponding to the search platform account number, and judging whether the search platform password is consistent with the hidden analysis password obtained in the step S159 or not:

if the search platform password is consistent with the hidden analysis password obtained in the step S159, the search user successfully logs in the search platform;

if the search platform password is inconsistent with the hidden parsing password obtained in step S159, the search password and the verification code are re-input, or the search account number, the search password and the verification code are re-input, and the process returns to step S11.

In summary, by adopting the technical scheme, the invention can display the search result on the client after the search platform is logged in safely.

Additional aspects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.

Drawings

The foregoing and/or additional aspects and advantages of the invention will become apparent and may be better understood from the following description of embodiments taken in conjunction with the accompanying drawings in which:

Fig. 1 is a schematic block diagram of a flow of the present invention.

Fig. 2 is a schematic diagram of a two-dimensional code image according to the present invention.

FIG. 3 is a schematic diagram of binary value writing two-dimensional code image according to the present invention.

Fig. 4 is a diagram of writing a two-dimensional code image with a value of 1.

Fig. 5 is a schematic diagram of a two-code security image according to the present invention.

FIG. 6 is a diagram of a binary platform value writing binary security platform image according to the present invention.

Fig. 7 is a schematic diagram of a two-dimensional code image rotated 90 ° counterclockwise.

FIG. 8 is a diagram of binary value writing two-dimensional code image according to the present invention.

Fig. 9 is a diagram of writing a two-dimensional code image with a value of 1.

Fig. 10 is a schematic diagram of a two-code security image in accordance with the present invention.

FIG. 11 is a diagram of a binary platform value writing binary security platform image according to the present invention.

Detailed Description

Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to like or similar elements or elements having like or similar functions throughout. The embodiments described below by referring to the drawings are illustrative only and are not to be construed as limiting the invention.

The invention provides a space operator searching system based on an elastic search technology, which is shown in figure 1 and comprises a searching user login module, a space graph importing module, a space graph searching module and a land graph displaying module;

the space pattern retrieval module is used for retrieving the space pattern related to the space pattern obtained by the retrieval platform according to the space pattern imported by the retrieval user after the retrieval user logs in the retrieval platform; the association relationship includes an intersection relationship and an inclusion relationship.

The plot graph display module is used for displaying plot graphs.

the space graph retrieval module comprises the following steps:

s24, the searching platform searches and obtains the graph associated with the received space graph according to the graph coordinate set;

In a preferred embodiment of the present invention, when the association relationship is an intersecting relationship in step S24, the method includes the steps of:

S241，H＝{H ₁ ,H ₂ ,H ₃ ,…,H _h where H represents a set of graphics coordinates, H ₁ Represents the 1 st coordinate, H, extracted from the received spatial pattern ₂ Represents the 2 nd coordinate, H, extracted from the received spatial pattern ₃ Represents the 3 rd coordinate, H, extracted from the received spatial pattern _h Representing an h coordinate extracted from the received space graph, wherein h represents the total number of coordinates in the received space graph; [ H ] ₁ ∪H ₂ ∪H ₃ ∪…∪H _h ]For the space graph received by the search platform, the U represents that the set logic accords with the union; let self-increment h' =1;

g′＝1、2、3、……、g，g″＝1、2、3、……、g，g′≠g″；

s243, judging the size relation between h' and h:

wherein plex is _u The area of the pixel point u;

the perimeter calculation method of each graph comprises the following steps:

wherein plex is _u The area of the pixel point u;

wherein plex is _u The area of the pixel point u;

wherein plex is _u The area of the pixel point u;

In a preferred embodiment of the present invention, the method further comprises the step of painting the land pattern intersecting the received space pattern in step S245, wherein the painting method comprises the steps of:

s2451, obtaining a plot pattern intersected with the received space pattern, and marking the obtained plot pattern intersected with the received space pattern on a space map as a marking point;

S2452, obtaining RGB values of the pixels of the space map corresponding to the mark points and RGB values of adjacent pixels of the space map corresponding to the mark points;

s2453, calculating a color value according to the RGB value of the pixel point of the space map corresponding to the mark point obtained in the step S2452 and the RGB value of the adjacent pixel point of the space map corresponding to the mark point obtained in the step S2452; the color value calculating method comprises the following steps:

wherein GRAY (X) _i ,Y _i ,Z _i ) A pixel value of an ith pixel point of the space map corresponding to the mark point is represented;

(X _i ,Y _i ,Z _i ) Representing the position coordinates of the ith pixel point on the space map;

i represents the total number of pixel points of the space map corresponding to the mark points;

GRAY _max representing the maximum pixel value in all pixel points of the space map corresponding to the mark point;

GRAY _min representing the minimum pixel value in all pixel points of the space map corresponding to the mark point;

GRAY′(X′ _j ,Y′ _j ,Z′ _j ) Representing the pixel value of the j-th adjacent pixel point of the space map corresponding to the mark point;

(X′ _j ,Y′ _j ,Z′ _j ) Representing the position coordinates of the j-th adjacent pixel point on the space map;

j represents the total number of adjacent pixel points of the space map corresponding to the mark points;

GRAY′ _max representing the maximum pixel value in all adjacent pixel points of the space map corresponding to the mark point;

GRAY′ _min Representing the minimum pixel value in all adjacent pixel points of the space map corresponding to the mark point;

Q(X _i ,Y _i ,Z _i ) Representing a color value;

s2454, color value Q (X) _i ,Y _i ,Z _i ) Painting the pixel value as the corresponding mark point;

and S2455, displaying the colored land block graph on the client.

In a preferred embodiment of the present invention, when the association relationship is the inclusion relationship in step S24, the method includes the steps of:

g′＝1、2、3、……、g，g″＝1、2、3、……、g，g′≠g″；

If the H' th coordinate H _h′ In the graphic set g= { G ₁ ,G ₂ ,G ₃ ,…G _g In }, the H' th coordinate H _h′ The corresponding land pattern is used as the land pattern to be verified, and h '=h' +1; executing the next step;

if the H' th coordinate H _h′ Not in graphic set g= { G ₁ ,G ₂ ,G ₃ ,…G _g In the process, no graph contained in the received space graph is retrieved;

s243, judging the size relation between h' and h:

if h 'is less than or equal to h, h' represents self-increment, h represents the total number of coordinates in the received space graph, and executing the next step;

if h '> h, h' represents self-increment, h represents the total number of coordinates in the received space graph, then executing S245;

s244, judging the H' coordinate H _h′ Whether in the plot graph to be verified:

if the H' th coordinate H _h′ In the plot to be verified, h '=h' +1; returning to step S243;

if the H' th coordinate H _h′ If the space pattern is not in the to-be-verified land pattern, the pattern contained in the received space pattern is not retrieved;

s245, the to-be-verified land pattern is the land pattern contained in the received space pattern.

In a preferred embodiment of the present invention, in step S245, the method for calculating the area of the land pattern intersecting the land pattern to be verified is as follows:

wherein plex is _u The area of the pixel point u;

U _s representing the total number of pixels of an s-th land pattern intersected with the land pattern to be verified;

S _s representation and to-be-verifiedThe area of the s-th land pattern intersected by the land pattern; s=1, 2, 3, … …, S' represents the total number of plot patterns intersecting the plot pattern to be verified;

the calculation method of the perimeter of the land pattern intersected with the land pattern to be verified comprises the following steps:

/>

wherein plex is _u The area of the pixel point u;

l _s representing the total number of pixel points on the contour line of the s-th land pattern intersected with the land pattern to be verified;

L _s representing the perimeter of an s-th plot pattern intersecting the plot pattern to be verified; s=1, 2, 3, … …, S' represents the total number of plot patterns intersecting the plot pattern to be verified.

In a preferred embodiment of the present invention, in step S245, the method further comprises the step of painting the land pattern intersecting the land pattern to be verified, wherein the painting method comprises the steps of:

s2451, obtaining a plot pattern intersected with the plot pattern to be verified, and marking the obtained plot pattern intersected with the plot pattern to be verified on a space map as a marking point;

wherein GRAY (X) _i ,Y _i ,Z _i ) Watch (watch)Showing the pixel value of the ith pixel point of the space map corresponding to the mark point;

Q(X _i ,Y _i ,Z _i ) Representing a color value;

and S2455, displaying the colored land block graph on the client.

In a preferred embodiment of the invention, the retrieval user login module comprises the following steps:

s11, obtaining a search account number, a search password and a verification code which are input by a search user, and a client ID code; the client ID code is not limited to a motherboard ID code, a CPUID code, a display card ID code and a hard disk ID code, but can also be a Bluetooth ID code, an ICCID code and an IMEIID code, when the client is a PC computer, the client ID code is preferably the CPUID code, and when the client is a smart phone, the client ID code is preferably the Bluetooth ID code; the search account number, the search password and the verification code input by the search user are 92-system characters, and the numerical value represented by each character is shown in table 2.

S12, fusing the retrieval password and the verification code obtained in the step S11 to obtain a two-code fusion code; and the security coefficient of the password is improved through the adjustment of the position sequence of the retrieval password and the verification code.

S13, mapping the two-code fusion code obtained in the step S12 into a two-code mapping code; the two-code fusion code is mapped into the two-code mapping code, so that the safety coefficient of the password can be further improved.

S14, converting the two-code mapping code obtained in the step S13 into two-code security codes and two-code security images; and converting the two-code mapping code into a two-code security code and a two-code security image, so as to realize the security transmission of the password.

s142, converting the two-code mapping code in the step S13 into a binary value;

S147, extracting an image of the two-dimensional code written with the

numerical values

0 and 1, wherein the image is the two-code security image.

if A ₁ -A ₂ ≤A ₀ ，and

if A ₁ -A ₂ ≥A ₀ ′，and

Indicating that the symbol of the element set does not belong to, Z ⁺ Representing a positive integer set, executing step S123;

if it is

S122，

wherein B represents a two-code fusion code;

b ₃ representing the 3 rd bit word of the verification code obtained in the step S11 from left to rightA symbol;

S123，

wherein B represents a two-code fusion code;

representation ofThe A-th verification code obtained in the step S11 is counted from left to right ₂ Bit characters; namely, the last character of the verification code obtained in the step S11 from left to right;

S124，

wherein B represents a two-code fusion code;

A is the search password obtained in step S11 ₂ Bit characters;

a is the search password obtained in step S11 ₂ +1-bit characters;

a is the search password obtained in step S11 ₂ +2-bit characters;

a is the search password obtained in step S11 ₂ +3-bit characters;

a is the verification code obtained in the step S11 from left to right ₂ Bit characters; namely, the last character of the verification code obtained in step S11 from left to right. And according to the bit number of the retrieval password and the verification code, the retrieval password and the verification code are sequentially subjected to position adjustment, so that password security is facilitated.

if A ₁ ′-2A ₂ ′≤A ₀ ，and

Indicating that the symbol of the element set does not belong to, Z ⁺ Representing a positive integer set, executing step S1572; />

If A ₁ ′-2A ₂ ′≤A ₀ ′，and

if it is

S122，

Wherein B' represents a two-code platform code;

S123，

Wherein B' represents a two-code platform code;

S124，

Wherein B' represents a two-code platform code;

the analysis obtained in step S157 is shownA-th password from left to right ₂ ' bit characters;

a is the analysis password obtained in step S157 ₂ ' 1-bit characters;

a is the analysis password obtained in step S157 ₂ ' 2-bit characters;

a is the analysis password obtained in step S157 ₂ ' 3-bit characters;

a is the analysis verification code obtained in the step S157 ₂ ' bit characters; i.e. obtained in step S157The last character of the verification code from left to right is parsed.

Assume that a search account number, a search password and a verification code input by a search user are admin, 0 and 01 respectively. The number of digits of a typical verification code is four, and the number of digits of the code is not less than six, but for illustration purposes, the number of digits of the retrieval code and verification code is shortened.

Firstly, obtaining a search account number, a search password and a verification code which are input by a search user and are respectively admin, 0 and 01.

Second, since the number of bits of the search password 0 is 4, the number of bits of the verification code 01 is 2, namely the match is achieved

Thus, the two-code fusion code b=b ₁ b ₁ B ₂ b ₂ B ₃ B ₄ ＝？01？0。

Third, fusing two codes according to table 1? 01? The 0 map is a two-code map code 010201.

Table 1 mapping character 1 to character 2

Character 1

0

1

2

3

4

5

6

7

8

9

a

b

c

d

e

f

g

h

i

Character 2

1

2

3

4

5

6

7

8

9

a

b

c

d

e

f

g

h

i

j

Character 1

j

k

l

m

n

o

p

q

r

s

t

u

v

w

x

y

z

A

B

Character 2

k

l

m

n

o

p

q

r

s

t

u

v

w

x

y

z

A

B

C

Character 1

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

Character 2

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

Character 1

V

W

X

Y

Z

)

！

@

#

$

％

^

&

*

(

-

＝

[

]

Character 2

W

X

Y

Z

)

！

@

#

$

％

^

&

*

(

-

＝

[

]

\

Character

1

\

；

‘

,

.

/

_

+

{

}

|

:

“

<

>

？

Character 2

；

‘

,

.

/

_

+

{

}

|

:

“

<

>

？

0

Fourth, the binary mapping code 010201 is converted to binary value 0100010001010110001100100001 with decimal value 071656225 according to table 2.

Table 2 numerical values corresponding to characters

Character(s)	0	1	2	3	4	5	6	7	8	9	a	b	c	d	e	f	g	h	i
																				Numerical value	0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16	17	18
Character(s)	j	k	l	m	n	o	p	q	r	s	t	u	v	w	x	y	z	A	B
																				Numerical value	19	20	21	22	23	24	25	26	27	28	29	30	31	32	33	34	35	36	37
Character(s)	C	D	E	F	G	H	I	J	K	L	M	N	O	P	Q	R	S	T	U
																				Numerical value	38	39	40	41	42	43	44	45	46	47	48	49	50	51	52	53	54	55	56
Character(s)	V	W	X	Y	Z	)	！	@	#	$	％	^	&	*	(	-	＝	[	]
																				Numerical value	57	58	59	60	61	62	63	64	65	66	67	68	69	70	71	72	73	74	75
Character(s)	\	；	‘	,	.	/	_	+	{	}	\|	:	“	<	>	？
																				Numerical value	76	77	78	79	81	81	82	83	84	85	86	87	88	89	90	91

Fifth, the two-code mapping code 010201 is converted into a two-dimensional code image, as shown in fig. 2.

Sixth, binary values 0100010001010110001100100001 are written in the black boxes of the two-dimensional code in the order from left to right and from top to bottom, as shown in fig. 3.

Seventh, writing the value 1 into the white frame of the two-dimensional code, as shown in fig. 4.

And eighth, sequentially taking out the numerical values of the two-dimensional codes from left to right and from top to bottom to 0100010111001110101100111110111011101111110100011.

And ninth, converting the extracted numerical value 0100010111001110101100111110111011101111110100011 into a security character 02& fk [ (L, the decimal value is 153508168720291) with the same system as the binary mapping code, and the security character 02& fk [ (L is the binary security code).

And tenth, extracting an image of the two-dimensional code written with the

values

0 and 1, wherein the image is a two-code security image, as shown in fig. 5.

And eleventh step, uploading the two-code security codes 02& fk [ (L and the two-code security images obtained in the tenth step, and the retrieval account admin and the client ID codes obtained in the first step) to a retrieval platform.

The verification process of the retrieval platform is as follows:

twelfth, after the retrieval platform receives the two-code security code and the two-code security image which are sent by the client, and the retrieval account number and the client ID code, respectively obtaining the two-code security platform code and the two-code security platform image, and the retrieval platform account number and the client ID platform code; the two-code security codes 02& fk transmitted by the client are received by the retrieval platform (L is the two-code security platform code, the two-code security image transmitted by the client is received by the retrieval platform is the two-code security platform image, the retrieval account admin transmitted by the client is received by the retrieval platform is the retrieval platform account, and the client ID code transmitted by the client is received by the retrieval platform is the client ID platform code;

thirteenth step, the two-code security platform code 02& fk [ (L is converted into binary platform value 0100010111001110101100111110111011101111110100011;

a fourteenth step of writing binary system platform values into the blocks of the two-code security platform image in the twelfth step in sequence from left to right and from top to bottom, as shown in fig. 6;

fifteenth, sequentially taking out numerical values 0100010001010110001100100001 from black frames of the two-code security platform image from left to right and from top to bottom;

Sixteenth, converting the numerical value 0100010001010110001100100001 extracted in the fifteenth step into a binary mapping platform code 010201 with the same system as the binary mapping code;

seventeenth step, inverse mapping the two-code mapping platform code 010201 to the two-code platform code according to table 3? 01?0.

TABLE 3 inverse mapping character 1 to character 2

Character 1

0

1

2

3

4

5

6

7

8

9

a

b

c

d

e

f

g

h

i

Character 2

？

0

1

2

3

4

5

6

7

8

9

a

b

c

d

e

f

j

h

Character 1

j

k

l

m

n

o

p

q

r

s

t

u

v

w

x

y

z

A

B

Character 2

i

j

k

l

m

n

o

p

q

r

s

t

u

v

w

x

y

z

A

Character 1

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

Character 2

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

Character 1

V

W

X

Y

Z

)

！

@

#

$

％

^

&

*

(

-

＝

[

]

Character 2

U

V

W

X

Y

Z

)

！

@

#

$

％

^

&

*

(

-

＝

[

Character 1

；

‘

\

,

.

/

_

+

{

}

:

“

|

<

>

？

Character 2

]

；

‘

\

,

.

/

_

+

{

}

:

“

|

<

>

Eighteenth, searching according to the client ID platform code obtained in the twelfth step to obtain a verification code 01 sent by a retrieval platform;

nineteenth step, due to two-code platform code? 01? The number of bits of 0 is 6, and the number of bits of the verification code sent by the search platform is 2, namely the number of bits accords with

Thus (2)

So parse the password B ₁ ′B ₂ ′B ₃ ′B ₄ ' =0, parse verification code b ₁ ′b ₂ ′＝01。

A twentieth step of executing the next step, since the resolution verification code 01 obtained in the nineteenth step is identical to the verification code 01 obtained in the tenth step;

and twenty-first step, searching according to the search platform account admin obtained in the twelfth step to obtain a search platform password 0 corresponding to the search platform account.

And twenty-second, searching the searching platform account number obtained in the twenty-first step to obtain the searching platform password 0 corresponding to the searching platform account number admin, wherein the searching platform password 0 is consistent with the analysis password 0 obtained in the nineteenth step, so that the searching user successfully logs in the searching platform.

Another embodiment: firstly, obtaining a search account number, a search password and a verification code which are input by a search user and are respectively admin, 0 and 01.

Third, fusing two codes according to table 1? 01? Mapping 0 into a two-code mapping code 010201;

Fifthly, converting the two-code mapping code 010201 into a two-dimensional code image, as shown in fig. 2; the two-dimensional code image is rotated counterclockwise by 90 °, as shown in fig. 7.

Sixth, binary values 0100010001010110001100100001 are written in the black boxes of the two-dimensional code in the order from left to right and from top to bottom, as shown in fig. 8.

Seventh, writing the value 1 into the white frame of the two-dimensional code, as shown in fig. 9.

And eighth, sequentially taking out the numerical values of the two-dimensional codes from left to right and from top to bottom to 01000101110101111101101111111101101011110101100101101.

Ninth, the extracted value 01000101110101111101101111111101101011110101100101101 is converted into a security character i4$ptmn=, which is the same binary code as the binary code mapping code, and the decimal value is 2457389155871533, and the security character i4$ptmn= is the binary code security code.

Tenth, an image of the two-dimensional code written with the

values

0 and 1 is extracted, and the image is a two-code security image, as shown in fig. 10.

And eleventh step, uploading the two-code security code I4$PTmn=obtained in the ninth step and the two-code security image obtained in the tenth step, and the retrieval account admin and the client ID code obtained in the first step to a retrieval platform.

The verification process of the retrieval platform is as follows:

twelfth, after the retrieval platform receives the two-code security code and the two-code security image which are sent by the client, and the retrieval account number and the client ID code, respectively obtaining the two-code security platform code and the two-code security platform image, and the retrieval platform account number and the client ID platform code; the two-code security code I4 PTmn=the two-code security platform code transmitted by the client is received by the retrieval platform, the two-code security image transmitted by the client is received by the retrieval platform as the two-code security platform image, the retrieval account admin transmitted by the client is received by the retrieval platform as the retrieval platform account, and the client ID code transmitted by the client is received by the retrieval platform as the client ID platform code;

Thirteenth step, converting the two-code security platform code i4$ptmn=in twelve steps into a binary platform value 01000101110101111101101111111101101011110101100101101;

a fourteenth step of writing binary platform values into the blocks of the two-code security platform image in the twelfth step in sequence from left to right and from top to bottom, as shown in fig. 11;

seventeenth step, inverse mapping the two-code mapping platform code 010201 to the two-code platform code according to table 3? 01?0;

Thus (2)

MD5 hash rule method represents a hash algorithm using MD 5;

representing an analysis password;

B ₃ ' the 3 rd character representing the parse code from left to right;

if the search platform password is inconsistent with the hidden parsing password obtained in step S159, the search password and the verification code are re-input, or the search account number, the search password and the verification code are re-input, and the process returns to step S11. The password of the search platform is stored instead of the stored password input in the step S11, so that the client platform is favorable for ensuring the safety even if the client platform is taken up and cannot log in the platform.

And tenth, extracting an image of the two-dimensional code written with the

values

0 and 1, wherein the image is a two-code security image, as shown in fig. 5.

The verification process of the retrieval platform is as follows:

Thus (2)

and twenty-first step, searching according to the search platform account admin obtained in the twelfth step to obtain a search platform password 03234EF598DA6686 corresponding to the search platform account.

Twenty-second, performing MD5 hash algorithm on the resolving password 0 obtained in the nineteenth step to obtain a hidden resolving password:

the Securely parse actual password＝MD5 hash rule method||B ₁ ′B ₂ ′B ₃ ′B ₄ ′||

＝MD5 hash rule method|| 0||

＝03234EF598DA6686

and thirdly, searching the searching platform account number obtained in the twenty-first step to obtain a searching platform password 03234EF598DA6686 corresponding to the searching platform account number admin, wherein the searching platform password 03234EF598DA6686 is consistent with the hidden analysis password 03234EF598DA6686 obtained in the twenty-second step, so that the searching user successfully logs in the searching platform.

Tenth, an image of the two-dimensional code written with the

values

The verification process of the retrieval platform is as follows:

Thus (2)

＝MD5 hash rule method|| 0||

＝03234EF598DA6686

On the retrieval platform, the method for obtaining the password of the retrieval platform comprises the following steps:

s01, acquiring a search password input by a search user in a password registration box during registration;

s02, mapping the retrieval password obtained in the step S01 into a retrieval mapping code;

s03, converting the retrieval mapping code obtained in the step S02 into a password security code and a password security image; the method for converting the retrieval mapping code into the password security code and the password security image comprises the following steps:

s031, converting the search mapping code in the step S03 into a two-dimensional code;

s032, converting the retrieval mapping code in the step S03 into binary values;

s033, sequentially writing binary values in the step S032 into black frames of the two-dimensional codes in the step S032 from left to right and from top to bottom;

S034, writing a value 1 into a white frame of the two-dimensional code, and taking the last black frame written as an end point;

s035, sequentially taking out the numerical values in the two-dimensional codes from left to right and from top to bottom;

s036, converting the numerical value extracted in the step S035 into a security character with the same system as the retrieval mapping code, wherein the security character is a password security code;

s037, extracting an image of the two-dimensional code written with the

values

0 and 1, wherein the image is the password security image.

S04, uploading the client ID code, the password security code and the password security image obtained in the step S03 to a retrieval platform for verification registration. The method for verifying registration by the retrieval platform comprises the following steps:

s041, after receiving the password security code and the password security image sent by the client and the client ID code, the retrieval platform respectively obtains the password security platform code, the password security platform image and the client ID platform code;

s042, converting the password security platform code obtained in the step S041 into a binary platform value;

s043, sequentially writing binary platform values into the blocks of the password security platform image in the step S041 from left to right and from top to bottom;

s044, sequentially taking out numerical values from the black frames of the password security platform image according to the sequence from left to right and from top to bottom;

S045, converting the numerical value extracted in the step S044 into a code mapping platform code with the same system as the retrieval mapping code; reversely mapping the code mapping platform code into a code platform code; or, converting the numerical value extracted in the step S044 into a code mapping platform code with the same system as the retrieval mapping code; reversely mapping the code mapping platform code into a code platform code;

s046, generating a registration account number according to the client ID platform code obtained in the step S041, associating the registration account number with the password platform code, storing the association in a search platform database, and returning the registration account number to the search user, thereby completing the registration process of the search user.

Or S041, after receiving the password security code and the password security image sent by the client and the client ID code, the retrieval platform respectively obtains the password security platform code, the password security platform image and the client ID platform code;

s046, the hidden code platform code is obtained by adopting the MD5 hash algorithm to the code platform code in the step S045;

s047, generating a registration account number according to the client ID platform code obtained in the step S041, associating the registration account number with the hidden password platform code, storing the association in a search platform database, and returning the registration account number to the search user, thereby completing the registration process of the search user.

While embodiments of the present invention have been shown and described, it will be understood by those of ordinary skill in the art that: many changes, modifications, substitutions and variations may be made to the embodiments without departing from the spirit and principles of the invention, the scope of which is defined by the claims and their equivalents.

Claims

1. The space operator searching system based on the elastic search technology is characterized by comprising a searching user login module, a space graphic importing module, a space graphic searching module and a land block graphic displaying module;

the plot graph display module is used for displaying plot graphs;

wherein, the searching user login module comprises the following steps:

S15, uploading the two-code security code and the two-code security image obtained in the step S14 and the retrieval account number and the client ID code obtained in the step S11 to a retrieval platform for verification;

further, the method for converting the two-code mapping code into the two-code security code in step S14 includes the following steps:

s142, converting the two-code mapping code in the step S13 into a binary value;

s147, extracting an image of the two-dimensional code written with the numerical values 0 and 1, wherein the image is a two-code security image;

further, the method for retrieving platform verification in step S15 includes the following steps:

2. The spatial operator search system based on the elastic search technique according to claim 1, wherein the spatial graphic importing module comprises the following steps:

The space graph retrieval module comprises the following steps:

3. The spatial operator search system based on the elastic search technique according to claim 2, wherein in step S24, the steps of:

g′＝1、2、3、……、g，g″＝1、2、3、……、g，g′≠g″；

s243, judging the size relation between h' and h:

4. The spatial operator search system according to claim 2, wherein in step S25, the area of each graphic is calculated by:

wherein plex is _u The area of the pixel point u;

S _s representing the area of the s-th land pattern; s=1. 2, 3, … …, S' represent the total number of plot patterns intersecting the received spatial pattern;

the perimeter calculation method of each graph comprises the following steps:

wherein plex is _u The area of the pixel point u;

wherein plex is _u The area of the pixel point u;

wherein plex is _u The area of the pixel point u;

L′ _s′ representing the s' th intersectionPerimeter of the plot pattern; s' =1, 2, 3, … …, S "represents the total number of intersecting land pattern present in the land pattern intersecting the received spatial pattern.

5. The spatial operator search system based on the elastic search technique according to claim 1, wherein the manner of obtaining the two-code fusion code in step S12 comprises the steps of:

if A ₁ -A ₂ ≤A ₀ ，and

Wherein A is ₁ Representing the number of bits of the search password obtained in step S11, A ₂ Representing the number of bits of the verification code obtained in step S11, A ₀ A first threshold value representing a preset number of bits and representing a logical relationship and +.>

if A ₁ -A ₂ ≥A ₀ ′，and

if it is

S122，

wherein B represents a two-code fusion code;

S123，

wherein B represents a two-code fusion code;

a is the verification code obtained in the step S11 from left to right ₂ Bit characters; that is, the verification code obtained in step S11 is from the leftThe last character to the right;

S124，

wherein B represents a two-code fusion code;

a is the search password obtained in step S11 ₂ Bit characters;

a is the search password obtained in step S11 ₂ +1-bit characters;

a is the search password obtained in step S11 ₂ +2-bit characters;

a is the search password obtained in step S11 ₂ +3-bit characters;

6. The spatial operator search system based on the elastic search technique according to claim 1, wherein the method for parsing the password and parsing the verification code in step S157 comprises the steps of:

If A ₁ ′-2A ₂ ′≤A ₀ ，and

If A ₁ ′-2A ₂ ′≤A ₀ ′，and

if it is

S122，

wherein B' represents a two-code platform code;

S123，

wherein B' represents a two-code platform code;

S124，

wherein B' represents a two-code platform code;

a is the analysis password obtained in step S157 ₂ ' bit characters;

a is the analysis password obtained in step S157 ₂ ' 1-bit characters;

a is the analysis password obtained in step S157 ₂ ' 2-bit characters;

a is the analysis password obtained in step S157 ₂ ' 3-bit characters;

representing the result obtained in step S157A is the number of the analysis verification code from left to right ₂ ' bit characters; that is, the last character of the resolution verification code obtained in step S157 is counted from left to right.

7. The spatial operator search system based on the elastic search technique according to claim 1, wherein step S141 is to convert the two-code mapping code in step S13 into a two-dimensional code; rotating the obtained two-dimensional code clockwise or anticlockwise by alpha, wherein alpha=pi/2, pi and 3 pi/2;

or/and step S159 is to encrypt the resolving password obtained in step S157 to obtain a hidden resolving password, and the method for obtaining the hidden resolving password is as follows:

MD5 hash rule method represents a hash algorithm using MD 5;

representing an analysis password;

B ₃ ' the 3 rd character representing the parse code from left to right;