On the Complexity of Database Queries
Authors:
- Christos H. PapadimitriouCPChristos H. Papadimitriou
- Mihalis YannakakisMYMihalis Yannakakis
- 1 June 1999
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 58 (3) , 407-427
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Fixed-Parameter Tractability and Completeness I: Basic ResultsSIAM Journal on Computing, 1995
- Color-codingJournal of the ACM, 1995
- Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analoguesAnnals of Pure and Applied Logic, 1995
- Constraint programming and database languages1995
- Nondeterminism within $P^ * $SIAM Journal on Computing, 1993
- Elements of Relational Database Theory1990
- On conjunctive queries containing inequalitiesJournal of the ACM, 1988
- Checking that finite state concurrent programs satisfy their linear specification1985
- How to Find Long Paths Efficiently1985
- Optimal implementation of conjunctive queries in relational data bases1977