In this paper, the authors examine the problem of computing diverse query results which is useful for browsing search results in online shopping applications. The search results are diversified wrt a sequence of output attributes (termed d-order) where an attribute that appears earlier in the d-order has higher priority for diversification. They present a new indexing technique, D-Index, to efficiently compute diverse query results for queries with static or dynamic d-orders. Their performance evaluation demonstrates that their D-Index outperforms the state-of-the-art techniques developed for queries with static or dynamic d-orders.