{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T04:41:38Z","timestamp":1648788098079},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,1,23]],"date-time":"2009-01-23T00:00:00Z","timestamp":1232668800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Ser. F-Inf. Sci."],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s11432-009-0051-7","type":"journal-article","created":{"date-parts":[[2009,1,22]],"date-time":"2009-01-22T08:12:05Z","timestamp":1232611925000},"page":"286-294","source":"Crossref","is-referenced-by-count":0,"title":["Fast filtering false active subspaces for efficient high dimensional similarity processing"],"prefix":"10.1007","volume":"52","author":[{"given":"GuoRen","family":"Wang","sequence":"first","affiliation":[]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[]},{"given":"JunChang","family":"Xin","sequence":"additional","affiliation":[]},{"given":"YuHai","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"EnDe","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,1,23]]},"reference":[{"issue":"3","key":"51_CR1","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C. B\u00f6hm","year":"2001","unstructured":"B\u00f6hm C, Berchtold S, Keim D A. Searching in high-dimensional spaces-index structures for improving the performance of multimedia databases. ACM Comput Surv, 2001, 33(3): 322\u2013373","journal-title":"ACM Comput Surv"},{"issue":"2","key":"51_CR2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/93605.98741","volume":"19","author":"N. Berkmann","year":"1990","unstructured":"Berkmann N, Krigel H P, Schneider R, et al. The R*-tree: an efficient and robust access method for points and rectangles. SIGMOD Record, 1990, 19(2): 322\u2013331","journal-title":"SIGMOD Record"},{"issue":"2","key":"51_CR3","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1145\/253262.253347","volume":"26","author":"N. Katayama","year":"1997","unstructured":"Katayama N, Satoh S. The SR-tree: an index structure for high-dimensional nearest meighbor queries. SIGMOD Record, 1997, 26(2): 369\u2013380","journal-title":"SIGMOD Record"},{"issue":"4","key":"51_CR4","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K. I. Lin","year":"1994","unstructured":"Lin K I, Jagadish H V, Faloutsos C. The TV-tree: an index structure for high-dimensional data. VLDB J, 1994, 3(4): 517\u2013542","journal-title":"VLDB J"},{"key":"51_CR5","first-page":"516","volume-title":"Proceedings of the 12th ICDE Conference","author":"D. A. White","year":"1996","unstructured":"White D A, Jain R. Similarity indexing with the SS-tree. In: Proceedings of the 12th ICDE Conference. Washington: IEEE Computer Society, 1996. 516\u2013523"},{"issue":"2","key":"51_CR6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1109\/TMM.2002.1017736","volume":"4","author":"G. H. Cha","year":"2002","unstructured":"Cha G H, Chung C W. The GC-tree: a high-dimensional index structure for similarity search in image databases. IEEE Trans Multimedia, 2002, 4(2): 235\u2013247","journal-title":"IEEE Trans Multimedia"},{"issue":"2","key":"51_CR7","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1145\/253262.253345","volume":"26","author":"T. Bozkaya","year":"1997","unstructured":"Bozkaya T, Ozsoyoglu M. Distance-based indexing for high-dimensional metric spaces. SIGMOD Record, 1997, 26(2): 357\u2013368","journal-title":"SIGMOD Record"},{"key":"51_CR8","first-page":"426","volume-title":"Proceedings of the 23rd VLDB Conference","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 VLDB Conference. San Fransisco: Morgan Kaufmann, 1997. 426\u2013435"},{"key":"51_CR9","first-page":"148","volume-title":"Proceedings of the 7th ADBIS Conference","author":"T. Skopal","year":"2003","unstructured":"Skopal T, Pokorny J, Kratky M, et al. Revisiting M-tree building principles. In: Proceedings of the 7th ADBIS Conference. Berlin: Springer-Verlag, 2003. 148\u2013162"},{"key":"51_CR10","first-page":"356","volume-title":"Proceedings of the first WAIM Conference","author":"M. Ishikawa","year":"2000","unstructured":"Ishikawa M, Chen H, Furuse K, et al. MB+tree: a dynamically updatable metric index for similarity searches. In: Proceedings of the first WAIM Conference. Berlin: Springer-Verlag, 2000. 356\u2013373"},{"key":"51_CR11","first-page":"89","volume-title":"Proceedings of the 26th VLDB Conference","author":"K. Chakrabarti","year":"2000","unstructured":"Chakrabarti K, Mehrotra S. Local dimensionality reduction: a new approach to indexing high dimensional spaces. In: Proceedings of the 26th VLDB Conference. San Fransisco: Morgan Kaufmann, 2000. 89\u2013100"},{"key":"51_CR12","first-page":"161","volume-title":"Proceedings of the 14th Australasian Database Conference","author":"X. Zhou","year":"2003","unstructured":"Zhou X, Wang G, Yu J X, et al. M+-tree: a new dynamical multidimensional index for metric spaces. In: Proceedings of the 14th Australasian Database Conference. Sydney: Australian Computer Society, 2003. 161\u2013168"},{"key":"51_CR13","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/872757.872815","volume-title":"Proceedings of the 2003 ACM SIGMOD Conference","author":"B. Cui","year":"2003","unstructured":"Cui B, Ooi B C, Su J, et al. Contorting high dimensional data for efficient main memory processing. In: Proceedings of the 2003 ACM SIGMOD Conference. New York: ACM Press, 2003. 479\u2013490"},{"issue":"4","key":"51_CR14","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J. K. Uhlmann","year":"1991","unstructured":"Uhlmann J K. Satisfying general proximity\/similarity queries with metric trees. Inform Process Lett, 1991, 40(4): 175\u2013179","journal-title":"Inform Process Lett"},{"key":"51_CR15","first-page":"460","volume-title":"Proceedings of the 12th ICDE Conference","author":"G. Yu","year":"1996","unstructured":"Yu G, Kaneko K, Bai G, et al. Transaction management for a distributed object storage system WAKSHI-design, implementation and performance. In: Proceedings of the 12th ICDE Conference. Washington: IEEE Computer Society, 1996. 460\u2013468"}],"container-title":["Science in China Series F: Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-009-0051-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-009-0051-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-009-0051-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:35:58Z","timestamp":1559388958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-009-0051-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,23]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["51"],"URL":"https:\/\/doi.org\/10.1007\/s11432-009-0051-7","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"value":"1009-2757","type":"print"},{"value":"1862-2836","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,23]]}}}