Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 541602, 11 pages
http://dx.doi.org/10.1155/2014/541602
Research Article

An Efficient Algorithm for Maximizing Range Sum Queries in a Road Network

1School of Information and Communication Engineering, Sungkyunkwan University, 2066 Seobu-ro, Jangan-gu, Suwon 440-746, Republic of Korea
2Department of Computer Engineering, Sungkyunkwan University, Republic of Korea

Received 30 April 2014; Accepted 11 July 2014; Published 24 July 2014

Academic Editor: Jong-Hyuk Park

Copyright © 2014 Tien-Khoi Phan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. H. Cho and M. Choi, “Personal mobile album/diary application development,” Journal of Convergence, vol. 5, no. 1, pp. 32–37, 2014. View at Google Scholar
  2. Y. Luo, O. Hoeber, and Y. Chen, “Enhancing Wi-Fi fingerprinting for indoor positioning using human-centric collaborative feedback,” Human-Centric Computing and Information Sciences, vol. 3, article 2, 2013. View at Google Scholar
  3. J. Ahn and R. Han, “An indoor augmented-reality evacuation system for the Smartphone using personalized Pedometry,” Human-Centric Computing and Information Sciences, vol. 2, article 18, 2012. View at Publisher · View at Google Scholar
  4. H. Luo and M.-L. Shyu, “Quality of service provision in mobile multimedia—a survey,” Human-Centric Computing and Information Sciences, vol. 1, article 5, 2011. View at Publisher · View at Google Scholar
  5. S. W. Park and I. Y. Lee, “Anonymous authentication scheme based on NTRU for the protection of payment information in NFC mobile environment,” Journal of Information Processing System, vol. 9, no. 3, pp. 461–476, 2013. View at Google Scholar
  6. K. Peng, “A secure network for mobile wireless service,” Journal of Information Processing Systems, vol. 9, no. 2, pp. 247–258, 2013. View at Publisher · View at Google Scholar · View at Scopus
  7. T. Hoang, T. Nguyen, C. Luong, S. Do, and D. Choi, “Adaptive cross-device gait recognition using a mobile accelerometer,” Journal of Information Processing Systems, vol. 9, no. 2, pp. 333–348, 2013. View at Publisher · View at Google Scholar · View at Scopus
  8. H. I. Kim, Y. K. Kim, and J. W. Chang, “A grid-based cloaking area creation scheme for continuous LBS queries in distributed systems,” Journal of Convergence, vol. 4, no. 1, pp. 23–30, 2013. View at Google Scholar
  9. S. Hong and J. Chang, “A new k-NN query processing algorithm based on multicasting-based cell expansion in location-based services,” Journal of Convergence, vol. 4, no. 4, pp. 1–6, 2013. View at Google Scholar
  10. D. W. Choi, C. W. Chung, and Y. Tao, “A scalable algorithm for maximizing range sum in spatial databases,” Proceedings of the VLDB Endowment, vol. 5, no. 11, pp. 1088–1099, 2012. View at Publisher · View at Google Scholar
  11. H. Imai and T. Asano, “Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane,” Journal of Algorithms, vol. 4, no. 4, pp. 310–323, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  12. Y. Tao, X. Hu, D. W. Choi, and C. W. Chung, “Approximate MaxRS in spatial databases,” PVLDB, vol. 6, no. 13, pp. 1546–1557, 2013. View at Google Scholar
  13. M. L. Yiu and N. Mamoulis, “Clustering objects on a spatial network,” in Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD ’04), pp. 443–454, June 2004. View at Scopus
  14. S. C. Nandy and B. B. Bhattacharya, “A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids,” Computers & Mathematics with Applications, vol. 29, no. 8, pp. 45–61, 1995. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. T. Brinkhoff, “A framework for generating network-based moving objects,” GeoInformatica, vol. 6, no. 2, pp. 153–180, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  16. K. Mouratidis, Y. Lin, and M. L. Yiu, “Preference queries in large multi-cost transportation networks,” in Proceedings of the IEEE 26th International Conference on Data Engineering (ICDE '10), pp. 533–544, Long Beach, Calif, USA, March 2010. View at Publisher · View at Google Scholar
  17. S. Cabello, J. M. Díaz-Báñez, S. Langerman, C. Seara, and I. Ventura, “Reverse facility location problems,” in Proceedings of the Canadian Conference on Computational Geometry (CCCG ’05), pp. 68–71, 2005.
  18. R. C.-W. Wong, M. T. Özsu, P. S. Yu, A. W.-C. Fu, and L. Liu, “Efficient method for maximizing bichromatic reverse nearest neighbor,” The VLDB Journal, vol. 2, no. 1, pp. 1126–1137, 2009. View at Google Scholar
  19. Y. Du, D. Zhang, and T. Xia, “The optimal-location query,” in Advances in Spatial and Temporal Databases: Proceedings of the 9th International Symposium SSTD 2005, Angra dos Reis, Brazil, August 22–24, 2005, vol. 3633 of Lecture Notes in Computer Science, pp. 163–180, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
  20. D. Zhang, Y. Du, T. Xia, and Y. Tao, “Progressive computation of the min-dist optimal-location query,” in Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB '06), pp. 643–654, 2006.
  21. X. Xiao, B. Yao, and F. Li, “Optimal location queries in road network databases,” in Proceedings of the IEEE 27th International Conference on Data Engineering (ICDE ’11), pp. 804–815, Hannover, Germany, April 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. D. Yan, Z. Zhao, and W. Ng, “Efficient algorithms, for finding optimal meeting point on road networks,” PVLDB, vol. 4, no. 11, pp. 968–979, 2011. View at Google Scholar
  23. B. M. Chazelle and D. T. Lee, “On a circle placement problem,” Computing, vol. 36, no. 1-2, pp. 1–16, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. A. Gajentaan and M. H. Overmars, “On a class of O(n2) problems in computational geometry,” Computational Geometry, Theory and Applications, vol. 5, no. 3, pp. 165–185, 1995. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. B. Aronov and S. Har-Peled, “On approximating the depth and related problems,” in Proceedings of the 16th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA '05), pp. 886–894, ACM, New York, NY, USA, 2005. View at MathSciNet
  26. M. de Berg, S. Cabello, and S. Har-Peled, “Covering many or few points with unit disks,” Theory of Computing Systems, vol. 45, no. 3, pp. 446–469, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus