Managing Temporal Data

Author(s):  
Abdullah Uz Tansel

In general, databases store current data. However,the capability to maintain temporal data is a crucial requirement for many organizations and provides the base for organizational intelligence. A temporal database maintains time-varying data, that is, past, present, and future data. In this chapter, we focus on the relational data model and address the subtle issues in modeling and designing temporal databases. A common approach to handle temporal data within the traditional relational databases is the addition of time columns to a relation. Though this appears to be a simple and intuitive solution, it does not address many subtle issues peculiar to temporal data, that is, comparing database states at two different time points, capturing the periods for concurrent events and accessing times beyond these periods, handling multi-valued attributes, coalescing and restructuring temporal data, and so forth, [Gadia 1988, Tansel and Tin 1997]. There is a growing interest in temporal databases. A first book dedicated to temporal databases [Tansel at al 1993] followed by others addressing issues in handling time-varying data [Betini, Jajodia and Wang 1988, Date, Darwen and Lorentzos 2002, Snodgrass 1999].

2011 ◽  
pp. 1461-1469
Author(s):  
Abdullah Uz Tansel

In general, databases store current data. However,the capability to maintain temporal data is a crucial requirement for many organizations and provides the base for organizational intelligence. A temporal database maintains time-varying data, that is, past, present, and future data. In this chapter, we focus on the relational data model and address the subtle issues in modeling and designing temporal databases. A common approach to handle temporal data within the traditional relational databases is the addition of time columns to a relation. Though this appears to be a simple and intuitive solution, it does not address many subtle issues peculiar to temporal data, that is, comparing database states at two different time points, capturing the periods for concurrent events and accessing times beyond these periods, handling multi-valued attributes, coalescing and restructuring temporal data, and so forth, [Gadia 1988, Tansel and Tin 1997]. There is a growing interest in temporal databases. A first book dedicated to temporal databases [Tansel at al 1993] followed by others addressing issues in handling time-varying data [Betini, Jajodia and Wang 1988, Date, Darwen and Lorentzos 2002, Snodgrass 1999].


Author(s):  
Abdullah Uz Tansel

Databases in general store current data. However, the capability to maintain temporal data is a crucial requirement for many organizations and provides the base for organizational intelligence. A temporal database has a time dimension and maintains time-varying data (i.e., past, present, and future data). In this article, we focus on the relational data model and address the subtle issues in modeling temporal data, such as comparing database states at two different time points, capturing the periods for concurrent events, and accessing to times beyond these periods, handling multivalued attributes, coalescing, and restructuring temporal data (Gadia 1988, Tansel & Tin, 1997). Many extensions to the relational data model have been proposed for handling temporal data.


1994 ◽  
Vol 33 (04) ◽  
pp. 358-370 ◽  
Author(s):  
A. K. Das ◽  
M. A. Musen

Abstract:Chronus is a query system that supports temporal extensions to the Structured Query Language (SQL) for relational databases. Although the relational data model can store time-stamped data and can permit simple temporal-comparison operations, it does not provide either a closed or a sufficient algebra for manipulating temporal data. In this paper, we outline an algebra that maintains a consistent relational representation of temporal data and that allows the type of temporal queries needed for protocol-directed decision support. We also discuss how Chronus can translate between our temporal algebra and the relational algebra used for SQL queries. We have applied our system to the task of screening patients for clinical trials. Our results demonstrate that Chronus can express sufficiently all required temporal queries, and that the search time of such queries is similar to that of standard SQL.


2014 ◽  
Vol 5 (1) ◽  
Author(s):  
Juanda Hakim Lubis

Abstract. At present, many applications require data from the past and the future. These data are usually used to trace the events that happened to look at trends and find the mistakes in the past so as to prevent the occurrence of the same mistakes. Temporal database is one of the solutions to handling data in the past and future. Temporal database is a database with data representing the valid time dimension. The use of this valid time shows aspects of the historical data because the data will be recorded in accordance with real-world from the beginning until the end of the validity of the data. This research implements temporal databases and relational databases that take the historical aspects of the data into consideration in order to measure the effectiveness of each database. Keywords: Temporal Database, relational database, valid time, historical data, response time. Abstrak. Pada saat ini banyak aplikasi yang membutuhkan data dari masa lampau dan data pada masa yang akan datang. Data-data ini biasanya digunakan untuk menelusuri event-event yang terjadi untuk melihat trend dan menemukan kesalahan-kesalahan di masa lampau sehingga mencegah terjadinya kesalahan yang sama. Temporal Database merupakan salah satu solusi dalam penanganan data-data di masa lampau maupun di masa yang akan datang. Temporal database adalah database yang merepresentasikan data dengan dimensi waktu berupa valid time. Penggunaan valid time ini dapat memperlihatkan aspek historical data karena suatu data akan dicatat sesuai dengan waktu real world baik dari dimulai sampai akhir keberlakuan data. Penelitian ini, melakukan analisis temporal database serta relational database yang memperhitungkan aspek historical data untuk mengukur keefektifan penggunaan masing-masing basis data. Kata kunci: Temporal Database, relational database, valid time, historical data, response time.


