{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:17:25Z","timestamp":1725488245512},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540672272"},{"type":"electronic","value":"9783540464396"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46439-5_3","type":"book-chapter","created":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T02:09:46Z","timestamp":1185934186000},"page":"36-50","source":"Crossref","is-referenced-by-count":16,"title":["Dynamically Optimizing High-Dimensional Index Structures"],"prefix":"10.1007","author":[{"given":"Christian","family":"B\u00f6hm","sequence":"first","affiliation":[]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"3_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/3-540-57301-1_5","volume-title":"Proc. 4th Int. Conf. on Foundations of Data Organization and Algorithms","author":"R. Agrawal","year":"1993","unstructured":"Agrawal R., Faloutsos C., Swami A.: \u2018Efficient similarity search in sequence databases\u2019, Proc. 4th Int. Conf. on Foundations of Data Organization and Algorithms, 1993, LNCS 730, pp. 69\u201384"},{"key":"3_CR2","unstructured":"Agrawal R., Lin K., Shawney H., Shim K.: \u2018Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases\u2019, Proc. of the 21st Conf. on Very Large Databases, 1995, pp. 490\u2013501."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Arya S., Mount D.M., Narayan O.: \u2018Accounting for Boundary Effects in Nearest Neighbor Searching\u2019, Proc. 11th Symp. on Computational Geometry, Vancouver, Canada, pp. 336\u2013344, 1995.","DOI":"10.1145\/220279.220315"},{"key":"3_CR4","unstructured":"Aref W. G., Samet H.: \u2018Optimization Strategies for Spatial Query Processing\u2019, Proc. 17th Int. Conf. on Very Large Databases (VLDB\u201991), Barcelona, Catalonia, 1991, pp. 81\u201390."},{"issue":"9","key":"3_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley J.L.: \u2018Multidimensional Search Trees Used for Associative Searching\u2019, Communications of the ACM, Vol. 18, No. 9, pp. 509\u2013517, 1975.","journal-title":"Communications of the ACM"},{"key":"3_CR6","unstructured":"Berchtold S., B\u00f6hm C., Jagadish H. V., Kriegel H.-P., Sander J.: \u2018Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces\u2019, Proc. Int. Conf. on Data Engineering, Konstanz, Germany, 2000."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Berchtold S., B\u00f6hm C., Kriegel H.-P.: \u2018The Pyramid-Technique: Towards indexing beyond the Curse of Dimensionality\u2019, Proc. ACM SIGMOD Int. Conf. on Management of Data, Seattle, pp. 142\u2013153,1998.","DOI":"10.1145\/276305.276318"},{"key":"3_CR8","unstructured":"Berchtold S., B\u00f6hm C., Keim D., Kriegel H.-P., Xu X.: \u2018Optimal Multidimensional Query Processing Using Tree Striping\u2019, submitted."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Berchtold S., B\u00f6hm C., Keim D., Kriegel H.-P.: \u2018A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space\u2019, ACM PODS Symposium on Principles of Database Systems, 1997, Tucson, Arizona.","DOI":"10.1145\/263661.263671"},{"key":"3_CR10","unstructured":"Belussi A., Faloutsos C.: \u2018Estimating the Selectivity of Spatial Queries Using the \u2018Correlation\u2019 Fractal Dimension\u2019. Proceedings of 21th International Conference on Very Large Data Bases, VLDB\u201995, Zurich, Switzerland, 1995, pp. 299\u2013310."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Berchtold S., Kriegel H.-P.: \u2018S3: Similarity Search in CAD Database Systems\u2019, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1997, Tucson, Arizona, pp. 564\u2013567.","DOI":"10.1145\/253260.253407"},{"key":"3_CR12","unstructured":"Berchtold S., Keim D., Kriegel H.-P.: \u2018The X-Tree: An Index Structure for High-Dimensional Data\u2019, 22nd Conf. on Very Large Databases, 1996, Bombay, India, pp. 28\u201339."},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s007780050049","volume":"6","author":"S. Berchtold","year":"1997","unstructured":"Berchtold S., Keim D., Kriegel H.-P.: \u2018Using Extended Feature Objects for Partial Similarity Retrieval\u2019, VLDB Journal Vol. 6, No. 4, pp. 333\u2013348, 1997.","journal-title":"VLDB Journal"},{"key":"3_CR14","unstructured":"B\u00f6hm C.: \u2018Efficiently Indexing High-Dimensional Data Spaces\u2019, Ph.D. Thesis, Faculty for Mathematics and Computer Science, University of Munich, Utz-Verlag M\u00fcnchen, 1998."},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J. H. Friedman","year":"1977","unstructured":"Friedman J. H., Bentley J. L., Finkel R. A.: \u2018An Algorithm for Finding Best Matches in Logarithmic Expected Time\u2019, ACM Transactions on Mathematical Software, Vol. 3, No. 3, September 1977, pp. 209\u2013226.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF00962238","volume":"3","author":"C. Faloutsos","year":"1994","unstructured":"Faloutsos C., Barber R., Flickner M., Hafner J., et al.: \u2018Efficient and Effective Querying by Image Content\u2019, Journal of Intelligent Information Systems, 1994, Vol. 3, pp. 231\u2013262.","journal-title":"Journal of Intelligent Information Systems"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Faloutsos C., Kamel I.: \u2018Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension\u2019, Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Minneapolis, Minnesota, 1994, pp. 4\u201313.","DOI":"10.1145\/182591.182593"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Faloutsos C., Ranganathan M., Manolopoulos Y.: \u2018Fast Subsequence Matching in Time-Series Databases\u2019, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1994, pp. 419\u2013429.","DOI":"10.1145\/191839.191925"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Faloutsos C., Sellis T., Roussopoulos N.: \u2018Analysis of Object-Oriented Spatial Access Methods\u2019, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1987.","DOI":"10.1145\/38713.38758"},{"key":"3_CR20","series-title":"Technical Report","volume-title":"Survey on Multidimensional Access Methods","author":"V. Gaede","year":"1995","unstructured":"Gaede V., G\u00fcnther O.: \u2018Survey on Multidimensional Access Methods\u2019, Technical Report ISS-16, Humbold-Universit\u00e4t Berlin, 1995."},{"issue":"7","key":"3_CR21","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/0306-4379(93)90005-L","volume":"18","author":"J. E. Gary","year":"1993","unstructured":"Gary J. E., Mehrotra R.: \u2018Similar Shape Retrieval using a Structural Feature Index\u2019, Information Systems, Vol. 18, No. 7, 1993, pp. 525\u2013537.","journal-title":"Information Systems"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Henrich, A.: \u2018The LSD h-tree: An Access Structure for Feature Vectors\u2019, Proc. 14th Int. Conf. on Data Engineering, Orlando, 1998.","DOI":"10.1109\/ICDE.1998.655799"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare, \u2018Quicksort\u2019, Computer Journal, Vol. 5, No. 1, 1962.","DOI":"10.1093\/comjnl\/5.1.10"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Hjaltason G. R., Samet H.: \u2018Ranking in Spatial Databases\u2019, Proc. 4th Int. Symp. on Large Spatial Databases, Portland, ME, 1995, pp. 83\u201395.","DOI":"10.1007\/3-540-60159-7_6"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Jagadish H. V.: \u2018A Retrieval Technique for Similar Shapes\u2019, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1991, pp. 208\u2013217.","DOI":"10.1145\/115790.115821"},{"key":"3_CR26","unstructured":"Kastenm\u00fcller G., Kriegel H.-P., Seidl T.: \u2018Similarity Search in 3D Protein Databases\u2019, Proc. German Conference on Bioinformatics (GCB\u201998), K\u00f6ln (Cologne), 1998."},{"key":"3_CR27","unstructured":"Korn F., Sidiropoulos N., Faloutsos C., Siegel E., Protopapas Z.: \u2018Fast Nearest Neighbor. Search in Medical Image Databases\u2019, Proc. 22nd VLDB Conference, Mumbai (Bombay), India, 1996, pp. 215\u2013226."},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Katayama N., Satoh S.: \u2018The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries\u2019, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1997, pp. 369\u2013380.","DOI":"10.1145\/253260.253347"},{"key":"3_CR29","unstructured":"Kriegel H.-P., Seidl T.: \u2018Approximation-Based Similarity Search for 3-D Surface Segments\u2019, GeoInformatica Journal, Kluwer Academic Publishers, 1998, to appear."},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K. Lin","year":"1995","unstructured":"Lin K., Jagadish H. V., Faloutsos C.: \u2018The TV-Tree: An Index Structure for High-Dimensional Data\u2019, VLDB Journal, Vol. 3, pp. 517\u2013542, 1995.","journal-title":"VLDB Journal"},{"key":"3_CR31","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/3-540-62222-5_59","volume-title":"Proc. 6th Int. Conf. on Database Theory","author":"A. Papadopoulos","year":"1997","unstructured":"Papadopoulos A., Manolopoulos Y.: \u2018Performance of Nearest Neighbor Queries in R-Trees\u2019, Proc. 6th Int. Conf. on Database Theory, Delphi, Greece, in: Lecture Notes in Computer Science, Vol. 1186, Springer, pp. 394\u2013408, 1997."},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Pagel B.-U., Six H.-W., Toben H., Widmayer P.: \u2018Towards an Analysis of Range Query Performance in Spatial Data Structures\u2019, Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS\u201993, Washington, D.C., 1993, pp.214\u2013221.","DOI":"10.1145\/153850.153878"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Shawney H., Hafner J.: \u2018Efficient Color Histogram Indexing\u2019, Proc. Int. Conf. on Image Processing, 1994, pp. 66\u201370.","DOI":"10.1109\/ICIP.1994.413532"},{"key":"3_CR34","unstructured":"Seidl T., Kriegel H.-P.: \u2018Efficient User-Adaptable Similarity Search in Large Multimedia Databases\u2019, Proc. 23rd Int. Conf. on Very Large Databases (VLDB\u201997), Athens, Greece, 1997, pp. 506\u2013515."},{"key":"3_CR35","isbn-type":"print","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/237661.237705","volume-title":"Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"Y. Theodoridis","year":"1996","unstructured":"Yannis Theodoridis, Timos K. Sellis: \u2018A Model for the Prediction of R-tree Performance\u2019. Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 3\u20135, 1996, Montreal, Canada. ACM Press, 1996, ISBN 0-89791-781-2 pp. 161\u2013171.","ISBN":"http:\/\/id.crossref.org\/isbn\/0897917812"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"White D.A., Jain R.: \u2018Similarity indexing with the SS-tree\u2019, Proc. 12th Int. Conf on Data Engineering, New Orleans, LA, 1996.","DOI":"10.1109\/ICDE.1996.492202"},{"key":"3_CR37","unstructured":"Weber R., Schek H.-J., Blott S.: \u2018A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces\u2019, Proc. Int. Conf. on Very Large Databases, New York, 1998."}],"container-title":["Lecture Notes in Computer Science","Advances in Database Technology \u2014 EDBT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46439-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:30:36Z","timestamp":1556728236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46439-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672272","9783540464396"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/3-540-46439-5_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}