{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:38:58Z","timestamp":1742913538699,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642327407"},{"type":"electronic","value":"9783642327414"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-32741-4_17","type":"book-chapter","created":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T13:02:04Z","timestamp":1345554124000},"page":"185-193","source":"Crossref","is-referenced-by-count":0,"title":["An Indexing Structure for Dynamic Multidimensional Data in Vector Space"],"prefix":"10.1007","author":[{"given":"Elena","family":"Mikhaylova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris","family":"Novikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anton","family":"Volokhov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A. Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM\u00a051(1), 117\u2013122 (2008), \n                    http:\/\/doi.acm.org\/10.1145\/1327452.1327494\n                  , doi:10.1145\/1327452.1327494","journal-title":"Commun. ACM"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1966865.1966869","volume-title":"Proceedings of the 1st Workshop on New Trends in Similarity Search, NTSS 2011","author":"S. Barton","year":"2011","unstructured":"Barton, S., Gouet-Brunet, V., Rukoz, M.: Large scale disk-based metric indexing structure for approximate information retrieval by content. In: Proceedings of the 1st Workshop on New Trends in Similarity Search, NTSS 2011, pp. 2\u20137. ACM, New York (2011), \n                    http:\/\/doi.acm.org\/10.1145\/1966865.1966869\n                  , doi:10.1145\/1966865.1966869"},{"key":"17_CR3","first-page":"1989","volume":"10","author":"J. Chen","year":"2009","unstructured":"Chen, J., Fang, H.R., Saad, Y.: Fast approximate knn graph construction for high dimensional data via recursive lanczos bisection. J. Mach. Learn. Res.\u00a010, 1989\u20132012 (2009), \n                    http:\/\/dl.acm.org\/citation.cfm?id=1577069.1755852","journal-title":"J. Mach. Learn. Res."},{"unstructured":"Ciaccia, P., Patella, M.: Bulk loading the m-tree. In: Proceedings of the 9th Australasian Database Conference, ADC 1998, pp. 15\u201326 (1998)","key":"17_CR4"},{"key":"17_CR5","first-page":"426","volume-title":"Proceedings of the 23rd International Conference on Very Large Data Bases, VLDB 1997","author":"P. Ciaccia","year":"1997","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd International Conference on Very Large Data Bases, VLDB 1997, pp. 426\u2013435. Morgan Kaufmann Publishers Inc., San Francisco (1997), \n                    http:\/\/dl.acm.org\/citation.cfm?id=645923.671005"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/997817.997857","volume-title":"Proceedings of the Twentieth Annual Symposium on Computational Geometry, SCG 2004","author":"M. Datar","year":"2004","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, SCG 2004, pp. 253\u2013262. ACM, New York (2004), \n                    http:\/\/doi.acm.org\/10.1145\/997817.997857\n                  , doi:10.1145\/997817.997857"},{"key":"17_CR7","first-page":"518","volume-title":"Proceedings of the 25th International Conference on Very Large Data Bases, VLDB 1999","author":"A. Gionis","year":"1999","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of the 25th International Conference on Very Large Data Bases, VLDB 1999, pp. 518\u2013529. Morgan Kaufmann Publishers Inc., San Francisco (1999), \n                    http:\/\/dl.acm.org\/citation.cfm?id=645925.671516"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1878137.1878145","volume-title":"Proceedings of the International Workshop on Very-Large-Scale Multimedia Corpus, Mining and Retrieval, VLS-MCMR 2010","author":"G.T. Gudmundsson","year":"2010","unstructured":"Gudmundsson, G.T., J\u00f3nsson, B.T., Amsaleg, L.: A large-scale performance study of cluster-based high-dimensional indexing. In: Proceedings of the International Workshop on Very-Large-Scale Multimedia Corpus, Mining and Retrieval, VLS-MCMR 2010, pp. 31\u201336. ACM, New York (2010), \n                    http:\/\/doi.acm.org\/10.1145\/1878137.1878145\n                  , doi:10.1145\/1878137.1878145"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/1951365.1951395","volume-title":"Proceedings of the 14th International Conference on Extending Database Technology, EDBT\/ICDT 2011","author":"S. G\u00fcnnemann","year":"2011","unstructured":"G\u00fcnnemann, S., Kremer, H., Lenhard, D., Seidl, T.: Subspace clustering for indexing high dimensional data: a main memory index based on local reductions and individual multi-representations. In: Proceedings of the 14th International Conference on Extending Database Technology, EDBT\/ICDT 2011, pp. 237\u2013248. ACM, New York (2011), \n                    http:\/\/doi.acm.org\/10.1145\/1951365.1951395\n                  , doi:10.1145\/1951365.1951395"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/602259.602266","volume-title":"Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, SIGMOD 1984","author":"A. Guttman","year":"1984","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, SIGMOD 1984, pp. 47\u201357. ACM, New York (1984), \n                    http:\/\/doi.acm.org\/10.1145\/602259.602266\n                  , doi:10.1145\/602259.602266"},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/971697.602266","volume":"14","author":"A. Guttman","year":"1984","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. SIGMOD Rec.\u00a014(2), 47\u201357 (1984), \n                    http:\/\/doi.acm.org\/10.1145\/971697.602266\n                  , doi:10.1145\/971697.602266","journal-title":"SIGMOD Rec."},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/276698.276876","volume-title":"Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998","author":"P. Indyk","year":"1998","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 604\u2013613. ACM, New York (1998), \n                    http:\/\/doi.acm.org\/10.1145\/276698.276876\n                  , doi:10.1145\/276698.276876"},{"issue":"1-3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0167-8655(02)00187-3","volume":"24","author":"F. Moreno-Seco","year":"2003","unstructured":"Moreno-Seco, F., Milc\u00f3, L., Oncina, J.: A modification of the laesa algorithm for approximated k-nn classification. Pattern Recogn. Lett.\u00a024(1-3), 47\u201353 (2003), \n                    http:\/\/dx.doi.org\/10.1016\/S0167-86550200187-3\n                  , doi:10.1016\/S0167-8655(02)00187-3","journal-title":"Pattern Recogn. Lett."},{"key":"17_CR14","first-page":"2487","volume":"11","author":"M. Radovanovi\u0107","year":"2010","unstructured":"Radovanovi\u0107, M., Nanopoulos, A., Ivanovi\u0107, M.: Hubs in space: Popular nearest neighbors in high-dimensional data. J. Mach. Learn. Res.\u00a011, 2487\u20132531 (2010), \n                    http:\/\/dl.acm.org\/citation.cfm?id=1756006.1953015","journal-title":"J. Mach. Learn. Res."},{"issue":"1-2","key":"17_CR15","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.14778\/1920841.1920994","volume":"3","author":"M. Sharifzadeh","year":"2010","unstructured":"Sharifzadeh, M., Shahabi, C.: Vor-tree: R-trees with voronoi diagrams for efficient processing of spatial nearest neighbor queries. Proc. VLDB Endow.\u00a03(1-2), 1231\u20131242 (2010), \n                    http:\/\/dl.acm.org\/citation.cfm?id=1920841.1920994","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"17_CR16","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00778-005-0167-3","volume":"16","author":"H.T. Shen","year":"2007","unstructured":"Shen, H.T., Zhou, X., Zhou, A.: An adaptive and dynamic dimensionality reduction method for high-dimensional indexing. The VLDB Journal\u00a016(2), 219\u2013234 (2007), \n                    http:\/\/dx.doi.org\/10.1007\/s00778-005-0167-3\n                  , doi:10.1007\/s00778-005-0167-3","journal-title":"The VLDB Journal"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1862344.1862347","volume-title":"Proceedings of the Third International Conference on SImilarity Search and Applications, SISAP 2010","author":"T. Skopal","year":"2010","unstructured":"Skopal, T.: Where are you heading, metric access methods?: a provocative survey. In: Proceedings of the Third International Conference on SImilarity Search and Applications, SISAP 2010, pp. 13\u201321. ACM, New York (2010), \n                    http:\/\/doi.acm.org\/10.1145\/1862344.1862347\n                  , doi:10.1145\/1862344.1862347"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-39403-7_13","volume-title":"Advances in Databases and Information Systems","author":"T. Skopal","year":"2003","unstructured":"Skopal, T., Pokorn\u00fd, J., Kr\u00e1tk\u00fd, M., Sn\u00e1\u0161el, V.: Revisiting M-Tree Building Principles. In: Kalinichenko, L.A., Manthey, R., Thalheim, B., Wloka, U. (eds.) ADBIS 2003. LNCS, vol.\u00a02798, pp. 148\u2013162. Springer, Heidelberg (2003)"},{"issue":"2","key":"17_CR19","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s11042-007-0179-7","volume":"38","author":"A. Thomasian","year":"2008","unstructured":"Thomasian, A., Zhang, L.: Persistent clustered main memory index for accelerating k-nn queries on high dimensional datasets. Multimedia Tools Appl.\u00a038(2), 253\u2013270 (2008), \n                    http:\/\/dx.doi.org\/10.1007\/s11042-007-0179-7\n                  , doi:10.1007\/s11042-007-0179-7","journal-title":"Multimedia Tools Appl."},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-46439-5_4","volume-title":"Advances in Database Technology - EDBT 2000","author":"C. Traina Jr.","year":"2000","unstructured":"Traina Jr., C., Traina, A.J.M., Seeger, B., Faloutsos, C.: Slim-Trees: High Performance Metric Trees Minimizing Overlap between Nodes. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol.\u00a01777, pp. 51\u201365. Springer, Heidelberg (2000), \n                    http:\/\/dl.acm.org\/citation.cfm?id=645339.650146"},{"issue":"1","key":"17_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-8655(94)90094-9","volume":"15","author":"E. Vidal","year":"1994","unstructured":"Vidal, E.: New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (aesa). Pattern Recognition Letters\u00a015(1), 1\u20137 (1994)","journal-title":"Pattern Recognition Letters"},{"issue":"12","key":"17_CR22","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1109\/TKDE.2004.97","volume":"16","author":"J. Xu","year":"2004","unstructured":"Xu, J., Zheng, B., Lee, W.C., Lun Lee, D.: The d-tree: An index structure for planar point queries in location-based wireless services. IEEE Trans. on Knowl. and Data Eng.\u00a016(12), 1526\u20131542 (2004), \n                    http:\/\/dx.doi.org\/10.1109\/TKDE.2004.97\n                  , doi:10.1109\/TKDE.2004.97","journal-title":"IEEE Trans. on Knowl. and Data Eng."}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32741-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T06:57:03Z","timestamp":1674111423000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-32741-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642327407","9783642327414"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32741-4_17","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2013]]}}}