Downloads: 116
India | Computer Science Engineering | Volume 3 Issue 11, November 2014 | Pages: 1050 - 1052
Routing Keyword Search Using KERG
Abstract: Searching a keyword on a vast web is somewhat easier, but the search over a enlarge number of structured and linked data creates a difficulty. Routing keywords only to applicable sources can reduce the high cost of searching of queries over all sources. It is difficult for web user to use this web data by means of SQL or SPARQL. We hire a keyword element relationship summary that compactly represents relationships between keywords and the data elements called the set-level keyword-element relationship graph (KERG). A multilevel scoring mechanism is suggested for computing the relevant of routing plans based on the level of keyword, data elements, element sets and subgraphs that connect these elements.
Keywords: search, query, Routing, graph-structured data
How to Cite?: Chaitali S. Chaudhari, M. M. Naoghare, "Routing Keyword Search Using KERG", Volume 3 Issue 11, November 2014, International Journal of Science and Research (IJSR), Pages: 1050-1052, https://www.ijsr.net/getabstract.php?paperid=OCT141124, DOI: https://dx.doi.org/10.21275/OCT141124