Abstract
Spatial approximate keyword queries consist of a spatial condition and a set of keywords as the fuzzy textual conditions, and they return objects labeled with a set of keywords similar to queried keywords while satisfying the spatial condition. Such queries enable users to find objects of interest in a spatial database, and make mismatches between user query keywords and object keywords tolerant. With the rapid growth of data, spatial databases storing objects from diverse geographical regions can be no longer held in main memories. Thus, it is essential to answer spatial approximate keyword queries over disk resident datasets. Existing works present methods either returns incomplete answers or indexes in main memory, and effective solutions in disks are in demand. This paper presents a novel disk resident index RMB-tree to support spatial approximate keyword queries. We study the principle of augmenting R-tree with capacity of approximate keyword searching based on existing solutions, and store multiple bitmaps in R-tree nodes to build an RMB-tree. RMB-tree supports spatial conditions such as range constraint, combined with keyword similarity metrics such as edit distance, dice etc. Experimental results against R-tree on two real world datasets demonstrate the efficiency of our solution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Open street map. http://www.openstreetmap.org/
Chen, L., Jiaheng, L., Yiming, L.: Efficient merging and filtering algorithms for approximate string searches. In: IEEE ICDE 2008 (2008)
Chen, Y.-Y., Suel, T., Markowetz, A.: Efficient query processing in geographic web search engines. In: ACM SIGMOD, pp. 277–288 (2006)
Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: ACM SIGMOD, pp. 993–1002 (1984)
Jensen, C.S., Wu, D., Chen, L., Cong, G.: Spatial keyword query processing: An experimental evaluation. In: VLDB (2013)
Marios, H., Amit, C., Nick, K., Divesh, S.: Fast indexes and algorithms for set similarity selection queries. In: IEEE ICDE, pp. 267–276 (2008)
Sattam, A., Alexander, B., Li, C.: Supporting location-based approximate-keyword queries. In: ACM SIGSPATIAL, pp. 61–70 (2010)
Yao, B., Li, F., Hadjieleftheriou, M., Hou, K.: Approximate string search in spatial databases. In: IEEE ICDE, pp. 545–556 (2010)
Yinghua, Z., Xing, X., Chuang, W., Yuchang, G., Wei-Ying, M.: Hybrid index structures for location-based web search. In: ACM CIKM, pp. 155–162 (2005)
Zhang, D., Ooi, B.C., Tung, A.: Locating mapped resources in web 2.0. In: IEEE ICDE, pp. 521–532 (2010)
Zhang, Z., Hadjieleftheriou, M., Ooi, B.C., Srivastava, D.: Bed-tree: an all-purpose index structure for string similarity search based on edit distance. In: ACM SIGMOD, pp. 915–926 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, J., Yang, D., Wei, Y., Gao, H., Li, J., Yuan, Y. (2015). Answering Spatial Approximate Keyword Queries in Disks. In: Cheng, R., Cui, B., Zhang, Z., Cai, R., Xu, J. (eds) Web Technologies and Applications. APWeb 2015. Lecture Notes in Computer Science(), vol 9313. Springer, Cham. https://doi.org/10.1007/978-3-319-25255-1_35
Download citation
DOI: https://doi.org/10.1007/978-3-319-25255-1_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25254-4
Online ISBN: 978-3-319-25255-1
eBook Packages: Computer ScienceComputer Science (R0)