Author(s):  
Elzbieta Malinowski ◽  
Esteban Zimányi

Data warehouses integrate data from different source systems to support the decision process of users at different management levels. Data warehouses rely on a multidimensional view of data usually represented as relational tables with structures called star or snowflake schemas. These consist of fact tables, which link to other relations called dimension tables. A fact table represents the focus of analysis (e.g., analysis of sales) and typically includes attributes called measures. Measures are usually numeric values (e.g., quantity) used for performing quantitative evaluation of different aspects in an organization. Measures can be analyzed according to different analysis criteria or dimensions (e.g., store dimension). Dimensions may include hierarchies (e.g., month-year in the time dimension) for analyzing measures at different levels of detail. This analysis can be done using on-line analytical processing (OLAP) systems, which allow dynamic data manipulations and aggregations. For example, the roll-up operation transforms detailed measures into aggregated data (e.g., daily into monthly or yearly sales) while the drill-down operations does the contrary. Multidimensional models include a time dimension indicating the timeframe for measures, e.g., 100 units of a product were sold in March 2007. However, the time dimension cannot be used to keep track of changes in other dimensions, e.g., when a product changes its ingredients. In many cases the changes of dimension data and the time when they have occurred are important for analysis purposes. Kimball and Ross (2002) proposed several implementation solutions for this problem in the context of relational databases, the so-called slowly-changing dimensions. Nevertheless, these solutions are not satisfactory since either they do not preserve the entire history of data or are difficult to implement. Further, they do not consider the research realized in the field of temporal databases. Temporal databases are databases that support some aspects of time (Jensen & Snodgrass, 2000). This support is provided by means of different temporality types1, to which we refer in the next section. However, even though temporal databases allow to represent and to manage time-varying information, they do not provide facilities for supporting decision-making process when aggregations of high volumes of historical data are required. Therefore, a new field called temporal data warehouses joins the research achievements of temporal databases and data warehouses in order to manage time-varying multidimensional data.


Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1478
Author(s):  
Penugonda Ravikumar ◽  
Palla Likhitha ◽  
Bathala Venus Vikranth Raj ◽  
Rage Uday Kiran ◽  
Yutaka Watanobe ◽  
...  

Discovering periodic-frequent patterns in temporal databases is a challenging problem of great importance in many real-world applications. Though several algorithms were described in the literature to tackle the problem of periodic-frequent pattern mining, most of these algorithms use the traditional horizontal (or row) database layout, that is, either they need to scan the database several times or do not allow asynchronous computation of periodic-frequent patterns. As a result, this kind of database layout makes the algorithms for discovering periodic-frequent patterns both time and memory inefficient. One cannot ignore the importance of mining the data stored in a vertical (or columnar) database layout. It is because real-world big data is widely stored in columnar database layout. With this motivation, this paper proposes an efficient algorithm, Periodic Frequent-Equivalence CLass Transformation (PF-ECLAT), to find periodic-frequent patterns in a columnar temporal database. Experimental results on sparse and dense real-world and synthetic databases demonstrate that PF-ECLAT is memory and runtime efficient and highly scalable. Finally, we demonstrate the usefulness of PF-ECLAT with two case studies. In the first case study, we have employed our algorithm to identify the geographical areas in which people were periodically exposed to harmful levels of air pollution in Japan. In the second case study, we have utilized our algorithm to discover the set of road segments in which congestion was regularly observed in a transportation network.


Author(s):  
D. J. RANDALL ◽  
H. J. HAMILTON ◽  
R. J. HILDERMAN

This paper addresses the problem of using domain generalization graphs to generalize temporal data extracted from relational databases. A domain generalization graph associated with an attribute defines a partial order which represents a set of generalization relations for the attribute. We propose formal specifications for domain generalization graphs associated with calendar (date and time) attributes. These graphs are reusable (i.e. can be used to generalize any calendar attributes), adaptable (i.e. can be extended or restricted as appropriate for particular applications), and transportable (i.e. can be used with any database containing a calendar attribute).


Author(s):  
F.O. de Franca ◽  
L.C.T. Gomes ◽  
L.N. de Castro ◽  
F.J. von Zuben
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document