Discussions on Subgraph Ranking for Keyworded Search

초록

Recently many graph information can be available i n numerous application domains, including relational database s, Web, Bioinformatics, Chemistry reaction information, Ontol ogy, XML, Social Networks, Patent Information, Paper citatio n, and RDF graphs, etc. Graphs also have structure to be foun d to express complicate data relationships like Web, Database, XML Document and Semantic Web. Traditionally, user had to learn difficult query languages like SQL to do information sear ch over graph structures. There are needs to find out a simple and effective keyword search method for non-technical users s o as to use a keyword search method on the ever-increasing gra ph data. The purpose of this research is to develop a method fo r ranking over the graph structures. We propose the relevance score for each node and link by using each query keyword.

키워드