Skip to main content
SpringerLink
Log in
Book cover

International Conference on Scientific and Statistical Database Management

SSDBM 1990: Statistical and Scientific Database Management pp 131–147Cite as

A framework for query optimization in temporal databases

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 420))

Abstract

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 is evaluated.

This work was supported by the Applied Mathematical Sciences Research Program of the Office of Energy Research, U.S. Department of Energy under Contract DE-AC03-76SF00098.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adiba, M, Quang, N.B., Historical Multi-Media Databases, Proceedings of the International Conference on Very Large Databases, Aug. 1986, pp. 63–70.

    Google Scholar 

  2. Ahad, R., Rao, K.V.B., McLeod, D., On Estimating the Cardinality of the Projection of a Database Relation, ACM Transactions on Database Systems, 14, 1, Mar. 1989, pp. 28–40.

    Google Scholar 

  3. Ariav, G., A Temporally Oriented Data Model, ACM Transactions on Database Systems, 11, 4, Dec. 1986, pp. 499–527.

    Google Scholar 

  4. Christodoulakis, S., Estimating Record Selectivities, Information Systems, 8, 2, 1983, pp. 105–115.

    Google Scholar 

  5. Clifford, J., Croker, A., The Historical Relational Data Model (HRDM) and Algebra Based on Lifespans, Proceedings of the International Conference on Data Engineering, Feb. 1987, pp. 528–537.

    Google Scholar 

  6. Clifford, J., Tansel, A., On an Algebra for Historical Relational Databases: Two Views, Proceedings of ACM SIGMOD International Conference on Management of Data, May 1985, pp. 247–265.

    Google Scholar 

  7. Kolovson, C., Stonebraker, M., Indexing Techniques for Historical Databases, Proceedings of the International Conference on Data Engineering, Feb. 1989, pp. 127–139.

    Google Scholar 

  8. Gunadhi, H., Segev, A., Physical Design of Temporal Databases, Lawrence Berkeley Lab Technical Report LBL-24578, January 1988.

    Google Scholar 

  9. Lynch, C.A., Selectivity Estimation and Query Optimization in Large Databases with Highly Skewed Distribution of Column Values, Proceedings of the International Conference on Very Large Databases, Aug. 1988, pp. 240–251.

    Google Scholar 

  10. Lum, V., Dadam, P., Erbe, R., Guenauer, J., Pistor, P., Walch, G., Werner, H., Woodfill, J., Designing DBMS Support for the Temporal Dimension, Proceedings of ACM SIGMOD International Conference on Management of Data, Jun. 1984, pp. 115–130.

    Google Scholar 

  11. Mulakrishna, M., DeWitt, D.J., Equi-Depth Histograms for Estimating Selectivity Factors for Multi-Dimensional Queries, Proceedings of ACM SIGMOD International Conference on Management of Data, May 1988, pp. 28–36.

    Google Scholar 

  12. Klopproge, M.R., Lockemann, P.C., Modeling Information Preserving Databases: Consequences of the Concepts of Time, Proceedings of the International Conference on Very Large Databases, Aug. 1983, pp. 399–416.

    Google Scholar 

  13. Navathe, S., Ahmed, R., A Temporal Relational Model and a Query Language, UF-CIS Technical Report TR-85-16, Univ of Florida, April 1986.

    Google Scholar 

  14. Piatetsky-Shapiro, G., Connell, C., Accurate Estimation of the Number of Tuples Satisfying a Condition, Proceedings of the ACM SIGMOD International Conference on Management of Data, May 1984, pp. 256–276.

    Google Scholar 

  15. Rosenthal, A., Reiner, D., Extending the Algebraic Framework of Query Processing to Handle Outerjoins Proceedings of the International Conference on Very Large Databases, Aug. 1984, pp. 334–343.

    Google Scholar 

  16. Rotem, D., Segev, A., Physical Organization of Temporal Data, Proceedings of the International Conference on Data Engineering, Feb. 1987, pp. 547–553.

    Google Scholar 

  17. Segev, A., Gunadhi, H., Event-Join Optimization in Temporal Relational Databases, Proceedings of the International Conference on Very Large Databases, Aug. 1989. pp. 205–215.

    Google Scholar 

  18. Segev, A., Shoshani, A., Logical Modeling of Temporal Databases, Proceedings of ACM SIGMOD International Conference on Management of Data, May 1987, pp. 454–466.

    Google Scholar 

  19. Segev, A., and Shoshani, A., The Representation of a Temporal Data Model in the Relational Environment, Lecture Notes in Computer Science, Vol 339, M. Rafanelli, J.C. Klensin, and P. Svensson (eds.), Springer-Verlag, 1988, pp 39–61.

    Google Scholar 

  20. Segev, A., Shoshani, A., Functionality of Temporal Data Models and Physical Design Implementations, IEEE Data Engineering, 11, 4, Dec. 1988, pp. 38–45.

    Google Scholar 

  21. Selinger, P.G., Astrahan, M.M., Chamberlain, D.D., Lorie, R.A., Price, T.G., Access Path Selection in a Relational Database System, Proceedings of ACM SIGMOD International Conference on Management of Data, May 1979, pp.23–34.

    Google Scholar 

  22. Shoshani, A., Kawagoe, K., Temporal Data Management, Proceedings of the International Conference on Very Large Databases, Aug. 1986, pp. 79–88.

    Google Scholar 

  23. Snodgrass, R., The Temporal Query Language TQuel, ACM Transactions on Database Systems, Jun. 1987, pp. 247–298.

    Google Scholar 

  24. Snodgrass, R., Ahn, I., A Taxonomy of Time in Databases, Proceedings of ACM SIGMOD International Conference on Management of Data, May 1985, pp. 236–246.

    Google Scholar 

  25. Snodgrass, R., Ahn, I., Performance Analysis of Temporal Queries, TempIS Document No. 17, Department of Computer Science, University of North Carolina, August 1987.

    Google Scholar 

  26. S.B. Yao, Approximating Block Accesses in Database Organizations, Communications of the ACM, 20, 4, Apr. 1977, pp. 260–261.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Walter A. Haas School of Business, The University of California, USA

    Himawan Gunadhi & Arie Segev

  2. Computing Sciences Research and Development Department, Lawrence Berkeley Laboratory, 94720, Berkeley, California

    Himawan Gunadhi & Arie Segev

Authors
  1. Himawan Gunadhi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arie Segev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zbigniew Michalewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gunadhi, H., Segev, A. (1990). A framework for query optimization in temporal databases. In: Michalewicz, Z. (eds) Statistical and Scientific Database Management. SSDBM 1990. Lecture Notes in Computer Science, vol 420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52342-1_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-52342-1_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52342-0

  • Online ISBN: 978-3-540-46968-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation