KR100777081B1 - Method and system for browsing information of lattice structure over web environment - Google Patents

Abstract

A method for searching for information in a lattice structure under a web environment and a system thereof are provided to add node identification information to each node forming the lattice structure for enabling a client to check interrelation among nodes and to search for information in the lattice structure under a web environment. A method for searching for information in a lattice structure under a web environment comprises the following several steps. A client transmits search information to a server. The server searches for target information according to a reference node matched with the transmitted search information, reads node identification information related to the reference node, and searches for target information matched with the lineal ascendant nodes according to the node identification information. The server transmits the search target information matched with the reference node and the lineal ascendant nodes to the client.

Description

Method and system for browsing information of lattice structure over web environment}

1 is a schematic diagram illustrating the concept of a semantic network and a lattice structure.

FIG. 2 illustrates a lattice structure formed based on the medieval theologian Ambrose as an example in which one conceptual node is interconnected with several other conceptual nodes.

3 shows information formed in a tree structure according to the prior art.

4 is a block diagram of a system for searching for information of a lattice structure in a web environment according to the present invention.

5 shows information formed in a lattice structure according to the present invention.

FIG. 6 illustrates that node identification information is assigned to each concept node of FIG. 2.

7 shows a structure of node identification information according to the present invention.

8 shows the structure of a database according to the invention.

9 illustrates an example of a search interface implemented using HTML in a web environment.

FIG. 10 is an excerpt of one line from FIG. 9 and shows a search interface node.

FIG. 11 illustrates a case in which sibling nodes are expanded in FIG. 9.

<Explanation of symbols for the main parts of the drawings>

100: server 110: database

200: network 310, 320, 330, 340: client

The present invention relates to a method and system for searching for information of a lattice structure in a web environment, and more particularly, to construct a semantic network of a lattice structure in which a concept is associated with a plurality of concepts in a web environment. It relates to a method and system that allows a client to efficiently explore it.

Recently, the concept of 'Web 2.0' has emerged, attracting worldwide attention. It is the next generation web technology created by Tim O'reilly, the founder of the World Wide Web (www). It is a reflection of the process of evolution from 'web warehouse web or folder web (web 1.0)' to 'ecosystem web'. In other words, Web 2.0 reflects the perception of how the Web is evolving from a collection of Web sites into a complete platform for delivering Web applications to end users, and the key idea is to It's the web.

The present invention provides a method and system for constructing a 'Semantic Network' which is one of the core technologies of Web 2.0 in a web environment and efficiently searching for it. Hereinafter, an information searching method according to the prior art will be described. Before explaining, let's take a quick look at the semantic network.

