TUCKET: A Tensor Time Series Data Structure for Efficient and Accurate Factor Analysis over Time Ranges
Ruizhong Qiu, Jun-Gi Jang, Xiao Lin, Lihui Liu, Hanghang Tong

TL;DR
TUCKET is a novel data structure that enables efficient and accurate range queries and stream updates for tensor time series data, significantly improving over existing methods in latency and accuracy.
Contribution
We introduce TUCKET, a new tensor data structure based on a stream segment tree that supports range queries and stream updates with high efficiency and accuracy.
Findings
TUCKET achieves at least 3x lower latency than Zoom-Tucker.
TUCKET reduces reconstruction error by at least 1.4 times.
Extensive experiments on large datasets validate TUCKET's superior performance.
Abstract
Tucker decomposition has been widely used in a variety of applications to obtain latent factors of tensor data. In these applications, a common need is to compute Tucker decomposition for a given time range. Furthermore, real-world tensor time series are typically evolving in the time dimension. Such needs call for a data structure that can efficiently and accurately support range queries of Tucker decomposition and stream updates. Unfortunately, existing methods do not support either range queries or stream updates. This challenging problem has remained open for years prior to our work. To solve this challenging problem, we propose TUCKET, a data structure that can efficiently and accurately handle both range queries and stream updates. Our key idea is to design a new data structure that we call a stream segment tree by generalizing the segment tree, a data structure that was…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
