{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:23:04Z","timestamp":1725790984618},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642550317"},{"type":"electronic","value":"9783642550324"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-642-55032-4_68","type":"book-chapter","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T06:15:38Z","timestamp":1395728138000},"page":"663-673","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Semantic-Based Organization and Similarity Search Method for Internet Data Resources"],"prefix":"10.1007","author":[{"given":"Peige","family":"Ren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baokang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunqing","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"68_CR1","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C. B\u00f6hm","year":"2001","unstructured":"B\u00f6hm, C., et al.: Searching in High-Dimensional Spaces\u2014Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys\u00a033(3), 322\u2013373 (2001)","journal-title":"ACM Computing Surveys"},{"key":"68_CR2","doi-asserted-by":"crossref","unstructured":"Ch\u00e0vez, E., et al.: Searching in Metric Spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","DOI":"10.1145\/502807.502808"},{"key":"68_CR3","doi-asserted-by":"crossref","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach. Advances in Database Systems (2006)","DOI":"10.1007\/0-387-29151-2"},{"key":"68_CR4","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"68_CR5","doi-asserted-by":"crossref","unstructured":"Bentley, J.L.: Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM\u00a018(9), 509\u2013517 (1975)","DOI":"10.1145\/361002.361007"},{"key":"68_CR6","doi-asserted-by":"crossref","unstructured":"Fu, A.W., Chan, P.M., Cheung, Y.L., Moon, Y.S.: Dynamic vp-Tree Indexing for n-Nearest Neighbor Search Given PairWise Distances. In: VLDB (2000)","DOI":"10.1007\/PL00010672"},{"key":"68_CR7","doi-asserted-by":"crossref","unstructured":"Ciaccia, T., Patella, M., Zezula, P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In: VLDB, pp. 426\u2013435 (1997)","DOI":"10.1145\/275487.275495"},{"key":"68_CR8","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegel, H.P.: The Pyramid-Technique: Towards Breaking the Curse of Dimensionality. In: SIGMOD, pp. 142\u2013153 (1998)","DOI":"10.1145\/276305.276318"},{"key":"68_CR9","unstructured":"Jagadish, H.V., Ooi, B.C., et al.: iDistance: An Adaptive B\u2009+\u2009-tree Based Indexing Method for Nearest Neighbor Search. ACM Transactions on Database Systems, 1\u201334 (2003)"},{"key":"68_CR10","unstructured":"Zhang, R., Ooi, B.C., Tan, K.-L.: Making the Pyramid Technique Robust to Query Types and Workloads. In: Proceeding of the 20th International Conference on Data Engineering, ICDE 2004 (2004)"},{"issue":"3","key":"68_CR11","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys\u00a031(3), 264\u2013323 (1999)","journal-title":"ACM Computing Surveys"},{"key":"68_CR12","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-R.: The x-tree: An index structure for high-dimensional data. In: VLDB (1996)"},{"key":"68_CR13","unstructured":"Zhang, R., Ooi, B.C., Tan, K.-L.: Making the pyramid technique robust to query types and workloads. In: Proceedings of the 20th International Conference on Data Engineering. IEEE (2004)"},{"issue":"2","key":"68_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D.: The Ubiquitous B-tree. ACM Computing Surveys\u00a011(2), 121\u2013138 (1979)","journal-title":"ACM Computing Surveys"},{"key":"68_CR15","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: An index structure for high-dimensional data. Readings in Multimedia Computing and Networking, 451 (2001)","DOI":"10.1016\/B978-155860651-7\/50124-8"},{"key":"68_CR16","unstructured":"White, D.A., Jain, R.: Similarity indexing with the SS-tree. In: Proceedings of the Twelfth International Conference on Data Engineering. IEEE (1996)"},{"key":"68_CR17","doi-asserted-by":"crossref","unstructured":"Batko, M., Gennaro, C., Zezula, P.: Similarity grid for searching in metric spaces. In: T\u00fcrker, C., Agosti, M., Schek, H.-J. (eds.) P2P, Grid, and Service Orientation . . . . LNCS, vol.\u00a03664, pp. 25\u201344. Springer, Heidelberg (2005)","DOI":"10.1007\/11549819_3"},{"key":"68_CR18","unstructured":"Berchtold, S., Boehm, C., Kriegel, H.-P.: High-dimensional index structure. U.S. Patent No. 6,154,746 (November 28, 2000)"}],"container-title":["Lecture Notes in Computer Science","Information and Communication Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55032-4_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T23:06:04Z","timestamp":1648681564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-55032-4_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642550317","9783642550324"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55032-4_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}