Efficient Join Synopsis Maintenance for Data Warehouse
Zhuoyue Zhao, Feifei Li, Yuxi Liu
Abstract
Various sources such as daily business operations and sensors from different IoT applications constantly generate a lot of data. They are often loaded into a data warehouse system to perform complex analysis over. It, however, can be extremely costly if the query involves joins, especially many-to-many joins over multiple large tables. A join synopsis, i.e., a small uniform random sample over the join result, often suffices as a representative alternative to the full join result for many applications such as histogram construction, model training and etc. Towards that end, we propose a novel algorithm SJoin that can maintain a join synopsis over a pre-specified general θ -join query in a dynamic database with continuous inflows of updates. Central to SJoin is maintaining a weighted join graph index, which assists to efficiently replace join results in the synopsis upon update. We conduct extensive experiments using TPC-DS and a simulated road sensor data over several complex join queries and they demonstrate the clear advantage of SJoin over the best available baseline.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a3b22b6a-1554-4f90-b3a5-fe64c540f720Cited by top-tier papers6
- Cardinality Estimation in DBMS: A Comprehensive Benchmark EvaluationYuxing Han, Ziniu Wu, Peizhi Wu, Rong Zhu et al.VLDB 2022 · 169 citations
- Efficiently Approximating Selectivity Functions using Low Overhead Regression ModelsAnshuman Dutt, Chi Wang, Vivek R. Narasayya, Surajit ChaudhuriVLDB 2020 · 45 citations
- Reservoir Sampling over JoinsBinyang Dai, Xiao Hu, Ke YiSIGMOD 2024 · 6 citations
- Transactional Panorama: A Conceptual Framework for User Perception in Analytical Visual InterfacesDixin Tang, Alan D. Fekete, Indranil Gupta, Aditya G. ParameswaranVLDB 2023 · 3 citations
- Random Sampling Over Spatial Range JoinsDaichi AmagataICDE 2025 · 3 citations
Related papers
- JanusAQP: Efficient Partition Tree Maintenance for Dynamic Approximate Query ProcessingXi Liang, Stavros Sintos, Sanjay KrishnanICDE 2023 · 3 citations
- PGMJoins: Random Join Sampling with Graphical ModelsAli Mohammadi Shanghooshabad, Meghdad Kurmanji, Qingzhi Ma, Michael Shekelyan et al.SIGMOD 2021 · 13 citations
- Optimizing Queries with Many-to-Many JoinsHasara Kalumin, Amol DeshpandeICDE 2025 · 3 citations
- AJOSC: Adaptive Join Order Selection for Continuous QueriesXinyi Ye, Xiangyang Gou, Lei Zou, Wenjie ZhangSIGMOD 2025
- Adopting Worst-Case Optimal Joins in Relational Database SystemsMichael J. Freitag, Maximilian Bandle, Tobias Schmidt, Alfons Kemper et al.VLDB 2020 · 79 citations
