BtSQL: nested bitemporal relational database query language

Temel Bulgular & Veri:The bitemporal atom (BTA) is the fundamental construct to represent temporal data and it contains 5 components: a value, the lower and upper bounds of valid time, and the lower and upper bounds of the recoding time.

💡

Sonuç & Katkı:We also evaluate the performance of the 2 alternative implementation methods by considering retrieval, insertion, and update queries.

🔬Tür:Modelleme & Sayısal Simülasyon

📍Kapsam:Genişletilmiş Akademik Örneklem

⚙️Değişkenler:Bitemporal database · nested bitemporal relational model · bitemporal atom type

Özet

A nested bitemporal relational data model and its query language are implemented. The bitemporal atom (BTA) is the fundamental construct to represent temporal data and it contains 5 components: a value, the lower and upper bounds of valid time, and the lower and upper bounds of the recoding time. We consider 2 types of data structures for storing BTAs: 1) string representation and 2) abstract data-type representation. We also develop a preprocessor for translating a bitemporal structured query language (BtSQL) statement into standard SQL statements. The BtSQL includes the select, insert, delete, and update statements of the SQL, extended for bitemporal relational databases. It supports bitemporal, historical, and current context. Bitemporal context is for auditing purposes, historical context is for querying past states of a bitemporal database, and current context is for querying the snapshot state of a bitemporal database. We also evaluate the performance of the 2 alternative implementation methods by considering retrieval, insertion, and update queries.

Abstract

A nested bitemporal relational data model and its query language are implemented. The bitemporal atom (BTA) is the fundamental construct to represent temporal data and it contains 5 components: a value, the lower and upper bounds of valid time, and the lower and upper bounds of the recoding time. We consider 2 types of data structures for storing BTAs: 1) string representation and 2) abstract data-type representation. We also develop a preprocessor for translating a bitemporal structured query language (BtSQL) statement into standard SQL statements. The BtSQL includes the select, insert, delete, and update statements of the SQL, extended for bitemporal relational databases. It supports bitemporal, historical, and current context. Bitemporal context is for auditing purposes, historical context is for querying past states of a bitemporal database, and current context is for querying the snapshot state of a bitemporal database. We also evaluate the performance of the 2 alternative implementation methods by considering retrieval, insertion, and update queries.

Anahtar kelimeler

Bitemporal database nested bitemporal relational model bitemporal atom type bitemporal query BtSQL

🔖

Bu Makaleye Atıf Yap

ATAY, C. E., TANSEL, A. U. (2014). BtSQL: nested bitemporal relational database query language. Turkish Journal of Electrical Engineering and Computer Science, Cilt: 22 - Sayı: 2, 479–498. https://ajindex.com/articles/188547

📄 Tam Metin PDF Okuyucu

Yeni Sekmede Aç ↗

↗Yeni Sekme

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (13)

A.U. Tansel, C.E. Atay, “Nested bitemporal relational algebra”, International Symposium on Computer and Information Sciences, pp. 622–633, 2006.
M. Stonebraker, D. Moore, Object-Relational DBMSs: Tracking the Next Great Wave, San Francisco, The Morgan Kaufmann Series in Data Management Systems, 1999.
J. Melton, Understanding Object-Relational and Other Advanced Features, San Francisco, Morgan Kaufmann Publishers, 2003.
A.U. Tansel, J. Clifford, S.K. Gadia, S. Jajodia, A. Segev, R.T. Snodgrass. Temporal Databases: Theory, Design, and Implementation, San Francisco, Benjamin/Cummings, 1993.
J. Ben-Zvi, The Time Relational Model, PhD, University of California, 1982. R.T. Snodgrass, “The temporal query language TQuel”, ACM Transactions on Database Systems, Vol. 12, pp. 247–298, 1987. S.K. Gadia, “A homogeneous relational model and query languages for temporal databases”, ACM Transactions on Database Systems, Vol. 13, pp. 418–448, 1988. G. ¨ Ozsoyo˘ glu, M.Z. ¨ Ozsoyo˘ glu, V. Matos, “Extending relational algebra and relational calculus with set-valued attributes and aggregate functions”, ACM Transactions on Database Systems, Vol. 12, pp. 566–592, 1987.
G. Bhargava, S.K. Gadia, “Relational database systems with zero information loss”, IEEE Transactions on Knowledge and Data engineering, Vol. 5, pp. 76–87, 1993.
C.S. Jensen, M.D. Soo, R.T. Snodgrass, “Unifying temporal data models via a conceptual model”, Information Systems, Vol. 19, pp. 513–547, 1994.
R.T. Snodgrass, I. Ahn, G. Ariav, D.S. Batory, J. Clifford, C.E. Dyreson, C.S. Jensen, R. Elmasri, F. Grandi, W. K¨ afer, N. Kline, K.G. Kulkarni, T.Y.C. Leung, N.A. Lorentzos, J.F. Roddick, A. Segev, M.D. Soo, S.M. Sripada, The TSQL2 Temporal Query Language, Dordrecht, Kluwer, 1995.
D. Shasha, Y. Zhu, “SpyTime – a performance benchmark for bitemporal database”, www.cs.nyu.edu/shasha/spytime/spytime.html, last accessed 1 December 2009.
C. Combi, A. Montanari, G. Pozzi, “The T4SQL temporal query language”, ACM International Conference on Information and Knowledge Management, pp. 193–202, 2007.
M. Dumas, M.C. Fauvet, P.C. Scholl, “TEMPOS: a platform for developing temporal applications on top of object DBMS”, IEEE Transactions on Knowledge and Data Engineering, Vol. 16, pp. 354–374, 2004.
J. Yang, H. Ying, J. Widom, “TIP: a temporal extension to informix” Proceedings of the Special Interest Group on the Management of Data, pp. 596–671, 2000.
V.T. Chau, S. Chittayasothorn, “A temporal compatible object relational dat