Skip to main content

DART: An Efficient Method for Direction-Aware Bichromatic Reverse k Nearest Neighbor Queries

  • Conference paper

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

Abstract

This paper 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 the 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. From extensive experiments, we show that DART outperforms an R-tree-based naive algorithm in both indexing time and query processing time.

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

Buying options

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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Achtert, E., Böhm, C., Kröger, P., Kunath, P., Pryakhin, A., Renz, M.: Efficient reverse k-nearest neighbor search in arbitrary metric spaces. In: Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data, SIGMOD 2006, pp. 515–526. ACM, New York (2006)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  3. Cheema, M.A., Zhang, W., Lin, X., Zhang, Y.: Efficiently processing snapshot and continuous reverse k nearest neighbors queries. VLDB Journal 21(5), 703–728 (2012)

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  6. Emrich, T., Kriegel, H.P., Kröger, P., Renz, M., Xu, N., Züfle, A.: Reverse k-nearest neighbor monitoring on mobile objects. In: Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2010, pp. 494–497. ACM, New York (2010)

    Google Scholar 

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

    Article  Google Scholar 

  8. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Datam, SIGMOD 1984, pp. 47–57. ACM, New York (1984)

    Chapter  Google Scholar 

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

    Google Scholar 

  10. Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, SIGMOD 2000, pp. 201–212. ACM, New York (2000)

    Chapter  Google Scholar 

  11. Korn, F., Muthukrishnan, S., Srivastava, D.: Reverse nearest neighbor aggregates over data streams. In: Proceedings of the 28th International Conference on Very Large Data Bases, VLDB 2002, pp. 814–825. VLDB Endowment (2002)

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  14. Lian, X., Chen, L.: Monochromatic and bichromatic reverse skyline search over uncertain databases. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, pp. 213–226. ACM, New York (2008)

    Chapter  Google Scholar 

  15. Mokbel, M.F., Levandoski, J.J.: Toward context and preference-aware location-based services. In: Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access, MobiDE 2009, pp. 25–32. ACM, New York (2009)

    Chapter  Google Scholar 

  16. Nutanong, S., Tanin, E., Zhang, R.: Incremental evaluation of visible nearest neighbor queries. IEEE Trans. on Knowl. and Data Eng. 22(5), 665–681 (2010)

    Article  Google Scholar 

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

    Article  Google Scholar 

  18. Qin, C., Bao, X., Roy Choudhury, R., Nelakuditi, S.: Tagsense: a smartphone-based approach to automatic image tagging. In: Proceedings of the 9th International Conference on Mobile Systems, Applications, and Services, Mobisys 2011, pp. 1–14. ACM, New York (2011)

    Google Scholar 

  19. Stanoi, I., Agrawal, D., Abbadi, A.E.: Reverse nearest neighbor queries for dynamic databases. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 44–53 (2000)

    Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

  22. Tao, Y., Papadias, D., Lian, X.: Reverse knn search in arbitrary dimensionality. In: Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, vol. 30, pp. 744–755. VLDB Endowment (2004)

    Google Scholar 

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

    Article  Google Scholar 

  24. Tao, Y., Yiu, M.L., Mamoulis, N.: Reverse nearest neighbor search in metric spaces. IEEE Trans. on Knowl. and Data Eng. 18(9), 1239–1252 (2006)

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  27. Wang, Y., Gao, Y., Chen, L., Chen, G., Li, Q.: All-visible-k-nearest-neighbor queries. In: Liddle, S.W., Schewe, K.-D., Tjoa, A.M., Zhou, X. (eds.) DEXA 2012, Part II. LNCS, vol. 7447, pp. 392–407. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, KW., Choi, DW., Chung, CW. (2013). DART: An Efficient Method for Direction-Aware Bichromatic Reverse k Nearest Neighbor Queries. In: Nascimento, M.A., et al. Advances in Spatial and Temporal Databases. SSTD 2013. Lecture Notes in Computer Science, vol 8098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40235-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40235-7_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40234-0

  • Online ISBN: 978-3-642-40235-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics