
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Shashi K. Gadia, Sunil S. Nair, "Algebraic Identities and Query Optimization in a Parametric Model for Relational Temporal Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 10, no. 5, pp. 793807, September/October, 1998.  
BibTex  x  
@article{ 10.1109/69.729733, author = {Shashi K. Gadia and Sunil S. Nair}, title = {Algebraic Identities and Query Optimization in a Parametric Model for Relational Temporal Databases}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {10}, number = {5}, issn = {10414347}, year = {1998}, pages = {793807}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.729733}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Algebraic Identities and Query Optimization in a Parametric Model for Relational Temporal Databases IS  5 SN  10414347 SP793 EP807 EPD  793807 A1  Shashi K. Gadia, A1  Sunil S. Nair, PY  1998 KW  Relational algebra KW  algebraic optimization KW  temporal databases KW  query optimization KW  relational model. VL  10 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Abstract—This paper presents algebraic identities and algebraic query optimization for a parametric model for temporal databases. The parametric model has several features not present in the classical model. In this model, a key is explicitly designated with a relation, and an operator is available to change the key. The algebra for the parametric model is threesorted; it includes 1) relational expressions that evaluate to relations, 2) domain expressions that evaluate to time domains, and 3) Boolean expressions that evaluate to TRUE or FALSE. The identities in the parametric model are classified as weak identities and strong identities. Weak identities in this model are largely counterparts of the identities in classical relational databases. Rather than establishing weak identities from scratch, a meta inference mechanism, introduced in the paper, allows weak identities to be induced from their respective classical counterpart. On the other hand, the strong identities will be established from scratch. An algorithm is presented for algebraic optimization to transform a query to an equivalent query that will execute more efficiently.
[1] G. Bhargava and S.K. Gadia, "The Concept of an Error in a Database: An Application of Temporal Databases," Proc. INSDOC COMAD '90 Int'l Conf. Management of Data, Dec. 1990; also available as Technical Report No. TR9715, Computer Science Dept., Iowa State Univ., Ames, 1997.
[2] G. Bhargava and S.K. Gadia, "Relational Database Systems with Zero Information Loss," IEEE Trans. Knowledge and Data Eng., vol. 5, pp. 7687, 1993.
[3] G. Bhargava, P. Goel, and B. Iyer, "Hypergraph Based Reorderings of Outerjoin Queries with Complex Predicates," Proc. ACM SIGMOD Int'l Conf. Management of Data, 1995.
[4] G. Bhargava, P. Goel, and B. Iyer, "Efficient Processing of Outer Joins and Aggregate Functions," Proc. Third IEEE Int'l Conf. Data Eng., 1995.
[5] J. Clifford and A. Croker, "The Historical Data Model (HRDM) and Algebra Based on Lifespans," Proc. 11th IEEE Int'l Conf. Data Eng., 1995.
[6] R. Elmasri, G.T.J. Wuu, and Y.J. Kim, "The Time Index: An Access Structure for Temporal Data," Proc. VLDB Conf., pp. 112, 1990.
[7] S.K. Gadia, "Weak Temporal Relations," Proc. Fifth Ann. ACM SIGACTSIGMOD Symp. Principles of Database Systems, 1986.
[8] S.K. Gadia, "Toward A MultiHomogeneous Model for a Temporal Database," Proc. IEEE Int'l Conf. Data Eng., 1986.
[9] S.K. Gadia, "A Homogeneous Relational Model and Query Languages for Temporal Databases," ACM Trans. Database Systems, vol. 13, no. 4, pp. 418448, Dec. 1988.
[10] S.K. Gadia, "A Bibliography and Index of Our Works on Belief Data," Technical Report No. TR9713, Computer Science Dept., Iowa State Univ., Ames, 1997.
[11] S.K. Gadia and G. Bhargava, "A Formal Treatment of Errors and Updates in a Relational Database," 198889, unpublished manuscript available as Technical Report No. TR9714, Computer Science Dept., Iowa State Univ., Ames, 1997.
[12] S.K. Gadia and S. Nair, "Temporal Databases: A Prelude to Parametric Data," chapter in Temporal Databases: Theory, Design, and Implementation. BenjaminCummings, pp. 2866, 1993.
[13] S.K. Gadia, S. Nair, and Y. Poor, "Incomplete Information in Relational Temporal Databases," Proc. 18th Int'l Conf. Very Large Data Bases, pp. 395406, 1992.
[14] H. Gunadhi and A. Segev, "Efficient Indexing Methods for Temporal Relations," EEE Trans. Knowledge and Data Eng., vol. 5, pp. 496509, 1993.
[15] A. Guttman, “RTrees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Conf. Management of Data, 1984.
[16] S.K. Gadia and J.H. Vaishnav, "A Query Language for a Homogeneous Temporal Database," Proc. Fourth Ann. ACM SIGACTSIGMOD Symp. Principles of Database Systems, pp. 5156, 1985.
[17] S.K. Gadia and C.S. Yeung, “A Generalized Model for a Relational Temporal Database,” Proc. ACM SIGMOD Int'l Conf. Management of Data, 1988.
[18] S.K. Gadia and C.S. Yeung, "Inadequacy of Interval Timestamps in Temporal Databases," Information Sciences, vol. 54, pp. 122, 1991.
[19] C. Kolovson and M. Stonebraker, "Indexing Techniques for Historical Databases," Proc. IEEE Conf. Data Eng., pp. 127137, 1989.
[20] N.A. Lorentzos and R.G. Johnson, "Extending Relational Algebra to Manipulate Temporal Data," Information Systems, vol. 13, no. 3, pp. 289296, 1988.
[21] T.Y. Leung and R.R. Muntz, "Query Processing for Temporal Databases," Proc. IEEE Int'l Conf. Data Eng., 1990.
[22] D. Lomet and B. Salzberg, "TransactionTime Databases," chapter in Temporal Databases: Theory, Design, and Implementation, A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, eds., pp. 388417, 1993.
[23] L.E. McKenzie, Jr. and R.T. Snodgrass, “Evaluation of Relational Algebras Incorporating the Time Dimension in Databases,” ACM Computing Surveys, vol. 23, no. 4, pp. 501–543, 1991.
[24] S.B. Navathe and R. Ahmed, "A Temporal Relational Model and a Query Language," Information Sciences, vol. 49, pp. 147175, 1989.
[25] S. Nair and S.K. Gadia, "Algebraic Optimization in a Relational Model for Temporal Databases," Proc. First Int'l Conf. Information and Knowledge Management, pp. 169176, 1992.
[26] J.M. Smith and P.Y.T. Chang, "Optimizing the Performance of a Relational Algebra Database Interface," IEEE Trans. Software Eng., vol. 18, no. 10, pp. 568579, 1975.
[27] N. Sarda, "Algebra and Query Language for a Historical Data Model," The Computer J., vol. 33, no. 1, pp. 1118, Feb. 1990.
[28] M.H. Scholl, Theoretical Foundation of Algebraic Optimization Using Unnormalized Relations, Lecture Notes in Computer Science 243, 1986.
[29] A. Segev, "Join Processing and Optimization in Temporal Relational Databases," chapter in Temporal Databases: Theory, Design, and Implementation. BenjaminCummings, pp. 356387, 1993.
[30] R.T. Snodgrass, “The Temporal Query Language TQuel,” ACM Trans. Database Systems, vol. 12, no. 2, pp. 247–298, 1987.
[31] A.U. Tansel, "Adding Time Dimension to Relational Model and Extending Relational Algebra," Information Systems, vol. 11, no. 4, pp. 343355, 1986.
[32] A. Tansel et al. Temporal Databases: Theory, Design, and Implementation. Database Systems and Applications Series, Benjamin/Cummings, 1993.
[33] J.P. Tremblay and R. Manohar, Discrete Math. Structures with Applications to Computer Science. McGraw Hill, Computer Science Series, 1975.
[34] J.D. Ullman, Principles of Database and KnowledgeBase Systems, vol. II: The New Tech nologies. New York: Computer Science Press, 1989.