This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Exploration of Relationships Among Exclusive Disjunctive Data
December 1995 (vol. 7 no. 6)
pp. 928-940
ASCII Text
x 
 
Jui-Shang Chiu, Arbee L.P. Chen, "An Exploration of Relationships Among Exclusive Disjunctive Data," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 6, pp. 928-940, December, 1995.
 
 
BibTex
x
 
@article{ 10.1109/69.476498,
author = {Jui-Shang Chiu and Arbee L.P. Chen},
title = {An Exploration of Relationships Among Exclusive Disjunctive Data},
journal ={IEEE Transactions on Knowledge and Data Engineering},
volume = {7},
number = {6},
issn = {1041-4347},
year = {1995},
pages = {928-940},
doi = {http://doi.ieeecomputersociety.org/10.1109/69.476498},
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 - An Exploration of Relationships Among Exclusive Disjunctive Data
IS - 6
SN - 1041-4347
SP928
EP940
EPD - 928-940
A1 - Jui-Shang Chiu,
A1 - Arbee L.P. Chen,
PY - 1995
KW - Incomplete information
KW - disjunctive information
KW - partial values
KW - query language semantics
KW - tuple relationships
KW - relational databases.
VL - 7
JA - IEEE Transactions on Knowledge and Data Engineering
ER -
 

Abstract—In this paper, we elaborate on how to interpret the query answer on exclusive disjunctive databases and how to reduce the query answer into a more concise form. Exclusive disjunctive data are represented as a pair of value set and variable set in Pv-table which is an extension of the relational model. A value set corresponds to a finite set of possible values in which exactly one value is the true value. By variable sets, tuples may be related with certain relationships, namely disjunctive relationship and join relationship. Three kinds of tuple sets are classified according to these relationships, each possesses an important property, namely co-exist, co-nonempty, or co-instance. Based on these properties, the interpretation of Pv-tables can be formalized in a semantically meaningful way. Also, the redundant and mergeable tuples can be identified. After removing and merging tuples accordingly, a more concise Pv-table can thus provide a better understanding of the query result.

[1] S. Abiteboul and G. Grahne,“Update semantics for incomplete databases,” Proc. VLDB Conf., pp. 1-12, 1985.
[2] S. Abiteboul,P. Kanellakis,, and G. Grahne,“On the representation and querying of sets of possible worlds,” Proc. ACM SIGMOD Conf., pp. 34-48, 1987.
[3] D. Barbará, H. Garcia-Molina, and D. Porter, “The Management of Probabilistic Data,” IEEE Trans. Knowledge and Data Eng., vol. 4, pp. 487-501, 1992.
[4] J. Biskup,“Foundations of Codd’s relational maybe operations,” ACM Trans. Database Systems, vol. 8, no. 4, pp. 608-636, 1983.
[5] B.P. Buckles and F.E. Petry,“A fuzzy representation of data for relational databases,” Fuzzy Sets and Systems, vol. 7, pp. 213-226, 1982.
[6] R. Cavallo and M. Pittarelli,“The theory of probabilistic databases,” Proc. VLDB Conf. , pp. 71-81, 1987.
[7] J.S. Chiu and A.L.P. Chen,“A sound and complete extended relational algebra for exclusive disjunctive data,” The Poster Paper Collection, VLDB Conf., pp. 12-22, 1994.
[8] J.S. Chiu and A.L.P. Chen,“Pv-table—a representation system for exclusive disjunctive data,” Technical Report, Dept. of Computer Science, Nat’l Tsing Hua Univ., 1994.
[9] E. Codd,“Understanding relations,” Installment no. 7, ACM SIGMOD Record FDT Bulletin, vol. 7, no. 3-4, pp. 23-28, 1975.
[10] E. Codd,“Extending the database relational model to capture more meaning,” ACM Trans. Database Systems, vol. 4, no. 4, pp. 397-434, 1979.
[11] E. Codd,“Missing information (applicable and inapplicable) in relational databases,” ACM SIGMOD Record, vol. 15, no. 4, pp. 53-78, 1986.
[12] L.G. Demichiel, “Resolving Database Incompatibility: An Approach to Performing Relational Operations over Mismatched Domains,” IEEE Trans. Knowledge and Data Eng., vol. 4, pp. 485-493, 1989.
[13] D. Dubois and H. Prade,Possibility Theory: An Approach to Computerized Processing of Uncertainty.New York: Plenum Press, 1986.
[14] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[15] G. Grahne,“Dependency satisfaction in databases with incomplete information,” Proc. VLDB Conf., pp. 37-45, 1984.
[16] J. Grant,“Partial values in a tabular database model,” Information Processing Letters, vol. 9, no. 2, pp. 97-99, 1979.
[17] J. Grant,“Incomplete information in a relational database,” Fundamenta Informaticae, vol. 3, no. 3, pp. 363-378, 1980.
[18] J. Grant and J. Minker,“Answering queries in indefinite databases and the null value problem,” Advances in Computing Research, P. Kanellakis, ed., The Theory of Databases, vol. 3, pp. 247-267. JAI Press, 1986.
[19] T. Imielinski and W. Lipski Jr.,“Incomplete information and dependencies in relational databases,” Proc. ACM SIGMOD Conf., pp. 178-184, 1983.
[20] T. Imielinski and W. Lipski Jr.,“Incomplete information in relational databases,” J. ACM, vol. 31, no. 4, pp. 761-791, 1984.
[21] T. Imielinski,S. Naqvi,, and K. Vadaparty,“Incomplete objects—A data model for design and planning applications,” Proc. ACM SIGMOD Conf., pp. 288-297, 1991.
[22] T. Imielinski and K. Vadaparty,“Complexity of query processing in databases with OR-objects,” Proc. ACM PODS Conf., pp. 51-65, 1989.
[23] M. Koubarakis,“Database models for infinite and indefinite temporal information,” Information Systems, vol. 19, no. 2, pp. 141-173, 1994.
[24] M. Levene and G. Loizou,“Semantics for null extended nested relations,” ACM Trans. Database Systems, vol. 18, no. 3, pp. 414-459, 1993.
[25] H.J. Levesque,“The interaction with incomplete knowledge bases: A formal treatment,” Proc. Int’l Joint Conf. Artificial Intelligence, pp. 240-245, 1981.
[26] L. Libkin and L. Wong,“Semantic representations and query languages for or-sets,” Proc. ACM PODS Conf. , pp. 37-48, 1993.
[27] Y.E. Lien,“Multivalued dependencies with null values in relational data bases,” Proc. VLDB Conf. , pp. 61-66, 1979.
[28] W. Lipski,“On semantic issue connected with incomplete information systems,” ACM Trans. Database Systems, vol. 4, no. 3, pp. 262-296, 1979.
[29] K.C. Liu and R. Sunderraman,“Indefinite and maybe information in relational databases,” ACM Trans. Database Systems, vol. 15, no. 1, pp. 1-39, 1990.
[30] K.C. Liu and R. Sunderraman,“A generalized relational model for indefinite and maybe information,” IEEE Trans. Knowledge and Data Engineering, vol. 3, no. 1, pp. 65-77, 1991.
[31] D. Maier,The Theory of Relational Databases.Rockville, Md.: Computer Science Press, 1983.
[32] J. Minker,“On indefinite databases and the closed world assumption,” Proc. Automated Deduction Conf., pp. 292-308, 1982.
[33] J.M. Morrissey,“Imprecise information and uncertainty in information systems,” ACM Trans. Information Systems, vol. 8, no. 2, pp. 159-180, 1990.
[34] A. Ola,“Relational databases with exclusive disjunctions,” Proc. IEEE Data Eng. Conf., pp. 328-336, 1992.
[35] A. Ola and G. Ozsoyoglu,“Incomplete relational database models based on intervals,” IEEE Trans. Knowledge and Data Engineering, vol. 5, no. 2, pp. 293-308, 1993.
[36] H. Prade and C. Testemale,“Generalizing database relational algebra forthe treatment of incomplete/uncertain information and vague queries,” Information Sciences, vol. 34, pp. 115-143, 1984.
[37] R. Reiter,“On closed world databases,” Logic and Databases, H. Gallaire and J. Minker, eds. , pp. 55-76.New York: Plenum Press, 1978.
[38] R. Reiter,“Towards a logical reconstruction of relational database theory,” On Conceptual Modelling, M.L. Brodie, J. Mylopoulos, and J.W. Schmidt, eds., pp. 191-233.New York: Springer-Verlag, 1984.
[39] R. Reiter,“A sound and sometimes complete query evaluation algorithm forrelational databases with null values,” J. ACM, vol. 33, no. 2, pp. 349-370, 1986.
[40] F.S.C. Tseng, A.L.P. Chen, and W.-P. Yang, “Answering Heterogeneous Database Queries with Degrees of Uncertainty,” Distributed and Parallel Databases, vol. 1, pp. 281-302, 1993.
[41] F.S.C. Tseng,A.L.P. Chen,, and W.P. Yang,“Searching a minimal semantically-equivalent subset of a set of partial values,” The VLDB J., vol. 2, no. 4, pp. 489-512, 1993.
[42] F.S.C. Tseng,A.L.P. Chen, and W.P. Yang,“Refining imprecise data by integrity constraints,” Data and Knowledge Eng. J., vol. 11, no. 3, pp. 299-316, 1993.
[43] Y. Vassiliou,“Null values in database management: A denotational semantics approach,” Proc. ACM SIGMOD Conf., pp. 162-169, 1979.
[44] Y. Vassiliou,“Functional dependencies and incomplete information,” Proc. VLDB Conf., pp. 260-269, 1980.
[45] M. Winslett,“A model-based approach to updating databases with incomplete information,” ACM Trans. Database Systems, vol. 13, no. 2, pp. 167-196, 1988.
[46] L.C. Yuan and D.A. Chiang,“A sound and complete query evaluation algorithmfor relational databases with null values,” Proc. ACM SIGMOD Conf., pp. 74-81, 1988.
[47] L.A. Zadeh,“Fuzzy sets as a basis for a theory of possibility,” Fuzzy Sets and Systems, vol. 1, no. 1, pp. 3-28, 1978.
[48] C. Zaniolo,“Database systems with null values,” J. Computer and System Sciences, vol. 28, pp. 142-166, 1984.
[49] M. Zemankova,“Implementing imprecision in information systems,” Information Science, vol. 37, pp. 107-141, 1985.

Index Terms:
Incomplete information, disjunctive information, partial values, query language semantics, tuple relationships, relational databases.
Citation:
Jui-Shang Chiu, Arbee L.P. Chen, "An Exploration of Relationships Among Exclusive Disjunctive Data," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 6, pp. 928-940, Dec. 1995, doi:10.1109/69.476498
Usage of this product signifies your acceptance of the Terms of Use.