{"id":"https://openalex.org/W1987413769","doi":"https://doi.org/10.1145/2661829.2661864","title":"Efficient Static and Dynamic In-Database Tensor Decompositions on Chunk-Based Array Stores","display_name":"Efficient Static and Dynamic In-Database Tensor Decompositions on Chunk-Based Array Stores","publication_year":2014,"publication_date":"2014-11-03","ids":{"openalex":"https://openalex.org/W1987413769","doi":"https://doi.org/10.1145/2661829.2661864","mag":"1987413769"},"language":"en","primary_location":{"id":"doi:10.1145/2661829.2661864","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2661829.2661864","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management","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/A5100770931","display_name":"Mijung Kim","orcid":"https://orcid.org/0000-0003-3995-5384"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mijung Kim","raw_affiliation_strings":["Arizona State University, Tempe, AZ, USA","Arizona State University , Tempe , AZ , USA"],"affiliations":[{"raw_affiliation_string":"Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Arizona State University , Tempe , AZ , USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003070145","display_name":"K. Sel\u00e7uk Candan","orcid":"https://orcid.org/0000-0003-4977-6646"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Sel\u00e7uk Candan","raw_affiliation_strings":["Arizona State University, Tempe, AZ, USA","Arizona State University , Tempe , AZ , USA"],"affiliations":[{"raw_affiliation_string":"Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Arizona State University , Tempe , AZ , USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100770931"],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":1.8389,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.84477559,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"969","last_page":"978"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9990000128746033,"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/T12303","display_name":"Tensor decomposition and applications","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9890000224113464,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8047281503677368},{"id":"https://openalex.org/keywords/tensor","display_name":"Tensor (intrinsic definition)","score":0.7257040143013},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7039031982421875},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5836156606674194},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.48133906722068787},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.4809543490409851},{"id":"https://openalex.org/keywords/tensor-decomposition","display_name":"Tensor decomposition","score":0.46976611018180847},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4551047086715698},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4511522352695465},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4420399069786072},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34489214420318604},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.32678231596946716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1379053294658661}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8047281503677368},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.7257040143013},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7039031982421875},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5836156606674194},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.48133906722068787},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.4809543490409851},{"id":"https://openalex.org/C2986737658","wikidata":"https://www.wikidata.org/wiki/Q30103009","display_name":"Tensor decomposition","level":3,"score":0.46976611018180847},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4551047086715698},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4511522352695465},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4420399069786072},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34489214420318604},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.32678231596946716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1379053294658661},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2661829.2661864","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2661829.2661864","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1963127755","display_name":null,"funder_award_id":"1016921","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8130494171","display_name":null,"funder_award_id":"116394","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W49160414","https://openalex.org/W111803032","https://openalex.org/W398759745","https://openalex.org/W770535834","https://openalex.org/W1493892051","https://openalex.org/W1963826206","https://openalex.org/W1977142133","https://openalex.org/W1993589664","https://openalex.org/W2000215628","https://openalex.org/W2001982883","https://openalex.org/W2005741518","https://openalex.org/W2024165284","https://openalex.org/W2028778237","https://openalex.org/W2048531216","https://openalex.org/W2063385922","https://openalex.org/W2083036673","https://openalex.org/W2086524348","https://openalex.org/W2096544401","https://openalex.org/W2102182691","https://openalex.org/W2103392911","https://openalex.org/W2105818667","https://openalex.org/W2110121428","https://openalex.org/W2119511382","https://openalex.org/W2121739212","https://openalex.org/W2132896093","https://openalex.org/W2146635036","https://openalex.org/W2155125497","https://openalex.org/W2962732538","https://openalex.org/W4235167418"],"related_works":["https://openalex.org/W4379256054","https://openalex.org/W2093953080","https://openalex.org/W47805180","https://openalex.org/W2963838862","https://openalex.org/W3015641590","https://openalex.org/W3216281372","https://openalex.org/W3213449325","https://openalex.org/W2949531434","https://openalex.org/W4286927328","https://openalex.org/W3155683369"],"abstract_inverted_index":{"As":[0],"the":[1,57,61,109,116,124,138,150,157,162],"relevant":[2],"data":[3,42,86,95,143,167],"sets":[4,144],"get":[5],"large,":[6],"existing":[7],"in-memory":[8],"schemes":[9],"for":[10,32],"tensor":[11,37,50,70,111,133,142],"decomposition":[12,51,112,134],"become":[13],"increasingly":[14],"ineffective":[15],"and,":[16],"instead,":[17],"memory-independent":[18],"solutions,":[19],"such":[20],"as":[21],"in-database":[22,36,49,132],"analytics,":[23],"are":[24],"necessitated.":[25],"In":[26],"this":[27,121,165],"paper,":[28],"we":[29,73,90],"present":[30],"techniques":[31,103,159],"efficient":[33,129],"implementations":[34],"of":[35,118,164],"decompositions":[38],"on":[39,83,141],"chunk-based":[40,85],"array":[41],"stores.":[43],"The":[44],"proposed":[45,139,158],"static":[46],"and":[47,53,68,97,130,153],"incremental":[48,110],"operators":[52],"their":[54],"optimizations":[55],"address":[56],"constraints":[58],"imposed":[59],"by":[60],"main":[62],"memory":[63,152],"limitations":[64],"when":[65],"handling":[66],"large":[67],"high-order":[69],"data.":[71],"Firstly,":[72],"discuss":[74],"how":[75],"to":[76,127],"implement":[77],"alternating":[78],"least":[79],"squares":[80],"operations":[81],"efficiently":[82],"a":[84],"storage":[87],"system.":[88],"Secondly,":[89],"consider":[91],"scenarios":[92],"with":[93],"frequent":[94],"updates":[96],"show":[98,155],"that":[99,145,156],"compressed":[100],"matrix":[101],"multiplication":[102],"can":[104],"be":[105],"effective":[106],"in":[107],"reducing":[108],"maintenance":[113],"costs.":[114],"To":[115],"best":[117],"our":[119],"knowledge,":[120],"paper":[122],"presents":[123],"first":[125],"attempt":[126],"develop":[128],"optimized":[131],"operations.":[135],"We":[136],"evaluate":[137],"algorithms":[140],"do":[146],"not":[147],"fit":[148],"into":[149],"available":[151],"results":[154],"significantly":[160],"improve":[161],"scalability":[163],"core":[166],"analysis.":[168]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}