Relational Algorithms

From: Martin Sutton <mgms_at_cc.newcastle.edu.au>
Date: 2000/05/03
Message-ID: <8ensb8$rnm$1_at_seagoon.newcastle.edu.au>#1/1


Hi All,

            Database algorithms are not my area at all but I need to get some idea of the time complexity of the algorithms used to manipulate relational database tables. For example, when performing a JOIN, is a cartesian product actually taken first and then the 'live' rows selected or is(are) there algorithms for this task with a better performance?

Any pointers to textbooks, white-papers, journal articles etc. much appreciated.

TIA Martin Received on Wed May 03 2000 - 00:00:00 CEST

Original text of this message