{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:59:07Z","timestamp":1742975947933,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319115375"},{"type":"electronic","value":"9783319115382"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11538-2_18","type":"book-chapter","created":{"date-parts":[[2014,10,9]],"date-time":"2014-10-09T10:20:23Z","timestamp":1412850023000},"page":"187-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Hybrid Index Structure for Temporal Marine Data"],"prefix":"10.1007","author":[{"given":"Dongmei","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danfeng","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoluo","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,10]]},"reference":[{"key":"18_CR1","unstructured":"Mayer-Sch\u00f6nberger, V., Cukier, K.: Big data: a revolution that will transform how we live, work, and think. Houghton Mifflin Harcourt (2013)"},{"key":"18_CR2","unstructured":"Meng, X.-F., Ci, X.: Big data management: concepts, techniques and challenges. J. Comput. Res. Dev. 50(1), 146\u2013169 (2013)"},{"key":"18_CR3","unstructured":"Shi, S., Lei, B.: Theory and Practice on China Digital Ocean, pp. 1\u201316. Ocean Press, Beijing (2011)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Liu, X.-S., Zhang, X., Chi, T.-H., et al.: Study on China digital ocean prototype system. In: Proceedings of the 2009 WRI World Congress, pp. 466\u2013469. IEEE, Piscataway (2009)","DOI":"10.1109\/WCSE.2009.337"},{"key":"18_CR5","unstructured":"Zhou, X.-M., Wang, G.-R.: Key dimension based high-dimensional data partition strategy. J. Softw. 15(9), 1360\u20131374 (2004)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Chen, J., Fang, B.-X., Tan, J.-L., et al.: Index filtering algorithm based on minimum enclosing circle partition. J. Comput. 35(10), 2139\u20132146 (2012)","DOI":"10.3724\/SP.J.1016.2012.02139"},{"key":"18_CR7","unstructured":"Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. VLDB 98, pp. 194\u2013205 (1998)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Robinson, J.T.: The KDB-tree: a search structure for large multidimensional dynamic indexes. In: Proceedings of 1981 ACM SIGMOD on Data Management, pp. 10\u201318. ACM (1981)","DOI":"10.1145\/582318.582321"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., et al.: The R*-tree: an efficient and robust access method for points and rectangles, pp. 322\u2013331. ACM (1990)","DOI":"10.1145\/93605.98741"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The grid file: An adaptable, symmetric multikey file structure. ACM Trans. Database Syst. (TODS) 9(1), 38\u201371 (1984)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"18_CR11","unstructured":"Goil, S., Nagesh, H.: MAFIA: efficient and scalable subspace clustering for very large data sets. In: Proceedings of SIGKDD on Data Mining, pp. 443\u2013452 (1999)"},{"key":"18_CR12","unstructured":"Huang, D.-M., Du, Y.-L., He, Q.: Migration algorithm for big marine data in hybrid cloud storage. J. Integr. Plant Biol. 2014(01), 199\u2013205 (2014)"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11538-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T23:06:33Z","timestamp":1676415993000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11538-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115375","9783319115382"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11538-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"10 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}