Routing Keyword Search Using KERG
Journal: International Journal of Science and Research (IJSR) (Vol.3, No. 11)Publication Date: 2014-11-05
Authors : Chaitali S. Chaudhari; M. M. Naoghare;
Page : 1050-1052
Keywords : search; query; Routing; graph-structured data;
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.
Other Latest Articles
- Performance Measurement of Keyword Search Systems
- Fluoride Content in Brine Samples, Salt, and Pan Soil of Ramanathapuram, Ramanathapuram District, Tamil Nadu, India
- Implementation of High Throughput Radix-16 FFT Algorithm
- A Survey Paper on Federated Access to Kerberized Services in the Eduroam Network
- Survey on Securely Shared Data on Cloud
Last modified: 2021-06-30 21:12:54