Computing Longest Increasing Subsequences over Sequential Data Streams

Summary: Introduces a unified quadruple neighbor list for real-time enumeration of all LIS in sliding-window streams, including gap/weight constraints. Uses O(w) space, O(log w) insertion, and improves over prior methods theoretically and empirically. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 11650
Venue: VLDB
Year: 2017
Pagerank: 5.093636e-05
Overall Rank: 12,009 | 17.61%
DOI: 10.14778/3021924.3021931

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Youhuan Li (Peking University)
2. Lei Zou (Peking University)
3. Huaming Zhang (University of Alabama)
4. Dongyan Zhao (Peking University)

BibTeX Citation

@article{li_vldb17,
        title = {{Computing Longest Increasing Subsequences over Sequential Data Streams}},
        author = {Li, Youhuan and Zou, Lei and Zhang, Huaming and Zhao, Dongyan},
        journal = {PVLDB},
        series = {{VLDB} '17},
        volume = {10},
        number = {3},
        pages = {181--192},
        doi = {10.14778/3021924.3021931},
        url = {https://doi.org/10.14778/3021924.3021931},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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.00046675394
1,718	Towards a Streaming SQL Standard	2008	VLDB	9.9297933e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	5,592	Ranked Subsequence Matching in Time-Series Databases	2007	VLDB
2	6,858	A Generic Framework for Efficient and Effective Subsequence Retrieval	2012	VLDB
3	82	Space-Efficient Online Computation of Quantile Summaries	2001	SIGMOD
4	8,542	Online Windowed Subsequence Matching over Probabilistic Sequences	2012	SIGMOD
5	8,422	LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying	2007	VLDB
6	41	Fast Subsequence Matching in Time-Series Databases	1994	SIGMOD
7	8,780	The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem	2022	VLDB
8	12,056	Range Thresholding on Streams	2016	SIGMOD
9	2,745	Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries	2020	VLDB
10	8,026	A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union	2011	SIGMOD