From df1d5c324a14f8e57ef78794e6c3b34cbf027c2a Mon Sep 17 00:00:00 2001 From: LtWorf Date: Wed, 18 Mar 2009 09:42:48 +0000 Subject: [PATCH] added draft of complexity study git-svn-id: http://galileo.dmi.unict.it/svn/relational/trunk@112 014f5005-505e-4b48-8d0a-63407b615a7c --- complexity | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 complexity diff --git a/complexity b/complexity new file mode 100644 index 0000000..1cee324 --- /dev/null +++ b/complexity @@ -0,0 +1,24 @@ +Request for Comments: 2026 Harvard University + + Complexity + +Abstract + Purpose of this document is to describe in a detailed way the + complexity of relational algebra operations. The evaluation will be + done on the specific implementation of this program, not on theorical + lower limits. + + Latest implementation can be found at: + http://galileo.dmi.unict.it/svn/trunk + +Notation + Big O notation will be used. Constant values will be ignored. + + Single letters will be used to indicate relations and letters between + | will indicate the cardinality (number of tuples) of the relation. + +1. UNARY OPERATORS + +1.1 Selection +1.2 Rename +1.3 Projection \ No newline at end of file