In this paper, we propose a new framework to index versioned documents, and extend the keyword queries into the more general phrase queries. Our index answers a one-sided time-constrained phrase query for any phrase P in O((|P|+k)log n) time, where n is the dataset size and k is the output size. We discuss how to tune our framework with realistic assumptions, our experiments shows that under similar space budgets, our index supports queries 5 times faster than the baseline inverted lists when |P| is at least four.