Skip to main content
SpringerLink
Log in

DART+: Direction-aware bichromatic reverse k nearest neighbor query processing in spatial databases

  • Published:
Journal of Intelligent Information Systems Aims and scope Submit manuscript

Abstract

This article presents a novel type of queries in spatial databases, called the direction-aware bichromatic reverse k nearest neighbor(DBRkNN) queries, which extend the bichromatic reverse nearest neighbor queries. Given two disjoint sets, P and S, of spatial objects, and a query object q in S, the DBRkNN query returns a subset P′ of P such that k nearest neighbors of each object in P′ include q and each object in P′ has a direction toward q within a pre-defined distance. We formally define the DBRkNN query, and then propose an efficient algorithm, called DART, for processing the DBRkNN query. Our method utilizes a grid-based index to cluster the spatial objects, and the B+-tree to index the direction angle. We adopt a filter-refinement framework that is widely used in many algorithms for reverse nearest neighbor queries. In the filtering step, DART eliminates all the objects that are away from the query object more than a pre-defined distance, or have an invalid direction angle. In the refinement step, remaining objects are verified whether the query object is actually one of the k nearest neighbors of them. As a major extension of DART, we also present an improved algorithm, called DART+, for DBRkNN queries. From extensive experiments with several datasets, we show that DART outperforms an R-tree-based naive algorithm in both indexing time and query processing time. In addition, our extension algorithm, DART+, also shows significantly better performance than DART.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

Notes

  1. http://www.chorochronos.org/

