{"id":"https://openalex.org/W2134481278","doi":"https://doi.org/10.1109/sfcs.2002.1181891","title":"Implicit B-trees: New results for the dictionary problem","display_name":"Implicit B-trees: New results for the dictionary problem","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2134481278","doi":"https://doi.org/10.1109/sfcs.2002.1181891","mag":"2134481278"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2002.1181891","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181891","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5074159685","display_name":"Gianni Franceschini","orcid":null},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"G. Franceschini","raw_affiliation_strings":["Dipartimento di Informatica, Universita di Pisa, Pisa, Italy","Dipt. di Inf., Pisa Univ., Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universita di Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"Dipt. di Inf., Pisa Univ., Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006984021","display_name":"Roberto Grossi","orcid":"https://orcid.org/0000-0002-7985-4222"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"R. Grossi","raw_affiliation_strings":["Dipartimento di Informatica, Universita di Pisa, Pisa, Italy","Dipt. di Inf., Pisa Univ., Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universita di Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"Dipt. di Inf., Pisa Univ., Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108095454","display_name":"J. Ian Munro","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J.I. Munro","raw_affiliation_strings":["School of Computer Science, University of Waterloo, Waterloo, ONT, Canada","(University of Waterloo)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Waterloo, Waterloo, ONT, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"(University of Waterloo)","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073016367","display_name":"Linda Pagli","orcid":"https://orcid.org/0000-0003-3717-3952"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"L. Pagli","raw_affiliation_strings":["Dipartimento di Informatica, Universita di Pisa, Pisa, Italy","University of Pisa,#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universita di Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]},{"raw_affiliation_string":"University of Pisa,#TAB#","institution_ids":["https://openalex.org/I108290504"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2984,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.894405,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"145","last_page":"154"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/data-structure","display_name":"Data structure","score":0.661634087562561},{"id":"https://openalex.org/keywords/b-tree","display_name":"B-tree","score":0.6604633331298828},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.650127649307251},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6284401416778564},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6267894506454468},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.529617428779602},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5133683085441589},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4853302538394928},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46153366565704346},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.45689013600349426},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3886334300041199},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3594730496406555},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3561476767063141},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3215808868408203},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11217322945594788}],"concepts":[{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.661634087562561},{"id":"https://openalex.org/C78669399","wikidata":"https://www.wikidata.org/wiki/Q677051","display_name":"B-tree","level":3,"score":0.6604633331298828},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.650127649307251},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6284401416778564},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6267894506454468},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.529617428779602},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5133683085441589},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4853302538394928},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46153366565704346},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.45689013600349426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3886334300041199},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3594730496406555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3561476767063141},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3215808868408203},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11217322945594788},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/sfcs.2002.1181891","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181891","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:arpi.unipi.it:11568/71783","is_oa":false,"landing_page_url":"http://hdl.handle.net/11568/71783","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:iris.uniroma1.it:11573/57829","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/57829","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W172574161","https://openalex.org/W1966368937","https://openalex.org/W1970976560","https://openalex.org/W1983433417","https://openalex.org/W1985174631","https://openalex.org/W1986970296","https://openalex.org/W1992636056","https://openalex.org/W1993022201","https://openalex.org/W2047619746","https://openalex.org/W2051283794","https://openalex.org/W2067169404","https://openalex.org/W2069907263","https://openalex.org/W2071227907","https://openalex.org/W2085247306","https://openalex.org/W2156305878","https://openalex.org/W2160484851","https://openalex.org/W2165621523","https://openalex.org/W3140526873","https://openalex.org/W3198470706","https://openalex.org/W6646629931","https://openalex.org/W6648588468"],"related_works":["https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W1608733163","https://openalex.org/W2623150993","https://openalex.org/W2055932080","https://openalex.org/W3127082728","https://openalex.org/W1976803949","https://openalex.org/W4230281099"],"abstract_inverted_index":{"We":[0,123],"reopen":[1],"the":[2,11,18,26,42,54,61,69,92,96,99,138],"issue":[3],"of":[4,20,30,108,115,127,163],"finding":[5],"an":[6,31],"implicit":[7],"data":[8,23,55,70],"structure":[9,80],"for":[10,112],"dictionary":[12],"problem.":[13],"In":[14],"particular,":[15],"we":[16,38,65,104],"examine":[17],"problem":[19,97],"maintaining":[21],"n":[22,28,52],"values":[24,71],"in":[25,33,84,119,134,157],"first":[27,93],"locations":[29],"array":[32,118],"such":[34],"a":[35,106,116,120,125,142,161],"way":[36],"that":[37,141,152],"can":[39],"efficiently":[40],"perform":[41,67],"operations":[43,63,83],"insert,":[44],"delete":[45],"and":[46,53,60,75],"search.":[47],"No":[48],"information":[49],"other":[50],"than":[51,73],"is":[56],"to":[57],"be":[58],"retained;":[59],"only":[62],"which":[64],"may":[66],"on":[68,95],"(other":[72],"reads":[74],"writes)":[76],"are":[77],"comparisons.":[78],"Our":[79],"supports":[81],"these":[82],"O(log/sup":[85],"2/":[86],"n/log":[87],"log":[88],"n)":[89,130,149],"time,":[90],"marking":[91],"improvement":[94],"since":[98],"mid":[100],"1980's.":[101],"En":[102],"route":[103],"develop":[105],"number":[107],"space":[109],"efficient":[110],"techniques":[111],"handling":[113],"segments":[114],"large":[117],"memory":[121],"hierarchy.":[122],"achieve":[124],"cost":[126,162],"O(log/sub":[128,164],"B/":[129],"block":[131,143,166],"transfers":[132],"like":[133],"regular":[135],"B-trees,":[136],"under":[137],"realistic":[139],"assumption":[140],"stores":[144],"B":[145],"=":[146],"/spl":[147],"Omega/(log":[148],"keys,":[150],"so":[151],"reporting":[153],"r":[154],"consecutive":[155],"keys":[156],"sorted":[158],"order":[159],"has":[160],"B/n+r/B)":[165],"transfers.":[167],"Being":[168],"implicit,":[169],"our":[170],"B-tree":[171],"occupies":[172],"exactly":[173],"[n/B]":[174],"blocks":[175],"after":[176],"each":[177],"update.":[178]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}