nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Query Language for NC
|
Suciu, Dan |
|
1997 |
55 |
2 |
p. 299-321 23 p. |
artikel |
2 |
Bounded Arity Datalog(≠) Queries on Graphs
|
Afrati, Foto N. |
|
1997 |
55 |
2 |
p. 210-228 19 p. |
artikel |
3 |
Can Datalog Be Approximated?
|
Chaudhuri, Surajit |
|
1997 |
55 |
2 |
p. 355-369 15 p. |
artikel |
4 |
Dyn-FO: A Parallel, Dynamic Complexity Class
|
Patnaik, Sushant |
|
1997 |
55 |
2 |
p. 199-209 11 p. |
artikel |
5 |
Finitely Representable Databases
|
Grumbach, Stéphane |
|
1997 |
55 |
2 |
p. 273-298 26 p. |
artikel |
6 |
Query Languages for Bags and Aggregate Functions
|
Libkin, Leonid |
|
1997 |
55 |
2 |
p. 241-272 32 p. |
artikel |
7 |
Relative Serializability: An Approach for Relaxing the Atomicity of Transactions
|
Krishnaswamy, V. |
|
1997 |
55 |
2 |
p. 344-354 11 p. |
artikel |
8 |
Relaxing the Uniformity and Independence Assumptions Using the Concept of Fractal Dimension
|
Faloutsos, Christos |
|
1997 |
55 |
2 |
p. 229-240 12 p. |
artikel |
9 |
The Complexity of the Evaluation of Complex Algebra Expressions
|
Suciu, Dan |
|
1997 |
55 |
2 |
p. 322-343 22 p. |
artikel |