Optimal Processing Keyword CoverSearch in Spatial Database

K.S. Dadapeer*, S. Salam**, T. V. Rao***
* PG Scholar, Department of Computer Science and Engineering, Sree Vidyanikethan Engineering College, Tirupati, India.
**-*** Professor, Department of Computer Science and Engineering, Sree Vidyanikethan Engineering College, Tirupati, India.
Periodicity:June - August'2016
DOI : https://doi.org/10.26634/jcom.4.2.8123

Abstract

Keywords are used in different approaches. In text editing and DBMS (Data Base Management System), a keyword is used to find certain records. In programming languages, a keyword is the reserved word in a program since it has a meaning. It is also used to search the relevant web pages through a search engine. In spatial database having a set of objects, each object is associated with a keyword such as hotels, restaurants, etc. Here the issue is closest keyword cover search also called as keyword cover, which covers a set of query keyword and minimum inter object distance. At present days we are giving the importance of keyword rating to make a better decision. Later, generic version of the keyword cover called best keyword cover, which the objects cover the inter object distance and keyword rating. Baseline algorithm simulates closest keywords search, combining objects from query keyword to generate a candidate key. In baseline algorithm, the performance decreases because, as the number of query keyword increases the candidates increases, and to overcome this drawback, a scalable algorithm called Keyword Nearest Neighbour Expansion (K-NNE) variation was introduced with previous approach. The keyword Nearest Neighbour Expansion (K-NNE) gradually decreases the candidate key. In previous work with minimal tree cover, the query keyword in future finds the sub graph rather than minimal tree, which is more informative to the users. Nodes in a tree are close to each other, and the other nodes far away from each other has a weak relationship on content nodes in a tree. All keywords having same importance, ie, the result containing strong relationship that is the shortest distance between each pair of nodes selected over weak relationship. Tree base method content and non-content nodes in the tree during the results, hundreds and thousands of nodes in input graph have high time and memory complexity.

Keywords

Spatial Database, Spatial Object, Spatial Keyword Query.

How to Cite this Article?

Dadapeer, K.S., Salam, S., and Rao, T.V. (2016). Optimal Processing Keyword Cover Search In Spatial Database. i-manager’s Journal on Computer Science, 4(2), 31-38. https://doi.org/10.26634/jcom.4.2.8123

References

[1]. Ke Deng, Xin Li, Jiaheng Lu, and Xiaofang Zhou, (2015). “Best Keyword Cover Search”. Knowledge and Data Engineering, IEEE Transaction.
[2]. X. Cao, G. Cong, and C. Jensen, (2010). “Retrieving top-k prestige-base relevant spatial web objects”. Proc. VLDB Endowment, Vol.3, No.½, pp.373-384.
[3]. G. Cong, C. Jensen and D. Wu, (2009). “Efficient retrieval of the top-K most relevant spatial web objects”. Pro, VLDB Endowment, Vol.2, No.1, pp.337-348.
[4]. S.B. Roy and K. Chakrabarti, (2011). “Location aware type a head search on spatial database: Semantic and Efficiency”. In Proc. ACM SIGMOD Int. Conf. Manage. Data, pp.361-37.
[5]. D. Zhang, B. Ooi, and A. Tung, (2010). “Locating mapped resources in web 2.10”. Proc. IEEE 26th International Conference on Data Engineering, pp.521- 532.
[6]. T. Brinkoff, H. Kriegel, and Seeger, (1993). “Efficient processing pf Spatial Joining using r-trees”. In Proc. ACM SIGMOD Int. Conf. Manage. Data, pp.237-246.
[7]. Lei Liu, Yong Gao, Xing Lin, Xiao Guo, Haoran Li, “A Framework and implementation for Qualitative Geographic Information Retrival”. 21st International Conference on Geoinformatics.
[8]. Xing Cao, Gao Cong Christian, S. Jensen and Beng Chin Ooi, (2011). “Collective Spatial Keyword Querying”. SIGMOD 11, Athens, Greece.
[9]. R. Hariharan, B. Hore, C. Li and S. Mehrotra, (2007). “Processing Spatial Keyword (SK) Queries in geographic information retrieval (GIR) systems”. In Proc.19th Int. Conf.Sci.Static Data Base Manage, pp.16-23.
[10]. Gisli, R. Hjaltason and Hana Samet, (1999). “Distance Browsing in Spatial Databases”. ACM Trans. Database System, Vol.24, No.2, pp.265-318.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.