Keyword Query Routing

Authors

  • Sandeep Chand Kumain

DOI:

https://doi.org/10.17762/msea.v70i1.2301

Abstract

Abstract

An innovative method of accessing connected data sources on the internet is keyword search.  We propose to route keywords only to relevant sources in order to reduce the substantial processing cost of keyword search queries throughout all providers.  We propose a novel method for computing top-k routing plans by considering their propensity to contain responses for a specific keyword query.  We use a summary of the links between the data components referencing certain keywords to concisely convey these interactions.  For calculating the relevance of routing plans through scores at the level of keywords, data components, element sets, along with sub graphs connecting these elements, a multilayer scoring system is given. We mostly employ two strategies while looking for keywords. Both schema-based and schema-agnostic techniques are involved. On top of commercial databases are developed schema-based techniques. By mapping keywords to the components of databases, also known as keyword elements, a keyword is processed. The calculated keyword components are then joined using the schema-derived valid join sequences to create candidate networks that represent potential answers to the keyword query. Schema-neutral methods work directly with the data. In these methods, the structured outcomes are computed by examining the underlying graphs. Steiner trees and graphs are used to represent keywords and related items. This method seeks to identify structures in the Steiner trees. A Steiner graph, for example, is the path between uni1 and award for the query "Stanley Robert Award".  For the effective exploration of keyword search results over data graphs—which may be quite large—a variety of techniques have been developed. Bidirectional search and dynamic programming are two examples.

Downloads

Published

2021-01-31

How to Cite

Kumain, S. C. . (2021). Keyword Query Routing. Mathematical Statistician and Engineering Applications, 70(1), 207–215. https://doi.org/10.17762/msea.v70i1.2301

Issue

Section

Articles