{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:35:17Z","timestamp":1774949717773,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540423010","type":"print"},{"value":"9783540477242","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47724-1_14","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T19:51:52Z","timestamp":1185911512000},"page":"257-276","source":"Crossref","is-referenced-by-count":60,"title":["Constrained Nearest Neighbor Queries"],"prefix":"10.1007","author":[{"given":"Hakan","family":"Ferhatosmanoglu","sequence":"first","affiliation":[]},{"given":"Ioanna","family":"Stanoi","sequence":"additional","affiliation":[]},{"given":"Divyakant","family":"Agrawal","sequence":"additional","affiliation":[]},{"given":"Amr","family":"El Abbadi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"P. Bernstein, M. Brodie, S. Ceri, D. DeWitt, M. Franklin, H. Garcia-Molina, J. Gray, J. Held, J. Hellerstein, H. Jagadish, M. Lesk, D. Maier, J. Naughton, H. Pirahesh, M. Stonebraker, and J. Ullman. The Asilomar report on database research. ACM Sigmod Record, 27(4), December 1998.","DOI":"10.1145\/306101.306137"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"S. Berchtold, C. Bohm, and H.-P. Kriegel. The Pyramid-Technique: Towards breaking the curse of dimensionality. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 142\u2013153, Seattle, Washington, USA, June 1998.","DOI":"10.1145\/276304.276318"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"S. Berchtold, C. Bohm, D. Keim, and H. Kriegel. A cost model for nearest neighbor search in high-dimensional data space. In Proc. ACM Symp. on Principles of Database Systems, pages 78\u201386, Tuscon, Arizona, June 1997.","DOI":"10.1145\/263661.263671"},{"key":"14_CR4","unstructured":"S. Berchtold, D. A. Keim, and H. P. Kriegel. The x-tree: An index structure for high-dimensional data. In Proceedings of the 22nd International Conference on Very Large Databases (VLDB), pages 28\u201336, 1996."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger. The r*-tree: An efficient and robust access method for points and reactangles. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 322\u2013331, May 1990.","DOI":"10.1145\/93605.98741"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"X. Cheng, R. Dolin, M. Neary, S. Prabhakar, K. Ravikanth, D. Wu, D. Agrawal, A. El Abbadi, M. Freeston, A. Singh, T. Smith, and J. Su. Scalable access within the context of digital libraries. In IEEE Proceedings of the International Conference on Advances in Digital Libraries, ADL, pages 70\u201381, Washington, D.C., 1997.","DOI":"10.1109\/ADL.1997.601202"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"M. Ester, J. Kohlhammer, and H. P. Kriegel. The dc-tree: a fully dynamic index structure for data warehouses. In Proceedings of the 16th International Conference on Data Engineering (ICDE), March 2000.","DOI":"10.1109\/ICDE.2000.839438"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"H. Ferhatosmanoglu, D. Agrawal, and A. El Abbadi. Clustering declus-tered data for efficient retrieval. In Proc. Conf. on Information and Knowledge Management, pages 343\u2013350, Kansas City, Missouri, November 1999.","DOI":"10.1145\/319950.320026"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"H. Ferhatosmanoglu, D. Agrawal, and A. El Abbadi. Concentric hyper-spaces and disk allocation for fast parallel range searching. In Proc. Int. Conf. Data Engineering, pages 608\u2013615, Sydney, Australia, March 1999.","DOI":"10.1109\/ICDE.1999.754977"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. El Abbadi. Approximate nearest neighbor searching in multimedia databases. In Proc of 17th IEEE Int. Conf. on Data Engineering (ICDE), pages 503\u2013511, Heidelberg, Germany, April 2001.","DOI":"10.1109\/ICDE.2001.914864"},{"key":"14_CR11","unstructured":"J. D. Foley, A. Van Dam, S. K. Feiner, and J. F. Hughes. Computer Graphics: Principles and Practice. Addison Wesley, 1996."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"V. Gaede and O. Gunther. Multidimensional access methods. ACM Computing Surveys, 30:170\u2013231, 1998.","journal-title":"ACM Computing Surveys"},{"key":"14_CR13","unstructured":"A. Gionis, P. Indyk, and R. Motwani. Similarity searching in high dimensions via hashing. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 518\u2013529, Edinburgh, Scotland, UK, September 1999."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 47\u201357, June 1984.","DOI":"10.1145\/971697.602266"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"G. R. Hjaltason and H. Samet. Ranking in spatial databases. In Proc. of 4th Int. Symp. on Large Spatial Databases, pages 83\u201395, Portland,ME, 1995.","DOI":"10.1007\/3-540-60159-7_6"},{"issue":"2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G. Hjaltason","year":"1999","unstructured":"G. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Transactions on Database Systems, 24(2):265\u2013318, 1999.","journal-title":"ACM Transactions on Database Systems"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"I. Kamel and C. Faloutsos. On packing r-trees. In Proceedings of the 2nd International Conference on Information and Knowledge Management (CIKM), pages 490\u2013499, 1993.","DOI":"10.1145\/170088.170403"},{"key":"14_CR18","unstructured":"I. Kamel and C. Faloutsos. Hilbert r-tree: An improved r-tree using fractals. In Proceedings of the International Conference on Very Large Databases, September 1994."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, Dallas, USA, May 2000.","DOI":"10.1145\/342009.335415"},{"issue":"4","key":"14_CR20","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1145\/99935.99949","volume":"15","author":"D. B. Lomet","year":"1990","unstructured":"D. B. Lomet and B. Salzberg. The hb-tree: A multi-attribute indexing method with good guaranteed performance. ACM Transactions on Database Systems, 15(4):625\u2013658, December 1990.","journal-title":"ACM Transactions on Database Systems"},{"key":"14_CR21","unstructured":"B. S. Manjunath. Airphoto dataset. http:\/\/vivaldi.ece.ucsb.edu\/Manjunath\/research.htm , May 2000."},{"issue":"8","key":"14_CR22","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1109\/34.531803","volume":"18","author":"B. S. Manjunath","year":"1996","unstructured":"B. S. Manjunath and W. Y. Ma. Texture features for browsing and retrieval of image data. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(8):837\u201342, August 1996.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"14_CR23","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"J. Nievergelt, H. Hinterberger, and K.C. Sevcik. The grid file: an adaptable, symmetric multikey file structure. ACM Transactions on Database Systems 9,1:38\u201371, March 1984.","journal-title":"ACM Transactions on Database Systems"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"G. Proietti and C. Faloutsos. I\/o complexity for range queries on region data stored using an r-tree. In Proceedings of the International Conference on Data Engineering (ICDE), March 1999.","DOI":"10.1109\/ICDE.1999.754979"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"N. Roussopoulos, S. Kelly, and F. Vincent. Nearest neighbor queries. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 71\u201379, May 1995.","DOI":"10.1145\/568271.223794"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"J. T. Robinson. The kdb-tree: A search structure for large multidimensional dynamic indexes. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 10\u201318, 1981.","DOI":"10.1145\/582318.582321"},{"key":"14_CR27","unstructured":"I. Stanoi, D. Agrawal, and A. El Abbadi. Reverse nearest neighbor queries for dynamic databases. In Proceedings of the ACM SIGMOD Workshop on Data Mining and Knowledge Discovery (DMKD), 2000."},{"key":"14_CR28","volume-title":"The Design and Analysis of Spatial Structures","author":"H. Samet","year":"1989","unstructured":"H. Samet. The Design and Analysis of Spatial Structures. Addison Wesley Publishing Company, Inc., Massachusetts, 1989."},{"key":"14_CR29","unstructured":"T. Sellis and N. Roussopoulos. The r+-tree: A dynamic index for multidimensional objects. In Proceedings of the 13th International Conference on Very Large Databases (VLDB), pages 507\u2013518, May 1987."}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47724-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:22:26Z","timestamp":1556713346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47724-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423010","9783540477242"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-47724-1_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}