KR101958811B1 - Search service system based on ontology and search service method using the same - Google Patents

Abstract

The present invention relates to a search service system and a method thereof. More specifically, the present invention relates to an ontology-based search service system which searches for a search keyword in a triple data list including subjects, objects, and predicates, and expresses the relations thereof in a network graph. According to the present invention, the search service system includes: a triple store storing triple data lists which is multiple sets of triple data made of nodes including subjects and objects of the subjects, and edges including the relations between the subjects and objects; a triple search module searching for a triple data list related to a search keyword inputted from a user in the triple store; and a network graph search module displaying the shape of a network graph including the search keyword, node lists including the subjects in the triple data found with the search keyword, and an edge list connecting the node lists based on the triple data list found in the triple search module. In addition, the present invention visualizes the relations between data to easily recognize the same, thereby significantly reducing the analysis time.

Description

TECHNICAL FIELD [0001] The present invention relates to an ontology-based search service system and method,

The present invention relates to a search service system and method, and more particularly, to an ontology-based search service system and method for searching a triple data list including a plurality of search keywords, an object, and a predicate, will be.

Generally, a search service is used to search for information about a specific content. Such a search service basically receives a search keyword from a user and provides information with high relevance to the input search keyword as a result.

However, existing search services provided only one-dimensional and piece-wise information about search keywords. For example, if you search for 'Yi Soon Shin', you are simply listing all the information that contains 'Yi Soon Shin' in the sentence. Also, if we want to investigate the relationship between 'Yi Soon Shin' and 'Won Gyun', users should search 'Yi Soon Shin' and 'Won Kyun' respectively and collect simple information about each. Therefore, when the relationship between the search keywords is to be grasped, it is not easy to grasp the relationship, and thus it takes a lot of time. Therefore, there is a demand for a search service and a search method that can solve this problem.

Korean Patent Laid-Open Publication No. 10-2016-0124407 (published Oct. 27, 2016) Korean Patent Publication No. 10-2016-0054785 (published on May 17, 2016)

An object of the present invention is to provide an ontology-based search service system and method that can easily grasp the relationship between search keywords and shorten analysis time.

The objects of the present invention are not limited to the above-mentioned objects, and other objects and advantages of the present invention which are not mentioned can be understood by the following description and more clearly understood by the embodiments of the present invention. It will also be readily apparent that the objects and advantages of the invention may be realized and attained by means of the instrumentalities and combinations particularly pointed out in the appended claims.

The ontology-based search service system according to the present invention comprises a node including a subject and an object for the subject, a triple store storing a triple data list including a plurality of triple data including an edge including a relation between the subject and the object, A triple search module for searching the triple store for a triple data list of search keywords inputted from a user and a node list and an edge list in a triple data list according to each of the plurality of search keywords, And a keyword interrelationship retrieval module for forming a network graph from the formed node list, the edge list, and the relation edge list.

The present invention can be applied to a network graph form including a node list including a subject of triple data searched by a search keyword and a search keyword, and an edge list connecting the node lists based on the triple data list retrieved from the triple search module And a network graph retrieval module that expresses the network graph as a function.

An unnecessary node, an edge and a relation edge from the user are input and deleted from the network graph, and the remaining nodes are searched for by extension to obtain snapshot information implemented in a snapshot form, a story including a title and a synopsis of the snapshot information And a story search module for forming story information including meta information.

When the search keyword is inquired in the on-state, the story search module searches for a new keyword in the network graph centered on the current search keyword when loading the triple data of the new search keyword in the story search, When a triple data of a new search keyword is loaded at the time of searching for a story, a new graph is displayed next to the network graph centered on the current search keyword when the search keyword is looked up in the off state, And a graph extension mode for expressing the network graph in such a manner that a new node for the search keyword is separately displayed.

And a story unit that manages the story information, inquires and loads story information disclosed by another user, and receives additional story information from a user to generate new story information.

According to another aspect of the present invention, there is provided an ontology-based search service method including: a node including a subject and an object for the subject; and a triple data list including a plurality of triple data including an edge including a relation between the subject and the object, Storing a plurality of search keywords in a triple store, storing the plurality of search keywords in a database, querying the triple store for a triple data list of a plurality of search keywords received from a user by the triple search module, Forms a node list and an edge list in the triple data list corresponding to the plurality of search keywords, forms a relation edge list connecting the nodes related to each other in the triple data according to the plurality of search keywords, Form network graphs .

