{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:22:09Z","timestamp":1742397729322},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735397"},{"type":"electronic","value":"9783540735403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73540-3_3","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T01:58:05Z","timestamp":1187402285000},"page":"38-56","source":"Crossref","is-referenced-by-count":9,"title":["Continuous Medoid Queries over Moving Objects"],"prefix":"10.1007","author":[{"given":"Stavros","family":"Papadopoulos","sequence":"first","affiliation":[]},{"given":"Dimitris","family":"Sacharidis","sequence":"additional","affiliation":[]},{"given":"Kyriakos","family":"Mouratidis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Raghavan, P., Rao, S.: Polynomial Time Approximation Schemes for Euclidean k-Medians and Related Problems. In: STOC (1998)","DOI":"10.1145\/276698.276718"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M., Kriegel, H.P., Sander, J.: OPTICS: Ordering Points To Identify the Clustering Structure. In: SIGMOD (1999)","DOI":"10.1145\/304182.304187"},{"key":"3_CR3","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: SIGMOD (1990)","DOI":"10.1145\/93597.98741"},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D.: The Ubiquitous B-Tree. ACM Computing Surveys\u00a011(2), 121\u2013137 (1979)","journal-title":"ACM Computing Surveys"},{"key":"3_CR5","unstructured":"Cai, Y., Hua, K., Cao, G.: Processing Range-Monitoring Queries on Heterogeneous Mobile Objects. In: MDM (2004)"},{"key":"3_CR6","unstructured":"Ester, M., Kriegel, H.P., Xu, X.: A Database Interface for Clustering in Large Spatial Databases. In: KDD (1995)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Ester, M., Kriegel, H.P., Xu, X.: Knowledge Discovery in Large Spatial Databases: Focusing Techniques for Efficient Class Identification. In: SSD (1995)","DOI":"10.1007\/3-540-60159-7_5"},{"key":"3_CR8","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A Density Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: KDD (1996)"},{"key":"3_CR9","unstructured":"R-Trees, A.: dynamic index structure for spatial searching. In: SIGMOD (1984)"},{"key":"3_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Current Trends in Database Technology - EDBT 2004 Workshops","author":"B. Gedik","year":"2004","unstructured":"Gedik, B., Liu, L.: MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System. In: Lindner, W., Mesiti, M., T\u00fcrker, C., Tzitzikas, Y., Vakali, A.I. (eds.) EDBT 2004. LNCS, vol.\u00a03268, Springer, Heidelberg (2004)"},{"issue":"3","key":"3_CR12","first-page":"515","volume":"15","author":"S. Guha","year":"2003","unstructured":"Guha, S., Meyerson, A., Mishra, N., Motwani, R.: O\u2019Callaghan, L. Clustering Data Streams: Theory and Practice. IEEE TKDE\u00a015(3), 515\u2013528 (2003)","journal-title":"IEEE TKDE"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., Shim, K.: CURE: An Efficient Clustering Algorithm for Large Databases. In: SIGMOD (1998)","DOI":"10.1145\/276304.276312"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Hu, H., Xu, J., Lee, D.: A generic framework for monitoring continuous spatial queries over moving objects. In: SIGMOD (2005)","DOI":"10.1145\/1066157.1066212"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Koudas, N., Ooi, B., Tan, K., Zhang, R.: Approximate NN queries on Streams with Guaranteed Error\/performance Bounds. In: VLDB (2004)","DOI":"10.1016\/B978-012088469-8.50071-1"},{"key":"3_CR16","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data","author":"L. Kaufman","year":"1990","unstructured":"Kaufman, L., Rousseeuw, P.: Finding Groups in Data. Wiley-Interscience, Chichester (1990)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring. In: SIGMOD (2005)","DOI":"10.1145\/1066157.1066230"},{"issue":"1","key":"3_CR18","first-page":"124","volume":"13","author":"B. Moon","year":"2001","unstructured":"Moon, B., Jagadish, H.V., Faloutsos, C., Saltz, J.H.: Analysis of the Clustering Properties of the Hilbert Space-Filling Curve. IEEE TKDE\u00a013(1), 124\u2013141 (2001)","journal-title":"IEEE TKDE"},{"issue":"11","key":"3_CR19","first-page":"1451","volume":"17","author":"K. Mouratidis","year":"2005","unstructured":"Mouratidis, K., Papadias, D., Bakiras, S., Tao, Y.: A Threshold-based Algorithm for Continuous Monitoring of k Nearest Neighbors. IEEE TKDE\u00a017(11), 1451\u20131464 (2005)","journal-title":"IEEE TKDE"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Mouratidis, K., Papadias, D., Papadimitriou, S.: Tree-based Partition Querying: A Methodology for Computing Medoids in Large Spatial Datasets. In: VLDBJ (to appear)","DOI":"10.1007\/s00778-007-0045-2"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Mokbel, M., Xiong, X., Aref, W.: SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases. In: SIGMOD (2004)","DOI":"10.1145\/1007568.1007638"},{"key":"3_CR22","unstructured":"Ng, R., Han, J.: Efficient and Effective Clustering Methods for Spatial Data Mining. In: VLDB (1994)"},{"issue":"10","key":"3_CR23","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TC.2002.1039840","volume":"51","author":"S. Prabhakar","year":"2002","unstructured":"Prabhakar, S., Xia, Y., Kalashnikov, D., Aref, W., Hambrusch, S.: Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects. IEEE Transactions on Computers\u00a051(10), 1124\u20131140 (2002)","journal-title":"IEEE Transactions on Computers"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Xiong, X., Mokbel, M., Aref, W.: SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. In: ICDE (2005)","DOI":"10.1145\/1007568.1007638"},{"key":"3_CR25","unstructured":"Yu, X., Pu, K., Koudas, N.: Monitoring K-Nearest Neighbor Queries Over Moving Objects. In: ICDE (2005)"},{"key":"3_CR26","unstructured":"Zhang, D., Du, Y., Xia, T., Tao, Y.: Progressive Computation of the Min-Dist Optimal-Location Query. In: VLDB (2006)"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: An Efficient Data Clustering Method for Very Large Databases. In: SIGMOD (1996)","DOI":"10.1145\/233269.233324"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73540-3_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:17:35Z","timestamp":1619518655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73540-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735397","9783540735403"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73540-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}