[reporter="jpham", created="Wed, 13 Sep 2006 15:27:50 -0500 (GMT-05:00)"]
Currently Farrago contains two kinds of sort orders: a physical sort order (on Fennel relations, designed by John Sichi) and a logical sort order (on abstract relations, designed by Julian Hyde). Neither of these implementations are complete for all components. The task is to unify the sort orders (probably to Julian's design since it is more expressive, allowing for multiple sort orders). Then fill in the sort order for relations that do not have them. Finally, remove redundant sorts.
As a side effect this will enable other optimizations such as LucidDb index only scan.
[author="jpham", created="Tue, 14 Nov 2006 23:14:52 -0500 (GMT-05:00)"]
Once this task is done, make index only scans work with interposed Calc nodes. FRG-75
[reporter="jpham", created="Wed, 13 Sep 2006 15:27:50 -0500 (GMT-05:00)"] Currently Farrago contains two kinds of sort orders: a physical sort order (on Fennel relations, designed by John Sichi) and a logical sort order (on abstract relations, designed by Julian Hyde). Neither of these implementations are complete for all components. The task is to unify the sort orders (probably to Julian's design since it is more expressive, allowing for multiple sort orders). Then fill in the sort order for relations that do not have them. Finally, remove redundant sorts.
As a side effect this will enable other optimizations such as LucidDb index only scan.