TraHist: Fast and Accurate Cardinality Estimation for Trajectory Data (Extended Version)
Yujeong Jo, Incheol Baek, Changbeom Shim, Yon Dohn Chung
Abstract
Cardinality estimation is fundamental for query optimization in database systems. Histogram-based estimators are widely used for their simplicity and efficiency but rely on point-centric partitioning that assumes record independence. This assumption breaks in trajectory data, where records from the same moving object show strong spatiotemporal dependencies. Conventional axis-aligned histograms therefore fragment trajectories across partition boundaries, leading to overestimation through duplicate counting. This error reflects a structural limitation of partition boundaries that are misaligned with trajectory-induced density patterns. To this end, we propose TraHist, a histogram-based estimator approximating density-aligned partitioning via efficient grid-based propagation. TraHist builds density-adaptive rectilinear buckets to preserve trajectory continuity and local density coherence while keeping histogram efficiency. Experiments on large-scale real-world datasets show that TraHist reduces estimation error by over 20x relative to the strongest competing estimator in query regimes where trajectory fragmentation is a dominant source of estimation error, while maintaining sub-millisecond query latency and competitive construction cost.
Create a lesson
Related papers
Reflective Compositional Grounding for Natural-Language-to-SPARQL
Isabelle Mohr, John Dujany, Andre Freitas
ConStore: Search-Overlapped Prefetch and Co-Retrieval-Aware Content Storage for Disk-Based ANNS
Zhutao Zhuang, Nong Xiao, Zhiguang Chen et al.
AdaBool: Sparse Boolean Matrix Processing with Adaptive Data Representation
Xiangrui Yang, Yifan Lei, Jiawei Yang et al.
Amora: Communication-Efficient Private Approximate Nearest Neighbors Search
Qiuhao Wang, Zuowei Chen, Xu Yang et al.
JetStream: Generating Verified Query Accelerators for Existing Database Systems
Akhilesh Balasingam, Amadou Ngom, Geoffrey X. Yu et al.
Path Length Existence Problems in Bounded-Treewidth Probabilistic Graphs
Antoine Amarilli, Mikaël Monet, Harshul Sagar