메뉴 건너뛰기




Volumn 190, Issue 2, 1998, Pages 211-239

A probabilistic view of datalog parallelization

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0042500396     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00091-1     Document Type: Article
Times cited : (6)

References (30)
  • 5
    • 0026221830 scopus 로고
    • A pipelined strategy for processing recursive queries in parallel
    • D.A. Bell, J. Shao, M.E.C. Hull, A pipelined strategy for processing recursive queries in parallel, Data Knowledge Eng. 6 (5) (1991) 367-391.
    • (1991) Data Knowledge Eng. , vol.6 , Issue.5 , pp. 367-391
    • Bell, D.A.1    Shao, J.2    Hull, M.E.C.3
  • 8
    • 0020166926 scopus 로고
    • Structure and complexity of relational queries
    • A.K. Chandra, D. Harel, Structure and complexity of relational queries, J. Comput. System Sci. 25 (1) (1982) 99-128.
    • (1982) J. Comput. System Sci. , vol.25 , Issue.1 , pp. 99-128
    • Chandra, A.K.1    Harel, D.2
  • 11
    • 84982593366 scopus 로고
    • Monadic generalized spectra
    • R. Fagin, Monadic generalized spectra, Z. Math. Logik 21 (1975) 89-96.
    • (1975) Z. Math. Logik , vol.21 , pp. 89-96
    • Fagin, R.1
  • 12
    • 0027906178 scopus 로고
    • Finite-model theory: A personal perspective
    • R. Fagin, Finite-model theory: a personal perspective, Theor. Comput. Sci. 116 (1993) 3-31.
    • (1993) Theor. Comput. Sci. , vol.116 , pp. 3-31
    • Fagin, R.1
  • 14
    • 0012942253 scopus 로고
    • Complexity of the first-order theory of almost all structures
    • E. Grandjean, Complexity of the first-order theory of almost all structures, Inform. Control 52 (1983) 180-204.
    • (1983) Inform. Control , vol.52 , pp. 180-204
    • Grandjean, E.1
  • 15
    • 0024718706 scopus 로고
    • Parallel processing of recursive queries in distributed architectures
    • G. Hulin, Parallel processing of recursive queries in distributed architectures, Proc. Internat. Conf. on Very Large Data Bases, 1989, pp. 87-96.
    • (1989) Proc. Internat. Conf. on Very Large Data Bases , pp. 87-96
    • Hulin, G.1
  • 16
    • 0022500426 scopus 로고
    • Relational queries computable in polynomial time
    • N. Immerman, Relational queries computable in polynomial time, Inform, and Control 68 (1986) 86-104.
    • (1986) Inform, and Control , vol.68 , pp. 86-104
    • Immerman, N.1
  • 17
    • 0026405037 scopus 로고
    • A rule language compiler for SQL database servers
    • G. Kiernan, C. de Maindreville, A rule language compiler for SQL database servers, Data knowledge Eng. 7 (2) (1991) 89-113.
    • (1991) Data Knowledge Eng. , vol.7 , Issue.2 , pp. 89-113
    • Kiernan, G.1    De Maindreville, C.2
  • 21
    • 0001012216 scopus 로고
    • Universal graphs and universal functions
    • R. Rado, Universal graphs and universal functions, Acta Arith. 9 (1964) 331-340.
    • (1964) Acta Arith. , vol.9 , pp. 331-340
    • Rado, R.1


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