The direction-constrained k nearest neighbor query Dealing with spatio-directional objects

Cited 7 time in webofscience Cited 0 time in scopus
  • Hit : 853
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorLee, Minjoongko
dc.contributor.authorChoi, Dong-Wanko
dc.contributor.authorKim, SangYeonko
dc.contributor.authorPark, Ha-Myungko
dc.contributor.authorChoi, Sung-Heeko
dc.contributor.authorChung, Chin Wanko
dc.date.accessioned2016-07-06T04:18:04Z-
dc.date.available2016-07-06T04:18:04Z-
dc.date.created2016-06-08-
dc.date.created2016-06-08-
dc.date.issued2016-07-
dc.identifier.citationGEOINFORMATICA, v.20, no.3, pp.471 - 502-
dc.identifier.issn1384-6175-
dc.identifier.urihttp://hdl.handle.net/10203/209468-
dc.description.abstractFinding k nearest neighbor objects in spatial databases is a fundamental problem in many geospatial systems and the direction is one of the key features of a spatial object. Moreover, the recent tremendous growth of sensor technologies in mobile devices produces an enormous amount of spatio-directional (i.e., spatially and directionally encoded) objects such as photos. Therefore, an efficient and proper utilization of the direction feature is a new challenge. Inspired by this issue and the traditional k nearest neighbor search problem, we devise a new type of query, called the direction-constrained k nearest neighbor (DCkNN) query. The DCkNN query finds k nearest neighbors from the location of the query such that the direction of each neighbor is in a certain range from the direction of the query. We develop a new index structure called MULTI, to efficiently answer the DCkNN query with two novel index access algorithms based on the cost analysis. Furthermore, our problem and solution can be generalized to deal with spatio-circulant dimensional (such as a direction and circulant periods of time such as an hour, a day, and a week) objects. Experimental results show that our proposed index structure and access algorithms outperform two adapted algorithms from existing kNN algorithms-
dc.languageEnglish-
dc.publisherSPRINGER-
dc.subjectDIMENSIONAL SPACES-
dc.subjectSEARCH-
dc.subjectDATABASES-
dc.titleThe direction-constrained k nearest neighbor query Dealing with spatio-directional objects-
dc.typeArticle-
dc.identifier.wosid000375566500005-
dc.identifier.scopusid2-s2.0-84959122942-
dc.type.rimsART-
dc.citation.volume20-
dc.citation.issue3-
dc.citation.beginningpage471-
dc.citation.endingpage502-
dc.citation.publicationnameGEOINFORMATICA-
dc.identifier.doi10.1007/s10707-016-0245-2-
dc.contributor.localauthorChoi, Sung-Hee-
dc.contributor.localauthorChung, Chin Wan-
dc.contributor.nonIdAuthorChoi, Dong-Wan-
dc.contributor.nonIdAuthorKim, SangYeon-
dc.type.journalArticleArticle-
dc.subject.keywordAuthork nearest neighbor search-
dc.subject.keywordAuthorR-tree-
dc.subject.keywordAuthorSpatial and directional object-
dc.subject.keywordPlusDIMENSIONAL SPACES-
dc.subject.keywordPlusSEARCH-
dc.subject.keywordPlusDATABASES-
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 7 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0