{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T21:10:27Z","timestamp":1737148227119,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540724834"},{"type":"electronic","value":"9783540725244"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72524-4_56","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T20:15:32Z","timestamp":1182802532000},"page":"542-553","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Difference NN Queries for Moving Objects"],"prefix":"10.1007","author":[{"given":"Bin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Xiaochun","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"56_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G. Hjaltason","year":"1999","unstructured":"Hjaltason, G., Samet, H.: Distance Browsing in Spatial Database. ACM Trans. on Database Systems\u00a024(2), 265\u2013318 (1999)","journal-title":"ACM Trans. on Database Systems"},{"issue":"10","key":"56_CR2","doi-asserted-by":"publisher","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.: An Efficient Cost Model for Optimization of Nearest Neighbor Search in Low and Medium Dimensional Spaces. IEEE Trans. Knowl. Data Eng.\u00a016(10), 1169\u20131184 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"56_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-47724-1_14","volume-title":"Advances in Spatial and Temporal Databases","author":"H. Ferhatosmanoglu","year":"2001","unstructured":"Ferhatosmanoglu, H., Stanoi, I., Agrawal, D.P., El Abbadi, A.: Constrained Nearest Neighbor Queries. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol.\u00a02121, pp. 257\u2013278. Springer, Heidelberg (2001)"},{"key":"56_CR4","doi-asserted-by":"crossref","unstructured":"Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group Nearest Neighbor Queries. In: Proceedings of the 20th IEEE Int. Conf. on Data Engineering (ICDE), pp. 301\u2013312 (2004)","DOI":"10.1109\/ICDE.2004.1320006"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Aggrawal, C., Yu, P.: Outlier detection for high dimensional data. In: Proceedings of the ACM SIGMOD Int. Conf. on Management of Data, pp. 37\u201346 (2001)","DOI":"10.1145\/375663.375668"},{"key":"56_CR6","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast Subsequence Matching in Time-Series Databases. In: Proceedings of the ACM SIGMOD Int. Conf. on Management of Data, pp. 419\u2013429 (1994)","DOI":"10.1145\/191839.191925"},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"Ester, M., Kriegel, H.-P., Sander, J.: Knowledge Discovery in Spatial Databases. Invited paper at German Conf. on Artificial Intelligence (1999)","DOI":"10.1007\/978-3-642-60243-6_1"},{"issue":"3","key":"56_CR8","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/331499.331504","volume":"31","author":"A. Jain","year":"1999","unstructured":"Jain, A., Murthy, M., Flynn, P.: Data Clustering: A review. ACM Comp. Surveys\u00a031(3), 64\u2013323 (1999)","journal-title":"ACM Comp. Surveys"},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: Proceedings of the ACM SIGMOD Int. Conf. on Management of Data, pp. 71\u201379 (1995)","DOI":"10.1145\/223784.223794"},{"issue":"6","key":"56_CR10","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions. Journal of ACM\u00a045(6), 891\u2013923 (1998)","journal-title":"Journal of ACM"},{"issue":"9","key":"56_CR11","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1109\/71.615443","volume":"8","author":"K. Nakano","year":"1997","unstructured":"Nakano, K., Olariu, S.: An Optimal Algorithm for the Angle-Restricted All Nearest Neighbor Problem on the Reconfigurable Mesh, with Applications. IEEE Trans. on Parallel and Distributed Systems\u00a08(9), 983\u2013990 (1997)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"issue":"3","key":"56_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00778-005-0166-4","volume":"15","author":"R. Benetis","year":"2006","unstructured":"Benetis, R., Jensen, C.S., Karciauskas, G., Saltenis, S.: Nearest and reverse nearest neighbor queries for moving objects. VLDB J.\u00a015(3), 229\u2013249 (2006)","journal-title":"VLDB J."},{"key":"56_CR13","unstructured":"Xiong, X., Mokbel, M., Aref, W.: SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. In: Proceedings of the 21st IEEE Int. Conf. on Data Engineering (ICDE), pp. 643\u2013654 (2005)"},{"key":"56_CR14","doi-asserted-by":"crossref","unstructured":"Kyriakos, M., Marios, H., Dimitris, P.: Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring. In: Proceedings of the ACM SIGMOD Int. Conf. on Management of Data, pp. 634\u2013645 (2005)","DOI":"10.1145\/1066157.1066230"},{"key":"56_CR15","unstructured":"Yu, X., Pu, K., Koudas, N.: Monitoring K-Nearest Neighbor Queries Over Moving Objects. In: Proceedings of the 21st IEEE Int. Conf. on Data Engineering (ICDE), pp. 631\u2013642 (2005)"},{"key":"56_CR16","series-title":"Lecture Notes in Computer Science","first-page":"394","volume-title":"Database Theory - ICDT \u201997","author":"A. Papadopoulos","year":"1996","unstructured":"Papadopoulos, A., Manolopoulos, Y.: Performance of Nearest Neighbor Queries in R-trees. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol.\u00a01186, pp. 394\u2013408. Springer, Heidelberg (1996)"},{"key":"56_CR17","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proceedings of the ACM SIGMOD Int. Conf. on Management of Data, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"56_CR18","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-tree: a Dynamic Index Structure for Spatial Searching. In: Proceedings of the ACM SIGMOD Int. Conf. on Management of Data, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"}],"container-title":["Lecture Notes in Computer Science","Advances in Data and Web Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72524-4_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T20:36:07Z","timestamp":1737146167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72524-4_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540724834","9783540725244"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72524-4_56","relation":{},"subject":[]}}