SCOPUS 정보 검색 플랫폼

Volumn , Issue , 2001, Pages 657-666

When is the evaluation of conjunctive queries tractable ?

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; RELATIONAL DATABASE SYSTEMS; TREES (MATHEMATICS);

CONJUNCTIVE TREES;

QUERY LANGUAGES;

EID: 0034833019 PISSN: 07349025 EISSN: None Source Type: Conference Proceeding
DOI: 10.1145/380752.380867 Document Type: Conference Paper

Times cited : (158)

References (16)

1
- 84958776545
- Optimal implementation of conjunctive queries in relational data bases
- (1977) Proceedings of the 9th ACM Symposium on Theory of Computing , pp. 77-90
- Chandra, A.K.¹ Merlin, P.M.²

2
- 84948974054
- Conjunctive query containment revisited
- Ph. Kolaitis and F. Afrati, editors, Proceedings of the 5th International Conference on Database Theory, Springer-Verlag
- (1997) Lecture Notes in Computer Science , vol.1186 , pp. 56-70
- Chekuri, Ch.¹ Rajaraman, A.²

3
- 0029290085
- Fixed-parameter tractability and completeness II: On completeness for W
- (1995) Theoretical Computer Science , vol.141 , pp. 109-131
- Downey, R.G.¹ Fellows, M.R.²

5
- 0002875734
- The parameterized complexity of relational database queries and an improved characterization of W
- Bridges, Calude, Gibbons, Reeves, and Witten, editors, Springer-Verlag
- (1996) Combinatorics, Complexity, and Logic - Proceedings of DMTCS '96 , pp. 194-213
- Downey, R.G.¹ Fellows, M.R.² Taylor, U.³

6
- 84949458886
- Query evaluation via tree-decompositions
- J. van den Bussche and V. Vianu, editors, Proceedings of the 8th International Conference on Database Theory, Springer Verlag
- (2001) Lecture Notes in Computer Science , vol.1973 , pp. 22-38
- Flum, J.¹ Frick, M.² Grohe, M.³

9
- 0003037529
- Reducibilities among combinatorial problems
- R.E. Miller and J.W. Thatcher, editors, Plenum Press, New York
- (1972) Complexity of Computer Computations , pp. 85-103
- Karp, R.M.¹

12
- 0002856269
- Graph minors V. Excluding a planar graph
- (1986) Journal of Combinatorial Theory, Series B , vol.41 , pp. 92-114
- Robertson, N.¹ Seymour, P.D.²

13
- 0003394437
- PhD thesis, Department of Electrical Engineering, MIT
- (1974) The Complexity of Decision Problems in Automata Theory
- Stockmeyer, L.J.¹

14
- 85028752389
- The complexity of relational query languages
- (1982) Proceedings of the 14th ACM Symposium on Theory of Computing , pp. 137-146
- Vardi, M.Y.¹

15
- 0019714095
- Algorithms for acyclic database schemes
- (1981) 7th International Conference on Very Large Data Bases , pp. 82-94
- Yannakakis, M.¹

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