Skip to main content
SpringerLink
Log in

Pairwise Expansion: A New Topdown Search for mCK Queries Problem over Spatial Web

  • Conference paper
  • First Online:
Web Technologies and Applications (APWeb 2016)

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

Included in the following conference series:

Abstract

This paper focuses on the problem of m-Closest Keywords (mCK) queries over spatial web objects. An \(mCK\ query\) is to find the optimal set of objects (object-set) in the sense that they are the spatially-closest records and satisfy m user-given keywords. We propose a new approach called Pairwise Expansion to find an exact solution of mCK queries based on topdown search of an on-the-fly quad-tree. This approach first enumerates object-pairs in a topdown way, then picks up each ‘closer’ object-pair and expands it into candidate object-sets. Experimental results show that this approach is more efficient than existing topdown search strategies and applicable for real spatial web data.

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

Access this chapter

Log in via an institution
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 EPUB and 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

Institutional subscriptions

References

  1. Zhang, D.X., Chee, Y.M., Mondal, A., Tung, A.K.H., Kitsuregawa, M.: Keyword search in spatial databases: towards searching by document. In: IEEE ICDE, pp. 688–699 (2009)

    Google Scholar 

  2. Guo, T., Cao, X., Cong, G.: Efficient algorithms for answering the \(m\)-closest keywords query. In: ACM SIGMOD, pp. 405–418 (2015)

    Google Scholar 

  3. Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest pair queries in spatial databases. In: ACM SIGMOD, pp. 189–200 (2000)

    Google Scholar 

  4. Qiu, Y., Ohmori, T., Shintani, T.,Fujita, H.: A new algorithm for \(m\)-closest keywords query over spatial web with grid partitioning. In: IEEE/ACIS SNPD, pp. 507–514 (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Systems, The University of Electro-Communications, 1-5-1 Chofugaoka, Chofu, Tokyo, 182-8585, Japan

    Yuan Qiu, Tadashi Ohmori, Takahiko Shintani & Hideyuki Fujita

Authors
  1. Yuan Qiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tadashi Ohmori
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Takahiko Shintani
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hideyuki Fujita
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuan Qiu .

Editor information

Editors and Affiliations

  1. School of Computing, University of Utah, Salt Lake City, Utah, USA

    Feifei Li

  2. School of Electrical Engineering, Seoul National University, Seoul, Korea (Republic of)

    Kyuseok Shim

  3. Soochow University , Suzhou, China

    Kai Zheng

  4. Soochow University , Suzhou, China

    Guanfeng Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Qiu, Y., Ohmori, T., Shintani, T., Fujita, H. (2016). Pairwise Expansion: A New Topdown Search for mCK Queries Problem over Spatial Web. In: Li, F., Shim, K., Zheng, K., Liu, G. (eds) Web Technologies and Applications. APWeb 2016. Lecture Notes in Computer Science(), vol 9932. Springer, Cham. https://doi.org/10.1007/978-3-319-45817-5_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45817-5_46

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45816-8

  • Online ISBN: 978-3-319-45817-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation