Review Papers | Computer Science & Engineering | India | Volume 4 Issue 10, October 2015
Keyword Query Routing using Relationship Graph
Abstract: searching is an best method for searching linked data sources on the web. We, propose to route s only to relevant sources to reduce the processing cost of queries search over all sources of web. We propose a best method for computing top- routing plans based on their potentials to contain results for a given query. We find a -element relationship summary that shows a relationships between s and the data elements showing them. A multilevel scoring mechanism is proposed for computing the relevance of routing plans based on scores at the level of s, data elements, element sets, and subgraphs that connect these elements. Further, we show routing greatly helps to improve the performance of search, without compromising its result quality.
Keywords: query, query routing, RDF, graph structured data, search
Edition: Volume 4 Issue 10, October 2015,
Pages: 174 - 176
How to Cite this Article?
Chaitali S. Chaudhari, M. M. Naoghare, "Keyword Query Routing using Relationship Graph", International Journal of Science and Research (IJSR), Volume 4 Issue 10, October 2015, pp. 174-176, https://www.ijsr.net/get_abstract.php?paper_id=SUB158626
How to Share this Article?
Similar Articles with Keyword 'query'
Survey on Algorithms Predicting Performance of Keyword Queries
A Comprehensive Study of Elasticsearch
Nikita Kathare | O. Vinati Reddy | Dr. Vishalakshi Prabhu