Synthesizing view definitions from data
暂无分享,去创建一个
Jennifer Widom | Aditya G. Parameswaran | Hector Garcia-Molina | Anish Das Sarma | H. Garcia-Molina | J. Widom | A. Sarma
[1] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[2] Rakesh Agarwal,et al. Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.
[3] Inderpal Singh Mumick,et al. Maintenance of Materialized Views: Problems, Techniques, and Applications , 1999, IEEE Data Eng. Bull..
[4] Thomas G. Dietterich. What is machine learning? , 2020, Archives of Disease in Childhood.
[5] Philip A. Bernstein,et al. Applying Model Management to Classical Meta Data Problems , 2003, CIDR.
[6] Vipin Kumar,et al. Introduction to Data Mining, (First Edition) , 2005 .
[7] Jennifer Widom,et al. Database Systems: The Complete Book , 2001 .
[8] Tiziano Villa,et al. Complexity of two-level logic minimization , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[9] Georg Gottlob,et al. On the complexity of deriving schema mappings from database instances , 2008, PODS.
[10] Srinivasan Parthasarathy,et al. Query by output , 2009, SIGMOD Conference.
[11] Alon Y. Halevy,et al. Answering queries using views: A survey , 2001, The VLDB Journal.
[12] Pauli Miettinen,et al. On the Positive-Negative Partial Set Cover problem , 2008, Inf. Process. Lett..
[13] E. McCluskey. Minimization of Boolean functions , 1956 .
[14] Robert K. Brayton,et al. Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.
[15] Robert D. Carr,et al. On the red-blue set cover problem , 2000, SODA '00.
[16] Moshe Y. Vardi. The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.
[17] Laura M. Haas,et al. Beauty and the Beast: The Theory and Practice of Information Integration , 2007, ICDT.
[18] Wenfei Fan,et al. Putting context into schema matching , 2006, VLDB.