Efficient time-interval data extraction in MVCC-based RDBMS

Li, Haixiang; Zhao, Zhanhao; Cheng, Yijian; Lü, Wei; Du, Xiaoyong; Pan, Anqun

doi:10.1007/s11280-018-0552-7

Cited by 3 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The newly generated record always maintain a link to its previous version (if any). According to the principle of MVCC, select/update/delete queries always locate the latest version of the record, and follow its link recursively to find a proper version based on the snapshot isolation mechanism [7,26,23]. Apparently, as compared to the temporal counterpart, in a non-temporal relation, the latest version of a record corresponds to the current record, and its previous versions correspond to historical records.…”

Section: Current Data Storagementioning

confidence: 99%

“…Consider the majority of conventional DBMSs, including Oracle, SQL Server, MySQL, are MVCC-based. Theoretically, for a given record r, the start time (or end time) in its transaction time should be set to the commit time of the transaction that creates (or updates/deletes) r based on the snapshot isolation theorem [7,23,26]. Nevertheless, most of the existing temporal implementations just pick up the time when transaction starts to execute, or the time of the operation that inserts/updates/deletes the record (note that conventional DBMSs do not maintain the commit time of the transaction with each record by taking into consideration the performance of the whole system) just because SQL:2011 does not enforce to use the commit time [21].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A lightweight and efficient temporal database management system in TDSQL

et al. 2019

Self Cite

View full text Add to dashboard Cite

Driven by the recent adoption of temporal expressions into SQL:2011, extensions of temporal support in conventional database management systems (a.b.a. DBMSs) have reemerged as a research hotspot. In this paper, we present a lightweight yet efficient built-in temporal implementation in Tencent's distributed database management system, namely TDSQL. The novelty of TDSQL's temporal implementation includes: (1) a new temporal data model with the extension of SQL:2011, (2) a built-in temporal implementation with various optimizations, which are also applicable to other DBMSs, and (3) a low-storage-consumption in which only data changes are maintained. For the repeatability purpose, we elaborate the integration of our proposed techniques into MySQL. We conduct extensive experiments on both real-life dataset and synthetic TPC benchmarks by comparing TD-SQL with other temporal databases. The results show that TDSQL is lightweight and efficient.

show abstract

Section: Current Data Storagementioning

confidence: 99%