CCF_100/relational
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

completed complexity of unary functions

Browse Source 
git-svn-id: http://galileo.dmi.unict.it/svn/relational/trunk@118 014f5005-505e-4b48-8d0a-63407b615a7c
This commit is contained in:
LtWorf 2009-04-01 13:37:56 +00:00
parent e1dec88be6
commit 45b559be28
1 changed files with 7 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
complexity
View File

@ -64,5 +64,11 @@ Notation
1.3 Projection
The projection operation creates a copy of the original relation
using only a subset of its fields. Time for the copy is something
like O(|n|*f) where f is the number of fields to copy.
But that's not all. Since relations are set, duplicated items are not
allowed. So after extracting the wanted elements, it has to check if
the new tuple was already added to the new relation. And this brings
the complexity to O((|n|*f)²).
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx