commit e7e5344b1b4b91d4bca4ee7dfcc6ad67a5d91959 parent 901a0bf733d26761bd47f2034bf62d86e3fb3f2c Author: a3nm <> Date: Sun, 17 Jun 2018 02:20:26 +0200 link Diffstat:
| Query evaluation.page | | | 4 | ++-- |
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/Query evaluation.page b/Query evaluation.page @@ -14,4 +14,4 @@ It is often most convenient to assume that queries are Boolean, so query evaluat A different perspective on non-Boolean queries is to write the query in [relational algebra]() and consider the evaluation of relational algebra instead. -Yet another perspective is to study the complexity of producing the query results in succession: see [Enumeration algorithms]().- \ No newline at end of file +Yet another perspective is to study the complexity of producing the query results in succession: see [Enumeration of query results]().+ \ No newline at end of file