Semantic Network is a model for representing each concept in cognitive psychology as a set of semantic traits or attributes. It was presented by Quilan in 1969. This is a connection between meanings in a specific relationship (~ is a ~, ~ has a part ~, etc.). As shown in FIG. 1, a concept corresponding to one node ( A synonym set is linked to another concept in a specific relationship, and each concept eventually becomes a complex network.

For example, Leonardo da Vinci is a 'is a' technologist, an 'is a' architect, a 'is a' sculptor and a 'is a' artist. Here, one conceptual node 'Leonardo da Vinci' is connected to the other conceptual nodes 'technologist', 'architect', 'sculptor' and 'artist' in a specific relationship (~ is a ~), respectively. Interconnecting with other conceptual nodes has a special lattice structure.

Figure 2 shows a more complex example, where the concept node 'Amrose' is' bishop ',' Church father ',' theologian ', and' Doctor of the Church ',' composer ',' saint 'and so on. In detail, 'Ambrose' is the first linked parent node with 'bishop', 'father', 'theologian', 'doctor of religion', 'composer' and 'saint' and is the parent node of 'Ambrose' The Father and the Doctor of Religion also have a theologian as their primary linked parent node. Thus, the theologian becomes the direct parent node of Ambrose and the direct parent node of the Father and the Doctor of Religion, the parent nodes of Ambrose. The Bishop, the Father, the Theologian, the Doctor of Religion, and the Composer, respectively, are connected to the upper node, person, through several links. Connected with ' On the other hand, unlike these, the saint has distinct parent nodes connected to 'deity', 'spiritual being', 'belief', etc. (psychological feature) '. For reference, in the present specification, a 'parent node' refers to a node having a higher concept directly connected to a predetermined reference node by one link, and the reference node is a node having a lower concept directly connected by one link in view of a parent node. This is a 'child node'.

From the perspective of data structure of computer science, as shown in FIG. 3, a tree structure having one parent node is ideal, and in the related art, the tree structure information is provided in a web environment. .

Referring to FIG. 3, when a certain highest meaning or concept is referred to as 'node 1', a node of a lower concept linked with 'node 1' becomes a child node of 'node 1'. FIG. 3 illustrates a structure in which 'node 1' has three child nodes, and 'node 11', 'node 12', and 'node 13', which are child nodes of 'node 1', have the same parent node. It is a node relationship. Similarly, 'node 11', 'node 12', and 'node 13' may each have their own child nodes. In FIG. 3, 'node 11' represents four child nodes' node 111 ',' node 112 ',' It can be seen that it has nodes 113 'and' node 114 '. In this way, a superordinate concept is connected to one or more subordinate concepts, and the subordinate concept is connected to another subordinate concept lower than itself, thereby forming a tree structure as a whole.

The information search method according to the prior art has a large amount of information in a tree structure as described above, and implemented in a web environment using technologies such as the Java language or Microsoft.net.

However, in the real natural world, not all information can always be represented by such a tree structure, especially in a semantic network including a large amount of semantic information. The size of the semantic network usually reaches about 70,000 in the case of nouns, and a large number of meanings are represented by a single node (Ambrose) as shown in FIG. 2 by a number of parent nodes (bishops, fathers, theologians, doctors of religion, composers and saints). ). There can also be parent-child relationships (theologians and fathers, theologians and doctors of religion) between these parent nodes, and there can be many (substantial, psychological features) in the highest sense.

Therefore, the information search method according to the related art can efficiently express only information of a tree structure in which each node has one parent node, but cannot express information of a large lattice structure such as a semantic network. And, although it is possible to provide the information search service in the web environment by transmitting the information of small lattice structure at once, it takes a lot of load to transmit all the information at once. There is still a problem in that when multiple clients access a single server at the same time, information cannot be provided smoothly.

The present invention was devised to solve the above problems of the prior art, and an object of the present invention is to provide a method and system capable of efficiently searching a large amount of lattice structure information in a web environment.

Another object of the present invention is to provide a method and system for constructing a semantic network of a lattice structure in which one meaning is associated with a plurality of meanings in a web environment and allowing a client to efficiently search for it.

For this purpose, a method of searching for information of a lattice structure according to the present invention includes the steps of: a) transmitting, by a client, search information to a server; b) searching, by the server, in a database for search target information corresponding to a reference node corresponding to the search information and search target information corresponding to a direct surviving node of the reference node; c) transmitting, by the server, the search target information corresponding to the reference node and the search target information corresponding to the direct persistent node to the client; And d) the client providing a search interface configured based on the search target information corresponding to the reference node and the direct persistent node.

Preferably, the step b), b1) searching for the search target information corresponding to the reference node corresponding to the search information; b2) reading node identification information related to the reference node; And b3) searching for search target information corresponding to the direct persistent node corresponding to the node identification information.

The information search system having a lattice structure according to the present invention comprises: a client for transmitting search information input from a user to a server through a network, and providing search target information transmitted from the server in the form of a search interface; A server for searching for a search target information corresponding to the reference node and the direct persistent node corresponding to the search information in a database and transmitting the search target information to a client; And a network performing communication between the client and the server.

Hereinafter, the present invention will be described in detail with reference to the accompanying drawings and preferred embodiments. For reference, detailed descriptions of well-known functions and configurations that may unnecessarily obscure the subject matter of the present invention will be omitted in the following description.

First, FIG. 4 is a structural diagram of a system for searching for information of a lattice structure in a web environment according to the present invention. As shown in FIG. 4, the Lattice structure information retrieval system according to the present invention is a server-client structure in which one or more clients are connected to a server through a network, and the server has a database storing a large amount of Lattice structure information. Interlocked.

