Synthesizing view definitions from data

ACM International Conference Proceeding Series

Volumn , Issue , 2010, Pages 89-103

  Das Sarma, Anish ^a   Parameswaran, Aditya ^b   Garcia Molina, Hector ^b   Widom, Jennifer ^b  

^a YAHOO RESEARCH   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

algorithms; complexity; query synthesis; view definitions

Indexed keywords

ALGORITHMS AND COMPLEXITY; ALGORITHMS COMPLEXITY;

DATABASE SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 77954469726     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1804669.1804683     Document Type: Conference Paper

References (18)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. pages 487-499, 1994.
2. Philip A. Bernstein. Applying model management to classical meta data problems. In CIDR, 2003.
3. P. Bohannon, E. Elnahrawy, W. Fan, and M. Flaster. Putting context into schema matching. In VLDB '06.
4. Robert King Brayton, Alberto L. Sangiovanni-Vincentelli, Curtis T. McMullen, and Gary D. Hachtel. Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, 1984.
5. R. Carr, S. Doddi, G. Konjevod, and M. Marathe. On the red-blue set cover problem. In SODA '00, pages 345-353.
6. H. G-Molina, J. Widom, and J. D. Ullman. Database Systems: The Complete Book. Prentice-Hall, 2002.
7. A. Gupta and I. S. Mumick. Maintenance of materialized views: Problems, techniques, and applications. IEEE Data Engineering Bulletin, 18(2), 1995.
8. L. Haas. The theory and practice of information integration. In Proc. of ICDT, 2007.
9. A. Y. Halevy. Answering queries using views: A survey. VLDB Journal, 4, 2000.
10. E. J. McCluskey. Minimization of boolean functions. The Bell System Technical Journal, 1956.
11. P. Miettinen. On the positive-negative partial set cover problem. Inf. Process. Lett., 108(4):219-221, 2008.
12. T. M. Mitchell. Machine Learning. McGraw-Hill, 1997.
13. Pierre Senellart and Georg Gottlob. On the complexity of deriving schema mappings from database instances. In Proc. PODS, pages 23-32, Vancouver, Canada, June 2008.
14. P. N. Tan, M. Steinbach, and V. Kumar. Introduction to Data Mining. Addison-Wesley, 2006.
15. Q. T. Tran, C. Y. Chan, and S. Parthasarathy. Query by output. In Proc. of ACM SIGMOD, 2009.
16. C. Umans, T. Villa, and A. L. Sangiovanni-Vincentelli. Complexity of two-level logic minimization. IEEE Trans. on CAD of Integrated Circuits and Systems, 25(7):1230-1246, 2006.
17. Moshe Y. Vardi. The complexity of relational query languages (extended abstract). In STOC '82.
18. V. V. Vazirani. Approximation Algorithms. Springer-Verlag, 2001.