International Journal of Computer Engineering in Research Trends

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

Announcements

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

☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :

☞ LAST DATE OF SUBMISSION : 31st March 2023

☞ SUBMISSION TO FIRST DECISION : In 7 Days

☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION

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%

 Conference Proposal

 Peer Review

 Digital Library

 Register here

 Conference Proposal

 Special Issue Proposal

 Conference Proposal Guidelines

 Upcoming Conference

DOI:10.22362/ijcert

Welcome to IJCERT