{"id":"https://openalex.org/W2100016822","doi":"https://doi.org/10.1002/spe.4380230705","title":"Longest\u2010match string searching for ziv\u2010lempel compression","display_name":"Longest\u2010match string searching for ziv\u2010lempel compression","publication_year":1993,"publication_date":"1993-07-01","ids":{"openalex":"https://openalex.org/W2100016822","doi":"https://doi.org/10.1002/spe.4380230705","mag":"2100016822"},"language":"en","primary_location":{"id":"doi:10.1002/spe.4380230705","is_oa":false,"landing_page_url":"https://doi.org/10.1002/spe.4380230705","pdf_url":null,"source":{"id":"https://openalex.org/S122199241","display_name":"Software Practice and Experience","issn_l":"0038-0644","issn":["0038-0644","1097-024X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Software: Practice and Experience","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/A5051736855","display_name":"Tim Bell","orcid":"https://orcid.org/0000-0002-0148-0857"},"institutions":[{"id":"https://openalex.org/I185492890","display_name":"University of Canterbury","ror":"https://ror.org/03y7q9t39","country_code":"NZ","type":"education","lineage":["https://openalex.org/I185492890"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Timothy Bell","raw_affiliation_strings":["Department of Computer Science, University of Canterbury, Christchurch 1, New Zealand","Department of Computer Science University of Canterbury Christchurch 1, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Canterbury, Christchurch 1, New Zealand","institution_ids":["https://openalex.org/I185492890"]},{"raw_affiliation_string":"Department of Computer Science University of Canterbury Christchurch 1, New Zealand","institution_ids":["https://openalex.org/I185492890"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047269307","display_name":"David Kulp","orcid":"https://orcid.org/0000-0001-6540-0222"},"institutions":[{"id":"https://openalex.org/I185492890","display_name":"University of Canterbury","ror":"https://ror.org/03y7q9t39","country_code":"NZ","type":"education","lineage":["https://openalex.org/I185492890"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"David Kulp","raw_affiliation_strings":["Department of Computer Science, University of Canterbury, Christchurch 1, New Zealand","Department of Computer Science University of Canterbury Christchurch 1, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Canterbury, Christchurch 1, New Zealand","institution_ids":["https://openalex.org/I185492890"]},{"raw_affiliation_string":"Department of Computer Science University of Canterbury Christchurch 1, New Zealand","institution_ids":["https://openalex.org/I185492890"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I185492890"],"apc_list":{"value":4220,"currency":"USD","value_usd":4220},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.1688106,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"23","issue":"7","first_page":"757","last_page":"771"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9836000204086304,"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/trie","display_name":"Trie","score":0.8415234684944153},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.7972735166549683},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7191022634506226},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5802654027938843},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.5777994394302368},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5346879959106445},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5111566185951233},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.5007367134094238},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.47192955017089844},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4404706656932831},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.4369139075279236},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.42460328340530396},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4194168746471405},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.41881832480430603},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4113907516002655},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2844764292240143}],"concepts":[{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.8415234684944153},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.7972735166549683},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7191022634506226},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5802654027938843},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.5777994394302368},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5346879959106445},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5111566185951233},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.5007367134094238},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.47192955017089844},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4404706656932831},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.4369139075279236},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.42460328340530396},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4194168746471405},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.41881832480430603},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4113907516002655},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2844764292240143},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1002/spe.4380230705","is_oa":false,"landing_page_url":"https://doi.org/10.1002/spe.4380230705","pdf_url":null,"source":{"id":"https://openalex.org/S122199241","display_name":"Software Practice and Experience","issn_l":"0038-0644","issn":["0038-0644","1097-024X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Software: Practice and Experience","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.14.8587","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.8587","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ubc.ca/local/reading/proceedings/spe91-95/spe/./vol23/issue7/spe837.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.32.8611","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.8611","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cosc.canterbury.ac.nz/research/reports/TechReps/./1989/tr_8906.pdf","raw_type":"text"},{"id":"pmh:oai:ir.canterbury.ac.nz:10092/3062","is_oa":false,"landing_page_url":"http://hdl.handle.net/10092/3062","pdf_url":null,"source":{"id":"https://openalex.org/S4377196357","display_name":"UC Research Repository  (University of Canterbury)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I185492890","host_organization_name":"University of Canterbury","host_organization_lineage":["https://openalex.org/I185492890"],"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":"Reports"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W185091403","https://openalex.org/W1510043860","https://openalex.org/W1831105049","https://openalex.org/W1985108724","https://openalex.org/W2001232605","https://openalex.org/W2017661493","https://openalex.org/W2022126655","https://openalex.org/W2029353114","https://openalex.org/W2107745473","https://openalex.org/W2117946854","https://openalex.org/W2121252285","https://openalex.org/W2122962290","https://openalex.org/W2129652681","https://openalex.org/W2130055503","https://openalex.org/W2134826720","https://openalex.org/W2137012911","https://openalex.org/W2155512447","https://openalex.org/W2161628678","https://openalex.org/W2611071497","https://openalex.org/W6607594530"],"related_works":["https://openalex.org/W2196636117","https://openalex.org/W2067956663","https://openalex.org/W2902482624","https://openalex.org/W3153057271","https://openalex.org/W2799512315","https://openalex.org/W4294611378","https://openalex.org/W2428232282","https://openalex.org/W2487079816","https://openalex.org/W1988981363","https://openalex.org/W2362352966"],"abstract_inverted_index":{"Abstract":[0],"Ziv\u2010Lempel":[1],"coding":[2,35,50],"is":[3,41,128],"currently":[4],"one":[5],"of":[6,19,78,105,111,133],"the":[7,31,54,58,74,95,106,113,120,131,147,179],"more":[8],"practical":[9],"data":[10,66,174],"compression":[11,99],"schemes.":[12],"It":[13],"operates":[14],"by":[15],"replacing":[16],"a":[17,20,23,38,134],"substring":[18],"text":[21],"with":[22],"pointer":[24],"to":[25,52,72,137,154,167],"its":[26],"longest":[27,55,114,169],"previous":[28],"occurrence":[29],"in":[30],"input,":[32],"for":[33,57,83,156,178],"each":[34,49],"step.":[36],"Decoding":[37],"compressed":[39],"file":[40],"very":[42],"fast,":[43],"but":[44,159],"encoding":[45],"involves":[46],"searching":[47,149],"at":[48],"step":[51],"find":[53,168],"match":[56],"next":[59],"few":[60],"characters.":[61],"This":[62],"paper":[63],"presents":[64],"eight":[65],"structures":[67,175],"that":[68],"can":[69,164],"be":[70,165],"used":[71,82,153],"accelerate":[73],"searching,":[75],"including":[76],"adaptations":[77],"four":[79],"methods":[80,110],"normally":[81],"exact":[84,157],"matching":[85],"searching.":[86],"The":[87,126],"algorithms":[88,107],"are":[89,108,151,181],"evaluated":[90],"analytically":[91],"and":[92,101,119,146],"empirically,":[93],"indicating":[94],"trade\u2010offs":[96],"available":[97],"between":[98],"speed":[100],"memory":[102],"consumption.":[103],"Two":[104],"well\u2010known":[109],"finding":[112],"match\u2014the":[115],"time\u2010consuming":[116],"linear":[117],"search,":[118],"storage\u2010intensive":[121],"trie":[122,127],"(digital":[123],"search":[124,142,155],"tree).":[125],"adapted":[129,166],"along":[130],"lines":[132],"PATRICIA":[135],"tree":[136],"operate":[138],"economically.":[139],"Hashing,":[140],"binary":[141],"trees,":[143],"splay":[144],"trees":[145],"Boyer\u2010Moore":[148],"algorithm":[150],"traditionally":[152],"matches,":[158],"we":[160],"show":[161],"how":[162],"these":[163],"matches.":[170],"In":[171],"addition,":[172],"two":[173],"specifically":[176],"designed":[177],"application":[180],"presented.":[182]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-10-10T00:00:00"}