
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
K.C. Liu, R. Sunderraman, "A Generalized Relational Model for Indefinite and Maybe Information," IEEE Transactions on Knowledge and Data Engineering, vol. 3, no. 1, pp. 6577, March, 1991.  
BibTex  x  
@article{ 10.1109/69.75890, author = {K.C. Liu and R. Sunderraman}, title = {A Generalized Relational Model for Indefinite and Maybe Information}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {3}, number = {1}, issn = {10414347}, year = {1991}, pages = {6577}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.75890}, 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  A Generalized Relational Model for Indefinite and Maybe Information IS  1 SN  10414347 SP65 EP77 EPD  6577 A1  K.C. Liu, A1  R. Sunderraman, PY  1991 KW  indefinite information; generalized relational model; maybe information; data structure; Mtable; Rprojection; merge; data structures; relational databases VL  3 JA  IEEE Transactions on Knowledge and Data Engineering ER   
A generalized relational model which is capable of representing and manipulating disjunctive and maybe kinds of information is presented. A data structure, called Mtable, is defined, and the information contained in the Mtable is precisely stated. Redundant information in Mtables is characterized, and an operator to remove this redundant information is presented. The relational algebra is suitably generalized to deal with Mtables. Additional operators, Rprojection and merge, are presented. Queries can be expressed as a combination of the various generalized relational algebraic operators. The Mtable accurately models the two bounds on the external interpretation of a query. The sure component of an Mtable corresponds to one of the bounds which is the set of objects which belong to the external interpretation of the query. The maybe component of an Mtable corresponds to the other bound which is the set of objects for which the possibility of belonging to the external interpretation of the query cannot be ruled out.
[1] S. Abiteboul and G. Grahne, "Update semantics for incomplete information," inProc. 11th Int. Conf. Very Large Data Bases, Stockholm, 1985, pp. 112.
[2] S. Abiteboul and V. Vianu, "Transactions in relational databases," inProc. 4th Int. Conf. Very Large Data Bases, Singapore, Aug. 1984.
[3] ANSI/X3/SPARC, "Study group on data base management systems,"ACM SIGMOD Rec., vol. 7, no. 2, 1975.
[4] F. Bancilhon and N. Spyratos, "Update semantics of relational views,"ACM Trans. Database Syst., vol. 6, no. 4, pp. 557575, Dec. 1981.
[5] J. Biskup, "A formal approach to null values in database relations," inAdvances in Database Theory, Vol. 1, H. Gallaire, J. Minker, and J.M. Nicolas, Eds. New York: Plenum, 1981, pp. 299341.
[6] J. Biskup, "A foundation of Codd's relational maybe operations,"ACM Trans. Database Syst., vol. 8, pp. 608636, Dec. 1983.
[7] J. Biskup, "Extending the relational algebra for relations with maybe tuples and existential and universal null values,"Fundamenta Informaticae, vol. VII, no. 1, pp. 129150, 1984.
[8] E. F. Codd, "A relational model of data for large shared data banks,"Commun. ACM, pp. 377387, June 1970.
[9] E.F. Codd, "Understanding relations," Installment #7, FDT Bulletin of ACM Record, vol. 7, no. 2, pp. 2328, Dec. 1975.
[10] E. F. Codd, "Extending the relational database model to capture more meaning,"ACM Trans. Database Syst., vol. 4, no. 4, pp. 397434, Dec. 1979.
[11] R. Fagin, J. D. Ullman, and M. Vardi, "On the semantics of updates in databases," inProc. ACM SIGACTSIGMOD Symp. Principles Database Syst., Atlanta, GA, 1983, pp. 352365.
[12] H. Gallaire, J. Minker, and J. Nicolas, "Logic and databases: A deductive approach,"ACM Comput. Surveys, vol. 16, pp. 153185,1984.
[13] J. Grant, "Null values in a relational database,"Inform. Processing Lett., vol. 6, no. 5, pp. 156157, Oct. 1977.
[14] J. Grant, "Partial values in a tabular database model,"Inform. Processing Lett., vol. 9, no. 2, pp. 9799, Aug. 1979.
[15] J. Grant, "Incomplete information in a relational database,"Fundamenta Informaticae, vol. III, no. 3, pp. 363378, 1980.
[16] T. Imielinski, "On algebraic query processing in logical databases," inAdvances in Database Theory, Vol. 2, H. Gallaire, J. Minker, and J.M. Nicolas, Eds. New York: Plenum, 1984, pp. 285318.
[17] T. Imielinski and W. Lipski, "On representing incomplete information in a relational database," inProc. 7th Int. Conf. Very Large Data Bases, Cannes, France, Sept. 1981, pp. 389397.
[18] T. Imielinski and W. Lipski, "Incomplete information and dependencies in relational databases," inProc. ACM SIGMOD Conf. Data Management, San Jose, CA, May 1983, pp. 178184.
[19] T. Imielinski and W. Lipski, "Incomplete Information in Relational Databases,"J. ACM, Vol. 31, No. 4, Oct. 1984, pp. 761791.
[20] G.M. Kuper, J.D. Ullman, and M. Vardi, "On the equivalence of logical databases," inProc. ACM SIGACTSIGMOD Symp. Principles Database Syst., Waterloo, Ont., 1984, pp. 221228.
[21] E. Lien, "Multivalued dependencies with null values in relational databases," inProc. 5th Int. Conf. Very Large Data Bases, 1979, pp. 6166.
[22] W. Lipski, "On semantic issues connected with incomplete information databases,"ACM Trans. Database Syst., vol. 4, no. 3, pp. 262296, Sept. 1979.
[23] K.C. Liu and R. Sunderraman, "Indefinite and maybe information in relational databases,"ACM Trans. Database Syst., vol. 15, pp 139, Mar. 1990.
[24] K.C. Liu and R. Sunderraman, "On representing indefinite and maybe information in relational databases," inProc. Fourth Int. Conf. Data Eng., Los Angeles, CA, Feb. 1988, pp. 250257.
[25] K.C. Liu and R. Sunderraman, "A generalized algebraic approach for indefinite deductive databases," manuscript, 1989.
[26] J. Minker, "On indefinite databases and the closed world assumption," inLecture Notes in Computer Science, no. 138, pp. 292308, SpringerVerlag, 1982.
[27] R. Reiter, "Towards a logical reconstruction of relational database theory," inOn Conceptual Modeling, M. Brodie, J. Mylopoulos, and J.W. Schmidt, Eds. Berlin, Germany: SpringerVerlag, 1984, pp. 191238.
[28] R. Reiter, "A sound and sometimes complete query evaluation algorithm for relational databases with null values,"J. ACM, vol. 33, no. 2, pp. 349370, Apr. 1986.
[29] Y. Vassiliou, "Null values in database management: A denotational semantics approach,"ACM SIGMOD Conf., Boston, MA, 1979, pp. 162169.
[30] Y. Vassiliou, "Functional dependencies and incomplete information," inProc. 6th Int. Conf. Very Large Data Bases, 1981, pp. 260269.
[31] C. Zaniolo, "Database relations with null values,"J. Comput. Syst. Sci., vol. 28, no. 1, pp. 142166, Feb. 1984.