QUEST: An Efficient Query Evaluation Scheme Towards Scan-Intensive Cross-Model Analysis
Jianfeng Huang, Dongjing Miao, Xin Liu

TL;DR
QUEST introduces a unified columnar storage and a novel Skip-Tree index to efficiently evaluate scan-intensive cross-model analytical queries, significantly reducing response time and resource consumption.
Contribution
The paper proposes QUEST, a new query evaluation scheme that unifies multi-model data in columnar format and employs Skip-Tree indexing for faster cross-model analysis.
Findings
Achieves 3.7x to 178.2x performance improvement over existing systems.
Effectively prunes irrelevant data to reduce intermediate results.
Demonstrates scalability and efficiency through extensive experiments.
Abstract
Modern data-driven applications require that databases support fast cross-model analytical queries. Achieving fast analytical queries in a database system is challenging since they are usually scan-intensive (i.e., they need to intensively scan over a large number of records) which results in huge I/O and memory costs. And it becomes tougher when the analytical queries are cross-model. It is hard to accelerate cross-model analytical queries in existing databases due to the lack of appropriate storage layout and efficient query processing techniques. In this paper, we present QUEST (QUery Evaluation Scheme Towards scan-intensive cross-model analysis) to push scan-intensive queries down to unified columnar storage layout and seamlessly deliver payloads across different data models. QUEST employs a columnar data layout to unify the representation of multi-model data. Then, a novel index…
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.
Taxonomy
TopicsData Management and Algorithms · Advanced Database Systems and Queries · Graph Theory and Algorithms