Wherein the network graph search module searches the triple search module based on the search keyword and the subject of the triple data searched with the search keyword when the triple search module receives a search keyword from the user, A node list, and an edge list connecting between the node lists, in the form of a network graph.

An unnecessary node, an edge and a relation edge from the user are input and deleted from the network graph, and the remaining nodes are searched for by extension to obtain snapshot information implemented in a snapshot form, a story including a title and a synopsis of the snapshot information And the story search module forms the story information including the meta information.

An unnecessary node, an edge and a relation edge from the user are input and deleted from the network graph, and the remaining nodes are searched for by extension to obtain snapshot information implemented in a snapshot form, a story including a title and a synopsis of the snapshot information The step of forming the story information including the meta information by the story search module comprises the steps of: when the search keyword is inquired in the on state, the graph extension mode is selected; when the triple data of the new search keyword is loaded in the story search, A step of expressing a network graph by extending a new node for a new search keyword in a network graph centering on a keyword, a graph extension mode when searching keywords in an off state, When loading triple data of a keyword, the current search keyword In such a way that the core next to a network graph shown separately a new node for a new search keyword and a step of representing the network graph.

The story part manages the story information, inquires and loads story information disclosed by another user, and receives additional story information from a user to generate new story information.

INDUSTRIAL APPLICABILITY The system and method for an ontology-based search service according to the present invention can visualize a relationship between data and can easily grasp a relationship between search keywords (data), thereby dramatically shortening the analysis time.

The above and other objects, features and advantages of the present invention will be more apparent from the following detailed description taken in conjunction with the accompanying drawings, in which: FIG.

1 is a conceptual diagram of an ontology-based search service system according to the present invention.
2 is a conceptual diagram for explaining triple data of an ontology-based search service system according to the present invention.
2 is an exemplary diagram of triple data of an ontology-based search service system according to the present invention.
4 is a diagram for explaining a triple search module in an ontology-based search service system according to the present invention.
FIG. 5 is a diagram for explaining a keyword search module in an ontology-based search service system according to the present invention.
6 is a diagram for explaining a network graph search module in an ontology-based search service system according to the present invention.
7 is a diagram illustrating an example of a log stored through a log unit in an ontology-based search service system according to the present invention.
8 is a conceptual diagram of an ontology-based search service system according to a modification of the present invention.
9 is a diagram for explaining a story search module when the graph extension mode is off in an ontology-based search service system according to the present invention.
10 is a diagram for explaining a story search module when a graph extension mode is turned on in an ontology-based search service system according to the present invention.
FIG. 11 is a diagram for describing story storage of a story in an ontology-based search service system according to the present invention.
FIG. 12 is a diagram for explaining generation of a story of a story part in an ontology-based search service system according to the present invention.
13 is a diagram for explaining an open story of a story part in an ontology-based search service system according to the present invention.
FIG. 14 is a diagram for explaining a story of a story part in an ontology-based search service system according to the present invention.
FIG. 15 is a flow chart of an ontology-based search service method according to the present invention.

The above and other objects, features, and advantages of the present invention will become more apparent by describing in detail exemplary embodiments thereof with reference to the attached drawings, which are not intended to limit the scope of the present invention. In the following description, well-known functions or constructions are not described in detail since they would obscure the invention in unnecessary detail. Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. In the drawings, the same reference numerals are used to denote the same or similar elements.

Hereinafter, an ontology-based search service system and method according to some embodiments of the present invention will be described.

1 is a conceptual diagram of an ontology-based search service system according to the present invention.

As shown in FIG. 1, the ontology-based search service system according to the present invention includes an ontology unit 100 for performing search based on stored triple data, a log for managing a search history performed by the ontology unit 100, And a user information management unit 300 for managing user information of a user accessing the ontololub unit.

The ontology unit 100 provides a network graph for a search keyword input from a user based on triple data. To this end, the ontology unit 100 includes a triple store 110 for storing triple data, a triple search module 120 for performing a search on the triple store 110 based on a keyword to be searched by the user, A keyword interrelationship retrieval module 130, and a network graph retrieval module 140 for retrieving the relationship between the keywords.

FIG. 2 is a conceptual diagram for explaining triple data of an ontology-based search service system according to the present invention, and FIG. 3 is a conceptual diagram for explaining triple data of an ontology-based search service system according to the present invention.

