Skip to main content

Processing Min Cost Queries on Heterogeneous Neighboring Objects

  • Conference paper
  • First Online:
Cognitive Cities (IC3 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1227))

Included in the following conference series:

  • 1536 Accesses

Abstract

In this paper, we present a novel type of location-based queries, named the min cost queries (or MCQ for short). Given the n types of spatial objects, O1, O2, …, On, where Oi has a cost attribute, and a user-defined distanced. The MCQ finds a set of n objects, {o1, o2, …, on}, such that the distance between any pair of objects in {o1, o2,…, on} does not exceed d and the total cost of {o1, o2, …, on} is smallest. To efficiently process the MCQ, we design a R-tree-based index, the Rc−tree, to man-age the spatial objects with their locations and costs. Then, we develop a top k-based MCQ algorithm combined with the Rc-tree to retrieve the MCQ result.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Benetis, R., Jensen, C.S., Karciauskas, G., Saltenis, S.: Nearest neighbor and reverse nearest neighbor queries for moving objects. VLDB J. 15(3), 229–249 (2006)

    Article  Google Scholar 

  2. Mokbel, M.F., Xiong, X., Aref, W.G.: SINA: scalable incremental processing of continuous queries in spatio-temporal databases. In: Proceedings of the ACM SIGMOD, pp. 623–634 (2004)

    Google Scholar 

  3. Sistla, A.P., Wolfson, O., Chamberlain, S., Dao, S.: Modeling and querying moving objects. In: ICDE, pp. 422–432 (1997)

    Google Scholar 

  4. Tao, Y., Papadias, D.: Time-parameterized queries in spatio-temporal databases. In: ACM SIGMOD, pp. 334–345 (2002)

    Google Scholar 

  5. Huang, Y.-K.: Location-based aggregate queries for heterogeneous neighboring objects. IEEE Access 5, 4887–4899 (2017)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuan-Ko Huang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Huang, YK. (2020). Processing Min Cost Queries on Heterogeneous Neighboring Objects. In: Shen, J., Chang, YC., Su, YS., Ogata, H. (eds) Cognitive Cities. IC3 2019. Communications in Computer and Information Science, vol 1227. Springer, Singapore. https://doi.org/10.1007/978-981-15-6113-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-6113-9_1

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-6112-2

  • Online ISBN: 978-981-15-6113-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics