A framework for query optimization in temporal databases

Conference · Wed Nov 01 04:00:00 EST 1989

DOI:https://doi.org/10.1007/3-540-52342-1_25· OSTI ID:6822667

Gunadhi, H; Segev, A ^[1]

---

1. Lawrence Berkeley Lab., CA (USA) California Univ., Berkeley, CA (USA). Walter A. Haas School of Business

We investigate issues pertaining to query processing of temporal databases in a relational environment. Tuple-versioning of relations is the adopted method of temporal data representation. New operators are necessary in order to exploit the richer semantics of temporal queries. We define four types of temporal joins-- theta-join, time intersection, time union and the event-join. Factors that affect processing strategies are discussed, especially the problem of estimating data selectivity for various temporal operations. Strategies for implementing the temporal equijoin operator are evaluated. 26 refs., 6 tabs.

• Research Organization: Lawrence Berkeley Lab., CA (USA)
• Sponsoring Organization: DOE/ER
• DOE Contract Number: AC03-76SF00098
• OSTI ID: 6822667
• Report Number(s): LBL-26417; CONF-9004206--1; ON: DE90011339
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990300* -- Information Handling
DATA BASE MANAGEMENT
MANAGEMENT
MATHEMATICAL MODELS
OPTIMIZATION