The triple store 110 is a database for storing and retrieving triples, and is a graph database storing meaningful sentences. The triple store 110 stores triple data, which is triple structure data. Here, the triple structure means a structure composed of a subject, a predicate, and an object, and the triple data includes a sentence including a subject, an object for the subject, and a predicate, . For example, if the triple data is 'Steven Spielberg is the maker of A.I.', Steven Spielberg is the subject and A.I is the object. In addition, the maker expresses the relation between the subject, Steven Spielberg, and the object A.I. Here, there are a plurality of triple data including object and predicate for the subject Steven Spielberg. For example, "Steven Spielberg is the producer of A.I." In addition, Steven Spielberg is the director of Ready Play One, Steven Spielberg is the producer of Ready Play One, and Steven Spielberg is the director of Saving Private Ryan. And the like. The above-mentioned triple data can be cataloged as a database as shown in FIG. 3 by inputting a plurality of pieces of the triple data to the triple store 110. Of course, the present invention is not limited to this, and may be extracted from a site other than the triple store 110.

4 is a diagram for explaining a triple search module in an ontology-based search service system according to the present invention.

The triple search module 120 queries the triple store 110 for a triple data list of search keywords. For this purpose, the triple search module 120 queries the triple data of the triple data list based on the search keyword input from the user. 4, when the triple search module 120 receives the search keyword from the user through the search keyword input window (①), the triple search module 120 searches the triple search module 120 (2). Of course, the triple search module 120 can search not only the object (③) but also the predicate (not shown) by giving the search keyword. Accordingly, the triple search module 120 can search all the triple data including the search keyword input from the user, from the triple data list. For example, if the search keyword is 'Steven Spielberg', the triple search module 120 may be able to determine that the subject is 'Steven Spielberg Triple Data' and 'Ready Play One' Steven Spielberg. '"You can search for triple data whose object is' Steven Spielberg.' Also, the triple search module 120 can search for triple data including 'Steven Spielberg' in the predicate as effective data, such as 'The Last Gun is a movie of Steven Spielberg.' That is, the triple search module 120 can search all the triple data including the search keyword from the user as valid data. In addition, the triple search module 120 forms a list of the triple data to be looked up in the form of a node and an edge. Here, an edge corresponds to a predicate, and a node corresponds to a subject and an object. In addition, a node can be represented by an image or the like that can represent a subject and an object in the form of a network graph, and an edge can be expressed by a line connecting nodes. Also, the relationship between connected nodes, that is, the predicate, can be expressed in text.

FIG. 5 is a diagram for explaining a keyword search module in an ontology-based search service system according to the present invention.

