{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:56:22Z","timestamp":1725472582460},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540498605"},{"type":"electronic","value":"9783540498629"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11942634_80","type":"book-chapter","created":{"date-parts":[[2006,11,15]],"date-time":"2006-11-15T23:43:11Z","timestamp":1163634191000},"page":"781-790","source":"Crossref","is-referenced-by-count":1,"title":["Parallel High-Dimensional Index Structure Using Cell-Based Filtering for Multimedia Data"],"prefix":"10.1007","author":[{"given":"Jae-Woo","family":"Chang","sequence":"first","affiliation":[]},{"given":"Yong-Ki","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Young-Jin","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"80_CR1","doi-asserted-by":"crossref","unstructured":"Robinson, J.T.: The K-D-B-tree: A Search Structure for Large Multidimensional Dynamic Indexes. In: Proc. of Int. Conf. on Management of Data, pp. 10\u201318 (1981)","DOI":"10.1145\/582319.582321"},{"key":"80_CR2","doi-asserted-by":"crossref","unstructured":"White, D.A., Jain, R.: Similarity Indexing: Algorithms and Performance. In: Proc. of the SPIE: Storage and Retrieval for Image and Video Databases IV, vol.\u00a02670, pp. 62\u201375 (1996)","DOI":"10.1117\/12.234810"},{"key":"80_CR3","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"H.I. Lin","year":"1995","unstructured":"Lin, H.I., Jagadish, H., Faloutsos, C.: The TV-tree: An Index Structure for High Di-men-sional Data. VLDB Journal\u00a03, 517\u2013542 (1995)","journal-title":"VLDB Journal"},{"key":"80_CR4","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: An Index Structure for High-Dimensional Data. In: Proceedings of the 22nd VLDB Conference, pp. 28\u201339 (1996)"},{"key":"80_CR5","doi-asserted-by":"crossref","unstructured":"Arya, S., Mount, D.M., Narayan, O.: Accounting for Boundary Effects in Nearest Neighbor Searching. In: Proc. of 11th Annaual Symp. on Computational Geometry, Vancouver, Canada, pp. 336\u2013344 (1995)","DOI":"10.1145\/220279.220315"},{"key":"80_CR6","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Bohm, C., Keim, D., Kriegel, H.-P.: A Cost Model for Nearest Neighbor Search in High-Dimensional Data Space. In: ACM PODS Symposium on Principles of Data-bases Systems, Tucson, Arizona (1997)","DOI":"10.1145\/263661.263671"},{"key":"80_CR7","unstructured":"Weber, R., Schek, H.-J., Blott, S.: A Quantitative Analysis and Perform-ance Study for Similarity-Search Methods in High-Dimensional Spaces. In: Proc. of 24th International Conference on Very Large Data Bases, pp. 24\u201327 (1998)"},{"key":"80_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-44472-6_7","volume-title":"Current Issues in Databases and Information Systems","author":"S.-G. Han","year":"2000","unstructured":"Han, S.-G., Chang, J.-W.: A New High-Dimensional Index Structure Using a Cell-Based Filtering Technique. In: Masunaga, Y., Thalheim, B., \u0160tuller, J., Pokorn\u00fd, J. (eds.) ADBIS 2000 and DASFAA 2000. LNCS, vol.\u00a01884, pp. 79\u201392. Springer, Heidelberg (2000)"},{"key":"80_CR9","unstructured":"Faloutsos, C.: Design of a Signature File Method that Accounts for Non-Uniform Occur-rence and Query Frequencies. In: ACM SIGMOD, pp. 165\u2013170 (1985)"},{"issue":"9-10","key":"80_CR10","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/S1383-7621(97)00015-5","volume":"44","author":"J.-K. Kim","year":"1998","unstructured":"Kim, J.-K., Chang, J.-W.: Horizontally-divided Signature File on a Parallel Machine Architecture. Journal of Systems Architecture\u00a044(9-10), 723\u2013735 (1998)","journal-title":"Journal of Systems Architecture"},{"issue":"8","key":"80_CR11","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/S1383-7621(99)00035-1","volume":"46","author":"J.-K. Kim","year":"2000","unstructured":"Kim, J.-K., Chang, J.-W.: Vertically-partitioned Parallel Signature File Method. Journal of Systems Architecture\u00a046(8), 655\u2013673 (2000)","journal-title":"Journal of Systems Architecture"},{"key":"80_CR12","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: Proc. of ACM Int. Conf. on Management of Data (SIGMOD), pp. 71\u201379 (1995)","DOI":"10.1145\/568271.223794"}],"container-title":["Lecture Notes in Computer Science","Frontiers of High Performance Computing and Networking \u2013 ISPA 2006 Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11942634_80","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:51:00Z","timestamp":1558284660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11942634_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540498605","9783540498629"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11942634_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}