{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:22:55Z","timestamp":1725736975941},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642394669"},{"type":"electronic","value":"9783642394676"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39467-6_23","type":"book-chapter","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T01:33:16Z","timestamp":1372123996000},"page":"253-267","source":"Crossref","is-referenced-by-count":3,"title":["Extending High-Dimensional Indexing Techniques Pyramid and iMinMax(\u03b8): Lessons Learned"],"prefix":"10.1007","author":[{"given":"Karthik Ganesan","family":"Pillai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liessman","family":"Sturlaugson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan M.","family":"Banda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafal A.","family":"Angryk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/3-540-46521-9_19","volume-title":"Algorithms and Complexity","author":"S. Battiato","year":"2000","unstructured":"Battiato, S., Cantone, D., Catalano, D., Cincotti, G., Hofri, M.: An efficient algorithm for the approximate median selection problem. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol.\u00a01767, pp. 226\u2013238. Springer, Heidelberg (2000)"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indexes. Acta Informatica\u00a01, 173\u2013189 (1972), doi:10.1007\/BF00288683","journal-title":"Acta Informatica"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/93605.98741","volume":"19","author":"N. Beckmann","year":"1990","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. SIGMOD Rec.\u00a019, 322\u2013331 (1990)","journal-title":"SIGMOD Rec."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1145\/276305.276318","volume":"27","author":"S. Berchtold","year":"1998","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegel, H.-P.: The pyramid-technique: Towards breaking the curse of dimensionality. SIGMOD Rec.\u00a027, 142\u2013153 (1998)","journal-title":"SIGMOD Rec."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/276304.276353","volume-title":"Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, SIGMOD 1998","author":"S. Berchtold","year":"1998","unstructured":"Berchtold, S., Keim, D.A.: High-dimensional index structures database support for next decade\u2019s applications. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, SIGMOD 1998, p. 501. ACM, New York (1998)"},{"key":"23_CR6","doi-asserted-by":"crossref","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)"},{"key":"23_CR7","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, 47\u201357 (1984)","journal-title":"SIGMOD Rec."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/335168.335219","volume-title":"Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2000","author":"B.C. Ooi","year":"2000","unstructured":"Ooi, B.C., Tan, K.-L., Yu, C., Bressan, S.: Indexing the edges \u2013 a simple and yet efficient approach to high-dimensional indexing. In: Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2000, pp. 166\u2013174. ACM, New York (2000)"},{"key":"23_CR9","unstructured":"Shi, Q., Nickerson, B.: Decreasing Radius K-Nearest Neighbor Search Using Mapping-based Indexing Schemes. Technical report, University of New Brunswick (2006)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s00778-004-0121-9","volume":"13","author":"C. Yu","year":"2004","unstructured":"Yu, C., Bressan, S., Ooi, B.C., Tan, K.-L.: Querying high-dimensional data in single-dimensional space. The VLDB Journal\u00a013, 105\u2013119 (2004)","journal-title":"The VLDB Journal"}],"container-title":["Lecture Notes in Computer Science","Big Data"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39467-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,26]],"date-time":"2022-02-26T05:52:28Z","timestamp":1645854748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39467-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642394669","9783642394676"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39467-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}