{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:51:06Z","timestamp":1762505466672},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,4,28]],"date-time":"2009-04-28T00:00:00Z","timestamp":1240876800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s10707-009-0084-5","type":"journal-article","created":{"date-parts":[[2009,4,27]],"date-time":"2009-04-27T00:07:59Z","timestamp":1240790879000},"page":"241-276","source":"Crossref","is-referenced-by-count":15,"title":["Algorithms for constrained k-nearest neighbor queries over moving object trajectories"],"prefix":"10.1007","volume":"14","author":[{"given":"Yunjun","family":"Gao","sequence":"first","affiliation":[]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Gencai","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Qing","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,4,28]]},"reference":[{"key":"84_CR1","doi-asserted-by":"crossref","unstructured":"Arumugam S, Jermaine C (2006) Closest-point-of-approach join for moving object histories. in Proc. of ICDE, p. 86","DOI":"10.1109\/ICDE.2006.36"},{"key":"84_CR2","doi-asserted-by":"crossref","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 Proc. of ACM SIGMOD, pp 322\u2013331","DOI":"10.1145\/93597.98741"},{"key":"84_CR3","doi-asserted-by":"crossref","unstructured":"Benetis R, Jensen CS, Karciauskas G, Saltenis S (2002) Nearest neighbor and reverse nearest neighbor queries for moving objects. in Proc. of IDEAS, pp 44\u201353","DOI":"10.1109\/IDEAS.2002.1029655"},{"issue":"3","key":"84_CR4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s00778-005-0166-4","volume":"15","author":"R Benetis","year":"2006","unstructured":"Benetis R, Jensen CS, Karciauskas G, Saltenis S (2006) Nearest and reverse nearest neighbor queries for moving objects. VLDB J 15(3):229\u2013249. doi: 10.1007\/s00778-005-0166-4","journal-title":"VLDB J"},{"key":"84_CR5","doi-asserted-by":"crossref","unstructured":"Berchtold S, Ertl B, Keim DA, Kriegel H-P, Seidl T (1998) Fast nearest neighbor search in high-dimensional space. in Proc. of ICDE, pp 209\u2013218","DOI":"10.1109\/ICDE.1998.655779"},{"issue":"3","key":"84_CR6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/290593.290596","volume":"27","author":"KL Cheung","year":"1998","unstructured":"Cheung KL, Fu AW-C (1998) Enhanced nearest neighbour search on the R-tree. SIGMOD Rec 27(3):16\u201321. doi: 10.1145\/290593.290596","journal-title":"SIGMOD Rec"},{"key":"84_CR7","doi-asserted-by":"crossref","unstructured":"Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M (2000) Closest pair queries in spatial databases. in Proc. of ACM SIGMOD, pp 189\u2013200","DOI":"10.1145\/342009.335414"},{"key":"84_CR8","doi-asserted-by":"crossref","unstructured":"Deng K, Zhou X, Shen H, Xu K, Lin X (2006) Surface k-NN query processing. in Proc. of ICDE, p. 78","DOI":"10.1109\/ICDE.2006.152"},{"key":"84_CR9","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu H, Stanoi I, Agrawal D, Abbadi A (2001) Constrained nearest neighbor queries. in Proc. of SSTD, pp 257\u2013278","DOI":"10.1007\/3-540-47724-1_14"},{"key":"84_CR10","doi-asserted-by":"crossref","unstructured":"Frentzos E, Gratsias K, Pelekis N, Theodoridis Y (2005) Nearest neighbor search on moving object trajectories. in Proc. of SSTD, pp 328\u2013345","DOI":"10.1007\/11535331_19"},{"issue":"2","key":"84_CR11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10707-006-0007-7","volume":"11","author":"E Frentzos","year":"2007","unstructured":"Frentzos E, Gratsias K, Pelekis N, Theodoridis Y (2007) Algorithms for nearest neighbor search on moving object trajectories. GeoInformatica 11(2):159\u2013193. doi: 10.1007\/s10707-006-0007-7","journal-title":"GeoInformatica"},{"issue":"2","key":"84_CR12","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/s11390-007-9030-x","volume":"22","author":"Y Gao","year":"2007","unstructured":"Gao Y, Li C, Chen G, Chen L, Jiang X, Chen C (2007) Efficient k-nearest-neighbor search algorithms for historical moving object trajectories. J Comput Sci Technol 22(2):232\u2013244. doi: 10.1007\/s11390-007-9030-x","journal-title":"J Comput Sci Technol"},{"key":"84_CR13","doi-asserted-by":"crossref","unstructured":"Gao Y, Li C, Chen G, Li Q, Chen C (2007) Efficient algorithms for historical continuous kNN query processing over moving object trajectories. in Proc. of APWeb\/WAIM, pp 188\u2013199","DOI":"10.1007\/978-3-540-72524-4_22"},{"key":"84_CR14","doi-asserted-by":"crossref","unstructured":"Gao Y, Chen G, Li Q, Li C, Chen C (2008 Constrained k-nearest neighbor query processing over moving object trajectories. in Proc. of DASFAA, pp 635\u2013643","DOI":"10.1007\/978-3-540-78568-2_56"},{"key":"84_CR15","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: A dynamic index structure for spatial searching. in Proc. of ACM SIGMOD, pp 47\u201357","DOI":"10.1145\/602259.602266"},{"issue":"2","key":"84_CR16","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. doi: 10.1145\/320248.320255","journal-title":"ACM Trans Database Syst"},{"key":"84_CR17","doi-asserted-by":"crossref","unstructured":"Iwerks GS, Samet H, Smith K (2003) Continuous k-nearest neighbor queries for continuously moving points with updates. in Proc. of VLDB, pp 512\u2013523","DOI":"10.1016\/B978-012722442-8\/50052-5"},{"key":"84_CR18","doi-asserted-by":"crossref","unstructured":"Kollios G, Gunopoulos D, Tsotras V (1999) On indexing mobile objects. in Proc. of ACM PODS, pp 261\u2013272","DOI":"10.1145\/303976.304002"},{"key":"84_CR19","unstructured":"Korn F, Sidiropoulos N, Faloutsos C, Siegel E, Protopapas Z (1996) Fast nearest neighbor search in medical image databases. in Proc. of VLDB, pp 215\u2013226"},{"key":"84_CR20","doi-asserted-by":"crossref","unstructured":"Manolopoulos Y, Nanopoulos A, Papadopoulos AN, Theodoridis Y (2005) R-trees: Theory and applications. Springer-Verlag","DOI":"10.1007\/978-1-84628-293-5"},{"issue":"2","key":"84_CR21","first-page":"40","volume":"26","author":"MF Mokbel","year":"2003","unstructured":"Mokbel MF, Ghanem TM, Aref WG (2003) Spatio-temporal access methods. IEEE Data Eng Bull 26(2):40\u201349","journal-title":"IEEE Data Eng Bull"},{"key":"84_CR22","doi-asserted-by":"crossref","unstructured":"Mouratidis K, Hadjieleftheriou M, Papadias D (2005) Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. in Proc. of ACM SIGMOD, pp 634\u2013645","DOI":"10.1145\/1066157.1066230"},{"issue":"11","key":"84_CR23","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1109\/TKDE.2005.172","volume":"17","author":"K Mouratidis","year":"2005","unstructured":"Mouratidis K, Papadias D, Bakiras S, Tao Y (2005) A threshold-based algorithm for continuous monitoring of k nearest neighbors. IEEE Trans Knowl Data Eng 17(11):1451\u20131464. doi: 10.1109\/TKDE.2005.172","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"84_CR24","unstructured":"Mouratidis K, Yiu M, Papadias D, Mamoulis N (2006) Continuous nearest neighbor monitoring in road networks. in Proc. of VLDB, pp 43\u201354"},{"key":"84_CR25","unstructured":"Papadias D, Shen Q, Tao Y, Mouratidis K (2004) Group nearest neighbor queries. in Proc. of ICDE, pp 301\u2013312"},{"key":"84_CR26","doi-asserted-by":"crossref","unstructured":"Papadopoulos AN, Manolopoulos Y (1997) Performance of nearest neighbor queries in R-trees. in Proc. of ICDT, pp 394\u2013408","DOI":"10.1007\/3-540-62222-5_59"},{"key":"84_CR27","unstructured":"Pfoser D, Jensen CS, Theodoridis Y (2000) Novel approaches in query processing for moving object trajectories. in Proc. of VLDB, pp 395\u2013406"},{"issue":"2","key":"84_CR28","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1023\/A:1023403908170","volume":"7","author":"K Raptopoulou","year":"2003","unstructured":"Raptopoulou K, Papadopoulos AN, Manolopoulos Y (2003) Fast nearest neighbor query processing in moving object databases. GeoInformatica 7(2):113\u2013137. doi: 10.1023\/A:1023403908170","journal-title":"GeoInformatica"},{"key":"84_CR29","doi-asserted-by":"crossref","unstructured":"Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. in Proc. of ACM SIGMOD, pp 71\u201379","DOI":"10.1145\/223784.223794"},{"key":"84_CR30","doi-asserted-by":"crossref","unstructured":"Saltenis S, Jensen CS, Leutenegger ST, Lopez MA (2000) Indexing the positions of continuously moving objects. in Proc. of ACM SIGMOD, pp 331\u2013342","DOI":"10.1145\/342009.335427"},{"key":"84_CR31","doi-asserted-by":"crossref","unstructured":"Seidl T, Kriegel H-P (1998) Optimal multi-step k-nearest neighbor search. in Proc. of ACM SIGMOD, pp 154\u2013165","DOI":"10.1145\/276304.276319"},{"key":"84_CR32","unstructured":"Sellis T, Roussopoulos N, Faloutsos C (1987) The R+-tree: A dynamic index for multi-dimensional objects. in Proc. of VLDB, pp 507\u2013518"},{"key":"84_CR33","doi-asserted-by":"crossref","unstructured":"Song Z, Roussopoulos N (2001) K-nearest neighbor search for moving query point. in Proc. of SSTD, pp 79\u201396","DOI":"10.1007\/3-540-47724-1_5"},{"key":"84_CR34","unstructured":"Tao Y, Papadias D (2001) The MV3R-Tree: A spatio-temporal access method for timestamp and interval queries. in Proc. of VLDB, pp 431\u2013440"},{"key":"84_CR35","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D (2002) Time parameterized queries in spatio-temporal databases. in Proc. of ACM SIGMOD, pp 334\u2013345","DOI":"10.1145\/564691.564730"},{"key":"84_CR36","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. in Proc. of VLDB, pp 287\u2013298","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"84_CR37","doi-asserted-by":"crossref","unstructured":"Theodoridis Y, Silva JRO, Nascimento MA (1999) On the generation of spatiotemporal datasets. in Proc. of SSD, pp 147\u2013164","DOI":"10.1007\/3-540-48482-5_11"},{"key":"84_CR38","doi-asserted-by":"crossref","unstructured":"Theodoridis Y, Vazirgiannis M, Sellis TK (1996) Spatio-temporal indexing for large multimedia applications. in Proc. of ICMCS, pp 441\u2013448","DOI":"10.1109\/MMCS.1996.535011"},{"key":"84_CR39","unstructured":"Xiong X, Mokbel M, Aref WG (2005) SEA-CNN: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. in Proc. of ICDE, pp 643\u2013654"},{"key":"84_CR40","unstructured":"Yu X, Pu K, Koudas N (2005) Monitoring k-nearest neighbor queries over moving objects. in Proc. of ICDE, pp 631\u2013642"},{"key":"84_CR41","doi-asserted-by":"crossref","unstructured":"Zheng B, Lee D (2001) Semantic caching in location-dependent query. in Proc. of SSTD, pp 97\u2013116","DOI":"10.1007\/3-540-47724-1_6"},{"key":"84_CR42","unstructured":"Zhang J, Mamoulis N, Papadias D, Tao Y (2004) All-nearest-neighbors queries in spatial databases. in Proc. of SSDBM, pp 297\u2013306"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-009-0084-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-009-0084-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-009-0084-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:16:58Z","timestamp":1559240218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-009-0084-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,28]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["84"],"URL":"https:\/\/doi.org\/10.1007\/s10707-009-0084-5","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,28]]}}}