Snapshot Semantics for Temporal Multiset Relations (Extended Version)

Snapshot semantics is widely used for evaluating queries over temporal data: temporal relations are seen as sequences of snapshot relations, and queries are evaluated at each snapshot. In this work, we demonstrate that current approaches for snapshot semantics over interval-timestamped multiset relations are subject to two bugs regarding snapshot aggregation and bag difference. We introduce a novel temporal data model based on K-relations that overcomes these bugs and prove it to correctly encode snapshot semantics. Furthermore, we present an efficient implementation of our model as a database middleware and demonstrate experimentally that our approach is competitive with native implementations and significantly outperforms such implementations on queries that involve aggregation.Comment: extended version of PVLDB pape

Generalized Lineage-Aware Temporal Windows: Supporting Outer and Anti Joins in Temporal-Probabilistic Databases

The result of a temporal-probabilistic (TP) join with negation includes, at each time point, the probability with which a tuple of a positive relation ${\bf p}$ matches none of the tuples in a negative relation ${\bf n}$, for a given join condition $\theta$. TP outer and anti joins thus resemble the characteristics of relational outer and anti joins also in the case when there exist time points at which input tuples from ${\bf p}$ have non-zero probabilities to be $true$ and input tuples from ${\bf n}$ have non-zero probabilities to be $false$, respectively. For the computation of TP joins with negation, we introduce generalized lineage-aware temporal windows, a mechanism that binds an output interval to the lineages of all the matching valid tuples of each input relation. We group the windows of two TP relations into three disjoint sets based on the way attributes, lineage expressions and intervals are produced. We compute all windows in an incremental manner, and we show that pipelined computations allow for the direct integration of our approach into PostgreSQL. We thereby alleviate the prevalent redundancies in the interval computations of existing approaches, which is proven by an extensive experimental evaluation with real-world datasets

Benchmarking bitemporal database systems: ready for the future or stuck in the past?

Abstract. Introduction: Many strategic investments are often justified with the argument that they will create synergy. For holding mining establishment the goal was more on how to increase business capacity and funding, management of natural resources of mineral and coal, increase value added through downstream and increase local content, as well as cost efficiency through synergy. This paper aims to find the value of synergy in Inalum, PTBA, ANTM and TINS before establishment holding company of mining and the sensitivity the value to different assumptions and how to improve value of synergy in creating a holding company of mining. The major aims of mining holding company to create value and synergy in mining State-Owned Enterprises, with the expectation, it will increase revenue contribution to the country. These goals could be analyzed and measured by understanding of synergy based on two sources of synergies: operating synergy and financial synergy. This paper will assess operating synergy. Methods: In this valuation, Discounted Cash Flow (DCF) Framework will be used to recognize the potential source of synergy from operation. Results: This study found that gain from operation synergy of increasing growth and cost reduction will maximize the business value amounted USD 3,659,295.63, compared to gain from cost reduction USD -14,181,427.91  and gain from increasing growth USD 644,448.44. Conclusion: Given the results from study, it is important to derive the right strategy from investment decision to reflect the optimal source of synergy in order to maximize the business value in Inalum. Keywords:  DCF, investing decision, maximize business value, value of synerg

An Exploratory Data Analysis Approach for Land Use-Transportation Interaction: The Design and Implementation of Transland Spatio-Temporal Data Model

Land use and transportation interaction is a complex and dynamic process. Many models have been used to study this interaction during the last several decades. Empirical studies suggest that land use and transportation patterns can be highly variable between geographic areas and at different spatial and temporal scales. Identifying these changes presents a major challenge. When we recognize that long-term changes could be affected by other factors such as population growth, economic development, and policy decisions, the challenge becomes even more overwhelming. Most existing land use and transportation interaction models are based on some prior theories and use mathematical or simulation approaches to study the problem. However, the literature also suggests that little consensus regarding the conclusions can be drawn from empirical studies that apply these models. There is a clear research need to develop alternative methods that will allow us to examine the land use and transportation patterns in more flexible ways and to help us identify potential improvements to the existing models. This dissertation presents a spatio-temporal data model that offers exploratory data analysis capabilities to interactively examine the land use and transportation interaction at use-specified spatial and temporal scales. The spatio-temporal patterns and the summary statistics derived from this interactive exploratory analysis process can be used to help us evaluate the hypotheses and modify the structures used in the existing models. The results also can suggest additional analyses for a better understanding of land use and transportation interaction. This dissertation first introduces a conceptual framework for the spatio-temporal data model. Then, based on a systematic method for explorations of various data sets relevant to land use and transportation interaction, this dissertation details procedures of designing and implementing the spatio-temporal data model. Finally, the dissertation describes procedures of creating tools for generating the proposed spatio-temporal data model from existing snapshot GIS data sets and illustrate its use by means of exploratory data analysis. Use of the spatio-temporal data model in this dissertation study makes it feasible to analyze spatio-temporal interaction patterns in a more effective and efficient way than the conventional snapshot GIS approach. Extending Sinton’s measurement framework into a spatio-temporal conceptual interaction framework, on the other hand, provides a systematic means of exploring land use and transportation interaction. Preliminary experiments of data collected for Dade County (Miami), Florida suggest that the spatio-temporal exploratory data analysis implemented for this dissertation can help transportation planners identify and visualize interaction patterns of land use and transportation by controlling the spatial, attribute, and temporal components. Although the identified interaction patterns do not necessarily lead to rules that can be applied to different areas, they do provide useful information for transportation modelers to re-evaluate the current model structure to validate the existing model parameter