When the triple search module 120 receives two or more search keywords from the user, the keyword related search module 130 inquires the relation between two or more search keywords. When the triple search module 120 receives a search keyword from a user, the triple search module 120 queries the triple data list associated with the search keyword immediately after receiving the input search keyword, and expresses the triple data list in the form of a network graph through a network graph search module 140 described later. In addition, when the triple search module 120 receives a new search keyword from the user, the triple search module 120 displays a related triple data list in the form of a network graph immediately upon receiving the input. At this time, as shown in FIG. 5, the search keyword received from the user is displayed in the [search keyword history] (2). Here, [Search keyword history] is divided into groups. For example, a single search keyword is a form of a group of a single search keyword, and a plurality of search keywords selected for a relation search are in the form of a group. In addition, a search keyword in the form of a group can be reused later by the user. The user can select a plurality of search keywords to search for a relationship in [Search keyword history] and then input a relationship inquiry command between the search keywords in the keyword interrelationship search module 130 by pressing the [ have. When the inter-keyword relation retrieval module 130 receives a relation inquiry command between two retrieval keywords input from the user, the inter-keyword relation retrieval module 130 inquires the triple data list including the two retrieval keywords. For example, when the triple search module 120 receives 'Yi Soon Shin', 'Won Kyun', and 'Turtle Ship' as search keywords from the user, the keyword search module 130 searches the relationship Search keywords are selected. For example, when the inter-keyword relation retrieval module 130 receives an inquiry order inquiry of 'Yi Soon Shin' and 'Won Gyun' from the user, the inter-keyword relation retrieval module 130 first obtains the relation query between 'Yi Soon Shin' Based on the triple data list, a node list, which is a subject and an object, and an edge list, which is a predicate, are generated. Then, a relation list between 'Yi Soon Shin' and 'Won Gyun' is created. Here, the redundancy is removed before generating the node list, the edge list, and the relationship edge list. Then, the network graph search module 140 expresses the generated relation edge list in the form of a network graph together with the node list and the edge list for each of the previously generated 'Yi' and 'Won Gyeong' (④). By means of the inter-keyword relation retrieval module 130, the present invention can find a meaningful relation between retrieval keywords having no direct relation. In addition, the inter-keyword relation retrieval module 130 of the present invention may receive the priority, i.e., the weight, of the retrieval keyword from the user. In this case, the inter-keyword relation retrieval module 130 may increase the weight in accordance with the order of the retrieval keywords selected by the user, so that the inter-keyword relation retrieval module 130 may be positioned at the center of the network graph in order of the weighted retrieval keywords. Also, it is possible to display all the triple data related to the search keyword having a high weight, and not to display the triple data having a low relevance to the search keyword as the weight is low. To this end, the importance of the data may be displayed in the triple data.

Meanwhile, the present invention may further include an option (3) for changing the form in which the network graph is displayed. In this case, the option may include a direction to select the up / down / left / right graph direction and a sort method (SortMethod) to change the alignment of the node and the relation node and the edge in the network graph. Here, the sort method (SortMethod) may include a hub size in which a node having a large edge in a network graph is placed, and a directed in which a from / to is connected in order to output.

In addition, the present invention may further include a link (Link (5)) for inquiring a triple data list including a selected search keyword. In this case, a list of triple data expressed in the form of a network graph can be displayed in text form.

6 is a diagram for explaining a network graph search module in an ontology-based search service system according to the present invention.

The network graph retrieving module 140 retrieves the node list and the edge list generated from the triple retrieving module 120 or the node list and the edge list generated from the triple retrieving module 120, Express the relation edge list in network graph form. 6, when the search keyword is inputted from the user through the search keyword input window (①), the triple search module 120 inquires of the triple store 110 about the triple data list of the search keyword, The network graph search module 140 expresses a network graph based on the node list and the edge list generated from the inquired triple data. Of course, when the user inputs the multiple search keywords and receives the relationship inquiry command, the network graph search module 140 expresses the network graph based on the node list, the edge list, and the relation edge list.

7 is a diagram illustrating an example of a log stored through a log unit in an ontology-based search service system according to the present invention.

The log unit 200 collects and stores the search history of the user. To this end, the log unit 200 includes a log service module 210 for collecting a user's search history and a log database 220 for storing and managing the collected search history.

The log service module 210 collects the search history of the user. For this purpose, the log service module 210 may be associated with the triple search module 120.

The log database 220 stores the log collected through the log service module 210 in a database. 7, a log stored in the log database 220 includes a log ID (id), a session ID, a user ID, and a user ID that are different from each other among a plurality of logs. A search keyword, a group, a date when the user inputs a search keyword, and a keyword search success / failure information (hidden). Also, the log data can be applied to the recommendation algorithm through analysis and can be utilized for the search history function for each user.

The user information management unit 300 manages user information of a user using the ontology-based search service system according to the present invention. To this end, the user information management unit 300 includes a user information management module 310 for receiving and managing user information including a user's ID, password, personal information, and the like in the user database 320, And a user database 320 that stores user data. Herein, the user information management module 310 may receive the ID and the password from the user, and may also give the user the right to access the ontology-based search service system according to the present invention.

8 is a conceptual diagram of an ontology-based search service system according to a modification of the present invention. FIG. 9 is a diagram for explaining a story search module when the graph extension mode is off in an ontology-based search service system according to the present invention. FIG. 5 is a diagram for explaining the story search module when the extension mode is turned on. FIG.

As shown in FIG. 8, the ontology unit 100 may further include a story search module 150. The system may further include a story unit 400 for managing a story formed based on a search result of the ontology unit 100, and a curation unit 500 for providing a curation on the story production to a user based on the story .

The story search module 150 allows a user to create a story for a search keyword. To this end, the story search module 150 searches for a story by searching for a node in the network graph, leaving only meaningful information among nodes, edges, and relationship edges. To this end, the story search module 150 may add, modify, or delete nodes, edges, and / or edges implemented in a network graphic form. Referring to FIG. 9, [Graph Expansion Mode] (1) determines whether to display a network graph based on an existing search keyword or a network graph based on a new search keyword when searching for a story. This can be done by inputting [on / off] from the user. For example, when the [graph extension mode] is turned off, the story search module 150 displays a network graph based on a new keyword when searching for a story. Here, at the time of story search, a history of search keywords (②) searched by the user is displayed on the screen. Also, a [search keyword history operation button] (3) including all selection, entire deselection, and initialization can be provided. Here, the entire selection is a function to select the entire search keyword in the search keyword history, and the entire deselect deselects the entire search keyword in the search keyword history. In addition, initialization initializes the search keyword history by deleting the entire search keyword in the search keyword history. Here, when a network graph for a search keyword is expressed (④), when a specific node is double-clicked, a network graph can be expressed around a new search keyword. Meanwhile, the present invention can provide an option to filter only the predicate (⑤) among the triple data for the search keyword by eliminating redundancy. In this case, if a specific predicate is selected, the network graph can be reconstructed by filtering the nodes related to the predicate. Here, the predicate may include, for example, a direct relative, a brother, a woman relationship, a mother-daughter relationship, a creator recognized as a creator (author), and a main object of description in the case of a person. In addition, the present invention can move the network graph up, down, left, and right using the network graph moving button (6), and enlarge or reduce the network graph using the network graph enlarging / reducing button (7). Here, the network graph enlargement / reduction button (7) may have an automatic button as well as an enlargement / reduction button. In this case, the automatic button can automatically adjust the size according to the size of the network graph area .

Referring to FIG. 10, when a user performs a query by inputting a search keyword and turning on a [graph extension mode], when a triple data of a new search keyword is retrieved in a story search, Express the network graph by extending the new node in the graph. As shown in the network graph (②) of FIG. 10, when a specific node is double-clicked, a node list and an edge list related to the node are retrieved, and the network graph is reconfigured Can be performed. Meanwhile, the present invention may further include a network graph search filter (class (3)). In this case, if a class (type) is selected and a search keyword is searched, only the node corresponding to the selected class (type) is filtered to reconstruct the network graph. Here, Class (type) is a classification related to the search keyword. For example, when the search keyword is 'lead,' Class (type) may include monks, cultural heritage, temples, In addition, the present invention may include an [edit] button for leaving only meaningful information among the nodes, the edges and the relation edges in the network graph and performing an extended search on the nodes. [edit] (④) button is for implementing the network graph modification mode, and clicking the corresponding button activates the function to modify the network graph. For example, if you select a node and click the Delete button, the node is deleted from the network graph. Also, the story search module 150 can receive the story about the displayed network graph from the user, and can store it through [Storing story] (7). This is because the network graph is stored in the story database 420 in the form of a snapshot and the story is stored in the story database 420 by inputting the story information into the information temporarily stored in the snapshot form [ Save Story]. Meanwhile, the present invention can perform the network graph movement (5) and the network graph enlargement / reduction (6) even in the story search mode.

The story unit 400 manages a story created by the user. To this end, the story unit 400 includes a story management module 410 for managing story data and a story database 420 for storing story data.

The story management module 410 stores and manages story information created by the user. To this end, the story management module 410 searches for and adds, modifies, and deletes story lists and edge lists, or story list snapshots made up of node lists, edge lists, and relationship edge lists, 420). Here, the story snapshot information is a node list and an edge list, and the primary key is composed of a composite key having a user ID (userid) and a snapshot ID (snapshot_id). In addition, the story meta information includes information such as the title of the story, synopsis, disclosure, and the creator. If the public information is disclosed, other users can also view the stored story information. In addition, a new story can be created based on a story created by another user. In this case, the story based on the reference becomes a reference story.

