{"id":"https://openalex.org/W2105633925","doi":"https://doi.org/10.1137/070685373","title":"Breaking a Time-and-Space Barrier in Constructing Full-Text Indices","display_name":"Breaking a Time-and-Space Barrier in Constructing Full-Text Indices","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2105633925","doi":"https://doi.org/10.1137/070685373","mag":"2105633925"},"language":"en","primary_location":{"id":"doi:10.1137/070685373","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070685373","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/A5013112058","display_name":"Wing-Kai Hon","orcid":"https://orcid.org/0000-0002-0570-2904"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wing-Kai Hon","raw_affiliation_strings":["wkhon@cs.nthu.edu.tw#TAB#"],"affiliations":[{"raw_affiliation_string":"wkhon@cs.nthu.edu.tw#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077610103","display_name":"Kunihiko Sadakane","orcid":"https://orcid.org/0000-0002-8212-3682"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kunihiko Sadakane","raw_affiliation_strings":["sada@csce.kyushu-u.ac.jp#TAB#"],"affiliations":[{"raw_affiliation_string":"sada@csce.kyushu-u.ac.jp#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012563463","display_name":"Wing\u2010Kin Sung","orcid":"https://orcid.org/0000-0001-7806-7086"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wing-Kin Sung","raw_affiliation_strings":["ksung@comp.nus.edu.sg#TAB#"],"affiliations":[{"raw_affiliation_string":"ksung@comp.nus.edu.sg#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5013112058"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.0102,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.97863006,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"38","issue":"6","first_page":"2162","last_page":"2178"},"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.9919999837875366,"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.9853000044822693,"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/compressed-suffix-array","display_name":"Compressed suffix array","score":0.9066063165664673},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.8173965215682983},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.78013014793396},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6471682786941528},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6452897191047668},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.5803309082984924},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.5597436428070068},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5283506512641907},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5246474742889404},{"id":"https://openalex.org/keywords/generalized-suffix-tree","display_name":"Generalized suffix tree","score":0.5136880278587341},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4765651524066925},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.42521780729293823},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41981473565101624},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41548633575439453},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4127908945083618},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23982366919517517},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07244172692298889}],"concepts":[{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.9066063165664673},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.8173965215682983},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.78013014793396},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6471682786941528},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6452897191047668},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.5803309082984924},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.5597436428070068},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5283506512641907},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5246474742889404},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.5136880278587341},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4765651524066925},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.42521780729293823},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41981473565101624},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41548633575439453},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4127908945083618},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23982366919517517},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07244172692298889},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/070685373","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070685373","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:scholarbank.nus.edu.sg:10635/39472","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/39472","pdf_url":null,"source":{"id":"https://openalex.org/S7407052290","display_name":"National University of Singapore","issn_l":null,"issn":[],"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":"Scopus","raw_type":"Article"},{"id":"pmh:oai:scholarbank.nus.edu.sg:10635/40801","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/40801","pdf_url":null,"source":{"id":"https://openalex.org/S7407052290","display_name":"National University of Singapore","issn_l":null,"issn":[],"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":"Scopus","raw_type":"Conference Paper"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.304.8710","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.8710","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.nthu.edu.tw/~wkhon/papers/HSS03.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.99.7790","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.7790","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.nthu.edu.tw/~wkhon/papers/HSS03.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1726445723","https://openalex.org/W1974983766","https://openalex.org/W1986633843","https://openalex.org/W1986970296","https://openalex.org/W1991386782","https://openalex.org/W2015577249","https://openalex.org/W2030962049","https://openalex.org/W2046038806","https://openalex.org/W2059513841","https://openalex.org/W2064184672","https://openalex.org/W2067974452","https://openalex.org/W2090021115","https://openalex.org/W2118703123","https://openalex.org/W2121252285","https://openalex.org/W2158874082","https://openalex.org/W2159647614","https://openalex.org/W2170899819","https://openalex.org/W2912435829"],"related_works":["https://openalex.org/W2003608043","https://openalex.org/W2405892617","https://openalex.org/W153119118","https://openalex.org/W2583658747","https://openalex.org/W2158874082","https://openalex.org/W1575722140","https://openalex.org/W4293529780","https://openalex.org/W1498395615","https://openalex.org/W2073921136","https://openalex.org/W1965532872"],"abstract_inverted_index":{"Suffix":[0],"trees":[1],"and":[2,11,76,106,120,136,166,191,205],"suffix":[3,100,129,161,164,189,193,236],"arrays":[4],"are":[5,15,124,210],"the":[6,19,21,38,41,44,47,84,89,99,118,121,128,171,175,178,211,225,241],"most":[7,48],"prominent":[8],"full-text":[9,156],"indices,":[10,157],"their":[12],"construction":[13,238],"algorithms":[14,213],"well":[16],"studied.":[17],"In":[18],"literature,":[20],"fastest":[22],"algorithm":[23,50,96,132,147,185,239],"runs":[24,57],"in":[25,58,71,202],"$O(n)$":[26,104],"time,":[27,207],"while":[28,55,200],"it":[29,56],"requires":[30,51,133],"$O(n\\log":[31,59],"n)$-bit":[32,78],"working":[33,53,79,108,138,198,221],"space,":[34,109],"where":[35,174,228],"n":[36],"denotes":[37],"length":[39],"of":[40,177],"text.":[42],"On":[43],"other":[45,154],"hand,":[46],"space-efficient":[49],"$O(n)$-bit":[52,107,137],"space":[54,122,139,199],"n)$":[60,74,217],"time.":[61],"It":[62],"was":[63],"open":[64],"whether":[65],"these":[66],"indices":[67],"can":[68,148,186,232],"be":[69,150],"constructed":[70],"both":[72,117],"$o(n\\log":[73,77,216],"time":[75,105,119,135,204,218],"space.":[80,222],"This":[81],"paper":[82],"breaks":[83],"above":[85],"time-and-space":[86],"barrier":[87],"under":[88],"unit-cost":[90],"word":[91],"RAM.":[92],"We":[93,168],"give":[94],"an":[95],"for":[97,110,140,224],"constructing":[98,127],"array,":[101],"which":[102],"takes":[103],"texts":[111],"with":[112,219],"constant-size":[113],"alphabets.":[114],"Note":[115],"that":[116,214],"bounds":[123],"optimal.":[125],"For":[126],"tree,":[130,162],"our":[131,146,235],"$O(n\\log^{\\epsilon}n)$":[134],"any":[141],"$0<\\epsilon<1$.":[142],"Apart":[143],"from":[144],"that,":[145],"also":[149,169],"adopted":[151],"to":[152,240],"build":[153],"existing":[155],"such":[158],"as":[159],"compressed":[160,163],"arrays,":[165],"FM-index.":[167],"study":[170],"general":[172],"case":[173,227],"size":[176],"alphabet":[179],"$\\Sigma$":[180],"is":[181],"not":[182],"constant.":[183],"Our":[184],"construct":[187],"a":[188,192],"array":[190,237],"tree":[194],"using":[195],"optimal":[196,220,242],"$O(n\\log|\\Sigma|)$-bit":[197],"running":[201],"$O(n\\log\\log|\\Sigma|)$":[203],"$O(n(\\log^{\\epsilon}n+\\log|\\Sigma|))$":[206],"respectively.":[208],"These":[209],"first":[212],"achieve":[215],"Moreover,":[223],"special":[226],"$\\log|\\Sigma|=O((\\log\\log":[229],"n)^{1-\\epsilon})$,":[230],"we":[231],"speed":[233],"up":[234],"$O(n)$.":[243]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}