I've been trying to ascertain whether suffix trees or suffix arrays (including their variants) are more space efficient (amongst other properties as given below), but I seem to be coming up with different viewpoints depending on where I look. This wikipedia article, for example, suggests that suffix arrays are more space efficient. In this book, in section 1.6, it is suggested that (compressed) suffix trees are very efficient for space, based on the paper "Compressed Suffix Trees with Full Functionality" by Kunihiko Sadakane. So what is the latest research on the comparison between suffix trees and suffix arrays (including their variants)? More specifically, I am interested in knowing which is better in terms of i) construction, ii) space (theoretical and practical), iii) querying performance.
I know that portions of this question may have been asked previously, but those questions are at least a year old and I am interested in the latest research.