FIG. 11 is a view for explaining story storage in a story unit in an ontology-based search service system according to the present invention, and FIG. 12 is a diagram for explaining story generation in a story unit in an ontology-based search service system according to the present invention . FIG. 13 is a view for explaining an open story of a story part in an ontology-based search service system according to the present invention, FIG. 14 is a diagram for explaining a story of a story part in a search service system based on the present invention to be.

Referring to FIG. 11, at the time of storing story information, title and synopsis are inputted, and whether or not disclosure is selected is selected. Then, when a save button is clicked, story metadata information (1) is stored in the story database 420. Here, the stored story information (2) is displayed as a network graph by inquiring the story information stored in the story database 420 in the form of a snapshot. Also, if you click the [Create Story] button (③), you can create a new story following the current story. More specifically, referring to FIG. 12, if the user clicks the [title of the previous story] (①) to be generated subsequently, the user can move to the corresponding story detail page. In the case of [search for a story] You can use features such as network graph extensions and filtering, modify mode, move, zoom, and save. Referring again to FIG. 11, when the [Move List] button () is clicked, the user can move to the story list page. [Story List] ([5]) includes [Public Story] for inquiring the story list selected for disclosure in the story database 420, [My Story] for inquiring the story list created by the user in the story database 420, . Referring to FIG. 13, the [public story] is displayed in the story database 420 by displaying the story list selected for public disclosure as described above, and when the title of each story is clicked, the story detail page is moved to the story detail page. Referring to FIG. 14, [My Story] is a list of stories created by the user in the story database 420 as described above. When the titles of each story are clicked in the same manner as the public story, .

