df1d5c324a
git-svn-id: http://galileo.dmi.unict.it/svn/relational/trunk@112 014f5005-505e-4b48-8d0a-63407b615a7c
24 lines
704 B
Plaintext
24 lines
704 B
Plaintext
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 |