Impact Factor:6.549
 Scopus Suggested Journal: Tracking ID for this title suggestion is: 55EC484EE39417F0

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Platinum Open Access and Multidisciplinary




Welcome to IJCERT

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

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

Back to Current Issues

A Novel Framework to Measure the Degree of Difficulty on Keyword Query Routing

Kallem Rajender Reddy, Y.Sunitha, , ,
Affiliations
M.Tech (CS),Department of Computer Science & Engineering , Sri Indu Institute of Engineering & Technology, Sheriguda (v)Ibrahimpatnam(M), RR District,501510
Asst-professor,Department of Computer Science & Engineering , Sri Indu Institute of Engineering & Technology, Sheriguda (v)Ibrahimpatnam(M), RR District,501510
:NOT ASSIGNED


Abstract
Spatial queries, such as range search and nearest neighbor retrieval, involve only conditions on objects geometric properties. A spatial database manages multidimensional objects(such as points, rectangles, etc.), and provides fast access to those objects based on different selection criteria.Keyword queries on databases provide easy access to data, but often suffer from low ranking quality, i.e., low precision and/or recall, as shown in recent benchmarks. It would be useful to identify queries that are likely to have low ranking quality to improve the user satisfaction. For instance, the system may suggest to the user alternative queries for such hard queries. In this paper, we analyze the characteristics of hard queries and propose a novel framework to measure the degree of difficulty for a keyword query over a database, considering both the structure and the content of the database and the query results. We evaluate our query difficulty prediction model against two effectiveness benchmarks for popular keyword search ranking methods. we present a suite of optimizations to minimize the incurred time overhead.


Citation
Kallem Rajender Reddy,Y.Sunitha."A Novel Framework to Measure the Degree of Difficulty on Keyword Query Routing". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 09,pp.640-645, SEPTEMBER - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I923.pdf,


Keywords : Keyword queries, KEYWORD query interfaces, INEX Queries, Semantic Search.

References
[1] X. Cao, G. Cong, C.S. Jensen, and B.C. Ooi, ―Collective Spatial Keyword Querying,‖ Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 373-384, 2011. 
[2] J. Lu, Y. Lu, and G. Cong, ―Reverse Spatial and Textual k Nearest Neighbor Search,‖ Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 349-360, 2011.  
[3] D. Zhang, Y.M. Chee, A. Mondal, A.K.H. Tung, and M. Kitsuregawa, ―Keyword Search in Spatial Databases: Towards Searching by Document,‖ Proc. Int’l Conf. Data Eng. (ICDE), pp.688-699, 2009. 
[4] G. Cong, C.S. Jensen, and D. Wu, ―Efficient Retrieval of the Top-k Most Relevant Spatial Web Objects,‖ PVLDB, vol. 2, no. 1, pp. 337- 348, 2009. 
[5] I.D. Felipe, V. Hristidis, and N. Rishe, ―Keyword Search on Spatial Databases,‖ Proc. Int’l Conf. Data Eng. (ICDE), pp. 656-665, 2008. 
[6] Yufei Tao and Cheng Sheng, ―Fast Nearest Neighbor Search with Keywords‖, IEEE transactions on knowledge and data engineering, VOL. 26, NO. 4, APRIL 2014.
 [7] M. Satyanarayanan, P. Bahl, R. Caceres, and N. Davies, ―The case for vm-based cloudlets in mobile computing,‖ IEEE Pervasive Computing, vol. 8, pp. 14–23, 2009. 
[8] S. Kosta, A. Aucinas, P. Hui, R. Mortier, and X. Zhang, ―Thinkair: Dynamic resource allocation and parallel execution in the cloud for mobile code offloading,‖ in Proc. of IEEE INFOCOM, 2012. [9] Z. Huang, C. Mei, L. E. Li, and T. Woo, ―Cloudstream: Delivering high-quality streaming videos through a cloud-based svc proxy,‖ in INFOCOM’11, 2011, pp. 201 205. 
[10] T. Coppens, L. Trappeniners, and M. Godon, ―AmigoTV: towards a social TV experience,‖ in Proc. of EuroITV, 2004. 
[11] N. Ducheneaut, R. J. Moore, L. Oehlberg, J. D. Thornton, and E. Nickell, ―Social TV: Designing for Distributed, Sociable Television Viewing,‖ International Journal of Human-Computer Interaction, vol. 24, no. 2, pp. 136–154, 2008. 
[12] A. Carroll and G. Heiser, ―An analysis of power consumption in as smartphone,‖ in Proc. of USENIXATC, 2010. 
[13] What is 100% Pure Java, http://www.javacoffeebreak.com/faq/faq0006.html. 
[14] J. Santos, D. Gomes, S. Sargento, R. L. Aguiar, N. Baker, M. Zafar, and A. Ikram, ―Multicast/broadcast network convergence in next generation mobile networks,‖ Comput. Netw., vol. 52, pp. 228–247, January 2008. 
[15] DVB-H, http://www.dvb-h.org/. 
[16] K. Chorianopoulos and G. Lekakos, ―Introduction to social tv: Enhancing the shared experience with interactive tv,‖ International Journal of Human- Computer Interaction, vol. 24, no. 2, pp. 113–120, 2008


DOI Link : NOT ASSIGNED

Download :
  V2I923.pdf


Refbacks : Currently there are no Refbacks

Support Us


We have kept IJCERT is a free peer-reviewed scientific journal to endorse conservation. We have not put up a paywall to readers, and we do not charge for publishing. But running a monthly journal costs is a lot. While we do have some associates, we still need support to keep the journal flourishing. If our readers help fund it, our future will be more secure.

Quick Links



DOI:10.22362/ijcert


Science Central

Score: 13.30





Submit your paper to editorijcert@gmail.com