{"id":"https://openalex.org/W2604149021","doi":"https://doi.org/10.1142/s0129054117500101","title":"Query-Optimal Partially Persistent B-Trees with Constant Worst-Case Update Time","display_name":"Query-Optimal Partially Persistent B-Trees with Constant Worst-Case Update Time","publication_year":2017,"publication_date":"2017-02-01","ids":{"openalex":"https://openalex.org/W2604149021","doi":"https://doi.org/10.1142/s0129054117500101","mag":"2604149021"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054117500101","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117500101","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061497405","display_name":"George Lagogiannis","orcid":"https://orcid.org/0000-0001-8040-4125"},"institutions":[{"id":"https://openalex.org/I109954829","display_name":"Agricultural University of Athens","ror":"https://ror.org/03xawq568","country_code":"GR","type":"education","lineage":["https://openalex.org/I109954829"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"George Lagogiannis","raw_affiliation_strings":["University Department, Agricutural University of Athens, Iera odos 75 11855, Greece"],"affiliations":[{"raw_affiliation_string":"University Department, Agricutural University of Athens, Iera odos 75 11855, Greece","institution_ids":["https://openalex.org/I109954829"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5061497405"],"corresponding_institution_ids":["https://openalex.org/I109954829"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.02857616,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"28","issue":"02","first_page":"141","last_page":"169"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7837752103805542},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6372473239898682},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5165635347366333},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48526594042778015},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4580482840538025},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.452708899974823},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4526488780975342},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3671606183052063},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3585126996040344}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7837752103805542},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6372473239898682},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5165635347366333},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48526594042778015},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4580482840538025},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.452708899974823},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4526488780975342},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3671606183052063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3585126996040344},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054117500101","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117500101","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W94425735","https://openalex.org/W1505451213","https://openalex.org/W1577072106","https://openalex.org/W1593112378","https://openalex.org/W1977949265","https://openalex.org/W2006131099","https://openalex.org/W2027450468","https://openalex.org/W2055385473","https://openalex.org/W2081290411","https://openalex.org/W2100576135","https://openalex.org/W2101429492","https://openalex.org/W2142947709","https://openalex.org/W2152301310","https://openalex.org/W3005557970"],"related_works":["https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W2089134982","https://openalex.org/W2113270940","https://openalex.org/W2900627138","https://openalex.org/W3100139999","https://openalex.org/W2030312085"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,47],"present":[4],"the":[5,31,52,63,79,85],"first":[6],"data":[7,68,76],"structure":[8,29,69],"for":[9],"partially":[10,36,80],"persistent":[11,37,81],"B-trees":[12,38],"with":[13,89],"constant":[14,43,90],"worst-case":[15,53,91],"update":[16,44,54,92],"time,":[17],"where":[18],"deletions":[19],"are":[20],"handled":[21],"in":[22,62],"a":[23,57,60],"symmetrical":[24],"to":[25,50,56],"insertions":[26],"manner.":[27],"Our":[28],"matches":[30],"query":[32,64],"times":[33],"of":[34],"optimal":[35],"that":[39],"do":[40],"not":[41],"support":[42],"time":[45,55],"thus,":[46],"have":[48],"managed":[49],"reduce":[51],"constant,":[58],"without":[59],"penalty":[61],"times.":[65],"The":[66],"new":[67],"is":[70],"produced":[71],"by":[72],"mixing":[73],"two":[74],"other":[75],"structures,":[77],"(a)":[78],"B-tree":[82],"and":[83],"(b)":[84],"balanced":[86],"search":[87],"tree":[88],"time.":[93]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}