Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

A Multilevel Scoring Mechanism to Compute Top - K Routing Plans for a Keyword Query

Mr Bharath Reddy, Mr. Manas Kumar Yogi, Grandhi Satya Suneetha, ,
Dept of CSE, Pragati Engineering College, Kakinada. Andhra Pradesh, India

In recent years Keyword search over database is explored. For information retrieval keyword query used, but due to ambiguity of multiple queries over database should be explored. while getting multiple result to keyword query we need effective crawlers, if search engine might be give multiple result to the single query then computation of all the these results and suggesting best one among all result defined as problem statement. In this paper, the label ranking system over unpredictable is presented. The Keyword directing strategy is utilized to course the catchphrases to significant source. In this methodology two techniques are incorporated. If user gives a keyword query to the search engine then the search engine should process the query and returns the appropriate result based rank. The result construction done based on R-Tree and it allows NN queries should be computed and based on I-Index we will construct the score for each NN query result.

Bharath Reddy," A Multilevel Scoring Mechanism to Compute Top - K Routing Plans for a Keyword Query”, International Journal of Computer Engineering In Research Trends, 3(11):602-608,November-2016.

Keywords : Keyword searching, Uncertain graph, algorithm, Keyword routing, graph data, Keyword query

[1] Wangchao Le, Feifei Li, Anastasios Kementsietsidis, Songyun Duan, Scalable Keyword Search on Large RDF Data", IEEE2013.
 [2] George Kollios, Michalis Potamias, and EvimariaTerzi, Clustering Large Probabilistic Graphs, IEEE vol. 25, NO. 2, February 2013
 [3] Ye Yuan, Guoren Wang, Lei Chen, and HaixunWang, Efficient Keyword Search on Uncertain Graph Data, IEEE vol. 25, no. 12, December 2013.
 [4] Jun Gao, Jiashuai Zhou, Jeffrey Xu Yu, and TengjiaoWang, Shortest Path Computing in Relational DBMSs, IEEE vol. 26, no. 4, April 2014.
 [5] ZhaonianZou, Jianzhong Li, Member, IEEE, Hong Gao, and Shuo Zhang, Mining Frequent Subgraph Patterns from Uncertain Graph Data‖, IEEE vol. 22, no. 9, September 2010.
 [6] Lifang Qiao, Yu Wang, A Keyword Query Method for Uncertain Database‖, 2nd International Conference on Computer Science and Network Technology, IEEE, 2012.
 [7] Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao Zhang, Xuemin Lin,‖ Finding Top-k Min-Cost Connected Trees in Databases‖, IEEE 1- 4244-0803-2/07/2007.
 [8] Thanh Tran and Lei Zhang, ‖ Keyword Query Routing‖, IEEE vol. 26, no. 2, February2014.
 [9] Ye Yuan, Guoren Wang, Haixun Wang, Lei Chen,‖ Efficient Subgraph Search over Large Uncertain Graphs‖. In Proceedings of the VLDB Endowment, Vol. 4,pp. 876-886, 2011.
 [10] Hao He, Haixun Wang, Jun Yang, Philip S. Yu,‖ BLINKS: Ranked Keyword Searches on Graphs‖, SIGMOD'07, June 2007. 
[11]Haoliang Jiang, HaixunWang, Philip S. Yu, and Shuigeng Zhou GString: A novel approach for efficient search in graph databases. In ICDE, 2007.
 [12] DennisShasha, Jason T.L.Wang, and RosalbaGiugno. Algorithmics and applications of tree and graph searching. In PODS, pages 39–52, 2002.
[13] Xifeng Yan, Philip S. Yu, and Jiawei Han. Substructure similarity search in graph databases. In SIGMOD, pages 766–777, 2005.
 [14] Branimir T. Todorovic, Svetozar R. Rancic, Ivica M. Markovic, Eden H. Mulalic, Velimir M. Ilic, ―Named Entity Recognition and Classification using Context Hidden Markov Model,‖ 9th Symposium on Neural Network Application in Electrical Engineering, NEUREL, pp. 43-46, 2008.
 [15] Dekai Wu, Weifeng Su and Marine Carpuat, ―A Kernel PCA Method for Superior Word Sense Disambiguation,‖ Proceedings of the 42nd Meeting of the Association for Computational Linguistics, pp. 637-644, 2004.
 [16]AbdelazizZitouni, AsmaDamankesh, ForooghBarakati, Maha Atari, Mohamed Watfa, FarhadOroumchian, ―Corpus-based Arabic Stemming Using N-grams,‖ Asia Information Retrieval Symposium - AIRS, vol. 6458, pp. 280-289, 2010.
 [17] Hassan Mohamed, Nazlia Omar, MohdJuzaidinAb Aziz, ―Statistical Malay Part-of-Speech (POS) Tagger using Hidden Markov Approach,‖ International Conference on Semantic Technology and Information Retrieval, pp. 231-236, June 2011.

DOI Link : NA

Download :

Refbacks : There are currently no refbacks


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events

Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.

Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.

IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert

IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)

Emerging Sources Citation Index (in process)

IJCERT title is under evaluation by Scopus.

Key Dates

☞   LAST DATE OF SUBMISSION : 31st March 2023
In 7 Days

Important Announcements

All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index

Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)

Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links

Conference Proposal