Notes on k-d NNS
Has been shown to run in O(log n) average time per search in a reasonable model. (Assume d a constant)
For VQ it appears that O(log n) is correct.
Storage for the k-d tree is O(n).
Preprocessing time is O(n log n) assuming d is a constant.