{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T06:30:06Z","timestamp":1718865006573},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,2,22]],"date-time":"2016-02-22T00:00:00Z","timestamp":1456099200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Defense Acquisition Program Administration and Agency for Defense Development, South Korea","award":["UD140022PD"],"award-info":[{"award-number":["UD140022PD"]}]},{"name":"Defense Acquisition Program Administration and Agency for Defense Development, South Korea","award":["UD140022PD"],"award-info":[{"award-number":["UD140022PD"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10707-016-0245-2","type":"journal-article","created":{"date-parts":[[2016,2,22]],"date-time":"2016-02-22T05:23:40Z","timestamp":1456118620000},"page":"471-502","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["The direction-constrained k nearest neighbor query"],"prefix":"10.1007","volume":"20","author":[{"given":"Min-Joong","family":"Lee","sequence":"first","affiliation":[]},{"given":"Dong-Wan","family":"Choi","sequence":"additional","affiliation":[]},{"given":"SangYeon","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Ha-Myung","family":"Park","sequence":"additional","affiliation":[]},{"given":"Sunghee","family":"Choi","sequence":"additional","affiliation":[]},{"given":"Chin-Wan","family":"Chung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,22]]},"reference":[{"key":"245_CR1","doi-asserted-by":"crossref","unstructured":"Avrithis Y, Kalantidis Y, Tolias G, Spyrou E (2010) Retrieving landmark and non-landmark images from community photo collections. In: proceedings of ACM multimedia (full paper) (MM 2010), Firenze, Italy","DOI":"10.1145\/1873951.1873973"},{"key":"245_CR2","volume-title":"Proceedings of the 1990 ACM SIGMOD international conference on Management of data, SIGMOD \u201990, pp 322\u2013331","author":"N Beckmann","year":"1990","unstructured":"Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The r*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the 1990 ACM SIGMOD international conference on Management of data, SIGMOD \u201990, pp 322\u2013331. ACM, New York"},{"issue":"9","key":"245_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509\u2013517","journal-title":"Commun ACM"},{"key":"245_CR4","doi-asserted-by":"crossref","unstructured":"Berchtold S, B\u00f6hm C, Keim DA, Kriegel H-P (1997) A cost model for nearest neighbor search in high-dimensional data space. In: Proceedings of ACM symposium on principles of database systems (PODS), pp 78\u201386","DOI":"10.1145\/263661.263671"},{"key":"245_CR5","unstructured":"Berchtold S, Keim DA, Kriegel H-P (1996) The x-tree : an index structure for high-dimensional data. In: VLDB, pp 28\u201339"},{"issue":"3","key":"245_CR6","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C B\u00f6hm","year":"2001","unstructured":"B\u00f6hm C, Berchtold S, Keim DA (2001) Searching in high-dimensional spaces Index structures for improving the performance of multimedia databases. ACM Comput Surv 33(3):322\u2013373","journal-title":"ACM Comput Surv"},{"issue":"1","key":"245_CR7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10707-004-5621-7","volume":"9","author":"VT de Almeida","year":"2005","unstructured":"de Almeida VT, G\u00fcting RH (2005) Indexing the trajectories of moving objects in networks. GeoInformatica 9(1):33\u201360","journal-title":"GeoInformatica"},{"key":"245_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel RA, Bentley JL (1974) Quad trees: a data structure for retrieval on composite keys. Acta Inf 4:1\u20139","journal-title":"Acta Inf"},{"issue":"3","key":"245_CR9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"JH Friedman","year":"1977","unstructured":"Friedman JH, Bentley JL, Finkel RA (1977) An algorithm for finding best matches in logarithmic expected time. ACM Trans Math Softw 3(3):209\u2013226","journal-title":"ACM Trans Math Softw"},{"key":"245_CR10","volume-title":"Proceedings of the 1984 ACM SIGMOD international conference on Management of data, SIGMOD \u201984, pp 47\u201357","author":"A Guttman","year":"1984","unstructured":"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 \u201984, pp 47\u201357. ACM, New York"},{"issue":"2","key":"245_CR11","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"GR Hjaltason","year":"1999","unstructured":"Hjaltason GR, Samet H (1999) Distance browsing in spatial databases. ACM Trans Database Syst 24(2):265\u2013318","journal-title":"ACM Trans Database Syst"},{"issue":"2","key":"245_CR12","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.ejor.2013.06.011","volume":"232","author":"Q Hu","year":"2014","unstructured":"Hu Q, Lim A (2014) An iterative three-component heuristic for the team orienteering problem with time windows. Eur J Oper Res 232(2):276\u2013286","journal-title":"Eur J Oper Res"},{"key":"245_CR13","unstructured":"Ibrahim K, Faloutsos C (1994) r-tree: Hilbert an improved r-tree using fractals. In: VLDB, pp 500\u2013509"},{"key":"245_CR14","doi-asserted-by":"crossref","unstructured":"Katayama N, Satoh S (1997) The sr-tree: an index structure for high-dimensional nearest neighbor queries. In: SIGMOD Conference, pp 369\u2013380","DOI":"10.1145\/253260.253347"},{"key":"245_CR15","doi-asserted-by":"crossref","unstructured":"Le TTT, Nickerson BG (2008) Efficient search of moving objects on a planar graph. In: Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS \u201908, pp 41:1\u201341:4. ACM, New York","DOI":"10.1145\/1463434.1463486"},{"key":"245_CR16","unstructured":"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\u2013311"},{"key":"245_CR17","doi-asserted-by":"crossref","unstructured":"Li G, Feng J, Xu J (2012) Desks: Direction-aware spatial keyword search. In: ICDE, pp 474\u2013485","DOI":"10.1109\/ICDE.2012.93"},{"key":"245_CR18","doi-asserted-by":"crossref","unstructured":"Nascimento MA, Silva JRO (1998) Towards historical r-trees. In: Proceedings of the 1998 ACM symposium on applied computing, pp 235\u2013240. ACM","DOI":"10.1145\/330560.330692"},{"key":"245_CR19","doi-asserted-by":"crossref","unstructured":"Patroumpas K, Sellis TK (2009) Monitoring orientation of moving objects around focal points. In: SSTD, pp 228\u2013246","DOI":"10.1007\/978-3-642-02982-0_16"},{"key":"245_CR20","unstructured":"Pfoser D, Jensen CS, Theodoridis Y (2000) Novel approaches in query processing for moving object trajectories. In: VLDB, pp 395\u2013406"},{"key":"245_CR21","doi-asserted-by":"crossref","unstructured":"Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: Proceedings of the 1995 ACM SIGMOD international conference on management of data, SIGMOD \u201995, pp 71\u201379","DOI":"10.1145\/223784.223794"},{"issue":"1","key":"245_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0600000009","volume":"2","author":"R Szeliski","year":"2006","unstructured":"Szeliski R (2006) Image alignment and stitching: a tutorial. Found Trends Comput Graph Vis 2(1):1\u2013104","journal-title":"Found Trends Comput Graph Vis"},{"key":"245_CR23","unstructured":"Tao Y, Papadias D (2001) Mv3r-tree: A spatio-temporal access method for timestamp and interval queries. In: VLDB, pp 431\u2013440"},{"issue":"10","key":"245_CR24","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1109\/TKDE.2004.48","volume":"16","author":"Y Tao","year":"2004","unstructured":"Tao Y, Zhang J, Papadias D, Mamoulis N (2004) An efficient cost model for optimization of nearest neighbor search in low and medium dimensional spaces. IEEE Trans Knowl Data Eng 16(10):1169\u2013 1184","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"245_CR25","doi-asserted-by":"crossref","unstructured":"Theoderidis Y, Vazirgiannis M, Sellis T (1996) Spatio-temporal indexing for large multimedia applications. In: Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems, 1996, pp 441\u2013448","DOI":"10.1109\/MMCS.1996.535011"},{"issue":"6","key":"245_CR26","doi-asserted-by":"crossref","first-page":"6540","DOI":"10.1016\/j.eswa.2010.11.085","volume":"38","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen P, Souffriau W, Berghe GV, Oudheusden DV (2011) The city trip planner: an expert system for tourists. Expert Syst Appl 38(6):6540\u20136546","journal-title":"Expert Syst Appl"},{"key":"245_CR27","doi-asserted-by":"crossref","unstructured":"Zhou P, Zhang D, Salzberg B, Cooperman G, Kollios G (2005) Close pair queries in moving object databases. In: GIS, pp 2\u201311","DOI":"10.1145\/1097064.1097067"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-016-0245-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-016-0245-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-016-0245-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:17:03Z","timestamp":1559254623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-016-0245-2"}},"subtitle":["Dealing with spatio-directional objects"],"short-title":[],"issued":{"date-parts":[[2016,2,22]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["245"],"URL":"https:\/\/doi.org\/10.1007\/s10707-016-0245-2","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,22]]}}}