Skip to main content

An Efficient Packing Algorithm for Spatial Keyword Queries

  • Conference paper
  • 2353 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7425))

Abstract

With the increase of location-based services, Web contents are being geo-tagged, and spatial keyword queries that retrieve objects satisfying both spatial and keyword conditions are gaining in prevalence. Unfortunately, the state-of-the-art packing algorithms only focus on spatial relationship, and they are not fit for the spatial keyword queries. In this paper, we propose a new packing algorithm named KBS which takes both location and keyword information into consideration, thus optimizing R-tree for spatial keyword queries. Experimental results on both real and synthetic datasets show that our method achieves high performance and space utilization.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sanderson, M., Kohler, J.: Analyzing geographic queries. In: SIGIR (2004)

    Google Scholar 

  2. Felipe, I.D., Hristidis, V., Rishe, N.: Keyword search on spatial databases. In: ICDE (2008)

    Google Scholar 

  3. Cong, G., Jensen, C.S., Wu, D.: Efficient retrieval of the top-k most relevant spatial web objects. In: PVLDB (2009)

    Google Scholar 

  4. Yao, B., Li, F., Hadjieleftheriou, M., Hou, K.: Approximate string search in spatial databases. In: ICDE (2010)

    Google Scholar 

  5. Wu, D., Yiu, M.L., Jensen, C.S., Cong, G.: Efficient continuously moving top-k spatial keyword query processing. In: ICDE (2011)

    Google Scholar 

  6. Roy, S.B., Chakrabarti, K.: Location-aware type ahead search on spatial databases: semantics and efficiency. In: SIGMOD (2011)

    Google Scholar 

  7. Lu, J., Lu, Y., Cong, G.: Reverse spatial and textual k nearest neighbor search. In: SIGMOD (2011)

    Google Scholar 

  8. Cao, X., Cong, G., Jensen, C.S., Ooi, B.C.: Collective spatial keyword querying. In: SIGMOD (2011)

    Google Scholar 

  9. Roussopoulos, N., Leifker, D.: Direct spatial search on pictorial databases using packed R-trees. In: SIGMOD (1985)

    Google Scholar 

  10. Kamel, I., Faloutsos, C.: On packing R-trees. In: CIKM (1993)

    Google Scholar 

  11. Leutenegger, S., Edgington, J.M., Lopez, M.A.: STR: A simple and efficient algorithm for R-tree packing. In: ICDE (1997)

    Google Scholar 

  12. Garcia, Y., Lopez, M., Leutenegger, S.: A greedy algorithm for bulk loading R-trees. In: ACM-GIS (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pan, J., Li, D., Li, L. (2012). An Efficient Packing Algorithm for Spatial Keyword Queries. In: Lee, G., Howard, D., Kang, J.J., Ślęzak, D. (eds) Convergence and Hybrid Information Technology. ICHIT 2012. Lecture Notes in Computer Science, vol 7425. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32645-5_70

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32645-5_70

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32644-8

  • Online ISBN: 978-3-642-32645-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics