Computing Longest Increasing Subsequences over Sequential Data Streams
Summary: Proposes the quadruple neighbor list (QN-list) for real-time LIS and constrained LIS over sliding windows. Uses O(w) space; builds in O(w log w); inserts in O(log w); deletes in O(w); claims the first uniform structure to support both LIS enumeration and constrained LIS with improved time/space. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Youhuan Li
- 2. Lei Zou
- 3. Huaming Zhang
- 4. Dongyan Zhao
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 41 | Fast Subsequence Matching in Time-Series Databases | 1994 | SIGMOD | 0.00046994182 |
| 1,690 | Towards a Streaming SQL Standard | 2008 | VLDB | 0.00010091848 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,753 | A Generic Framework for Efficient and Effective Subsequence Retrieval | 2012 | VLDB | 5.8414302e-05 |
| 5,495 | Ranked Subsequence Matching in Time-Series Databases | 2007 | VLDB | 6.2653095e-05 |
| 83 | Space-Efficient Online Computation of Quantile Summaries | 2001 | SIGMOD | 0.00036461682 |
| 8,412 | Online Windowed Subsequence Matching over Probabilistic Sequences | 2012 | SIGMOD | 5.4958075e-05 |
| 8,342 | LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying | 2007 | VLDB | 5.5045236e-05 |
| 41 | Fast Subsequence Matching in Time-Series Databases | 1994 | SIGMOD | 0.00046994182 |
| 11,863 | Range Thresholding on Streams | 2016 | SIGMOD | 5.1725247e-05 |
| 8,665 | The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem | 2022 | VLDB | 5.457513e-05 |
| 3,179 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 7.7369605e-05 |
| 7,898 | A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union | 2011 | SIGMOD | 5.5901842e-05 |