On the complexity of database queries (extended abstract)
- 1 May 1997
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On Limited Nondeterminism and the Complexity of the V-C DimensionJournal of Computer and System Sciences, 1996
- Fixed-Parameter Tractability and Completeness I: Basic ResultsSIAM Journal on Computing, 1995
- Color-codingJournal of the ACM, 1995
- On the complexity of bounded-variable queries (extended abstract)Published by Association for Computing Machinery (ACM) ,1995
- Constraint programming and database languagesPublished by Association for Computing Machinery (ACM) ,1995
- Nondeterminism within $P^ * $SIAM Journal on Computing, 1993
- On conjunctive queries containing inequalitiesJournal of the ACM, 1988
- Checking that finite state concurrent programs satisfy their linear specificationPublished by Association for Computing Machinery (ACM) ,1985
- The complexity of relational query languages (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1982
- Optimal implementation of conjunctive queries in relational data basesPublished by Association for Computing Machinery (ACM) ,1977