The client transmits the search information input from the user to the server through the network, and the server searches for the corresponding search target information stored in the database based on the search information and transmits the result to the client. To this end, the client and server are input means such as a keyboard or mouse, output means such as a display, communication means connected to a network to perform communication, storage means such as a hard disk, the input means, output means, communication means And control means for controlling the storage means. Since the server and client used in the present invention are similar to the server and client generally used in the web environment except for the information search function of the lattice structure, the detailed description thereof will be omitted. The information storage method of the lattice structure and the searching method thereof which are the main technical features of the present invention will be described.

As described above with reference to FIGS. 1 and 2, in a lattice structure, one node is interconnected with one or more other nodes, and there may be a plurality of parent nodes of a higher concept that are primarily linked based on a specific node. In addition, a parent-child relationship may exist between parent nodes, and a plurality of top-level nodes may exist.

The present invention provides node identification information corresponding to the number of parent nodes so that each node knows its immediate surviving node in order to efficiently process such a large amount of information of the lattice structure in a web environment. In order to reduce the amount of data transmitted between the server and the client, a large lattice structure is divided into two or more sub-networks, and the number and size thereof may be appropriately implemented according to a service environment.

FIG. 5 shows an example of information formed in a lattice structure according to the present invention. In FIG. 5, one information network (eg, semantic network) is divided into three sub networks (sub network A, sub network B, and sub network C). An isolated structure is illustrated.

First, 'node A1', which is the highest node in subnetwork A, has three child nodes 'node A11', 'node A12', and 'node A13'. And, 'node A12' has one child node 'node A121', 'node A13' has two child nodes 'node A131' and 'node A132'. Meanwhile, 'node A121' also has two child nodes 'node A1211' and 'node A1212', where 'node A1212' is the same node as 'node A132'.

In the case of subnetwork B, the highest node 'node B1' has two child nodes' node B11 'and' node B12 ', and' node B12 'has three child nodes' node B121', 'node B122', ' Has node B123 '. Here, 'node B122' is the same node as 'node A1212' and 'node A132'.

Lastly, in the case of sub-network C, 'node C1', which is the highest node, has two child nodes' node C11 'and' node C12 ', and' node C11 'is the' node A1212 ',' node A132 ',' It is the same node as node B122 '.

To sum it up, 'node A1212', 'node A132', 'node B122' and 'node C11' are the same node and four different parent nodes 'node A121', 'node A13', 'node B12' and Has 'node C1'. The path to the top node is different according to each parent node, whereby the direct persistent node is different.

In the present invention, in order to efficiently express information of a lattice structure in which one node may have a plurality of parent nodes and the parent-child relationship may be different from each other, the relation with the parent node with respect to one node Separate node identification information is assigned.

For convenience of description, if one node 'Node A1212', 'Node A132', 'Node B122', and 'Node C11' are set as reference nodes to be searched, the reference node has four parent nodes' Node A121 ',' node A13 ',' node B12 'and' node C1 ', and thus have four node identification information' A1212 ',' A132 ',' B122 'and' C11 '.

In FIG. 5, a node number assigned to each node is used as node identification information. Hereinafter, 'A1212' which is one of the node identification information of the reference node will be described.

'A', the first digit of the node identification information 'A1212', indicates the subnetwork as a subnetwork identifier, and '1', the second digit, indicates the highest node among the direct persistent nodes belonging to the subnetwork A as the first level identifier. . The third digit '2' is the second level identifier, indicating the second highest priority persistent node next to the highest node, where '2' indicates at least two child nodes belonging to the highest node (three children in FIG. 5). Node is present), indicating that it is the second child node. The fourth digit, '1', is a third level identifier and indicates a third-order direct persistent node corresponding to the grandchild node of the highest node. As described above, '1' includes at least one child node and the first child Indicates that this is a node. Finally, since the fifth digit '2' is the fourth level identifier and the last digit of the node identification information 'A1212', at least two child nodes exist in the reference node's own sibling relationship (parent node 'node A121'). ).

