{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:46:04Z","timestamp":1725907564520},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319654812"},{"type":"electronic","value":"9783319654829"}],"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-65482-9_32","type":"book-chapter","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T18:08:09Z","timestamp":1502388489000},"page":"452-464","source":"Crossref","is-referenced-by-count":2,"title":["Interval Merging Binary Tree"],"prefix":"10.1007","author":[{"given":"Istv\u00e1n","family":"Finta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00f3r\u00e1nt","family":"Farkas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e1ndor","family":"Sz\u00e9n\u00e1si","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Szabolcs","family":"Sergy\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,11]]},"reference":[{"key":"32_CR1","unstructured":"STORM - A distributed real-time computation system. http:\/\/storm.apache.org\/documentation\/Home.html . Last visited 29 Mar 2017"},{"key":"32_CR2","unstructured":"Java Collections Frameworks. http:\/\/docs.oracle.com\/javase\/7\/docs\/technotes\/guides\/collections\/overview.html . Last visited 29 Mar 2017"},{"issue":"7","key":"32_CR3","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"32_CR4","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press and McGraw-Hill (2009). ISBN: 0-262-03384-4"},{"key":"32_CR5","unstructured":"Binary Search Tree - Wiki. https:\/\/en.wikipedia.org\/wiki\/Binary_search_tree . Last visited 29 Mar 2017"},{"issue":"3","key":"32_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"G Adelson-Velsky","year":"1972","unstructured":"Adelson-Velsky, G., Landis, E.: Organization and maintenance of large ordered indexes. Acta Informatica 1(3), 173\u2013189 (1972). doi: 10.1007\/BF00288683","journal-title":"Acta Informatica"},{"key":"32_CR7","first-page":"263","volume":"146","author":"G Adelson-Velsky","year":"1962","unstructured":"Adelson-Velsky, G., Landis, E.: An algorithm for the organization of information. Proc. USSR Acad. Sci. 146, 263\u2013266 (1962)","journal-title":"Proc. USSR Acad. Sci."},{"key":"32_CR8","unstructured":"AVL Tree - Wiki. https:\/\/en.wikipedia.org\/wiki\/AVL_tree . Last visited 29 Mar 2017"},{"issue":"4","key":"32_CR9","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BF00289509","volume":"1","author":"R Bayer","year":"1972","unstructured":"Bayer, R.: Symmetric binary B-Trees: data structure and maintenance algorithms. Acta Informatica 1(4), 290\u2013306 (1972). doi: 10.1007\/BF00289509","journal-title":"Acta Informatica"},{"key":"32_CR10","unstructured":"Red-black tree - Wiki. https:\/\/en.wikipedia.org\/wiki\/Red-black_tree . Last visited 29 Mar 2017"},{"key":"32_CR11","unstructured":"(a, b) Tree. https:\/\/en.wikipedia.org\/wiki\/(a,b)-tree . Last visited 29 Mar 2017"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Interval trees. In: Computational Geometry, 2nd revised edn., Section 10.1, pp. 212\u2013217. Springer, Heidelberg (2000)","DOI":"10.1007\/978-3-662-04245-8_1"},{"issue":"9","key":"32_CR13","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"C\u201328","author":"JL Bentley","year":"1979","unstructured":"Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. C\u201328(9), 643\u2013647 (1979). doi: 10.1109\/TC.1979.1675432","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"32_CR14","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1145\/1012888.1005742","volume":"32","author":"B Pfaff","year":"2004","unstructured":"Pfaff, B.: Performance analysis of BSTs in system software. ACM SIGMETRICS 2004 32(1), 410\u2013422 (2004). ISBN: 1-58113-873-3","journal-title":"ACM SIGMETRICS 2004"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-65482-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T07:31:30Z","timestamp":1570001490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-65482-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319654812","9783319654829"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-65482-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}