Fetching the paper…
Reading the bibliography…
Acyclic schemes posses known benefits for database design, speeding up queries, and reducing space requirements.
Exponential bounds for the hypergeometric distribution
Evan Greene and Jon A Wellner. 2017 · 1911
Earlier work this paper cites.
Further Normalization of the Data Base Relational Model
E. F. Codd. 1971 · 1971
Earlier work this paper cites.
Probability inequalities for the sum in sampling without replacement
Robert J Serfling. 1974 · 1974
Earlier work this paper cites.
Recent Investigations in Relational Data Base Systems. In ACM Pacific . ACM, 15–20
E. F. Codd. 1975 · 1975
Earlier work this paper cites.
Multivalued Dependencies and a New Normal Form for Relational Databases
Ronald Fagin. 1977 · 1977
Earlier work this paper cites.
Normal Forms and Relational Database Operators. In Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data (Boston, Massachusetts) (SIGMOD ’79) . Association for Computing Machinery, New York, NY, USA, 153–160
Ronald Fagin. 1979 · 1979
Earlier work this paper cites.
Properties of Acyclic Database Schemes. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing, May 11-13, 1981, Milwaukee, Wisconsin, USA . 355–362
Catriel Beeri, Ronald Fagin, David Maier, Alberto O. Mendelzon, Jeffrey D. Ullman, and Mihalis Yannakakis. 1981 · 1981
Earlier work this paper cites.
Mihalis Yannakakis. 1981 · 1981
Earlier work this paper cites.
On the Desirability of Acyclic Database Schemes
Catriel Beeri, Ronald Fagin, David Maier, and Mihalis Yannakakis. 1983 · 1983
Earlier work this paper cites.
An Information-Theoretic Analysis of Relational Databases - Part I: Data Dependencies and Information Metric
Tony T. Lee. 1987a · 1987
Cited alongside, same era.
An Information-Theoretic Analysis of Relational Databases - Part II: Information Structures of Database Schemas
Tony T. Lee. 1987b · 1987
Cited alongside, same era.
On modified logarithmic Sobolev inequalities for Bernoulli and Poisson measures
Sergey G Bobkov and Michel Ledoux. 1998 · 1998
Cited alongside, same era.
Why is the snowflake schema a good data warehouse design?
Mark Levene and George Loizou. 2003 · 2003
Cited alongside, same era.
Elements of Information Theory
T. M. Cover and J. A. Thomas. 2006 · 2006
Cited alongside, same era.
Measure concentration for compound Poisson distributions
Ioannis Kontoyiannis and Mokshay Madiman. 2006 · 2006
Factorised representations of query results: size bounds and readability. In ICDT . ACM, 285–298
Dan Olteanu and Jakub Zavodny. 2012 · 2012
Later among the works it cites.
Concentration inequalities: A nonasymptotic theory of independence
Stéphane Boucheron, Gábor Lugosi, and Pascal Massart. 2013 · 2013
Later among the works it cites.
Learning Linear Regression Models over Factorized Joins. In Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference 2016, San Francisco, CA, USA, June 26 - July 01, 2016 . 3–18
Maximilian Schleich, Dan Olteanu, and Radu Ciucanu. 2016 · 2016
Later among the works it cites.
Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis
M. Mitzenmacher and E. Upfal. 2017 · 2017
Later among the works it cites.
AC/DC: In-Database Learning Thunderstruck. In Proceedings of the Second Workshop on Data Management for End-To-End Machine Learning, DEEM@SIGMOD 2018, Houston, TX, USA, June 15, 2018 . 8:1–8:10
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Repair checking in inconsistent databases: algorithms and complexity. In Database Theory - ICDT 2009, 12th International Conference, St. Petersburg, Russia, March 23-25, 2009, Proceedings . 31–41
Foto N. Afrati and Phokion G. Kolaitis. 2009 · 2009
Cited alongside, same era.
Database Repairing and Consistent Query Answering
Leopoldo E. Bertossi. 2011 · 2011
Cited alongside, same era.
A Normal Form for Preventing Redundant Tuples in Relational Databases. In Proceedings of the 15th International Conference on Database Theory (Berlin, Germany) (ICDT ’12) . Association for Computing Machinery, New York, NY, USA, 114–126
Hugh Darwen, C. J. Date, and Ronald Fagin. 2012 · 2012
Cited alongside, same era.
Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, and Maximilian Schleich. 2018 · 2018
Later among the works it cites.
A Layered Aggregate Engine for Analytics Workloads. In Proceedings of the 2019 International Conference on Management of Data, SIGMOD Conference 2019, Amsterdam, The Netherlands, June 30 - July 5, 2019. 1642–1659
Maximilian Schleich, Dan Olteanu, Mahmoud Abo Khamis, Hung Q. Ngo, and XuanLong Nguyen. 2019 · 2019
Later among the works it cites.
Mining Approximate Acyclic Schemes from Relations. In Proceedings of the 2020 International Conference on Management of Data, SIGMOD Conference 2020, online conference [Portland, OR, USA], June 14-19, 2020 , David Maier, Rachel Pottinger, AnHai Doan, Wang-Chiew Tan, Abdussalam Alawini, and Hung Q. Ngo (Eds.). ACM, 297–312
Batya Kenig, Pranay Mundra, Guna Prasaad, Babak Salimi, and Dan Suciu. 2020 · 2020
Later among the works it cites.
Quantifying the Loss of Acyclic Join Dependencies
Batya Kenig and Nir Weinberger. 2022 · 2022
Closest in time.