메뉴 건너뛰기




Volumn 1973, Issue , 2001, Pages 39-53

Scalar aggregation in fd-inconsistent databases

Author keywords

[No Author keywords available]

Indexed keywords

QUERY LANGUAGES; QUERY PROCESSING;

EID: 84949453663     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44503-x_3     Document Type: Conference Paper
Times cited : (34)

References (15)
  • 7
    • 0019072589 scopus 로고
    • Computable Queries for Relational Databases
    • A. K. Chandra and D. Harel. Computable Queries for Relational Databases. Journal of Computer and System Sciences, 21:156-178, 1980.
    • (1980) Journal , vol.21 , pp. 156-178
    • Chandra, A.K.1    Harel, D.2
  • 8
    • 84968322866 scopus 로고    scopus 로고
    • Integrating Data from Possibly Inconsistent Databases
    • Phan Minh Dung, Brussels, Belgium
    • Phan Minh Dung. Integrating Data from Possibly Inconsistent Databases. In International Conference on Cooperative Information Systems, Brussels, Belgium, 1996.
    • International Conference on Cooperative Information Systems , pp. 1996
  • 9
    • 0000340664 scopus 로고
    • Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
    • Fanica Gavril. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph. SIAM Journal on Computing, 1(2):180-187, 1972.
    • (1972) SIAM Journal on Computing , vol.1 , Issue.2 , pp. 180-187
    • Gavril, F.1
  • 10
    • 0039157358 scopus 로고
    • Algorithms for Minimum Covering by Cliques and Maximum Clique in Claw-free Perfect Graphs
    • W-L. Hsu and G.L. Nemhauser. Algorithms for Minimum Covering by Cliques and Maximum Clique in Claw-free Perfect Graphs. Discrete Mathematics, 37:181-191, 1981.
    • (1981) Discrete Mathematics , vol.37 , pp. 181-191
    • Hsu, W.-L.1    Nemhauser, G.L.2
  • 11
    • 0021513522 scopus 로고
    • Incomplete Information in Relational Databases
    • T. Imieliński and W. Lipski. Incomplete Information in Relational Databases. Journal of the ACM, 31(4):761-791, 1984.
    • (1984) Journal of the ACM , vol.31 , Issue.4 , pp. 761-791
    • Imieli, T.1    Ńskilipski, W.2
  • 14
    • 0003221260 scopus 로고    scopus 로고
    • Logical Approaches to Incomplete Information: A Survey
    • In J. Chomicki and G. Saake, editors, chapter 10. Kluwer Academic Publishers, Boston
    • R. van der Meyden. Logical Approaches to Incomplete Information: A Survey. In J. Chomicki and G. Saake, editors, Logics for Databases and Information Systems, chapter 10. Kluwer Academic Publishers, Boston, 1998.
    • (1998) Logics for Databases and Information Systems
    • Van Der Meyden, R.1
  • 15
    • 85028752389 scopus 로고
    • The Complexity of Relational Query Languages
    • M. Y. Vardi. The Complexity of Relational Query Languages. In ACM Symposium on Theory of Computing, pages 137-146, 1982.
    • (1982) ACM Symposium on Theory of Computing , pp. 137-146
    • Vardi, M.Y.1


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