Which of these three represent the most efficient query? I'm wondering if the smallest plan in bytes is the best plan. Also, are eager spools expensive or inexpensive, and is a smaller sub-tree cost better than a larger sub-tree cost? The first plan is 48 bytes and the second is 160 bytes. Both return the same records. project is smaller than architecture but architecture comes from a different database.
R, J