Youhuan Li's paper on longest increasing subsequence (LIS) computation over data stream (Longest Increasing Subsequence Computation over Streaming Sequences) is accepted by TKDE 2017.

This is an extension paper over previous work on streaming LIS computation that is published on VLDB 2017. This paper also focuses on the LIS computation over data stream with the proposed quadruple neighbor list (QN-list) data structure. The core idea of the extension part lies in the computation of LIS with all existing constraints. In previous work, we design algorithm for computing LIS with extreme gap/weight, while, in this version, we not only include the computation of LIS with extreme width (width is defined as the positional distance between the head item and the tail item of an LIS), but also consider the range/slope-constrained LIS computation. The range-constrained LIS is the LIS where any two consecutive items satisfy that their difference and distance are within given ranges. The slope-constrained LIS is the LIS where the slope between any two consecutive items (i.e., the ratio of the difference over the distance) should be not less than a certain parameter m. Computing range/slope-constrained LIS are quite different that of LIS with extreme gap/weight/width while we innovatively design efficient algorithm to support range/slope-constrained LIS and our solution is better than comparative work not only theoretically but also experimentally.