Academic
Publications
Event-Join Optimization in Temporal Relational Databases

Event-Join Optimization in Temporal Relational Databases,Arie Segev,Himawan Gunadhi

Event-Join Optimization in Temporal Relational Databases   (Citations: 42)
BibTex | RIS | RefWorks Download
An Event-Join combines temporal join and outer- join properties into a single operation. It is mostly used to group temporal attributes of an entity into a single relation. In this paper, we motivate the need to support the efficient processing of event-joins, and introduce several optimization algorithms, both for a general data organization and for specialized organizations (sorted and append-only databases). For the append-only data- base we introduce a data structure that can improve the performance of event-joins as well as other queries. Finally, we evaluate the performance of the proposed algorithms. 1. INTRODUCTION AND MOTIVATION
Conference: Very Large Data Bases - VLDB , pp. 205-215, 1989
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...The previous operators considered include Cartesian product, Θ-JOIN, EQUIJOIN, NATURAL JOIN, TIME JOIN [6,7], TE JOIN, TE OUTERJOIN, and EVENT JOIN [20,46,47,52] and those based on Allen’s [1] interval relations ([27,28,36])...
    • ...The temporal Cartesian product was first defined by Segev and Gunadhi [20,47]...
    • ...A specialized operator, the TE-join, was developed independently by Segev and Gunadhi [47]...
    • ...They defined a specialized version of the temporal outerjoin called the EVENT JOIN [47]...
    • ...Cartesian product [7] Outer Cartesian product None EQUIJOIN [6] Equijoin None GTE-join [56] Equijoin 2, 3 INTERVAL JOIN [2] Cartesian product None NATURAL JOIN [6] Natural join None TIME JOIN [6] Cartesian product 1 T-join [20] Cartesian product None TE-JOIN [47] Equijoin 2 TE-OUTERJOIN [47] Left outerjoin 2 EVENT JOIN [47] Outerjoin 2 Θ-JOIN [6] Theta join None Valid-time theta join [53] Theta join None Valid-time left join [53] Left ...
    • ...Cartesian product [7] Outer Cartesian product None EQUIJOIN [6] Equijoin None GTE-join [56] Equijoin 2, 3 INTERVAL JOIN [2] Cartesian product None NATURAL JOIN [6] Natural join None TIME JOIN [6] Cartesian product 1 T-join [20] Cartesian product None TE-JOIN [47] Equijoin 2 TE-OUTERJOIN [47] Left outerjoin 2 EVENT JOIN [47] Outerjoin 2 Θ-JOIN [6] Theta join None Valid-time theta join [53] Theta join None Valid-time left join [53] Left ...
    • ...Cartesian product [7] Outer Cartesian product None EQUIJOIN [6] Equijoin None GTE-join [56] Equijoin 2, 3 INTERVAL JOIN [2] Cartesian product None NATURAL JOIN [6] Natural join None TIME JOIN [6] Cartesian product 1 T-join [20] Cartesian product None TE-JOIN [47] Equijoin 2 TE-OUTERJOIN [47] Left outerjoin 2 EVENT JOIN [47] Outerjoin 2 Θ-JOIN [6] Theta join None Valid-time theta join [53] Theta join None Valid-time left join [53] Left ...
    • ...Like the EJ-1 algorithm described in the previous section, Segev and Gunadhi developed their algorithm, EJ-2, for the EVENT JOIN [47,20] (Table 1)...
    • ...Segev and Gunadhi modified the traditional merge-join algorithm to support the T-join and the temporal equijoin [47, 20]...
    • ...3.3.1 [20,47]. In particular, our algorithm computes only the valid-time equijoin, while EJ-2 computes the valid-time outerjoin, which includes the equijoin in the form of the valid-time natural join...

    Dengfeng Gaoet al. Join operations in temporal databases

    • ...Similar optimizations for insertions in ascending order were incorporated in the AP-tree [SG89] in the context of temporal databases...

    Reinhard Braumandlet al. Functional-Join Processing

    • ...Query processing is the most critical problem for the PMTV approach because it requires EVENT-JOIN [19,20], which includes Temporal-NATURALJOIN and Temporal-OUTERJOIN and these are the most expensive operations in temporal databases...
    • ...Entity-Join [19] (referred as Event-Join in [20]) joins together a temporal object that has been vertically partitioned into several relations via temporal normalization [13]...
    • ...Several algorithms and implementation methods have been proposed for single time dimension entity-join [19,20,25]...
    • ...Here we adopt and extend the algorithm of sort-merge entity join from [20] because it is easy to present and understand...
    • ...The equivalence of the afterwards update operations to the new tables version(s) for these two approaches has been recognized and can be found in [20]...
    • ...Entity-Join [19] (referred as Event-Join in [20]) joins together a temporal object that is vertically partitioned into several relations via time normalization [13]...

    Han-chieh Weiet al. PMTV: A Schema Versioning Approach for Bi-Temporal Databases

    • ...Entity-Join [25] (referred as Event-Join in [26]) joins together a temporal object that has been vertically partitioned into several relations via temporal normalization [18]...
    • ...PMTV approaches. The equivalence of the afterwards update operations to the new tables version(s) for these two approaches has been recognized and can be found in [26]...
    • ...Many join techniques have been well developed for snapshot relational databases [13], and some were extended to implement temporal joins [7,21,26,27]...
    • ...In [26,27], partition join is used to process the Entity-join operation and both give good results...

    Han-Chieh Weiet al. Schema versioning and database conversion techniques for bi-temporal d...

    • ...Various methods have been proposed to solve the “*/-/point” query [9], [14], [22], [30], [35], [36]...

    Anil Kumaret al. Designing Access Methods for Bitemporal Databases

Sort by: