{"id":"https://openalex.org/W2039208882","doi":"https://doi.org/10.1137/110836377","title":"Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing","display_name":"Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2039208882","doi":"https://doi.org/10.1137/110836377","mag":"2039208882"},"language":"en","primary_location":{"id":"doi:10.1137/110836377","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110836377","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5048790288","display_name":"Amihood Amir","orcid":"https://orcid.org/0000-0002-3939-337X"},"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":"Amihood Amir","raw_affiliation_strings":["University of Pisa,#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Pisa,#TAB#","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074159685","display_name":"Gianni Franceschini","orcid":null},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Gianni Franceschini","raw_affiliation_strings":["Bar Ilan University ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bar Ilan University ,","institution_ids":["https://openalex.org/I13955877"]}]},{"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/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Roberto Grossi","raw_affiliation_strings":["Bar Ilan University ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bar Ilan University ,","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028866207","display_name":"Tsvi Kopelowitz","orcid":null},"institutions":[{"id":"https://openalex.org/I55693919","display_name":"Netanya Academic College","ror":"https://ror.org/03d7p8g51","country_code":"IL","type":"education","lineage":["https://openalex.org/I55693919"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Tsvi Kopelowitz","raw_affiliation_strings":["Netanya Academic College ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Netanya Academic College ,","institution_ids":["https://openalex.org/I55693919"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012404981","display_name":"Moshe Lewenstein","orcid":"https://orcid.org/0000-0002-8272-244X"},"institutions":[{"id":"https://openalex.org/I55693919","display_name":"Netanya Academic College","ror":"https://ror.org/03d7p8g51","country_code":"IL","type":"education","lineage":["https://openalex.org/I55693919"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Moshe Lewenstein","raw_affiliation_strings":["Netanya Academic College ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Netanya Academic College ,","institution_ids":["https://openalex.org/I55693919"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009275662","display_name":"Noa Lewenstein","orcid":null},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Noa Lewenstein","raw_affiliation_strings":["Johns Hopkins University ("],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Johns Hopkins University (","institution_ids":["https://openalex.org/I145311948"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9338,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.89421855,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"43","issue":"4","first_page":"1396","last_page":"1416"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9912999868392944,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.8151971697807312},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.718488872051239},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.6570206880569458},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6126068830490112},{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.557593822479248},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.543487548828125},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5188511610031128},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5105501413345337},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.509332537651062},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47536367177963257},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4659584164619446},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.45526838302612305},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4200756251811981},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41171106696128845},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3990624248981476},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35044917464256287},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.12431749701499939}],"concepts":[{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.8151971697807312},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.718488872051239},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.6570206880569458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6126068830490112},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.557593822479248},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.543487548828125},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5188511610031128},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5105501413345337},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.509332537651062},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47536367177963257},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4659584164619446},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.45526838302612305},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4200756251811981},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41171106696128845},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3990624248981476},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35044917464256287},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.12431749701499939},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/110836377","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110836377","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arpi.unipi.it:11568/766401","is_oa":false,"landing_page_url":"http://epubs.siam.org/doi/pdf/10.1137/110836377","pdf_url":"http://epubs.siam.org/doi/pdf/10.1137/110836377","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/article"},{"id":"pmh:oai:iris.uniroma1.it:11573/595180","is_oa":false,"landing_page_url":"https://epubs.siam.org/doi/epdf/10.1137/110836377","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/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W36558993","https://openalex.org/W41435888","https://openalex.org/W1480837739","https://openalex.org/W1486336060","https://openalex.org/W1491314087","https://openalex.org/W1501342714","https://openalex.org/W1513400187","https://openalex.org/W1533382310","https://openalex.org/W1550418227","https://openalex.org/W1572059610","https://openalex.org/W1577072106","https://openalex.org/W1608221733","https://openalex.org/W1645386049","https://openalex.org/W1676865579","https://openalex.org/W1964669678","https://openalex.org/W1991166425","https://openalex.org/W1993696469","https://openalex.org/W1996578733","https://openalex.org/W2000484009","https://openalex.org/W2007791040","https://openalex.org/W2010816129","https://openalex.org/W2011999472","https://openalex.org/W2012714839","https://openalex.org/W2024051170","https://openalex.org/W2026166434","https://openalex.org/W2026511056","https://openalex.org/W2033625795","https://openalex.org/W2059513841","https://openalex.org/W2059618032","https://openalex.org/W2075117828","https://openalex.org/W2075557785","https://openalex.org/W2077180154","https://openalex.org/W2086158775","https://openalex.org/W2087926915","https://openalex.org/W2099844038","https://openalex.org/W2107079154","https://openalex.org/W2107646517","https://openalex.org/W2121252285","https://openalex.org/W2127087946","https://openalex.org/W2127534330","https://openalex.org/W2130055503","https://openalex.org/W2132339863","https://openalex.org/W2134458085","https://openalex.org/W2137120608","https://openalex.org/W2144779317","https://openalex.org/W2158630342","https://openalex.org/W2158874082","https://openalex.org/W2161488606","https://openalex.org/W2533248932","https://openalex.org/W2788695972","https://openalex.org/W4231502736"],"related_works":["https://openalex.org/W96331545","https://openalex.org/W1548907175","https://openalex.org/W2583658747","https://openalex.org/W1882920571","https://openalex.org/W1517600056","https://openalex.org/W2159942118","https://openalex.org/W2036633468","https://openalex.org/W2003608043","https://openalex.org/W2039208882","https://openalex.org/W2949224720"],"abstract_inverted_index":{"This":[0],"paper":[1,183],"presents":[2],"a":[3,24,36,88,151,215,336,365],"general":[4,61],"technique":[5,58,213],"for":[6,150,195,214,240,249,295],"optimally":[7],"transforming":[8],"any":[9],"dynamic":[10,200],"data":[11,25,49,217,226],"structure":[12,26,77,218,227],"that":[13,27,84,139],"operates":[14],"on":[15,266],"atomic":[16],"and":[17,188,204,255],"indivisible":[18],"keys":[19,30,41,312],"by":[20,127,233],"constant-time":[21],"comparisons,":[22],"into":[23],"handles":[28,362],"unbounded-length":[29],"whose":[31],"comparison":[32],"cost":[33],"is":[34,59,78,83,136,174,229,289,371],"not":[35,339],"constant.":[37],"Examples":[38],"of":[39,74,87,153,177,179,210,245,260,268,287,305,325,353,364],"these":[40],"are":[42,220],"strings,":[43,241],"multidimensional":[44],"points,":[45],"multiple-precision":[46],"numbers,":[47],"multikey":[48],"(e.g.,":[50],"records),":[51],"XML":[52],"paths,":[53],"URL":[54],"addresses,":[55],"etc.":[56],"The":[57,80,182,207,224,284],"more":[60,186],"than":[62],"what":[63],"has":[64],"been":[65],"done":[66,107],"in":[67,108,156,331,341],"previous":[68],"work":[69],"as":[70],"no":[71],"particular":[72],"exploitation":[73],"the":[75,85,98,137,157,175,180,211,221,235,243,246,261,302,322,326,351,356,360,367],"underlying":[76],"required.":[79],"only":[81],"requirement":[82],"insertion":[86,369],"key":[89,337],"must":[90],"identify":[91],"its":[92,95],"predecessor":[93],"or":[94],"successor.":[96],"Using":[97],"proposed":[99,212],"technique,":[100],"online":[101],"suffix":[102,159,198],"tree":[103,160],"construction":[104],"can":[105],"be":[106],"worst":[109,143],"case":[110,144,358],"time":[111,123,145,323,370],"$O(\\log":[112,121,141],"n)$":[113,122,142],"per":[114,124,146],"input":[115,147],"symbol":[116],"(as":[117],"opposed":[118],"to":[119,191],"amortized":[120],"symbol,":[125],"achieved":[126,368],"previously":[128],"known":[129],"algorithms).":[130],"To":[131],"our":[132,134],"knowledge,":[133],"algorithm":[135],"first":[138],"achieves":[140],"symbol.":[148],"Searching":[149],"pattern":[152],"length":[154,352],"$m$":[155],"resulting":[158],"takes":[161,343],"$O(\\min(m":[162],"\\log":[163,167],"|\\Sigma|,":[164],"m":[165],"+":[166,169,291,345],"n)":[168],"tocc)$":[170],"time,":[171,318,347],"where":[172,299,319,348,359],"$tocc$":[173],"number":[176],"occurrences":[178],"pattern.":[181],"also":[184],"describes":[185],"applications":[187],"shows":[189],"how":[190],"obtain":[192],"alternative":[193],"methods":[194],"dealing":[196],"with":[197,237],"sorting,":[199],"lowest":[201],"common":[202],"ancestors,":[203],"order":[205,250],"maintenance.":[206],"technical":[208],"features":[209],"given":[216],"$\\mathscr{D}$":[219,232],"following":[222],"ones.":[223],"new":[225],"$\\mathscr{D}'$":[228,288,315,342],"obtained":[230],"from":[231,314],"augmenting":[234],"latter":[236],"an":[238],"oracle":[239,361],"extending":[242],"functionalities":[244],"Dietz--Sleator":[247],"list":[248],"maintenance":[251],"[P.":[252],"F.":[253],"Dietz":[254],"D.":[256,257],"Sleator,":[258],"Proceedings":[259],"Nineteenth":[262],"Annual":[263],"ACM":[264],"Symposium":[265],"Theory":[267],"Computing,":[269],"ACM,":[270],"New":[271],"York,":[272],"1987,":[273],"pp.":[274,282],"365--372;":[275],"A.":[276],"Tsakalidis,":[277],"Acta":[278],"Inform.,":[279],"21":[280],"(1984),":[281],"101--112].":[283],"space":[285,303],"complexity":[286,304,324],"$\\mathscr{S}(n)":[290],"O(n)$":[292],"memory":[293],"cells":[294],"storing":[296],"$n$":[297],"keys,":[298],"$\\mathscr{S}(n)$":[300],"denotes":[301,321,350],"$\\mathscr{D}$.":[306,332],"Then,":[307],"each":[308],"operation":[309,328,334],"involving":[310,335],"$O(1)$":[311],"taken":[313],"requires":[316],"$O(\\mathscr{T}(n))$":[317],"$\\mathscr{T}(n)$":[320],"corresponding":[327],"originally":[329],"supported":[330],"Each":[333],"$y$":[338],"stored":[340],"$O(\\mathscr{T}(n)":[344],"|y|)$":[346],"$|y|$":[349],"$y$.":[354],"For":[355],"special":[357],"suffixes":[363],"string,":[366],"$O(\\mathscr{T}(n))$.":[372]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}