{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:45:02Z","timestamp":1725882302672},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319557045"},{"type":"electronic","value":"9783319557052"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-55705-2_2","type":"book-chapter","created":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T03:38:59Z","timestamp":1490067539000},"page":"18-34","source":"Crossref","is-referenced-by-count":0,"title":["A Partitioning Scheme for Big Dynamic Trees"],"prefix":"10.1007","author":[{"given":"Atsushi","family":"Sudoh","sequence":"first","affiliation":[]},{"given":"Tatsuo","family":"Tsuji","sequence":"additional","affiliation":[]},{"given":"Ken","family":"Higuchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,22]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"O\u2019Neil, P.E., O\u2019Neil, E.J., Pal. S., Cseri, I., Schaller, G., Westbury, N.: ORDPATHs: insert-friendly XML node labels. In: Proceedings of the ACM SIGMOD, pp. 903\u2013908 (2004)","DOI":"10.1145\/1007568.1007686"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Li, C., Ling, T.W.: QED: a novel quaternary en-coding to completely avoid re-labeling in XML updates. In: Proceedings of CIKM 2005, pp. 501\u2013508 (2005)","DOI":"10.1145\/1099554.1099692"},{"key":"2_CR3","unstructured":"Goldman, R., Widom, J.: Dataguides: enabling query formulation and optimization in semistrucutured databases. In: Proceedings of VLDB, pp. 436\u2013445 (1997)"},{"issue":"1","key":"2_CR4","first-page":"1","volume":"5","author":"T Kanbara","year":"2012","unstructured":"Kanbara, T., Ueshima, S.: Distance range queries in spatial index tree. Trans. Inf. Process. Soc. Jpn.: Database 5(1), 1\u201317 (2012)","journal-title":"Trans. Inf. Process. Soc. Jpn.: Database"},{"key":"2_CR5","unstructured":"Kido, K., Amagasa, T., Kitagawa, H.: A scheme for parallel processing of XML data using PC clusters. In: Proceedings of Database Engineering Workshop, 6B-oi3 (2006)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-18123-3_17","volume-title":"Database Systems for Advanced Applications","author":"M Makino","year":"2015","unstructured":"Makino, M., Tsuji, T., Higuchi, K.: History-pattern implementation for large-scale dynamic multidimensional datasets and its evaluations. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M.A. (eds.) DASFAA 2015. LNCS, vol. 9050, pp. 275\u2013291. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-18123-3_17"},{"issue":"4","key":"2_CR7","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1587\/transinf.2015DAP0025","volume":"E99-D","author":"M Makino","year":"2016","unstructured":"Makino, M., Tsuji, T., Higuchi, K.: History-pattern encoding for large-scale dynamic multidimensional datasets and its evaluations. IEICE Trans. E99-D(4), 989\u2013999 (2016). (extended version of [6])","journal-title":"IEICE Trans."},{"issue":"1","key":"2_CR8","first-page":"1","volume":"3","author":"B Li","year":"2010","unstructured":"Li, B., Kawaguchi, K., Tsuji, T., Higuchi, K.: A labeling scheme for dynamic XML trees based on history-offset encoding. Trans. Inf. Process. Soc. Jpn.: Database 3(1), 1\u201317 (2010)","journal-title":"Trans. Inf. Process. Soc. Jpn.: Database"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-540-71703-4_26","volume-title":"Advances in Databases: Concepts, Systems and Applications","author":"KMA Hasan","year":"2007","unstructured":"Hasan, K.M.A., Tsuji, T., Higuchi, K.: An efficient implementation for MOLAP basic data structure and its evaluation. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 288\u2013299. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-71703-4_26"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Brown, P.G.: Overview of sciDB: large scale array storage, processing and analysis. In: Proceedings of the ACM SIGMOD, pp. 963\u2013968 (2010)","DOI":"10.1145\/1807167.1807271"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Soroush, E., Balazinska, M.: Time travel in a scientific array database. In: Proceedings of ICDE, pp. 98\u2013109 (2013)","DOI":"10.1109\/ICDE.2013.6544817"},{"key":"2_CR12","unstructured":"Extensible Markup Language. http:\/\/www.w3.org\/XML\/"},{"key":"2_CR13","unstructured":"XMark \u2013 An XML Benchmark Project. http:\/\/www.xml-benchmark.org\/"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55705-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:46:15Z","timestamp":1568940375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55705-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319557045","9783319557052"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55705-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}