Incremental query evaluation in a ring of databases

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2010, Pages 87-98

  Koch, Christoph ^a  

^a Department of Molecular Biology and Genetics   (United States)

Author keywords

algebra; incremental view maintenance

Indexed keywords

AGGREGATE QUERIES; ALGEBRAIC STRUCTURES; INCREMENTAL VIEW MAINTENANCE; NORMAL FORM; QUERY EVALUATION; QUERY OPERATORS;

ALGEBRA; CALCULATIONS; DELTA FUNCTIONS; MAINTENANCE;

DATABASE SYSTEMS;

EID: 77954696370     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807085.1807100     Document Type: Conference Paper

References (36)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. U. A. Acar, G. E. Blelloch, and R. Harper. Adaptive functional programming. ACM Trans. Program. Lang. Syst., 28(6):990-1034, 2006.
3. Y. Ahmad and C. Koch. DBToaster: A SQL compiler for high-performance delta processing in main-memory databases. PVLDB, 2(2):1566-1569, 2009.
4. D. A. M. Barrington, N. Immerman, and H. Straubing. On uniformity within NC1. J. Comput. Syst. Sci., 41(3):274-306, 1990.
5. J. A. Blakeley, P.-Å. Larson, and F. W. Tompa. Efficiently updating materialized views. In Proc. SIGMOD Conference, pages 61-71, 1986.
6. R. P. Brent. The parallel evaluation of general arithmetic expressions. J. ACM, 21:201-206, 1974.
7. P. Buneman and E. K. Clemons. Efficient monitoring relational databases. ACM Trans. Database Syst., 4(3):368-382, 1979.
8. S. Ceri and J. Widom. Deriving production rules for incremental view maintenance. In Proc. VLDB, pages 577-589, 1991.
9. L. S. Colby, T. Griffin, L. Libkin, I. S. Mumick, and H. Trickey. Algorithms for deferred view maintenance. In Proc. SIGMOD, pages 469-480, 1996.
10. A. J. Demers, T. W. Reps, and T. Teitelbaum. Incremental evaluation for attribute grammars with application to syntax-directed editors. In Proc. POPL, pages 105-116, 1981.
11. G. Dong and J. Su. Incremental and decremental evaluation of transitive closure by first-order queries. Inf. Comput., 120(1):101-106, 1995.
12. D. S. Dummit and R. M. Foote. Abstract Algebra. John Wiley & Sons, 3rd edition, 2004.
13. S. Ghandeharizadeh, R. Hull, and D. Jacobs. Heraclitus: Elevating deltas to be first-class citizens in a database programming language. ACM Transactions on Database Systems, 21(3):370-426, Sept. 1996.
14. T. J. Green, Z. Ives, and V. Tannen. Reconcilable differences. In Proc. ICDT, St. Petersburg, Russia, 2009.
15. T. J. Green, G. Karvounarakis, and V. Tannen. Provenance semirings. In Proc. PODS, pages 31-40, 2007.
16. T. Griffin and L. Libkin. Incremental maintenance of views with duplicates. In Proc. SIGMOD, 1995.
17. A. Gupta, D. Katiyar, and I. S. Mumick. Counting solutions to the view maintenance problem. In Proc. Workshop on Deductive Databases, JICSLP, 1992.
18. A. Gupta, I. S. Mumick, and V. S. Subrahmanian. Maintaining views incrementally. In Proc. SIGMOD Conference, pages 157-166, 1993.
19. L. Henkin, J. Monk, and A. Tarski. Cylindric Algebras, Part I. North-Holland, 1971.
20. 0. Theor. Comput. Sci., 296(3):473-485, 2003.
21. W. Hesse and N. Immerman. Complete problems for dynamic complexity classes. In Proc. LICS, 2002.
22. D. S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume 1, chapter 2, pages 67-161. Elsevier Science Publishers B.V., 1990.
23. Y. Kotidis and N. Roussopoulos. A case for dynamic view management. ACM Transactions on Database Systems, 26(4):388-423, 2001.
24. S. Lang. Algebra. Graduate Texts in Mathematics. Springer-Verlag, revised 3rd edition, 2002.
25. L. Libkin and L. Wong. Some properties of query languages for bags. In Proc. DBPL, pages 97-114, 1993.
26. L. Libkin and L. Wong. Incremental recomputation of recursive queries with nested sets and aggregate functions. In Proc. DBPL, pages 222-238, 1997.
27. L. Libkin and L. Wong. On the power of incremental evaluation in SQL-like languages. In Proc. DBPL, pages 17-30, 1999.
28. P. B. Miltersen, S. Subramanian, J. S. Vitter, and R. Tamassia. Complexity models for incremental computation. Theor. Comput. Sci., 130(1):203-236, 1994.
29. S. Patnaik and N. Immerman. Dyn-FO: A parallel, dynamic complexity class. J. Comput. Syst. Sci., 55(2):199-209, 1997.
30. W. Pugh and T. Teitelbaum. Incremental computation via function caching. In Proc. POPL, 1989.
31. A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In Proc. PODS, pages 105-112, 1995.
32. N. Roussopoulos. An incremental access method for viewcache: Concept, algorithms, and cost analysis. ACM Transactions on Database Systems, 16(3):535-563, 1991.
33. O. Shmueli and A. Itai. Maintenance of views. In B. Yormark, editor, Proc. SIGMOD, pages 240-255. ACM Press, 1984.
34. R. Smolenski. Algebraic methods in the theory of lower bounds for boolean circuit complexity. In Proc. STOC, pages 77-82, 1987.
35. M. Y. Vardi. The complexity of relational query languages. In Proc. STOC, pages 137-146, May 1982.
36. W. P. Yan and P.-Å. Larson. Eager aggregation and lazy aggregation. In Proc. VLDB, pages 345-357, 1995.