On the contrary, the reference node having the total 5-digit node identification information 'A1212' has a parent node corresponding to the preceding 4-digit node identification information 'A121', and corresponds to the preceding 3-digit node identification information 'A12'. It can be seen that it has a grandparent, and a great-grandparent corresponding to the preceding two-digit node identification information 'A1'.

On the other hand, since the reference node has 'A132', 'B122', 'C11' in addition to the node identification information 'A1212', it is possible to know the direct persistent nodes corresponding to each. For example, in the case of the node identification information 'A132', it can be seen that a parent node corresponding to the node identification information 'A13' and a grandparent node corresponding to the node identification information 'A1' exist, where the node identification information 'A1' corresponds. 'Node A1' corresponds to the great-grandparent of the reference node (for 'A1212') and the grandparent (for 'A132').

 As described above, the node identification information is information for knowing the direct persistent nodes of the reference node. In this embodiment, the same node identification information as the number of parent nodes is used, and one parent node itself also has a plurality of parent nodes. (A grandparent from the point of view of the reference node), so that more node identification information may be used to express them all.

FIG. 6 illustrates that node identification information is assigned to each concept node illustrated in FIG. 2. In FIG. 6, when 'Ambrose' is set as a reference node, 'Ambrose' is a 'bishop (A1211314314)', 'a grant (A121132154)', 'theologian (A12113215)', and 'doctor' (A121132156) corresponding to the parent node. It has six node identification information 'A12113143141', 'A1211321543', 'A121132155', 'A1211321563', 'A1211334217' and 'B14312252' according to the relationship with the composer (A121133421) and the saint (B1431225).

On the other hand, since the reference node 'Ambrose' can also have child nodes, from the viewpoint of the child node, there is a plurality of node identification information of the parent node (reference node). In this case, the number of node identification information grows exponentially. In order to solve this problem, in the present embodiment, representative node identification information for each node is set and used, and in the case of remaining nodes other than 'Ambrose' in FIG. 6, only one representative node identification information is displayed.

The representative node identification information may be variously set according to the structure of the information, the user, the purpose of use, and the like. For example, the order of the sub-networks may be used as the primary reference, and node identification information corresponding to the longest path may be set as the representative node identification information. In this case, the representative node identification information of 'Ambrose' is 'A12113143141'.

FIG. 7 illustrates a structure of node identification information, and representative node identification information 'A12113143141' of 'Ambrose' is used as an example. As described with reference to FIG. 5, the node identification information illustrated in FIG. 7 includes a sub-network identifier in the first place, a first level identifier in the second place, a second level identifier in the third place, a third level identifier in the fourth place, and the like. Consists of Here, the digits below the twelfth level identifier are '0', whereby the number of the direct persistent nodes and the position of the reference node can be inferred.

The structure of the node identification information can be variously formed according to the number, size of subnetwork, maximum number of sibling nodes, maximum number of direct persistent nodes, and the like.

8 shows the structure of a database used in this embodiment. First, the search target information is information to be searched corresponding to the search information transmitted from the client. The search target information corresponds to one node, and in the case of a semantic network, represents a conceptual node. The node serial number is a number used to identify a node corresponding to the search target information in the database, which is an absolute identification information used in the database, unlike the node identification information (relative identification information) determined in relation to other nodes. . As described above, the node identification information is information indicating a relationship with the direct persistent node, and a plurality of node identification information may exist according to the relationship with the parent node. In FIG. 8, the first node identification information, the second node identification information, the third node identification information, and the like are distinguished and expressed. The representative node identification information described above is set (assigned) as the first node identification information, thereby storing a separate storage space. You can reduce the amount of data without using. Meanwhile, the detailed information added after each node identification information is detailed information of search target information related to the node identification information. For example, in FIG. 8, the first node identification information 'A12113143141' of 'Ambrose' is related to the 'bishop', and the first detail information may store a detailed description of the Ambrose related to the bishop.

With this structure, the present invention can efficiently store the information of the complex lattice structure, and can easily reflect the generation and destruction of the nodes (search information) and the change of the interconnection relationship.

Hereinafter, a method of searching for information of a lattice structure in a web environment will be described with reference to FIGS. 9 through 12.

