Skip to content
Free planNo credit card requiredStart writing

article · 2017

Creating routing plan for keyword query

Pranali Nunes, Anuradha Srinivasaraghavan, Varsha Nagpurkar

Cited by 0Abstract and details only

Abstract

Keyword search is an inherent example for searching linked data sources on the web. The proposed work tries to route keywords only to relevant sources. This would also reduce the high cost of processing keyword search queries over all sources. This proposed work also tries to compute top-k routing places based on their potentials to contain results for a given keyword query. The number of potential results may increase exponentially with the number of sources and links between them. Most of the results may be not necessary especially when they are not relevant to the user. The proposed work uses to solve the problem of keyword search over large number of linked and structured data source by using keyword expansion.

Cite this paper

APA 7

Nunes, P., Srinivasaraghavan, A., & Nagpurkar, V. (2017). Creating routing plan for keyword query. https://doi.org/10.1109/icecds.2017.8389953

MLA 9

Nunes, Pranali, et al. “Creating routing plan for keyword query.” vol. 2, 2017, pp. 2737–40, https://doi.org/10.1109/icecds.2017.8389953.

Chicago

Nunes, Pranali, Anuradha Srinivasaraghavan, and Varsha Nagpurkar. 2017. “Creating routing plan for keyword query.” https://doi.org/10.1109/icecds.2017.8389953.

Harvard

Nunes, P., Srinivasaraghavan, A. and Nagpurkar, V. (2017) ‘Creating routing plan for keyword query’. Available at: https://doi.org/10.1109/icecds.2017.8389953.

BibTeX
@article{nunes2017creating,
  title = {{Creating routing plan for keyword query}},
  author = {Nunes, Pranali and Srinivasaraghavan, Anuradha and Nagpurkar, Varsha},
  volume = {2},
  pages = {2737--2740},
  year = {2017},
  doi = {10.1109/icecds.2017.8389953}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.