Meanwhile, the present invention may include a curation unit 500 for providing a user with a curation on the generation of a story.

The curation unit 500 provides a function of merging a plurality of generated stories into a single integrated story. For example, a stored story can be defined as one episode, and a bundle of episodes can be created as a single integrated story. To this end, the user can select a story to be linked by recommending a story having a node capable of linking with the current story, and each story must have a link, that is, a node connected to each other. The generated curation is preferably stored in the curation database 520 to provide a management function for adding, modifying, and deleting the curation. In order to do this, the cuelization unit 500 includes a cuelization management module 510 for storing the cuelization in the cuelization database 520, adding and modifying and deleting the cuelization management module 510, and a cuellation database 520).

Next, an ontology-based search service method according to the present invention will be described with reference to the drawings. The duplicate description of the ontology-based search service system according to the present invention, which will be described later, will be omitted or briefly explained.

FIG. 15 is a flow chart of an ontology-based search service method according to the present invention.

As shown in FIG. 15, the ontology-based search service method according to the present invention includes a step S1 of storing a triple data list, a step S2 of performing a triple search, a step S3 of expressing a network graph, . In order to implement the multiple search, a search keyword relation is searched (S4) and a search keyword relation is expressed by a network graph (S5).

The step S1 of storing the triple data list stores a triple data list, which is a plurality of triple data consisting of a node including a subject and an object for the subject, and an edge including a relation between a subject and an object, I am angry. It is possible to store a plurality of triple data composed of predicates which are relation between subject, object, subject and object in a triple store. Here, the step (S1) of storing the triple data list may include storing and cataloging a plurality of triple data from the triple store, cataloging the triple data in the form of triple data, .

In step S2, the triple search module inquires of the triple store generated in step S1 to store the triple data list of the search keyword received from the user. Here, when the triple search module receives the search keyword from the user through the search keyword input window, the triple search module inquires the triple data list in which the subject matches the search keyword. Of course, the triple search module can search for the object as well as the search keyword, and if it is expanded, it can search for the predicate.

Step S3 of expressing the network graph is based on the triple data list retrieved from the triple search module. The network graph retrieval module extracts the node list including the subject of the triple data searched by the search keyword and the search keyword, It is expressed in the form of a network graph containing the edge list to be connected.

In a step S4 of retrieving a search keyword relation, when the triple search module receives two or more search keywords from the user, the inter-keyword relation search module inquires the relation between two or more search keywords. More specifically, based on a triple data list for each of a plurality of search keywords, a node list as a subject and an object, and an edge list as a predicate are generated. In addition, the redundancy is removed from the generated node list and the edge list, and the inter-keyword relation retrieval module retrieves a node list and an edge list for each of a plurality of retrieval keywords, and a relation edge list correlated among the nodes for a plurality of retrieval keywords .

Step S5 of expressing the search keyword relation by the network graph expresses the node list, the edge list and the relation edge list generated in the step S4 of searching for the search keyword relation in a network graph form.

Meanwhile, the present invention may further include the step of the story search module forming the story information.

The step of forming the story information by the story search module is a step of forming story information by adding a story about the network graph to the network graph. In this case, unnecessary nodes, edges and relationship edges are deleted from the network after inputting and receiving from the user. Then, the remaining nodes are searched for to obtain snapshot information implemented in the form of a snapshot, and a story metadata including a title and synopsis of the snapshot information And a step in which the story search module forms the story information including the information.

Here, the step of forming the story information by the story search module may include a step of, when loading the triple data of the new search keyword in the story search mode, A step of displaying a network graph in a manner of expanding a new node for a new search keyword in a network graph having a plurality of search keywords and a graph extension mode when searching keywords in an off state, When loading the data, expressing the network graph in such a way that a new node for the new search keyword is displayed beside the network graph centered on the current search keyword.

