On the Complexity of Database Queries
- 30 June 1999
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 58 (3), 407-427
- https://doi.org/10.1006/jcss.1999.1626
Abstract
No abstract availableKeywords
This publication has 14 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 languagesPublished by Association for Computing Machinery (ACM) ,1995
- Nondeterminism within $P^ * $SIAM Journal on Computing, 1993
- Elements of Relational Database TheoryPublished by Elsevier BV ,1990
- 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
- How to Find Long Paths EfficientlyNorth-Holland Mathematics Studies, 1985
- Optimal implementation of conjunctive queries in relational data basesPublished by Association for Computing Machinery (ACM) ,1977