{"id":"https://openalex.org/W2798659310","doi":"https://doi.org/10.1145/3183713.3183758","title":"Incremental View Maintenance with Triple Lock Factorization Benefits","display_name":"Incremental View Maintenance with Triple Lock Factorization Benefits","publication_year":2018,"publication_date":"2018-05-25","ids":{"openalex":"https://openalex.org/W2798659310","doi":"https://doi.org/10.1145/3183713.3183758","mag":"2798659310"},"language":"en","primary_location":{"id":"doi:10.1145/3183713.3183758","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3183713.3183758","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 International Conference on Management of Data","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/files/75390813/Incremental_View_Maintenance_with_Triple_Lock_Factorization_Benefits.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101550827","display_name":"Milo\u0161 Nikoli\u0107","orcid":"https://orcid.org/0000-0002-1548-6803"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Milos Nikolic","raw_affiliation_strings":["University of Oxford, Oxford, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035180920","display_name":"Dan Olteanu","orcid":"https://orcid.org/0000-0002-4682-7068"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dan Olteanu","raw_affiliation_strings":["University of Oxford, Oxford, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101550827"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":5.8274,"has_fulltext":true,"cited_by_count":54,"citation_normalized_percentile":{"value":0.97424179,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"365","last_page":"380"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.982200026512146,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.767162561416626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7140934467315674},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.6197947263717651},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5740485191345215},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5686057806015015},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.5540437698364258},{"id":"https://openalex.org/keywords/lock","display_name":"Lock (firearm)","score":0.5362379550933838},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4455568790435791},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.4423205554485321},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.4119621813297272},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33940520882606506},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2974962592124939},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2899605631828308},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17180010676383972},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12298029661178589},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.10334810614585876},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09159776568412781},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0803375244140625}],"concepts":[{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.767162561416626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7140934467315674},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.6197947263717651},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5740485191345215},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5686057806015015},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.5540437698364258},{"id":"https://openalex.org/C174839445","wikidata":"https://www.wikidata.org/wiki/Q1134386","display_name":"Lock (firearm)","level":2,"score":0.5362379550933838},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4455568790435791},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.4423205554485321},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.4119621813297272},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33940520882606506},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2974962592124939},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2899605631828308},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17180010676383972},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12298029661178589},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.10334810614585876},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09159776568412781},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0803375244140625},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3183713.3183758","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3183713.3183758","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 International Conference on Management of Data","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/0d7401f6-6838-4d9a-aa8e-d00a27aebe29","is_oa":true,"landing_page_url":"https://hdl.handle.net/20.500.11820/0d7401f6-6838-4d9a-aa8e-d00a27aebe29","pdf_url":"https://www.research.ed.ac.uk/files/75390813/Incremental_View_Maintenance_with_Triple_Lock_Factorization_Benefits.pdf","source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nikolic, M & Olteanu, D 2018, Incremental View Maintenance with Triple Lock Factorization Benefits. in Proceedings of the 2018 International Conference on Management of Data. SIGMOD '18, New York, NY, USA, pp. 365-380, 2018 ACM SIGMOD/PODS International Conference on Management of Data, Houston, Texas, United States, 10/06/18. https://doi.org/10.1145/3183713.3183758","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/0d7401f6-6838-4d9a-aa8e-d00a27aebe29","is_oa":true,"landing_page_url":null,"pdf_url":"https://www.research.ed.ac.uk/en/publications/0d7401f6-6838-4d9a-aa8e-d00a27aebe29","source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"","raw_type":""},{"id":"pmh:oai:pure.ed.ac.uk:publications/0d7401f6-6838-4d9a-aa8e-d00a27aebe29","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/0d7401f6-6838-4d9a-aa8e-d00a27aebe29","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nikolic, M & Olteanu, D 2018, Incremental View Maintenance with Triple Lock Factorization Benefits. in Proceedings of the 2018 International Conference on Management of Data. SIGMOD '18, New York, NY, USA, pp. 365-380, 2018 ACM SIGMOD/PODS International Conference on Management of Data, Houston, Texas, United States, 10/06/18. https://doi.org/10.1145/3183713.3183758","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/0d7401f6-6838-4d9a-aa8e-d00a27aebe29","is_oa":true,"landing_page_url":"https://hdl.handle.net/20.500.11820/0d7401f6-6838-4d9a-aa8e-d00a27aebe29","pdf_url":"https://www.research.ed.ac.uk/files/75390813/Incremental_View_Maintenance_with_Triple_Lock_Factorization_Benefits.pdf","source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nikolic, M & Olteanu, D 2018, Incremental View Maintenance with Triple Lock Factorization Benefits. in Proceedings of the 2018 International Conference on Management of Data. SIGMOD '18, New York, NY, USA, pp. 365-380, 2018 ACM SIGMOD/PODS International Conference on Management of Data, Houston, Texas, United States, 10/06/18. https://doi.org/10.1145/3183713.3183758","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2217633705","display_name":null,"funder_award_id":"682588","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G4956428346","display_name":null,"funder_award_id":"Horizon 2020 research and innovatio","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7842005466","display_name":null,"funder_award_id":"Horizon 2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8318064016","display_name":null,"funder_award_id":"Horizon","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2798659310.pdf","grobid_xml":"https://content.openalex.org/works/W2798659310.grobid-xml"},"referenced_works_count":49,"referenced_works":["https://openalex.org/W1973761208","https://openalex.org/W2008865455","https://openalex.org/W2014830756","https://openalex.org/W2023236823","https://openalex.org/W2024165284","https://openalex.org/W2028659807","https://openalex.org/W2032775418","https://openalex.org/W2039610696","https://openalex.org/W2044849727","https://openalex.org/W2050100848","https://openalex.org/W2074489032","https://openalex.org/W2077723394","https://openalex.org/W2090850279","https://openalex.org/W2093625126","https://openalex.org/W2100444372","https://openalex.org/W2115503987","https://openalex.org/W2131975293","https://openalex.org/W2135653967","https://openalex.org/W2150137825","https://openalex.org/W2154721480","https://openalex.org/W2161956202","https://openalex.org/W2214924133","https://openalex.org/W2244876453","https://openalex.org/W2247380138","https://openalex.org/W2284514301","https://openalex.org/W2293299776","https://openalex.org/W2345156056","https://openalex.org/W2469230926","https://openalex.org/W2481882994","https://openalex.org/W2535724050","https://openalex.org/W2536131596","https://openalex.org/W2548341626","https://openalex.org/W2548695101","https://openalex.org/W2563724055","https://openalex.org/W2592257482","https://openalex.org/W2604519798","https://openalex.org/W2612139288","https://openalex.org/W2612777267","https://openalex.org/W2613597870","https://openalex.org/W2613621736","https://openalex.org/W2798659310","https://openalex.org/W2913201029","https://openalex.org/W2963288913","https://openalex.org/W2963560792","https://openalex.org/W3098547670","https://openalex.org/W4246219036","https://openalex.org/W4292022450","https://openalex.org/W6691134134","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W3099313426","https://openalex.org/W4287593139","https://openalex.org/W752783541","https://openalex.org/W1506547947","https://openalex.org/W4206811032","https://openalex.org/W2995605830","https://openalex.org/W4239424132","https://openalex.org/W2596457687","https://openalex.org/W3212757063","https://openalex.org/W2086123442"],"abstract_inverted_index":{"We":[0,120],"introduce":[1],"F-IVM,":[2],"a":[3,11,35,51,76,123],"unified":[4],"incremental":[5],"view":[6],"maintenance":[7,42,49],"(IVM)":[8],"approach":[9],"for":[10,18,88],"variety":[12],"of":[13,31,43,50,53,66,107,118,125,144],"tasks,":[14,90],"including":[15],"gradient":[16],"computation":[17,81,92,106],"learning":[19],"linear":[20],"regression":[21],"models":[22],"over":[23,82,93],"joins,":[24],"matrix":[25],"chain":[26],"multiplication,":[27],"and":[28,111,139],"factorized":[29],"evaluation":[30],"conjunctive":[32],"queries.<br/><br/>F-IVM":[33],"is":[34,85],"higher-order":[36,137],"IVM":[37],"algorithm":[38],"that":[39,127],"reduces":[40],"the":[41,44,48,80,83,86,91,94,98,105,108],"given":[45],"task":[46],"to":[47,70],"hierarchy":[52],"increasingly":[54],"simpler":[55],"views.":[56],"The":[57],"views":[58],"are":[59,64,73],"functions":[60],"mapping":[61],"keys,":[62,109],"which":[63,72],"tuples":[65],"input":[67],"data":[68],"values,":[69],"payloads,":[71,110],"elements":[74],"from":[75],"task-specific":[77],"ring.":[78],"Whereas":[79],"keys":[84],"same":[87],"all":[89],"payloads":[95],"depends":[96],"on":[97],"task.":[99],"F-IVM":[100,114],"achieves":[101],"efficiency":[102],"by":[103,142],"factorizing":[104],"updates.<br/><br/>We":[112],"implemented":[113],"as":[115],"an":[116],"extension":[117],"DBToaster.":[119],"show":[121],"in":[122],"range":[124],"scenarios":[126],"it":[128],"can":[129],"outperform":[130],"classical":[131],"first-order":[132],"IVM,":[133,138],"DBToaster's":[134],"fully":[135],"recursive":[136],"plain":[140],"recomputation":[141],"orders":[143],"magnitude":[145],"while":[146],"using":[147],"less":[148],"memory.":[149]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":4}],"updated_date":"2026-04-20T07:46:08.049788","created_date":"2025-10-10T00:00:00"}