Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

Extending the relational algebra to support transaction time

Published: 01 December 1987 Publication History

Abstract

In this paper we discuss extensions to the conventional relational algebra to support transaction time. We show that these extensions are applicable to historical algebras that support valid time, yielding a temporal algebraic language. Since transaction time concerns the storage of information in the database, the notion of state is central. The extensions are formalized using denotational semantics. The additions preserve the useful properties of the conventional relational algebra.

References

[1]
Ablteboul, S and V Vlanu Traasactwns and Integrity Constraznts, xn Proceedzngs of the A CM Sympossum on Prmczples of Database Systems, 1985, pp 193-204
[2]
Ablteboul, S and V Vxanu Dec,dsn9 Propert,es of Transactwnal Schemas, m Proceedznos of the A CM Sympos,um on Prtncsples of Database Systems, 1986, pp 235-239
[3]
Ablteboul, S and V Vlanu A Transactwn Language Complete for Database Update and Spec#ficatgon, m Proceed- :ngs of the A CM Symposzum on Pr,nczples of Database Systems, San Diego, CA Mar 1987
[4]
Ben-Zvl, J The Tgme Relatwnal Model PhD Dtss UCLA, 1982
[5]
Bernstem, PA, V Hadzflacos and N Goodman Concurrency Control and Recovery,n Database Systems Addison-Wesley Series m Computer Science Addison-Wesley, 1987
[6]
Bontempo, C J Feature Analys#s of Query-By-Example, m Relational Database Systems New York Sprmger-Verlag, 1983 pp 409-433
[7]
Brodle, M On Modelhng Behaworal Semant,cs of Databases, m Proceed, ngs of the Conference on Very Large Databases, Cannes, France Sup 1981, pp 32-42
[8]
Cen, S, G Pelagattl and G Braccht Structured Methodology for Des,gmng Stat, c and Dynam,c Aspects of Data Base A pphcatzons Informatwn Systems, 6, No 1 (1981), pp 31-45
[9]
Chandra, A K and D Harel Computable Quemes for Relational Data Bases Journal of Computer and Systems Scsence, 21, No 2, Oct 1980, pp 156-178
[10]
Chfford, J and A Croker The H, stomcal Data Model (HRDM) and Algebra Based on Ltfespans, m Proceedsngs of the Internatwnal Conference on Data Engtneemng, IEEE Computer Socxety Los Angeles, CA Feb 1987
[11]
Codd, E F A Relatwnal Model of Data for Large Shared Data Bank Commun,catzons of the Assoczatzon of Computzng Machinery, 13, No 6, June 1970, pp 377-387
[12]
Gadla, S K A Homogeneous Relational Model and Query Languages for Temporal Databases 1984 (Submitted for pubhcatmn )
[13]
Gadla, S K Toward a Multthomogeneous Model .for a Temporal Database, m Proceedsngs of the International Conference on Data Eng, neer, ng, IEEE Computer Socxety Los Angeles, CA IEEE Computer Socxety Press, Feb 1986, pp 390-397
[14]
Gordon, Michael J C The Denotat#onal Descmptwn of Programming Languages New York-Heldelberg-Berhn Sprmger-Verlag, 1979
[15]
Hammer, M and D McLeod Database Descrzptwn #th SDM A Semantsc Database Model A CM Transact, ons on Database Systems, 6, No 3, Sep 1981, pp 351-386
[16]
Held, G D, M Stonebraker and E Wong INGRES-A Relatwnal Data Base Management System Proceed, ngs of the AFIPS 1975 Natzonal Computer Conference, 44, May 1975, pp 409-416
[17]
Jones, S, P Mason and R Stamper LEGOL F. 0 A Relatsonal Specsficatson Language for Complex Rules Informatson Systems, 4, No 4, Nov 1979, pp 293-305
[18]
Mamr, D The Theory of Relatwnal Databases Rockvflle, MD Computer Science Press, 1983
[19]
McKenzle, E and R Snodgrass Scheme Evolutzon and the Relatsonal Algebra Techmcal Report TR87-003 Computer Scxence Department, Umvermty of North Carolina at Chapel Hill Mar 1987
[20]
McKenzle, E and R Snodgrass Support:ng Vahd T:me Aa Hsstorseal Algebra and Evahtat,on Techmcal Report TR87-008 Computer Scxence Department, Unlvermty of North Carohna at Chapel Hffi Apr 1987
[21]
Navathe, S B and R Ahmed A Temporal Relat,onal Model and a Query Language UF-CIS Techmcal Report TR-85-16 Computer and Informatmn Sciences Department, Umverstty of Flomda Apt 1986
[22]
Overmyer, R and M Stonebraker Implementatwn of a T#me Expert sn a Database System A CM SIGMOD Record, 12, No 3, Apr 1982, pp 51-59
[23]
Reed, D P Implementing Atom, c Actsons on Decentrahzed Data A CM Transactwns on Computer Systems, 1, No 1, Feb 1983, pp 3-23
[24]
Rosenkrantz, D J, R E Stearns and P M Lewis System Level Concurrency Control for Distributed Database Systems A UM Transactwns on Database Systems, 3, No 2, June 1978, pp 178-198
[25]
Smith, JM and P Y-J Chang Optzmtzmg the Performance of a Relational Algebra Database Interface Communications of the Assoc,atwn of Computsng Machinery, 18, No 10, Oct 1975, pp 568-579
[26]
Snodgrass, R and I Ahn A Taxonomy of Tsme sn Databases, m Proceedsngs of ACM SIGMOD Internatwnal Conference on Management of Data, Ed S Navathe Association for Computing Machinery Austin, TX May 1985, pp 236-246
[27]
Snodgrass, R and I Ahn Temporal Databases IEEE Computer, 19, No 9, Sup 1986, pp 35-42
[28]
Snodgrass, R The Temporal Query Language TQuel A CM Transaetwns on Database Systems (to appear), 12, No 2, June 1987
[29]
Stearns, R E, P M Lew# and D J Rosenkrantz Concurrency Control for Database Systems, m Proceedings of the 17th Sympossum on Foundatsons of Computer Scsenee, IEEE 1976, pp 19-32
[30]
Stonebraker, M and L A Rowe The Design o{ POSTGRES, m Proceedmgs of A UM SIGMOD Internatsonal Conference on Management of Data, Ed C Zanlolo Association for Computing Machinery Washington, DC May 1986, pp 340-355
[31]
Stoy, Joseph E Denotatsonal Semantses The Seott-Strachey Approach to Programmsng Language Theory The MIT Series m Computer Science The MIT Press, 1977
[32]
Tandem Computers, Inc ENFORM Reference Manual Cupertino, CA, 1983
[33]
Tansel, A U Adding Tsme Dzmenston to Relatwnal Model and Eztendmg Relatwnal Algebra Informatwn Systems, 11, No 4 (1986), pp 343-355
[34]
Vxanu, V Dynarasc Constraints and Database E#olutwn, m Proceeding of the ACM SIGAct-SIGMod Symposzurn on Prsncsples of Database Systems, Assoclahon for Computing Machinery Atlanta, GA Mar. 1983, pp 389- 399

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1987
Published in SIGMOD Volume 16, Issue 3

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)62
  • Downloads (Last 6 weeks)18
Reflects downloads up to 16 Oct 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media