{"id":"https://openalex.org/W1484535615","doi":null,"title":"Efficient algorithms for selecting efficient data storage structures","display_name":"Efficient algorithms for selecting efficient data storage structures","publication_year":1980,"publication_date":"1980-01-01","ids":{"openalex":"https://openalex.org/W1484535615","mag":"1484535615"},"language":"en","primary_location":{"id":"mag:1484535615","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=909291","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","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/A5056791292","display_name":"Raul Javier Ramirez Inurrigarro","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Raul Javier Ramirez Inurrigarro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5056791292"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1159,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.82296651,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.8281000256538391,"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":0.8281000256538391,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.11079999804496765,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.023499999195337296,"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/dynamic-programming","display_name":"dynamic programming","score":0.7239999771118164},{"id":"https://openalex.org/keywords/conversion-costs","display_name":"conversion costs","score":0.7850000262260437},{"id":"https://openalex.org/keywords/pseudo-polynomial-time-algorithm","display_name":"pseudo-polynomial time algorithm","score":0.8960000276565552}],"concepts":[{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6535977125167847},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6356545686721802},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5766195058822632},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5560163259506226},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5396729707717896},{"id":"https://openalex.org/C138958017","wikidata":"https://www.wikidata.org/wiki/Q190087","display_name":"Data type","level":2,"score":0.5275965332984924},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5153619647026062},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.48209503293037415},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11948287487030029},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:1484535615","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=909291","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"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":0,"referenced_works":[],"related_works":["https://openalex.org/W2398602989","https://openalex.org/W849392782","https://openalex.org/W1965103502","https://openalex.org/W2483055406","https://openalex.org/W2090754307","https://openalex.org/W2471531802","https://openalex.org/W1966176558","https://openalex.org/W2065341084","https://openalex.org/W801237415","https://openalex.org/W2503108951"],"abstract_inverted_index":{"The":[0,166,296],"representations":[1,20,152],"used":[2],"to":[3,32,58,160,169,197,219,273,299,323,373],"implement":[4],"an":[5,10,64,245,311],"application's":[6,138],"data":[7,75,130,155,175,237,317,349,388],"structures":[8,52],"play":[9],"important":[11],"role":[12],"in":[13,157,162,306,366,384,392],"determining":[14],"its":[15,307],"execution":[16],"cost.":[17],"Since":[18],"suitable":[19],"may":[21],"be":[22,100],"selected":[23],"from":[24,149],"a":[25,60,71,89,103,154,171,186,198,334,348],"very":[26],"large":[27],"class,":[28],"it":[29,270],"is":[30,57,68,168,202,217,256,271,303,337],"necessary":[31,218],"search":[33],"for":[34,47,63,78,94,128,153,173,235,281,347,359,412,419],"the":[35,80,117,137,145,150,163,188,192,221,225,231,259,263,275,288,292,325,328,331,341,356,360,374,385,393,398,404,417],"efficient":[36,49,233,261,277],"ones":[37],"systematically.":[38],"In":[39],"this":[40,97,207,282,301],"thesis,":[41],"algorithms":[42,228,357,399],"based":[43],"on":[44,403],"dynamic":[45],"programming":[46],"selecting":[48],"composite":[50],"storage":[51,61,122,335],"are":[53,84,210,240,377,382],"presented.\r\nThe":[54],"general":[55,208,375],"problem":[56,209,302,376],"design":[59],"structure":[62,336,350],"application":[65,193,312,329],"whose":[66],"behaviour":[67,223],"characterized":[69],"by":[70,102,125],"set":[72,247,278,290,343],"of":[73,91,105,136,147,191,206,224,248,266,279,314,327,333,344,362,387,395,397,407],"(abstract)":[74],"type":[76,131,156,176,238,318,389],"occurrences":[77,390],"which":[79,320],"relative":[81,264],"operation":[82],"frequencies":[83],"known,":[85],"time-dependent":[86],"functions.":[87],"Given":[88],"library":[90],"possible":[92],"implementations":[93,234,249],"each":[95,126,174,179,236,413],"occurrence,":[96,319],"information":[98],"can":[99],"represented":[101],"collection":[104],"evaluation":[106,114,215],"and":[107,121,242,253,291,355,415],"conversion":[108,141,294],"cost":[109,142,190,200,422],"matrices":[110],"as":[111,185],"follows.":[112],"An":[113],"matrix":[115,143,216],"reflects":[116],"expected":[118],"run":[119,365],"time":[120,408],"space":[123,410],"required":[124],"representation":[127,172],"every":[129],"occurrence":[132,177,239],"at":[133,178],"one":[134,158,214,316],"phase":[135,159,284],"lifetime.":[139],"A":[140],"represents":[144],"costs":[146],"converting":[148],"potential":[151],"any":[161],"next":[164],"phase.":[165],"goal":[167],"select":[170,230],"phase,":[180,414],"such":[181],"that":[182,229,254,351],"when":[183],"considered":[184],"whole,":[187],"total":[189,405],"(including":[194],"conversions)":[195],"according":[196],"given":[199],"formula":[201],"minimized.\r\nSeveral":[203],"special":[204],"cases":[205],"examined.":[211],"When":[212,244],"only":[213,315],"characterize":[220],"complete":[222],"application,":[226],"pseudo-polynomial":[227,305],"most":[232,260,276],"presented":[241,298,358,400],"discussed.":[243],"initial":[246,289],"has":[250,268],"been":[251],"adopted":[252],"selection":[255,332],"no":[257],"longer":[258],"because":[262],"frequency":[265],"operations":[267],"changed,":[269],"desirable":[272],"find":[274],"assignments":[280],"new":[283],"taking":[285],"into":[286],"account":[287],"associated":[293],"costs.":[295],"algorithm":[297],"solve":[300,416],"also":[304],"running":[308,380],"time.":[309,369],"If":[310],"consists":[313],"must":[321],"adapt":[322],"all":[324],"phases":[326],"lifetime,":[330],"identified":[338],"with":[339,353],"finding":[340],"optimal":[342],"reorganization":[345],"points":[346],"deteriorates":[352],"time,":[354],"solution":[361],"these":[363],"problems":[364,418],"strictly":[367],"polynomial":[368],"Finally":[370],"some":[371],"solutions":[372],"described;":[378],"their":[379],"times":[381],"exponential":[383],"number":[386,394],"or":[391],"phases.\r\nAll":[396],"incorporate":[401],"bounds":[402],"amount":[406],"and/or":[409],"available":[411],"arbitrary,":[420],"monotonic":[421],"formulas.":[423]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}