In addition, the present invention may further include a step of managing the story information by the story part.

The step of managing the story information by the story part basically manages the story information by the story part, and after the story information disclosed by the other user is displayed and loaded, the additional story information is input from the user and the new story information can be generated.

As described above, the ontology-based search service system and method according to the present invention can visualize the relationship between the data to easily grasp the relationship between the data, thereby dramatically shortening the analysis time.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the scope of the invention is not limited to the disclosed exemplary embodiments. It is obvious that a transformation can be made. Although the embodiments of the present invention have been described in detail above, the present invention is not limited to these embodiments.

100: Ontology section 110: Triple store
120: Triple search module 130: Keyword relation search module
140: network graph search module 150: story search module
200: log unit 210: log service module
220: log database 300: user information management unit
310: user information management module 320: user database
400: Story Unit 410: Story Management Module
420: story database 500:
510: Curation management module 520: Curation database

Claims (10)

A triple store in which a triple data list is stored, the triple data being a plurality of triple data consisting of a node consisting of a subject and an object for the subject, and an edge including a relation between the subject and the object,
A triple search module for searching the triple store for a triple data list of a plurality of search keywords received from a user,
Forming a node list and an edge list in a triple data list according to each of the plurality of search keywords and forming a relation edge list connecting nodes related to each other in triple data according to the plurality of search keywords, A keyword-to-keyword relationship search module that forms a network graph with an edge list and a relationship edge list, and
An unnecessary node, an edge and a relation edge from the user are input and deleted from the network graph, and the remaining nodes are searched for by extension to obtain snapshot information implemented in a snapshot form, a story including a title and a synopsis of the snapshot information An ontology-based search service system including a story search module for forming story information including meta information.
The method according to claim 1,
A node list including a subject of triple data searched with a search keyword and a search keyword, and an edge list connecting the node lists, based on the triple data list retrieved from the triple search module An ontology-based search service system including a network graph search module.
delete 3. The method according to claim 1 or 2,
The story search module includes:
In loading a triple data of a new search keyword at the time of story search, a new node for a new search keyword is extended in the network graph centered on the current search keyword, Graphs,
A method of separately displaying a new node for a new search keyword next to a network graph centered on a current search keyword when loading a triple data of a new search keyword when searching for a search keyword in an off state, Ontology - based search service system that includes a graph extension mode that expresses a network graph as an ontology.
5. The method of claim 4,
An ontology-based search service system that manages the story information, searches for story information disclosed by another user, loads the story information, and receives a story information from a user to generate new story information.
Storing a triple data list, which is a plurality of triple data consisting of a node consisting of a subject and an object for the subject, and an edge including a relation between the subject and the object, in a triple store,
Querying the triple store for a triple data list of a plurality of search keywords received from a user by the triple search module,
The inter-keyword relation retrieval module forms a node list and an edge list in a triple data list according to each of the plurality of retrieval keywords, and a relation edge list for connecting nodes related to each other in the triple data according to the plurality of retrieval keywords Forming a network graph with the formed node list, the edge list and the relationship edge list, and
An unnecessary node, an edge and a relation edge from the user are input and deleted from the network graph, and the remaining nodes are searched for by extension to obtain snapshot information implemented in a snapshot form, a story including a title and a synopsis of the snapshot information And the story search module forms story information including meta information.
The method according to claim 6,
Wherein the network graph search module searches the triple search module based on the search keyword and the subject of the triple data searched with the search keyword when the triple search module receives a search keyword from the user, A node list, and an edge list connecting between the node lists, in the form of a network graph.
delete 8. The method according to claim 6 or 7,
An unnecessary node, an edge, and a relation edge from the user are input and deleted from the network graph, and the remaining nodes are searched for by extension to obtain snapshot information,
Wherein the story search module includes story information including story titles and synopsis of the snapshot information,
When the search keyword is inquired in the on state, the graph expansion mode is expanded. When loading the triple data of the new search keyword in the story search, a new node for the new search keyword is expanded in the network graph centered on the current search keyword The method comprising the steps of:
When loading the triple data of a new search keyword at the time of story search, a new node for a new search keyword is added to the network graph centered on the current search keyword, And displaying the network graph in a manner that is separately displayed.
10. The method of claim 9,
Managing the story information by the story part, inquiring and loading story information disclosed by another user, and receiving additional story information from the user to generate new story information.

Images