{"id":"https://openalex.org/W2152486057","doi":"https://doi.org/10.1109/sfcs.2003.1238199","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":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W2152486057","doi":"https://doi.org/10.1109/sfcs.2003.1238199","mag":"2152486057"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2003.1238199","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238199","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-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":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Wing-Kai Hon","raw_affiliation_strings":["University of Hong Kong, Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077610103","display_name":"Kunihiko Sadakane","orcid":"https://orcid.org/0000-0002-8212-3682"},"institutions":[{"id":"https://openalex.org/I135598925","display_name":"Kyushu University","ror":"https://ror.org/00p4k0j84","country_code":"JP","type":"education","lineage":["https://openalex.org/I135598925"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"K. Sadakane","raw_affiliation_strings":["Kyushu University, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyushu University, Japan","institution_ids":["https://openalex.org/I135598925"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012563463","display_name":"Wing\u2010Kin Sung","orcid":"https://orcid.org/0000-0001-7806-7086"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Wing-Kin Sung","raw_affiliation_strings":["National University of Singapore, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":19.4296,"has_fulltext":false,"cited_by_count":95,"citation_normalized_percentile":{"value":0.99315527,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"251","last_page":"260"},"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9847999811172485,"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.983299970626831,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.9064321517944336},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.8318325877189636},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.790215253829956},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.6587985157966614},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6523480415344238},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.6338198184967041},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5685945153236389},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5587126612663269},{"id":"https://openalex.org/keywords/generalized-suffix-tree","display_name":"Generalized suffix tree","score":0.550777018070221},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4949330687522888},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4518347680568695},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45073264837265015},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4387736916542053},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4234811067581177},{"id":"https://openalex.org/keywords/space-time","display_name":"Space time","score":0.4174897074699402},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40162569284439087},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34687161445617676},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06919649243354797}],"concepts":[{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.9064321517944336},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.8318325877189636},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.790215253829956},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.6587985157966614},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6523480415344238},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.6338198184967041},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5685945153236389},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5587126612663269},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.550777018070221},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4949330687522888},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4518347680568695},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45073264837265015},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4387736916542053},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4234811067581177},{"id":"https://openalex.org/C96402334","wikidata":"https://www.wikidata.org/wiki/Q3030793","display_name":"Space time","level":2,"score":0.4174897074699402},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40162569284439087},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34687161445617676},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06919649243354797},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C42360764","wikidata":"https://www.wikidata.org/wiki/Q83588","display_name":"Chemical engineering","level":1,"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sfcs.2003.1238199","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238199","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W41435888","https://openalex.org/W117230746","https://openalex.org/W938539187","https://openalex.org/W1487662321","https://openalex.org/W1495956867","https://openalex.org/W1534714852","https://openalex.org/W1542553486","https://openalex.org/W1587231161","https://openalex.org/W1600258932","https://openalex.org/W1602434374","https://openalex.org/W1603784832","https://openalex.org/W1726445723","https://openalex.org/W1974983766","https://openalex.org/W1975454935","https://openalex.org/W1985174631","https://openalex.org/W1986633843","https://openalex.org/W1986970296","https://openalex.org/W1990061958","https://openalex.org/W1991386782","https://openalex.org/W2030962049","https://openalex.org/W2046038806","https://openalex.org/W2055706406","https://openalex.org/W2059513841","https://openalex.org/W2090021115","https://openalex.org/W2107079154","https://openalex.org/W2121252285","https://openalex.org/W2130564474","https://openalex.org/W2149243190","https://openalex.org/W2158322625","https://openalex.org/W2158874082","https://openalex.org/W2161488606","https://openalex.org/W2170899819","https://openalex.org/W2320748401","https://openalex.org/W2475478067","https://openalex.org/W2533248932","https://openalex.org/W2912435829","https://openalex.org/W3021727955","https://openalex.org/W4214568865","https://openalex.org/W4237754109","https://openalex.org/W6632477169","https://openalex.org/W6635092297","https://openalex.org/W6644134144","https://openalex.org/W6662006067","https://openalex.org/W6683504902"],"related_works":["https://openalex.org/W2063841356","https://openalex.org/W2405149725","https://openalex.org/W2003608043","https://openalex.org/W2118703123","https://openalex.org/W1527782099","https://openalex.org/W2067974452","https://openalex.org/W4385595111","https://openalex.org/W1543263356","https://openalex.org/W1749587086","https://openalex.org/W117230746"],"abstract_inverted_index":{"Suffix":[0,178,181],"trees":[1],"and":[2,11,38,115,129,148,183,208,227],"suffix":[3,109,138,206,210],"arrays":[4],"are":[5,15,133,235],"the":[6,47,50,53,55,71,74,93,98,108,127,130,137,188,192,195,236],"most":[7,75],"prominent":[8],"full-text":[9,173],"indices,":[10,174],"their":[12],"construction":[13],"algorithms":[14,238],"well":[16],"studied.":[17],"It":[18],"has":[19],"been":[20],"open":[21],"for":[22,106,119,152],"a":[23,205,209,250],"long":[24],"time":[25,37,114,128,147,226,244],"whether":[26],"these":[27],"indices":[28],"can":[29,165,203],"be":[30,167],"constructed":[31],"in":[32,59,85,221],"both":[33,126],"O(n":[34,39,65,86,143,214,222,228],"log":[35,40,66,87,215,223,224,242,254],"n)":[36,88,243],"n)-bit":[41,67],"working":[42,68,80,117,150,217,247],"space,":[43,118,248],"where":[44,191],"n":[45],"denotes":[46],"length":[48],"of":[49,194],"text.":[51],"In":[52],"literature,":[54],"fastest":[56],"algorithm":[57,77,105,141,164,202],"runs":[58,84],"O(n)":[60,113],"time,":[61,232],"while":[62,82,219],"it":[63,83],"requires":[64,78,142],"space.":[69],"On":[70],"other":[72,171],"hand,":[73],"space-efficient":[76],"O(n)-bit":[79,116,149],"space":[81,131,151,218],"time.":[89],"This":[90],"paper":[91],"breaks":[92],"long-standing":[94],"time-and-space":[95],"barrier":[96],"under":[97,249],"unit-cost":[99],"word":[100],"RAM.":[101],"We":[102,185],"give":[103],"an":[104],"constructing":[107,136],"array":[110,207],"which":[111],"takes":[112],"texts":[120],"with":[121,245],"constant-size":[122],"alphabets.":[123],"Note":[124],"that":[125,239,253],"bounds":[132],"optimal.":[134],"For":[135],"tree,":[139],"our":[140,163],"log/sup":[144,229],"/spl":[145,156,230],"epsi//n)":[146,231],"any":[153],"0":[154],"<":[155,158],"epsi/":[157],"1.":[159],"Apart":[160],"from":[161],"that,":[162],"also":[166,186],"adopted":[168],"to":[169],"build":[170],"existing":[172],"such":[175],"as":[176],"Compressed":[177,180],"Tree,":[179],"Arrays":[182],"FM-index.":[184],"study":[187],"general":[189],"case":[190],"size":[193],"alphabet":[196],"A":[197],"is":[198],"not":[199],"constant.":[200],"Our":[201],"construct":[204],"tree":[211],"using":[212],"optimal":[213,246],"|A|)-bit":[216],"running":[220],"|A|)":[225],"respectively.":[233],"These":[234],"first":[237],"achieve":[240],"0(n":[241],"reasonable":[251],"assumption":[252],"|A|":[255],"=":[256],"o(log":[257],"n).":[258]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}