Affiliation:
1. University of California
2. King Abdulaziz City for Science and Technology, Riyadh, Saudi Arabia
Abstract
Document database systems store self-describing semi-structured records, such as JSON, "as-is" without requiring the users to pre-define a schema. This provides users with the flexibility to change the structure of incoming records without worrying about taking the system offline or hindering the performance of currently running queries. However, the flexibility of such systems does not free. The large amount of redundancy in the records can introduce an unnecessary storage overhead and impact query performance.
Our focus in this paper is to address the storage overhead issue by introducing a tuple compactor framework that infers and extracts the schema from self-describing semi-structured records during the data ingestion. As many prominent document stores, such as MongoDB and Couchbase, adopt Log Structured Merge (LSM) trees in their storage engines, our framework exploits LSM lifecycle events to piggyback the schema inference and extraction operations. We have implemented and empirically evaluated our approach to measure its impact on storage, data ingestion, and query performance in the context of Apache AsterixDB.
Subject
General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Benchmarking Learned and LSM Indexes for Data Sortedness;Proceedings of the Tenth International Workshop on Testing Database Systems;2024-06-09
2. Towards flexibility and robustness of LSM trees;The VLDB Journal;2024-01-11
3. Real-Time LSM-Trees for HTAP Workloads;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04
4. Dissecting, Designing, and Optimizing LSM-based Data Stores;Proceedings of the 2022 International Conference on Management of Data;2022-06-10
5. Columnar formats for schemaless LSM-based document stores;Proceedings of the VLDB Endowment;2022-06