References

  • Achtert E., Böhm C., Kröger, P., Kunath P., Pryakhin, A., Renz, M. (2006). Efficient reverse k-nearest neighbor search in arbitrary metric spaces. In: Proceedings of the 2006 ACM SIGMOD international conference on management of data, (SIGMOD ’06) (pp. 515– 526). New York: ACM.

  • Benetis, R., Jensen, S., Karciauskas, G., Saltenis, S. (2006). Nearest and reverse nearest neighbor queries for moving objects. The VLDB Journal, 15 (3), 229–249.

    Article  Google Scholar 

  • Cheema, M. A., Zhang, W., Lin, X., Zhang, Y., Li, X. (2012). Continuous reverse k nearest neighbors queries in euclidean space and in spatial networks. The VLDB Journal, 21 (1), 69–95.

    Article  Google Scholar 

  • Dhar, S., & Varshney, U. (2011). Challenges and business models for mobile location-based services and advertising. Commun ACM, 54 (5), 121–128.

    Article  Google Scholar 

  • Gao, Y., Zheng, B., Chen, G., Lee, W. C., Lee, K. C. K., Li, Q. (2009). Visible reverse k-nearest neighbor query processing in spatial databases. IEEE Transactions on Knowledge and Data Engineering, 21 (9), 1314–1327.

    Article  Google Scholar 

  • Guttman, A. (1984). R-trees: a dynamic index structure for spatial searching. In Proceedings of the 1984 ACM SIGMOD international conference on management of data, (SIGMOD ’84) (pp. 47–57). New York: ACM.

  • Kang, J. M., Mokbel, M. F., Shekhar, S., Xia, T., Zhang, D. (2007). Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors. In ICDE

    Google Scholar 

  • Korn, F., & Muthukrishnan, S. (2000). Influence sets based on reverse nearest neighbor queries. In Proceedings of the 2000 ACM SIGMOD international conference on management of data, (SIGMOD ’00) (pp. 201–212). New York: ACM.

  • Korn, F., Muthukrishnan, S., Srivastava, D. (2002). Reverse nearest neighbor aggregates over data streams. In Proceedings of the 28th international conference on Very Large Data Bases, VLDB Endowment, (VLDB ’02) (pp. 814–825).

  • Krumm, J. (2011). Ubiquitous advertising: the killer application for the 21st century. Pervasive Computing, IEEE, 10 (1), 66 –73.

    Article  Google Scholar 

  • Lee, K.W., Choi, D.W., Chung, C.W. (2013). Dart: An efficient method for direction-aware bichromatic reverse k nearest neighbor queries. In SSTD (pp. 295–311).

  • Li, G., Feng, J., Xu, J. (2012). Desks: direction-aware spatial keyword search. In A. Kementsietsidis & M. A. V. Salles (Eds.), ICDE (pp. 474–485). IEEE Computer Society.

  • Lian, X., & Chen, L. (2008). Monochromatic and bichromatic reverse skyline search over uncertain databases. In Proceedings of the 2008 ACM SIGMOD international conference on management of data, (SIGMOD ’08) (pp. 213–226). New York: ACM.

  • Mokbel, M.F., & Levandoski, J.J. (2009). Toward context and preference-aware location-based services. In Proceedings of the 8th ACM international workshop on data engineering for wireless and mobile access, (MobiDE ’09) (pp. 25–32). New York: ACM.

  • Nutanong, S., Tanin, E., Zhang, R. (2010). Incremental evaluation of visible nearest neighbor queries. IEEE Transactions on Knowledge and Data Engineering, 22 (5), 665–681.

    Article  Google Scholar 

  • Qiao, S., Tang, C., Jin, H., Long, T., Dai, S., Ku, Y., Chau, M. (2010). Putmode: prediction of uncertain trajectories in moving objects databases. Applied Intelligence, 33, 370–386.

    Article  Google Scholar 

  • Qin, C., Bao, X., Roy Choudhury, R, Nelakuditi, S. (2011). Tagsense: a smartphone-based approach to automatic image tagging. In Proceedings of the 9th international conference on mobile systems, applications and services (MobiSys ’11) (pp. 1–14). New York: ACM..

  • Stanoi, I., Agrawal, D., Abbadi, A.E. (2000). Reverse nearest neighbor queries for dynamic databases. In ACM SIGMOD workshop on research issues in data mining and knowledge discovery (pp. 44–53). New York: ACM.

  • Stanoi, I., Riedewald, M., Agrawal, D., Abbadi, A.E. (2001). Discovery of influence sets in frequently updated databases. In Proceedings of the 27th international conference on Very Large Data Bases, (VLDB ’01) (pp. 99–108). San Francisco: Morgan Kaufmann Publishers Inc.

  • Taniar, D., Safar, M., Tran, Q. T., Rahayu, W., Park, J. H. (2011). Spatial network rnn queries in gis. Computer Journal, 54 (4), 617–627.

    Article  Google Scholar 

  • Tao, Y., Papadias, D., Lian, X. (2004). Reverse knn search in arbitrary dimensionality. In Proceedings of the thirtieth international conference on Very Large Data Bases, VLDB Endowment, (VLDB ’04) (Vol. 30, pp. 744–755).

  • Tao, Y., Yiu, M. L., Mamoulis, N. (2006). Reverse nearest neighbor search in metric spaces. IEEE Transactions on Knowledge and Data Engineering, 18 (9), 1239–1252.

    Article  Google Scholar 

  • Tao, Y., Papadias, D., Lian, X., Xiao, X. (2007). Multidimensional reverse knn search. The VLDB Journal, 16 (3), 293–316.

    Article  Google Scholar 

  • Tran, Q. T., Taniar, D., Safar, M. (2010). Bichromatic reverse nearest-neighbor search in mobile systems. IEEE Systems Journal, 4 (2), 230–242.

    Article  Google Scholar 

  • Vlachou, A, Doulkeridis, C, Kotidis, Y, Norvag, K (2011). Monochromatic and bichromatic reverse top-k queries. IEEE Trans on Knowl and Data Eng, 23 (8), 1215–1229.

    Article  Google Scholar 

  • Wang, Y., Gao, Y., Chen, L., Chen, G., Li, Q. (2012). All-visible-k-nearest-neighbor queries. In DEXA (Vol. 2, pp. 392–407).

Download references

Acknowledgment

We would like to thank the editor and anonymous reviewers. This work was supported in part by Defense Acquisition Program Administration and Agency for Defense Development under the contract UD110006MD, Korea, and in part by the National Research Foundation of Korea(NRF) Grant funded by the Korean Government(MSIP)(No. NRF-2014R1A1A2002499).

Author information

Authors and Affiliations

  1. Division of Web Science and Technology, Korea Advanced Institute of Science and Technology, Daejeon, Korea

    Kyoung-Won Lee

  2. Deptartment of Computer Science, Korea Advanced Institute of Science and Technology, Daejeon, Korea

    Dong-Wan Choi

  3. Division of Web Science and Technology and Department of Computer Science, Korea Advanced Institute of Science and Technology, Daejeon, Korea

    Chin-Wan Chung

Authors
  1. Kyoung-Won Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dong-Wan Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chin-Wan Chung
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chin-Wan Chung.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lee, KW., Choi, DW. & Chung, CW. DART+: Direction-aware bichromatic reverse k nearest neighbor query processing in spatial databases. J Intell Inf Syst 43, 349–377 (2014). https://doi.org/10.1007/s10844-014-0326-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10844-014-0326-3

Keywords

Search

Navigation