Skip to main content
SpringerLink
Log in

An Index-Based Method for Efficient Maximizing Range Sum Queries in Road Network

  • Conference paper
  • First Online:
Databases Theory and Applications (ADC 2016)

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

Included in the following conference series:

Abstract

Given a set of positive weighted points, the Maximizing Range Sum (maxRS) problem finds the placement of a query region r of given size such that the weight sum of points covered by r is maximized. This problem has long been studied since its wide application in spatial data mining, facility locating, and clustering problems. However, most of the existing work focus on Euclidean space, which is not applicable in many real-life cases. For example, in location-based services, the spatial data points can only be accessed by following certain underlying (road) network, rather than straight-line access. Thus in this paper, we study the maxRS problem with road network constraint, and propose an index-based method that solves the online queries highly efficiently.

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

Notes

  1. 1.

    W.l.o.g., we assume r and edge length are real numbers, and w(f) is constant integer.

  2. 2.

    Note that there may exist multiple optimal locations, but we store only one in the index.

  3. 3.

    We also test on another popular real dataset(California road network) from [15], where the 87635 facilities are carefully generated using the real-life facility distribution. The result trend is similar with other datasets hence omitted due to space limitation.

References

  1. Imai, H., Asano, T.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algorithms 4(4), 310–323 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  2. Nandy, S.C., Bhattacharya, B.B.: A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids. Math. Appl. 29(8), 45–61 (1995)

    MathSciNet  MATH  Google Scholar 

  3. Choi, D.W., Chung, C.W., Tao, Y.: A scalable algorithm for maximizing range sum in spatial databases. Proc. VLDB Endow. 5(11), 1088–1099 (2012)

    Article  Google Scholar 

  4. Tao, Y., Hu, X., Choi, D.W., Chung, C.W.: Approximate MaxRS in spatial databases. PVLDB 6(13), 1546–1557 (2013)

    Google Scholar 

  5. Choi, D.W., Chung, C.W., Tao, Y.: Maximizing range sum in external memory. ACM Trans. Database Syst. 39(3), 21: 1–21: 44 (2014)

    Article  MathSciNet  Google Scholar 

  6. Mukherjee, M., Chakraborty, K.: A polynomial time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation. Inf. Process. Lett. 83, 41–48 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Goodrich, M.T., Tsay, J.-J., Vengroff, D.E., Vitter, J.S.: External-memory computational geometry (preliminary version). In: FOCS, pp. 714–723 (1993)

    Google Scholar 

  8. Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristán, V.: Smallest color-spanning objects. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, p. 278. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Tiwari, S., Kaushik, H.: Extracting region of interest (roi) details using lbs infrastructure and web databases. In: MDM 2012, pp. 376–379 (2012)

    Google Scholar 

  10. Du, Y., Zhang, D., Xia, T.: The optimal-location query. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 163–180. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Zhang, D., Du, Y., Xia, T., Tao, Y.: Progressive computation of the min-dist optimal-location query. In: VLDB (2006)

    Google Scholar 

  12. Xiao, X., Yao, B., Li, F.: Optimal location queries in road network databases. In: ICDE (2011)

    Google Scholar 

  13. Farahani, R.Z., Hekmatfar, M.: Facility Location: Concepts, Models, Algorithms and Case Studies, 1st edn. Physica-Verlag, Heidelberg (2009)

    Book  Google Scholar 

  14. Phan, T.K., Jung, H.R., Kim, U.M.: An efficient algorithm for maximizing range sum queries in a road network. Sci. World J. 2014 (2014). Article ID 541602

    Google Scholar 

  15. http://www.cs.fsu.edu/lifeifei/SpatialDataset.htm

  16. Brinkhoff, T.: A framework for generating network-based moving objects. GeoInformatica 6(2), 153–180 (2002)

    Article  MATH  Google Scholar 

  17. Yiu, M.L., Mamoulis, N.: Clustering objects on a spatial network. In: SIGMOD (2004)

    Google Scholar 

  18. Chazelle, B.M., Lee, D.T.: On a circle placement problem. Computing 36, 1–16 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  19. Aronov, B., Har-Peled, S.: On approximating the depth and related problems. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 886–894 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of New South Wales, Sydney, Australia

    Xiaoling Zhou & Wei Wang

Authors
  1. Xiaoling Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaoling Zhou .

Editor information

Editors and Affiliations

  1. Monash University , Clayton, Australia

    Muhammad Aamir Cheema

  2. School of Comp. Science a. Engineer, University of New South Wales School of Comp. Science a. Engineer, Sydney, Australia

    Wenjie Zhang

  3. University of New South Wales , Sydney, New South Wales, Australia

    Lijun Chang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Zhou, X., Wang, W. (2016). An Index-Based Method for Efficient Maximizing Range Sum Queries in Road Network. In: Cheema, M., Zhang, W., Chang, L. (eds) Databases Theory and Applications. ADC 2016. Lecture Notes in Computer Science(), vol 9877. Springer, Cham. https://doi.org/10.1007/978-3-319-46922-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46922-5_8

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation