{"id":"https://openalex.org/W1978294273","doi":"https://doi.org/10.5555/313852.314087","title":"Efficient suffix trees on secondary storage","display_name":"Efficient suffix trees on secondary storage","alternate_titles":[],"publication_year":1996,"publication_date":"1996-01-28","ids":{"openalex":"https://openalex.org/W1978294273","doi":"https://doi.org/10.5555/313852.314087","mag":"1978294273"},"language":"en","primary_location":{"id":"mag:1978294273","doi":"https://doi.org/10.5555/313852.314087","is_oa":false,"landing_page_url":"http://portal.acm.org/citation.cfm?id=314087","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W1978294273"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5071691934","display_name":"David Richard Clark","orcid":null,"observed_orcids":[]},"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":"David Richard Clark","raw_affiliation_strings":["Department of Computer Science, University of Waterloo Waterloo, ON N2L 3G1, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Waterloo Waterloo, ON N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108095454","display_name":"J. Ian Munro","orcid":"https://orcid.org/0000-0002-7165-7988","observed_orcids":["https://orcid.org/0000-0002-7165-7988"]},"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. Ian Munro","raw_affiliation_strings":["Department of Computer Science, University of Waterloo Waterloo, ON N2L 3G1, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Waterloo Waterloo, ON N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":4.2375,"has_fulltext":false,"cited_by_count":237,"citation_normalized_percentile":{"value":0.97452229,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"383","last_page":"391"},"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/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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-trees","display_name":"suffix trees","score":0.9990000128746033},{"id":"https://openalex.org/keywords/full-text-retrieval","display_name":"full-text search","score":0.7429999709129333},{"id":"https://openalex.org/keywords/secondary-storage","display_name":"external memory","score":0.8619999885559082},{"id":"https://openalex.org/keywords/space-efficient-data-structures","display_name":"space-efficient data structures","score":0.609000027179718},{"id":"https://openalex.org/keywords/dynamic-text","display_name":"dynamic text","score":0.5360000133514404},{"id":"https://openalex.org/keywords/text-indexing","display_name":"text indexing","score":0.38999998569488525}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8073598146438599},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.806442379951477},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.6949831247329712},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.666147768497467},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.6635748147964478},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.6294745802879333},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.628386914730072},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5793685913085938},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.4883422553539276},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4818088412284851},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4408319592475891},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.4132470488548279},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36015647649765015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13783439993858337},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06966081261634827},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"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":1,"locations":[{"id":"mag:1978294273","doi":"https://doi.org/10.5555/313852.314087","is_oa":false,"landing_page_url":"http://portal.acm.org/citation.cfm?id=314087","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W127947978","https://openalex.org/W1492311848","https://openalex.org/W1497108447","https://openalex.org/W1561123773","https://openalex.org/W1980905558","https://openalex.org/W2065717636","https://openalex.org/W2084367148","https://openalex.org/W2107646517","https://openalex.org/W2121252285","https://openalex.org/W2155512447","https://openalex.org/W2158874082","https://openalex.org/W2161534948","https://openalex.org/W2533248932"],"related_works":["https://openalex.org/W16499258","https://openalex.org/W2586037276","https://openalex.org/W2974083459","https://openalex.org/W1979282493","https://openalex.org/W2114790712","https://openalex.org/W2050670542","https://openalex.org/W2035524445","https://openalex.org/W2003608043","https://openalex.org/W1520004708","https://openalex.org/W7100198198"],"abstract_inverted_index":{"We":[0,37],"present":[1,99],"a":[2,8,50],"new":[3,73,100],"representation":[4],"for":[5,41,93],"suffix":[6,75],"trees,":[7],"data":[9,103],"structure":[10,44],"used":[11],"in":[12,48,79,105],"full":[13,94],"text":[14,95],"searching,":[15],"that":[16,52,115],"uses":[17],"little":[18],"more":[19],"storage":[20,47],"than":[21],"the":[22,32,43,55,69,108],"log":[23],"n":[24],"bits":[25],"per":[26],"index":[27,35],"point":[28],"required":[29],"to":[30,68],"store":[31],"list":[33],"of":[34,57,81],"points.":[36],"also":[38],"show":[39],"algorithms":[40,101],"maintaining":[42],"on":[45,111],"secondary":[46],"such":[49],"way":[51],"we":[53,63,98],"minimize":[54],"number":[56],"disk":[58],"accesses":[59],"while":[60],"searching":[61,113],"and":[62,84,102],"can":[64],"efficiently":[65],"handle":[66],"changes":[67],"text.":[70],"Using":[71],"this":[72,106],"representation,":[74],"trees":[76],"are":[77],"competitive":[78],"terms":[80],"space":[82],"with,":[83],"actually":[85],"offer":[86],"significantly":[87],"better":[88],"performance":[89],"than,":[90],"existing":[91],"methods":[92,114],"searching.":[96],"While":[97],"structures":[104],"paper,":[107],"emphasis":[109],"is":[110],"practical":[112],"have":[116],"been":[117],"empirically":[118],"verified":[119],"against":[120],"real":[121],"data.":[122]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1978294273","counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":14}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
