{"id":"https://openalex.org/W2062925883","doi":"https://doi.org/10.1142/s0129054106004406","title":"BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC","display_name":"BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC","publication_year":2006,"publication_date":"2006-12-01","ids":{"openalex":"https://openalex.org/W2062925883","doi":"https://doi.org/10.1142/s0129054106004406","mag":"2062925883"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054106004406","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054106004406","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5070478804","display_name":"Sergio De Agostino","orcid":"https://orcid.org/0000-0002-1379-8010"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"SERGIO DE AGOSTINO","raw_affiliation_strings":["Computer Science Department, La Sapienza University, Via Salaria 113, Rome, 00198, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, La Sapienza University, Via Salaria 113, Rome, 00198, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070478804"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.10862909,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"17","issue":"06","first_page":"1273","last_page":"1280"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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":0.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9886000156402588,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9557999968528748,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7633287310600281},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6702376008033752},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.6163221597671509},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6143634915351868},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5975732207298279},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5445359945297241},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48505014181137085},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.48437437415122986},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4777771234512329},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4346558153629303},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3190627694129944},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2899949550628662},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1308116912841797}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7633287310600281},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6702376008033752},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.6163221597671509},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6143634915351868},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5975732207298279},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5445359945297241},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48505014181137085},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.48437437415122986},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4777771234512329},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4346558153629303},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3190627694129944},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2899949550628662},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1308116912841797},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054106004406","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054106004406","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/48758","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/48758","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"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":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W187383659","https://openalex.org/W202077749","https://openalex.org/W1547966682","https://openalex.org/W2071779672","https://openalex.org/W2122962290"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W3143937874","https://openalex.org/W2007032764","https://openalex.org/W2513360157","https://openalex.org/W2067280619","https://openalex.org/W4251343851","https://openalex.org/W2149442301"],"abstract_inverted_index":{"The":[0,33],"unbounded":[1],"version":[2,61],"of":[3,58,63],"the":[4,31,41,46,55,64,69,78,87,91],"Lempel-Ziv":[5],"dynamic":[6],"dictionary":[7,70],"compression":[8,43,56],"method":[9],"is":[10,14,27,106,114],"P-complete.":[11],"Therefore,":[12],"it":[13,18],"unlikely":[15],"to":[16,29,85,98,110,117,123],"implement":[17,118],"with":[19],"sublinear":[20],"work":[21],"space":[22,126],"unless":[23],"a":[24,59],"deletion":[25,48],"heuristic":[26,95],"applied":[28],"bound":[30],"dictionary.":[32],"well-known":[34],"LRU":[35,65,92,103,120],"(least":[36],"recently":[37],"used)":[38],"strategy":[39],"provides":[40],"best":[42],"performance":[44],"among":[45],"existent":[47],"heuristics.":[49],"We":[50],"show":[51],"experimental":[52],"results":[53],"on":[54],"effectiveness":[57],"relaxed":[60],"(RLRUp)":[62],"heuristic.":[66],"RLRUp":[67],"partitions":[68],"in":[71,80,121],"p":[72,105],"equivalence":[73],"classes,":[74],"so":[75],"that":[76],"all":[77],"elements":[79],"each":[81],"class":[82],"are":[83],"considered":[84],"have":[86],"same":[88],"\"age\"":[89],"for":[90],"strategy.":[93],"Such":[94],"turns":[96],"out":[97],"be":[99,124],"as":[100,102],"good":[101],"when":[104],"greater":[107],"or":[108],"equal":[109],"2":[111],"(RLRU2).":[112],"RLRU2":[113],"slightly":[115],"easier":[116],"than":[119],"addition":[122],"more":[125],"efficient.":[127]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}