{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:56:16Z","timestamp":1725861376462},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319425528"},{"type":"electronic","value":"9783319425535"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42553-5_22","type":"book-chapter","created":{"date-parts":[[2016,7,18]],"date-time":"2016-07-18T11:42:23Z","timestamp":1468842143000},"page":"257-271","source":"Crossref","is-referenced-by-count":0,"title":["A Novel High-Dimensional Index Method Based on the Mathematical Features"],"prefix":"10.1007","author":[{"given":"Yu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiayu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ye","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,19]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM Special Interest Group on Management of Data(SIGMOD), pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"issue":"2","key":"22_CR3","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K.L., Yu, C., Zhang, R.: Idistance: an adaptive $$B^{+}$$ -tree based Indexing method for nearest neighbor search. ACM Trans. Database Syst. 30(2), 364\u2013397 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Bohm, C., Kriegel, H.-P.: The pyramid-technique: towards indexing beyond the curse of dimensionality. In: Proceedings of the ACM SIGMOD, pp. 142\u2013153 (1998)","DOI":"10.1145\/276305.276318"},{"issue":"2","key":"22_CR5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1109\/TMM.2007.911822","volume":"10","author":"YT Zhuang","year":"2008","unstructured":"Zhuang, Y.T., Yang, Y., Wu, F.: Mining semantic correlation of heterogeneous multimedia data for cross-media retrieval. IEEE Trans. Multimedia 10(2), 221\u2013229 (2008)","journal-title":"IEEE Trans. Multimedia"},{"key":"22_CR6","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 International Conference on Very Large Databases, pp. 194\u2013205 (1998)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/3-540-45033-5_3","volume-title":"Advances in Databases","author":"JK Lawder","year":"2000","unstructured":"Lawder, J.K., King, P.J.H.: Using space-filling curves for multi-dimensional indexing. In: Jeffery, K., Lings, B. (eds.) BNCOD 2000. LNCS, vol. 1832, pp. 20\u201335. Springer, Heidelberg (2000)"},{"key":"22_CR8","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of International Conference on Very Large Databases, pp. 426\u2013435 (1997)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, R. Schneider Seeger, B.: The $$R^{*}$$ -tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"22_CR10","unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C.: The $$R^{+}$$ -tree: a dynamic index for multidimensional objects. In: Proceedings of International Conference on Very Large Databases, pp. 507\u2013518 (1987)"},{"key":"22_CR11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/357775.357776","volume":"25","author":"C Bohm","year":"2000","unstructured":"Bohm, C.: A cost model for query processing in high-dimensional data. ACM Trans. Database Syst. 25, 129\u2013178 (2000)","journal-title":"ACM Trans. Database Syst."},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Robinson, J.: The K-D-B-tree: a search structure for large multidimensional dynamic indexes. In: Proceedings of the ACM SIGMOD, pp. 10\u201318 (1981)","DOI":"10.1145\/582318.582321"},{"key":"22_CR13","unstructured":"Jinyang, H.V., Jagadish, W.L., Ooi, B.C.: DSH: data sensitive hashing for high-dimensional k-NN search. In: Proceedings of the ACM SIGMOD, pp. 1127\u20131138 (2014)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Quality and efficiency in high dimensional nearest neighbor search. In: Proceedings of the ACM SIGMOD, pp. 563\u2013576 (2009)","DOI":"10.1145\/1559845.1559905"}],"container-title":["Lecture Notes in Computer Science","Big Data Computing and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42553-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T09:32:48Z","timestamp":1568194368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42553-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319425528","9783319425535"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42553-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}