Youhuan Li's paper(Computing Longest Increasing Subsequences over Sequential Data Streams) is accepted by VLDB 2016.

In this paper, we propose a data structure, a quadruple neighbor list (QN-list, for short), to support real time queries of all longest increasing subsequence (LIS) and LIS with constraints over sequential data streams. The QN-List built by our algorithm requires O(w) space and O(w) update time, where w is the time window size. The QN-list can efficiently support both LIS enumeration and LIS with constraints computation over real time sequential data streams. Our method utperforms the state-of-the-art methods in both time and space cost, not only theoretically, but also empirically.