Enhanced Approach for Keyword Query Routing

  IJCTT-book-cover
 
International Journal of Computer Trends and Technology (IJCTT)          
 
© 2015 by IJCTT Journal
Volume-28 Number-5
Year of Publication : 2015
Authors : V.Ganga Devi, A.V.S.N Bhushana Rao
  10.14445/22312803/IJCTT-V28P145

MLA

V.Ganga Devi, A.V.S.N Bhushana Rao  "Enhanced Approach for Keyword Query Routing". International Journal of Computer Trends and Technology (IJCTT) V28(5):228-230, October 2015. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract -
In this paper we work on graph data for rewriting keyword query. Many numbers of frameworks have been designed previously for efficient and meaningful segments query formation. In previous keyword query routing frameworks there is no valid tokens information. That’s why it’s not deliver good results as of final result. In this paper we design the new keyword query rewriting framework using maximum likelihood algorithm. Its extract the meaningful keywords query rewriting information. Now we can submit the efficient and effective query. It’s give the high quality results content. This framework provides good search performance compare to all previous systems.

References
[1] S. Bergsma and Q. I. Wang. Learning noun phrase query segmentation. In EMNLP-CoNLL, pages 819{826, 2007.
[2] J. Co_man and A. C. Weaver. A framework for evaluating database keyword search strategies. In CIKM, pages 729{738, 2010.
[3] S. Cucerzan and E. Brill. Spelling correction as an iterative process that exploits the collective knowledge of web users. In EMNLP, pages 293{300, 2004.
[4] L. Gao, X. Yu, and Y. Liu. Keyword query cleaning with query logs. In WAIM, pages 31{42, 2011.
[5] H. He, H. Wang, J. Yang, and P. S. Yu. Blinks: ranked keyword searches on graphs. In SIGMOD Conference, pages 305{316, 2007.
[6] V. Hristidis, L. Gravano, and Y. Papakonstantinou. E_cient ir-style keyword search over relational databases. In VLDB, pages 850{861, 2003.
[7] R. Jones, B. Rey, O. Madani, and W. Greiner. Generating query substitutions. In WWW, pages 387{396, 2006.
[8] V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph databases. In VLDB, pages 505{516, 2005.
[9] G. Ladwig and T. Tran. Index structures and top-k join algorithms for native keyword search databases. In CIKM, pages 1505{1514, 2011.
[10] G. Li, B. C. Ooi, J. Feng, J. Wang, and L. Zhou. Ease: an e_ective 3-in-1 keyword search method for unstructured, semi-structured and structured data. In SIGMOD Conference, pages 903{914, 2008.
[11] M. Li, M. Zhu, Y. Zhang, and M. Zhou. Exploring distributional similarity based models for query spelling correction. In ACL, 2006.
[12] F. Liu, C. T. Yu, W. Meng, and A. Chowdhury. E_ective keyword search in relational databases. In SIGMOD Conference, pages 563{574, 2006.

Keywords
keyword search, maximum likelihood algorithm, rewriting framework, RDF graphs.