Assuming that 'Ambrose' is a search target, the user inputs search information matched with the client, such as 'Ambrose' and 'Ambrosius', to search for a desired search target. Enter by means. Then, the client transmits the input search information to the server through the network, and the server searches the database for the search target information corresponding to the search information.

When the search target information (Ambros) corresponding to the reference node is searched, the node identification information (A12113143141, A1211321543, A1211321563, A121132155, A1211334217, B14312252) belonging to the search target information is read, and the readout of the node identification information Search for the search target information corresponding to the surviving node. Referring to FIG. 6, in the case of the node identification information 'A12113143141', the search target information corresponding to the immediate surviving node is 'object', 'object', 'life', 'organism', 'human', 'leader', 'religious' Become a leader, a priest, a priest, a bishop, and in the case of node identification information 'B14312252', 'psychological characteristics', 'awareness', 'content', 'belief', 'mental existence', 'spiritual' Being ',' Saint '.

When the search target information corresponding to the reference node and the search target information corresponding to the direct persistent node of the reference node are searched, the server transmits it to the client through the network, and the client displays it on the output means for viewing by the user. . FIG. 9 illustrates an example of displaying a search result of 'Ambrose' using HTML (hypertext markup language). In FIG. 9, a process of deriving a reference node from a top node is displayed step by step in order of a direct persistent node.

In detail, first, search target information corresponding to a direct surviving node of the first node identification information (see FIG. 8) is displayed step by step from 'entity', which is a top node, to 'Ambrose', which is a reference node. Then, the search target information corresponding to the direct persistent node of the second node identification information (see FIG. 8) is displayed again step by step. At this time, the direct surviving node of the same path is displayed by matching the level (baseline) from the next node to be branched without repeating display. In FIG. 9, 'intellectual' (directly persistent node of second node identification information) which is a lower level of 'person' is the same as 'leader' (directly persistent node of first node identification information). You can see that it is displayed step by step from the level up to the reference node. In the same manner, the search target information corresponding to the direct persistent node is displayed step by step for all the remaining node identification information. As such, the direct persistent node and the relationship between the reference node and the reference node can be known.

Meanwhile, the search result illustrated in FIG. 9 also performs a function of a search interface for searching for information of a lattice structure (eg, semantic network). FIG. 10 illustrates a line corresponding to the first reference node of FIG. 9 to explain this. Is an excerpt. For reference, each line in FIG. 9 performs a search interface function associated with a corresponding node, and in this respect, this may be referred to as a 'search interface node'.

As shown in FIG. 10, the search interface node includes a child node identification code, a sibling node identification code, a selection indication code, a search target information, a parent node identification code, and a parent relationship indication code.

', '

', '

' 3가지로 구분하여 사용하였다. 여기서, '

'는 자식노드가 존재하지 않는다는 것을 의미하고, '

'는 자식노드가 존재하며 적어도 하나의 자식노드가 펼쳐져 있음(표시되어 있음)을 의미하고, '

'는 자 식노드가 존재하지만 숨어 있음(표시되어 있지 않음)을 의미한다. 사용자는 검색 인터페이스 노드에서 마우스 등을 이용하여 자식노드 확인부호를 클릭함으로써 자식노드를 확인할 수 있으며, 도 10의 경우 '

'를 클릭하면 기준노드에 속해 있는 자식노드가 펼쳐져 표시되고, 반대로 '

'를 클릭하면 펼쳐져 있던 자식노드가 숨게 된다. First, the child node identification code is used to identify the child node of the reference node. In this embodiment,

','

','

'3 types were used. here, '

'Means no child nodes exist,'

'Means a child node exists and at least one child node is expanded (shown),

'Means the child node exists but is hidden (not shown). The user can check the child node by clicking the child node identification code in the search interface node using a mouse or the like.

Click on to expand the child nodes belonging to the base node, and vice versa

Click 'to hide the expanded child node.

'와 '

'를 사용하였다(참고로 도면상의 화살표와는 형상이 다소 상이하지만 실질적으로 동일한 것임). 여기서, '

는 형제노드가 펼쳐져 있지 않음을 의미하고, '

