On the complexity of database queries

Journal of Computer and System Sciences

Volumn 58, Issue 3, 1999, Pages 407-427

  Papadimitriou, Christos H ^a   Yannakakis, Mihalis ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA STRUCTURES; QUERY LANGUAGES; RELATIONAL DATABASE SYSTEMS;

DATABASE QUERIES; RELATIONAL CALCULUS;

COMPUTATIONAL COMPLEXITY;

EID: 0032648151     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1626     Document Type: Article

References (19)

1. K. Abrahamson, R. G. Downey, and M. R. Fellows, Fixed-parameter tractability and completeness IV: On Completeness for W[P] and PSPACE analogues, Ann. Pure Appl. Logic (1995), 235-276.
2. S. Abiteboul, R. Hull, and V. Vianu, "Foundations of Databases," Addison-Wesley, Reading, MA, 1995.
3. N. Alon, R. Yuster, and U. Zwick, Color-coding, J. Assoc. Comput. Mach. (1995), 844-856.
4. J. F. Buss and J. Goldsmith, Nondeterminism within P, SIAM J. Comput. (1993), 560-572.
5. A. K. Chandra and P. M. Merlin, Optimal implementation of conjunctive queries in relational databases, in "Proc. 9th ACM Symp. Theory of Comp., 1977," pp. 77-90.
6. R. G. Downey and M. R. Fellows, Fixed-parameter tractability and completeness I: Basic results, SIAM J. Comp. (1995), 873-921.
7. R. G. Downey, M. R. Fellows, and U. Taylor, "The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1], Dec. 1996," Proc. Conf. Discrete Mathematics and Theoretical Computer Science, pp. 194-213.
8. P. C. Kanellakis, Elements of relational database theory, in "Handbook of Theoretical Computer Science" (J. Van Leeuwen, Ed.), pp. 1074-1156, Elsevier, Amsterdam, 1991.
9. P. C. Kanellakis, Constraint programming and database languages: A tutorial, in "Proc. 14th ACM Symp. Principles of Databases Sys., 1995," pp. 46-53.
10. A. Klug, On conjunctive queries containing inequalities, J. Assoc. Comput. Mach. (1988), 146-160.
11. O. Lichtenstein and A. Pnueli, "Checking that Finite State Concurrent Programs Satisfy their Specifications, 1985," Proc. 12th Annual ACM Symp. on Principles of Prog. Lang., pp. 97-107.
12. B. Monien, How to find long paths efficiently, Ann. Disc. Math. (1985), 239-254.
13. C. H. Papadimitriou and M. Yannakakis, On limited nondeterminism and the complexity of the VC dimension, J. Comput. System Sci. 53 (1996), 161-170.
14. N. Robertson and P. D. Seymour, Graph minors XIII: The disjoint paths problem.
15. J. D. Ullman, "Principles of Database and Knowledge Base Systems," Comput. Sci. Press, New York, 1988.
16. M. Y. Vardi, "The Complexity of Relational Query Languages, 1982," Proc. ACM Symp. Theory of Computing, pp. 137-146.
17. M. Y. Vardi, "On the Complexity of Bounded-Variable Queries, 1995," Proc. 14th ACM Symp. Principles of Database Sys., pp. 266-276.
18. M. Yannakakis, "Algorithms for Acyclic Database Schemes, 1981," Proc. 7th Intl. Conf. Very Large Data Bases, pp. 82-94.
19. M. Yannakakis, "Perspectives on Database Theory, 1995," Proc. 36th IEEE Symp. Foundations of Comp. Sc., pp. 224-246.