{"id":"https://openalex.org/W2089545095","doi":"https://doi.org/10.1145/1559845.1559931","title":"Serial and parallel methods for i/o efficient suffix tree construction","display_name":"Serial and parallel methods for i/o efficient suffix tree construction","publication_year":2009,"publication_date":"2009-06-29","ids":{"openalex":"https://openalex.org/W2089545095","doi":"https://doi.org/10.1145/1559845.1559931","mag":"2089545095"},"language":"en","primary_location":{"id":"doi:10.1145/1559845.1559931","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1559845.1559931","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 ACM SIGMOD International Conference on Management of data","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/A5043552468","display_name":"Amol Ghoting","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]},{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Amol Ghoting","raw_affiliation_strings":["IBM T. J. Watson Research Center, Yorktown Heights, NY, USA","IBM T. J. Watson Research Center, Yorktown Heights , NY, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research Center, Yorktown Heights, NY, USA","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM T. J. Watson Research Center, Yorktown Heights , NY, USA#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033681881","display_name":"Konstantin Makarychev","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]},{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Konstantin Makarychev","raw_affiliation_strings":["IBM T. J. Watson Research Center, Yorktown Heights, NY, USA","IBM T. J. Watson Research Center, Yorktown Heights , NY, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research Center, Yorktown Heights, NY, USA","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM T. J. Watson Research Center, Yorktown Heights , NY, USA#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043552468"],"corresponding_institution_ids":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"],"apc_list":null,"apc_paid":null,"fwci":4.7979,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.95024189,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"827","last_page":"840"},"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.9797000288963318,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9442999958992004,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/suffix-tree","display_name":"Suffix tree","score":0.9316103458404541},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.815031886100769},{"id":"https://openalex.org/keywords/generalized-suffix-tree","display_name":"Generalized suffix tree","score":0.7777135968208313},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.7254723906517029},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.6879467964172363},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6733098030090332},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6619830131530762},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.5766700506210327},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.5735951662063599},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5250651240348816},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48272082209587097},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4749443829059601},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.43877485394477844},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.32680895924568176},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.2558666169643402},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.14242032170295715},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1382991373538971},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11088669300079346}],"concepts":[{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.9316103458404541},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.815031886100769},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.7777135968208313},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.7254723906517029},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.6879467964172363},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6733098030090332},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6619830131530762},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.5766700506210327},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.5735951662063599},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5250651240348816},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48272082209587097},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4749443829059601},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.43877485394477844},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.32680895924568176},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.2558666169643402},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.14242032170295715},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1382991373538971},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11088669300079346},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1559845.1559931","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1559845.1559931","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 ACM SIGMOD International Conference on Management of data","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":38,"referenced_works":["https://openalex.org/W68532121","https://openalex.org/W1540616176","https://openalex.org/W1571053466","https://openalex.org/W1578828659","https://openalex.org/W1603524899","https://openalex.org/W1807007002","https://openalex.org/W1967382114","https://openalex.org/W1970814655","https://openalex.org/W1974956214","https://openalex.org/W1990061958","https://openalex.org/W2055417893","https://openalex.org/W2086022864","https://openalex.org/W2095685450","https://openalex.org/W2100958137","https://openalex.org/W2107282968","https://openalex.org/W2108235229","https://openalex.org/W2110291136","https://openalex.org/W2121252285","https://openalex.org/W2124281279","https://openalex.org/W2124348703","https://openalex.org/W2131585788","https://openalex.org/W2133363953","https://openalex.org/W2134616089","https://openalex.org/W2135482764","https://openalex.org/W2137023570","https://openalex.org/W2142473132","https://openalex.org/W2152331922","https://openalex.org/W2161488606","https://openalex.org/W2187170662","https://openalex.org/W2197362952","https://openalex.org/W2533248932","https://openalex.org/W2915063781","https://openalex.org/W4233960312","https://openalex.org/W4285719527","https://openalex.org/W6602746130","https://openalex.org/W6633831026","https://openalex.org/W6676566979","https://openalex.org/W6682768705"],"related_works":["https://openalex.org/W2032737507","https://openalex.org/W2082932857","https://openalex.org/W2355763156","https://openalex.org/W3157818565","https://openalex.org/W4293872904","https://openalex.org/W2403867358","https://openalex.org/W2141352383","https://openalex.org/W77935133","https://openalex.org/W2051533549","https://openalex.org/W2592203046"],"abstract_inverted_index":{"Over":[0],"the":[1,5,27,38,41],"past":[2],"three":[3],"decades,":[4],"suffix":[6,30,82],"tree":[7,31,83],"has":[8,22],"served":[9],"as":[10],"a":[11,80],"fundamental":[12],"data":[13,47],"structure":[14],"in":[15,46],"string":[16],"processing.":[17],"However,":[18],"its":[19],"widespread":[20],"applicability":[21],"been":[23],"hindered":[24],"due":[25],"to":[26],"fact":[28],"that":[29,77],"construction":[32,84],"does":[33],"not":[34],"scale":[35],"well":[36],"with":[37],"size":[39],"of":[40],"input":[42],"string.":[43],"With":[44],"advances":[45],"collection":[48],"and":[49,65],"storage":[50],"technologies,":[51],"large":[52],"strings":[53],"have":[54],"become":[55],"ubiquitous,":[56],"especially":[57],"across":[58],"emerging":[59],"applications":[60],"involving":[61],"text,":[62],"time":[63],"series,":[64],"biological":[66],"sequence":[67],"data.":[68],"To":[69],"benefit":[70],"from":[71],"these":[72],"advances,":[73],"it":[74],"is":[75],"imperative":[76],"we":[78],"realize":[79],"scalable":[81],"algorithm.":[85]},"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}