'은 형제노드가 펼쳐져 있음을 의미하는데, 마찬가지로 사용자가 마우스 등을 이용하여 '

'을 클릭하면 형제노드가 펼쳐져 표시되며, '

'을 클릭하면 펼쳐져 있던 형제노드가 숨게 된다. 도 11은 도 9의 검색 인터페이스에서 첫 번째 기준노드의 형제노드 확인부호를 클릭하였을 때 기준노드의 형제노드가 펼쳐진 것을 도시한다.The sibling node confirmation code is used to identify the sibling node of the reference node. In this embodiment,

'Wow '

'(For reference, the shape is somewhat different from the arrow in the drawing, but is substantially the same). here, '

Means that no brother nodes are expanded,

"Means that the brother node is expanded, and likewise, if a user

Click to expand the sibling node,

Click to hide the expanded brother nodes. 11 illustrates the expansion of the sibling node of the reference node when the sibling node identification code of the first reference node is clicked in the search interface of FIG. 9.

', '

'로 선택여부를 표시한다. 참고로, 선택여부 표시부호 '

'는 앞서 설명한 자식노드 확인부호 '

'와 그 형상이 실질적으로 동일한데, 이의 구별은 검색 인터페이스 노드에서의 위치로 알 수 있으며, 또한 색상을 상이하게 함으로써 구별할 수 있다.The selection mark is used to indicate whether or not the corresponding node (search target information) has been selected by the user.

','

Indicates whether it is selected. For reference, the selection mark '

Is the child node identifier

'And its shape are substantially the same, the distinction of which can be seen by its position at the search interface node and by distinguishing the colors.

As described above, the search target information corresponds to one node in the Lattice-structured information network, and is information representing a search target to be searched by the user. In FIG. 9, the reference node 'Ambrose' is represented as 'Ambrose1 Saint Ambrose1 St.Ambrose1', where 'Ambrose', 'Saint Ambrose' and 'St.Ambrose' are synonym sets representing the same concept. . And, the number '1' is used in case the same name exists. In the search interface node, the search target information is preferably configured to display the corresponding detailed information (see FIG. 8) when the user clicks the mouse or positions the mouse pointer.

The parent node identification code is used to identify the parent node of the reference node. In this embodiment, '!' Is used. This is displayed when there are two or more (more than one) parent nodes of the reference node, and when the user clicks on them, all the parent nodes of the node are expanded and displayed again. For example, when the brother node of 'Ambrose' is unfolded as shown in FIG. 11, 'Berkeley', 'Eusebius', 'Ignatius', 'Martin', 'Nicholas', and 'Ulfilas' are each other in addition to the bishop. You can see that you have a parent node. For example, if you click the parent node identification code (!) Corresponding to 'Berkeley', all the parent nodes of 'Berkeley' are displayed.

The parental symbol indicates that the node is related to the number of parent nodes of the node and to which parent node. In the present embodiment, the form of 'm of n' (m≤n; m, n is a natural number), where n represents the total number of parent nodes, m is the parent node (or node identification information) ) Is related to As shown in FIG. 9, 'Ambrose' is repeatedly displayed six times according to the parent node, and it can be seen how many node identification information are related by the parent relationship display code.

On the other hand, when the same node is displayed several times according to its immediate surviving node, in the search for the lower node (child node), it is possible to implement the search in all reference nodes (6 nodes in the case of Ambrose) or There may be a method of implementing the search only in the representative reference node. In this embodiment, in order to prevent one information that may occur in the search process from overlapping, the child node may be searched only in the reference node corresponding to the representative node identification information (first node identification information). In this case, the representative reference node may be identified by the parent relation display code (1 of n), and may be distinguished by different colors of the representative reference node and other reference nodes. However, in the search for the sibling node, as described above, since the sibling node is different according to the parent node, the sibling node can be searched by clicking the sibling node identification code in each node.

