메뉴 건너뛰기




Volumn , Issue , 2010, Pages 87-98

Incremental query evaluation in a ring of databases

Author keywords

algebra; incremental view maintenance

Indexed keywords

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

EID: 77954696370     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807085.1807100     Document Type: Conference Paper
Times cited : (90)

References (36)
  • 3
    • 77954737780 scopus 로고    scopus 로고
    • DBToaster: A SQL compiler for high-performance delta processing in main-memory databases
    • Y. Ahmad and C. Koch. DBToaster: A SQL compiler for high-performance delta processing in main-memory databases. PVLDB, 2(2):1566-1569, 2009.
    • (2009) PVLDB , vol.2 , Issue.2 , pp. 1566-1569
    • Ahmad, Y.1    Koch, C.2
  • 6
    • 0016046965 scopus 로고
    • The parallel evaluation of general arithmetic expressions
    • R. P. Brent. The parallel evaluation of general arithmetic expressions. J. ACM, 21:201-206, 1974.
    • (1974) J. ACM , vol.21 , pp. 201-206
    • Brent, R.P.1
  • 7
    • 0018515483 scopus 로고
    • Efficient monitoring relational databases
    • P. Buneman and E. K. Clemons. Efficient monitoring relational databases. ACM Trans. Database Syst., 4(3):368-382, 1979.
    • (1979) ACM Trans. Database Syst. , vol.4 , Issue.3 , pp. 368-382
    • Buneman, P.1    Clemons, E.K.2
  • 8
    • 0003134527 scopus 로고
    • Deriving production rules for incremental view maintenance
    • S. Ceri and J. Widom. Deriving production rules for incremental view maintenance. In Proc. VLDB, pages 577-589, 1991.
    • (1991) Proc. VLDB , pp. 577-589
    • Ceri, S.1    Widom, J.2
  • 10
    • 85050860095 scopus 로고
    • Incremental evaluation for attribute grammars with application to syntax-directed editors
    • 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.
    • (1981) Proc. POPL , pp. 105-116
    • Demers, A.J.1    Reps, T.W.2    Teitelbaum, T.3
  • 11
    • 0001420860 scopus 로고
    • Incremental and decremental evaluation of transitive closure by first-order queries
    • G. Dong and J. Su. Incremental and decremental evaluation of transitive closure by first-order queries. Inf. Comput., 120(1):101-106, 1995.
    • (1995) Inf. Comput. , vol.120 , Issue.1 , pp. 101-106
    • Dong, G.1    Su, J.2
  • 13
    • 0030246818 scopus 로고    scopus 로고
    • Heraclitus: Elevating deltas to be first-class citizens in a database programming language
    • Sept.
    • 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.
    • (1996) ACM Transactions on Database Systems , vol.21 , Issue.3 , pp. 370-426
    • Ghandeharizadeh, S.1    Hull, R.2    Jacobs, D.3
  • 16
    • 84976783749 scopus 로고    scopus 로고
    • Incremental maintenance of views with duplicates
    • T. Griffin and L. Libkin. Incremental maintenance of views with duplicates. In Proc. SIGMOD, 1995.
    • Proc. SIGMOD, 1995
    • Griffin, T.1    Libkin, L.2
  • 21
    • 0036054156 scopus 로고    scopus 로고
    • Complete problems for dynamic complexity classes
    • W. Hesse and N. Immerman. Complete problems for dynamic complexity classes. In Proc. LICS, 2002.
    • Proc. LICS, 2002
    • Hesse, W.1    Immerman, N.2
  • 22
    • 0001951331 scopus 로고
    • A catalog of complexity classes
    • J. van Leeuwen, editor, chapter 2, Elsevier Science Publishers B.V.
    • 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.
    • (1990) Handbook of Theoretical Computer Science , vol.1 , pp. 67-161
    • Johnson, D.S.1
  • 25
    • 0346740701 scopus 로고
    • Some properties of query languages for bags
    • L. Libkin and L. Wong. Some properties of query languages for bags. In Proc. DBPL, pages 97-114, 1993.
    • (1993) Proc. DBPL , pp. 97-114
    • Libkin, L.1    Wong, L.2
  • 26
    • 0012694855 scopus 로고    scopus 로고
    • Incremental recomputation of recursive queries with nested sets and aggregate functions
    • L. Libkin and L. Wong. Incremental recomputation of recursive queries with nested sets and aggregate functions. In Proc. DBPL, pages 222-238, 1997.
    • (1997) Proc. DBPL , pp. 222-238
    • Libkin, L.1    Wong, L.2
  • 27
    • 0012694077 scopus 로고    scopus 로고
    • On the power of incremental evaluation in SQL-like languages
    • L. Libkin and L. Wong. On the power of incremental evaluation in SQL-like languages. In Proc. DBPL, pages 17-30, 1999.
    • (1999) Proc. DBPL , pp. 17-30
    • Libkin, L.1    Wong, L.2
  • 29
    • 0031247597 scopus 로고    scopus 로고
    • Dyn-FO: A parallel, dynamic complexity class
    • S. Patnaik and N. Immerman. Dyn-FO: A parallel, dynamic complexity class. J. Comput. Syst. Sci., 55(2):199-209, 1997.
    • (1997) J. Comput. Syst. Sci. , vol.55 , Issue.2 , pp. 199-209
    • Patnaik, S.1    Immerman, N.2
  • 31
    • 0029193408 scopus 로고
    • Answering queries using templates with binding patterns
    • A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In Proc. PODS, pages 105-112, 1995.
    • (1995) Proc. PODS , pp. 105-112
    • Rajaraman, A.1    Sagiv, Y.2    Ullman, J.D.3
  • 32
    • 0026213736 scopus 로고
    • An incremental access method for viewcache: Concept, algorithms, and cost analysis
    • N. Roussopoulos. An incremental access method for viewcache: Concept, algorithms, and cost analysis. ACM Transactions on Database Systems, 16(3):535-563, 1991.
    • (1991) ACM Transactions on Database Systems , vol.16 , Issue.3 , pp. 535-563
    • Roussopoulos, N.1
  • 33
    • 0021587238 scopus 로고
    • Maintenance of views
    • B. Yormark, editor, ACM Press
    • O. Shmueli and A. Itai. Maintenance of views. In B. Yormark, editor, Proc. SIGMOD, pages 240-255. ACM Press, 1984.
    • (1984) Proc. SIGMOD , pp. 240-255
    • Shmueli, O.1    Itai, A.2
  • 34
    • 85012869454 scopus 로고
    • Algebraic methods in the theory of lower bounds for boolean circuit complexity
    • R. Smolenski. Algebraic methods in the theory of lower bounds for boolean circuit complexity. In Proc. STOC, pages 77-82, 1987.
    • (1987) Proc. STOC , pp. 77-82
    • Smolenski, R.1
  • 35
    • 85028752389 scopus 로고
    • The complexity of relational query languages
    • May
    • M. Y. Vardi. The complexity of relational query languages. In Proc. STOC, pages 137-146, May 1982.
    • (1982) Proc. STOC , pp. 137-146
    • Vardi, M.Y.1
  • 36
    • 0003142704 scopus 로고
    • Eager aggregation and lazy aggregation
    • W. P. Yan and P.-Å. Larson. Eager aggregation and lazy aggregation. In Proc. VLDB, pages 345-357, 1995.
    • (1995) Proc. VLDB , pp. 345-357
    • Yan, W.P.1    Larson, P.-Å.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.