{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T08:13:01Z","timestamp":1648887181548},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2017,2]]},"abstract":" In this paper we present the first data structure for partially persistent B-trees with constant worst-case update time, where deletions are handled in a symmetrical to insertions manner. Our structure matches the query times of optimal partially persistent B-trees that do not support constant update time thus, we have managed to reduce the worst-case update time to a constant, without a penalty in the query times. The new data structure is produced by mixing two other data structures, (a) the partially persistent B-tree and (b) the balanced search tree with constant worst-case update time. <\/jats:p>","DOI":"10.1142\/s0129054117500101","type":"journal-article","created":{"date-parts":[[2017,4,4]],"date-time":"2017-04-04T01:50:23Z","timestamp":1491270623000},"page":"141-169","source":"Crossref","is-referenced-by-count":0,"title":["Query-Optimal Partially Persistent B-Trees with Constant Worst-Case Update Time"],"prefix":"10.1142","volume":"28","author":[{"given":"George","family":"Lagogiannis","sequence":"first","affiliation":[{"name":"University Department, Agricutural University of Athens, Iera odos 75 11855, Greece"}]}],"member":"219","published-online":{"date-parts":[[2017,4,3]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050028"},{"issue":"3","key":"p_2","first-page":"238","volume":"3","author":"Brodal G. S.","year":"1996","journal-title":"Nordic Journal of Computing"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054196000117"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0151-3"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2011.12.009"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1145\/1132863.1132870"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335427"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1145\/119995.115861"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1109\/69.599929"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054117500101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T08:59:01Z","timestamp":1565081941000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054117500101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":9,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2017,4,3]]},"published-print":{"date-parts":[[2017,2]]}},"alternative-id":["10.1142\/S0129054117500101"],"URL":"https:\/\/doi.org\/10.1142\/s0129054117500101","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2]]}}}