{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:39:58Z","timestamp":1725752398122},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642412776"},{"type":"electronic","value":"9783642412783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41278-3_16","type":"book-chapter","created":{"date-parts":[[2013,10,16]],"date-time":"2013-10-16T13:41:50Z","timestamp":1381930910000},"page":"126-133","source":"Crossref","is-referenced-by-count":0,"title":["An Extended Version of the LVA-Index"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Lasek","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R. Finkel","year":"1974","unstructured":"Finkel, R., Bentley, J.: Quad-trees: A data structure for retrieval on composite keys. ACTA Informatica\u00a04(1), 1\u20139 (1974)","journal-title":"ACTA Informatica"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J. Bentley","year":"1975","unstructured":"Bentley, J.: Multidimensional binary search trees used for associative searching. Communications of the ACM\u00a018, 509\u2013517 (1975)","journal-title":"Communications of the ACM"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Nievergelt, J., Hinterberger, H., Sevcik, K.: The grid file: An adaptable symmetric multikey file structure. ACM Transactions on Database Systems, 38\u201371 (1984)","DOI":"10.1145\/348.318586"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi Diagrams \u2013 A Survey of a Fundamental Geometric Data Structure. ACM Computing Surveys\u00a023(3), 345\u2013405 (1991)","journal-title":"ACM Computing Surveys"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Boston, MA, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Bayer, R.: Binary B-trees for virtual memory. In: Proc. ACM-SIGFIDET Workshop on Data Description, Access and Control, pp. 219\u2013235 (1971)","DOI":"10.1145\/1734714.1734731"},{"issue":"1","key":"16_CR7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1008729828172","volume":"15","author":"C. B\u00f6hm","year":"2000","unstructured":"B\u00f6hm, C., Berchtold, S., Kriegel, H.-P., Michel, U.: Multidimensional Index Structures in Relational Databases. J. Intell. Inf. Syst.\u00a015(1), 51\u201370 (2000); Han, J., Kamber, M.: Data mining: concepts and techniques. Morgan Kaufmann Publishers (2000)","journal-title":"J. Intell. Inf. Syst."},{"key":"16_CR8","unstructured":"Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of the 24th VLDB Conference on Very Large Data Bases(VLDB 1998), New York City, NY, pp. 194\u2013205 (1998)"},{"key":"16_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/11430919_43","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S. Zhou","year":"2005","unstructured":"Zhou, S., Zhao, Y., Guan, J., Huang, J.: A neighborhood-based clustering algorithm. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol.\u00a03518, pp. 361\u2013371. Springer, Heidelberg (2005)"},{"key":"16_CR10","series-title":"AISC","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-642-00563-3_65","volume-title":"Man-Machine Interactions","author":"P. Lasek","year":"2009","unstructured":"Lasek, P.: LVA-Index. An Efficient Way to Determine Nearest Neighbors. In: Cyran, K.A., Kozielski, S., Peters, J.F., Sta\u0144czyk, U., Wakulicz-Deja, A. (eds.) Man-Machine Interactions. AISC, vol.\u00a059, pp. 623\u2013633. Springer, Heidelberg (2009)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-15381-5_35","volume-title":"Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2010","author":"M. Kryszkiewicz","year":"2010","unstructured":"Kryszkiewicz, M., Lasek, P.: A neighborhood-based clustering by means of the\u00a0triangle inequality. In: Fyfe, C., Tino, P., Charles, D., Garcia-Osorio, C., Yin, H. (eds.) IDEAL 2010. LNCS, vol.\u00a06283, pp. 284\u2013291. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41278-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T17:15:47Z","timestamp":1558631747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41278-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642412776","9783642412783"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41278-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}