Temporal Database Management Testbed


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 1, No. 1, pp. 1-13, May. 1994
10.3745/KIPSTE.1994.1.1.1,   PDF Download:

Abstract

The Temporal Database Management Testbed supports valid and transaction time. In this paper, we discuss the design and implementation of a testbed of a temporal database management system in main memory. The testbed consists of a syntactic analyzer, a semantic analyzer, a code generator, and an interpreter. The syntactic analyzer builds a parse tree from a temporal query. The semantic analyzer then checks it for correctness against the system catalog. The code generator builds an execution tree termed an update network. We employ an incremental view materialization for the execution tree. After building the execution tree, the interpreter activates each node of the execution tree. Also, the indexing structure and the concurrency control are discussed in the testbed.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. D. Ho, J. K. Whan, J. K. Ja, K. K. Jung, R. K. Ho, "Temporal Database Management Testbed," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 1, no. 1, pp. 1-13, 1994. DOI: 10.3745/KIPSTE.1994.1.1.1.

[ACM Style]
Kim Dong Ho, Jeon Keun Whan, Jeong Kyung Ja, Kim Kee Jung, and Ryu Keun Ho. 1994. Temporal Database Management Testbed. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 1, 1, (1994), 1-13. DOI: 10.3745/KIPSTE.1994.1.1.1.