Finally, if the above information is summarized in terms of information transmission, the server first transmits the search target information corresponding to the reference node and its immediate persistent node requested from the client without transmitting the information of the lattice structure at once, and then retrieves the information. When a request is input from the user through the interface, the information is transmitted at the request of the client. In this way, the user can freely perform bottom-up exploring and top-down exploring, and can efficiently search for large-scale semantic network information having a lattice form in the Internet environment. have.

Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art to which the present invention pertains can implement the present invention in other specific forms without changing the technical spirit or essential features, The examples are to be understood in all respects as illustrative and not restrictive.

On the other hand, the scope of the present invention is specified by the appended claims rather than the detailed description, and all changes or modifications derived from the meaning and scope of the claims and equivalent concepts are included in the scope of the present invention. Should be interpreted as

According to the present invention, it is possible to efficiently search for a large amount of structured information of various types that must be analyzed in the Internet environment. Specifically, by organizing information using nodes and node identification information, it is possible to efficiently search not only the tree structure but also the large-scale information of the lattice structure in the web environment, and change by adding, deleting, and changing node identification information. You can easily edit the information of the lattice structure.

In addition, according to the present invention, the uplink search and the downlink search are free through the search interface, and the transmission load is reduced and the fast search is possible by transmitting only the information required by the user.

Claims (20)

In a system where a client and a server are connected through a network, a method of searching for information of a lattice structure in which two or more parent nodes exist for at least one node, a) transmitting, by the client, the search information to the server; b) the server searching for search target information corresponding to the reference node corresponding to the search information, and reading node identification information related to the reference node; And a search step of searching for search target information corresponding to a direct persistent node corresponding to the node identification information. And and c) transmitting, by the server, the search target information corresponding to the reference node and the direct persistent node to the client. delete The method of claim 1, The node identification information includes a first level identifier implying the highest direct persistent node, a second level identifier implying a second priority direct persistence node, and a third level identifier implying a third rank direct persistent node. A method of searching for information of a lattice structure, characterized by the above. The method of claim 3, The information of the lattice structure is divided into two or more sub networks, and the node identification information includes a sub network identifier. The method according to claim 1 or 3 or 4, and d) providing, by the client, a search interface configured based on the search target information corresponding to the reference node and the direct persistent node. The method of claim 5, The search interface includes a child node identification code, a sibling node identification code, and a parent node identification code. The method of claim 6, And the child node identification code operates normally only for the representative reference node. The method of claim 6, The search interface is initially set to provide only one child node, and when the child node identification code is selected, all the child nodes are displayed. The method of claim 6, And the search interface further comprises a subordinate relationship indicator indicating the total number of parent nodes for the reference node and how many parent nodes thereof are related. A system for searching for information of a lattice structure in which two or more parent nodes exist for at least one node, A client for transmitting search information input from a user to a server through a network, and providing search target information transmitted from the server in the form of a search interface; A server for searching for a search target information corresponding to the reference node and the direct persistent node corresponding to the search information in a database including search target information and node identification information related to the direct persistent node of the search target information and transmitting the same to the client; And Lattice-structured information retrieval system including a network for communicating between the client and the server. delete The method of claim 10, And the database further comprises detailed information on the search target information related to the node identification information. The method of claim 12, The node identification information includes a first level identifier implying the highest direct persistent node, a second level identifier implying a second priority direct persistence node, and a third level identifier implying a third rank direct persistent node. Lattice structure information retrieval system. The method of claim 12, The information of the lattice structure is divided into two or more sub networks, and the node identification information includes a sub network identifier. The method of claim 12, And the node identification information is added, deleted or changed according to the change of the lattice structure. The method of claim 12, And the information of the lattice structure is a semantic network. The method according to any one of claims 10 or 12 or 13 or 14 or 15 or 15 or 16, The search interface displays the node identification information corresponding to the reference node and the direct persistent node step by step from the highest node to the reference node, and the direct persistent node of the same path does not repeatedly display. The method of claim 17, And the search interface comprises a search interface node comprising a child node identification code, a sibling node identification code, and a parent node identification code. The method of claim 18, The child node identification code is a Lattice structure information search system, characterized in that the normal operation only for the representative reference node. The method of claim 18, And the search interface further comprises a subordinate relationship indicator indicating the total number of parent nodes for the reference node and how many parent nodes thereof are related.

Images