Leveraging range joins for the computation of overlap joins

Joins are essential and potentially expensive operations in database management systems. When data is associated with time periods, joins commonly include predicates that require pairs of argument tuples to overlap in order to qualify for the result. Our goal is to enable built-in systems support for such joins. In particular, we present an approach where overlap joins are formulated as unions of range joins, which are more general purpose joins compared to overlap joins, i.e., are useful in their own right, and are supported well by B+-trees. The approach is sufficiently flexible that it also supports joins with additional equality predicates, as well as open, closed, and half-open time periods over discrete and continuous domains, thus offering both generality and simplicity, which is important in a system setting. We provide both a stand-alone solution that performs on par with the state-of-the-art and a DBMS embedded solution that is able to exploit standard indexing and clearly outperforms existing DBMS solutions that depend on specialized indexing techniques. We offer both analytical and empirical evaluations of the proposals. The empirical study includes comparisons with pertinent existing proposals and offers detailed insight into the performance characteristics of the proposals

Leveraging range joins for the computation of overlap joins

Joins are essential and potentially expensive operations in database management systems. When data is associated with time periods, joins commonly include predicates that require pairs of argument tuples to overlap in order to qualify for the result. Our goal is to enable built-in systems support for such joins. In particular, we present an approach where overlap joins are formulated as unions of range joins, which are more general purpose joins compared to overlap joins, i.e., are useful in their own right, and are supported well by B+-trees. The approach is sufficiently flexible that it also supports joins with additional equality predicates, as well as open, closed, and half-open time periods over discrete and continuous domains, thus offering both generality and simplicity, which is important in a system setting. We provide both a stand-alone solution that performs on par with the state-of-the-art and a DBMS embedded solution that is able to exploit standard indexing and clearly outperforms existing DBMS solutions that depend on specialized indexing techniques. We offer both analytical and empirical evaluations of the proposals. The empirical study includes comparisons with pertinent existing proposals and offers detailed insight into the performance characteristics of the proposals

Enabling instant- and interval-based semantics in multidimensional data models: the T+MultiDim Model

Time is a vital facet of every human activity. Data warehouses, which are huge repositories of historical information, must provide analysts with rich mechanisms for managing the temporal aspects of information. In this paper, we (i) propose T+MultiDim, a multidimensional conceptual data model enabling both instant- and interval-based semantics over temporal dimensions, and (ii) provide suitable OLAP (On-Line Analytical Processing) operators for querying temporal information. T+MultiDim allows one to design typical concepts of a data warehouse including temporal dimensions, and provides one with the new possibility of conceptually connecting different temporal dimensions for exploiting temporally aggregated data. The proposed approach allows one to specify and to evaluate powerful OLAP queries over information from data warehouses. In particular, we define a set of OLAP operators to deal with interval-based temporal data. Such operators allow the user to derive new measure values associated to different intervals/instants, according to different temporal semantics. Moreover, we propose and discuss through examples from the healthcare domain the SQL specification of all the temporal OLAP operators we define. (C) 2019 Elsevier Inc. All rights reserved

Query Results over Ongoing Databases that Remain Valid as Time Passes By (Extended Version)

Ongoing time point now is used to state that a tuple is valid from the start point onward. For database systems ongoing time points have far-reaching implications since they change continuously as time passes by. State-of-the-art approaches deal with ongoing time points by instantiating them to the reference time. The instantiation yields query results that are only valid at the chosen time and get invalidated as time passes by. We propose a solution that keeps ongoing time points uninstantiated during query processing. We do so by evaluating predicates and functions at all possible reference times. This renders query results independent of a specific reference time and yields results that remain valid as time passes by. As query results, we propose ongoing relations that include a reference time attribute. The value of the reference time attribute is restricted by predicates and functions on ongoing attributes. We describe and evaluate an efficient implementation of ongoing data types and operations in PostgreSQL.Comment: Extended version of ICDE pape