乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T00:31:43Z","timestamp":1717115503607},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"7","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2024,3]]},"abstract":"Covers for a set of functional dependencies (FDs) are fundamental for many areas of data management, such as integrity maintenance, query optimization, database design, and data cleaning. When declaring integrity constraints, keys enjoy native support in database systems while FDs need to be enforced by triggers or at application level. Consequently, maximizing the use of keys will provide the best support. We propose the new notion of mixed cover for a set of FDs, comprising the set of minimal keys together with a cover for the set of non-key FDs implied by the FD set. We establish sequential and parallel algorithms for computing mixed covers from a given set of FDs, and illustrate that they complement each other in terms of their performance. Even though FD covers are typically smaller in number or size than their corresponding mixed cover, the latter generate orders of magnitude lower overheads during integrity maintenance. We also quantify how mixed covers improve the performance of query, refresh and insert operations on the TPC-H benchmark under different constraint workloads.<\/jats:p>","DOI":"10.14778\/3654621.3654626","type":"journal-article","created":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T22:21:08Z","timestamp":1717107668000},"page":"1578-1590","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Mixed Covers of Keys and Functional Dependencies for Maintaining the Integrity of Data under Updates"],"prefix":"10.14778","volume":"17","author":[{"given":"Zhuoxing","family":"Zhang","sequence":"first","affiliation":[{"name":"The University of Auckland, Auckland, New Zealand"}]},{"given":"Sebastian","family":"Link","sequence":"additional","affiliation":[{"name":"The University of Auckland, Auckland, New Zealand"}]}],"member":"320","published-online":{"date-parts":[[2024,5,30]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Data Profiling","author":"Abedjan Ziawasch","unstructured":"Ziawasch Abedjan, Lukasz Golab, Felix Naumann, and Thorsten Papenbrock. 2018. Data Profiling. Morgan & Claypool Publishers."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/320083.320091"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80022-5"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/320064.320066"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/3204028.3204032"},{"key":"e_1_2_1_6_1","volume-title":"Bernstein","author":"Biskup Joachim","year":"1979","unstructured":"Joachim Biskup, Umeshwar Dayal, and Philip A. Bernstein. 1979. Synthesizing Independent Database Schemas. In SIGMOD. 143--151."},{"key":"e_1_2_1_7_1","volume-title":"California RJ909","author":"Codd E. F.","year":"1971","unstructured":"E. F. Codd. 1971. Further Normalization of the Data Base Relational Model. Research Report \/ RJ \/ IBM \/ San Jose, California RJ909 (1971)."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 6th IFIP Congress 1974","author":"Codd E. F.","year":"1974","unstructured":"E. F. Codd. 1974. Recent Investigations in Relational Data Base Systems. In Information Processing, Proceedings of the 6th IFIP Congress 1974, Stockholm, Sweden, August 5--10, 1974. 1017--1021."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2977797.2977802"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0476-3"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/319587.319592"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1366102.1366103"},{"key":"e_1_2_1_13_1","unstructured":"Wenfei Fan Yinghui Wu and Jingbo Xu. 2016. Functional Dependencies for Graphs. In SIGMOD. 1843--1857."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364332"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2188349.2188355"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICAS.2008.11"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00676-3"},{"key":"e_1_2_1_18_1","volume-title":"Oracle, SQL Server, et al","author":"Lahdenm\u00e4ki Tapio","unstructured":"Tapio Lahdenm\u00e4ki and Michael Leach. 2005. Relational Database Index Design and the Optimizers: DB2, Oracle, SQL Server, et al. Wiley. 1--310 pages."},{"key":"e_1_2_1_19_1","volume-title":"A guided tour of relational databases and beyond","author":"Levene Mark","unstructured":"Mark Levene and George Loizou. 2012. A guided tour of relational databases and beyond. Springer Science & Business Media."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3459238"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3583140.3583141"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90009-0"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322223"},{"key":"e_1_2_1_24_1","volume-title":"The Theory of Relational Databases","author":"Maier David","unstructured":"David Maier. 1983. The Theory of Relational Databases. Computer Science Press."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90082-6"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794377"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915203"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368293"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574254"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-015-0247-9"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377377"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342638"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3611479.3611506"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067422"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450518"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2023.102224"},{"key":"e_1_2_1_37_1","unstructured":"Cong Yu and H. V. Jagadish. 2006. Efficient Discovery of XML Data Redundancies. In VLDB. 103--114."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90080-1"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588693"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3654621.3654626","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T22:26:45Z","timestamp":1717108005000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3654621.3654626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":39,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["10.14778\/3654621.3654626"],"URL":"https:\/\/doi.org\/10.14778\/3654621.3654626","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2024,3]]},"assertion":[{"value":"2024-05-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}