Abstract
Imprecise data exist in databases due to their unavailability or to data/ schema incompatibilities in a multidatabase system. Partial values have been used to represent imprecise data. Manipulation of partial values is therefore necessary to process queries involving imprecise data. In this article, we study the problem of eliminating redundant partial values that result from a projection on an attribute with partial values. The redundancy of partial values is defined through the interpretation of a set of partial values. This problem is equivalent to searching a minimal semantically-equivalent subset of a set of partial values. A semantically-equivalent subset contains exactly the same information as the original set. We derive a set of useful properties and apply a graph matching technique to develop an efficient algorithm for searching such a minimal subset and therefore eliminating redundant partial values. By this process, we not only provide a concise answer to the user, but also reduce the communication cost when partial values are requested to be transmitted from one site to another site in a distributed environment. Moreover, further manipulation of the partial values can be simplified. This work is also extended to the case of multi-attribute projections.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abiteboul, S. and Grahne, G. Update semantics for incomplete information,Proceedings of the Eleventh International Conference on Very Large Data Bases, Stockholm, 1985.
Bancilhon, F. and Spyratos, N. Update semantics of relational views,ACM Transmissions of Database System, 6(4):557–575, 1981.
Biskup, J. A foundation of Codd's relational maybe-operations,ACM Transmissions of Database Systems, 8(4):608–636, 1983.
Bondy, J.A. and Murty, U.S.R.Graph Theory with Applications, New York: Macmillan Press, 1976.
Codd, E.F. Extending the database relational model to capture more meaning,ACM Transmissions of Database Systems, 4(4):397–434, 1979.
Codd, E.F. Missing information (applicable and inapplicable) in relational databases,SIGMOD Record, 15(4):53–78, 1986.
Codd, E.F. More commentary on missing information in relational databases (applicable and inapplicable information),SIGMOD Record, 16(1):42–50, 1987.
DeMichiel, L.G. Resolving database incompatibility: An approach to performing relational operations over mismatched domains,IEEE Transmissions on Knowledge and Data Engineering, 1(4):485–493, 1989.
Ford, L.R. and Fulkerson, D.R.Flows in Networks, Princeton, NJ: Princeton University Press, 1962.
Garey, M.R. and Johnson, D.S.Computers and Intractability: A Guide to the Theory of NP-Completeness San Francisco: Freeman, 1979.
Grant, J. Null values in a relational data base,Information Processing Letters 6(5):156–157, 1977.
Grant, J. Partial values in a tabular database model,Information Processing Letters, 9(2):97–99, 1979.
Hall, P. On representatives of subsets,J. London Mathematical Society 10(26–30), 1935.
Hopcroft, J.E. and Karp, R.M. Ann 5/2 algorithm for maximum matching in bipartite graphs,SIAM J. Computing, 2(4):225–231, 1973.
Imieliński, T. and Lipski, W. On representing incomplete information in a relational database.Proceedings of the Seventh International Conference on Very Large Data Bases, Cannes, France, 1981.
Imieliński, T. and Lipski, W. Incomplete information and dependencies in relational databases,Proceedings of the ACM SIGMOD International Conference Management of Data, San Jose, California, 1983.
Imieliński, T. and Vadaparty, K. Complexity of query processing in databases with or-objects,Proceedings of the ACM Symposium on Principles of Database Systems, 1989.
Imieliński, T. Incomplete Deductive Databases.Annals of Mathematics and Artificial Intelligence, 3(2–4):259–294, 1991.
Lewis, H. and Papadimitiou, C.Elements of the Theory of Computation, Englewood Cliffs, NJ: Prentice-Hall, 1981, pp.26–26.
Lien, E. Multivalued dependencies with null values in relational databases.Proceedings of the Fifth International Conference on Very Large Data Bases, Rio de Janeiro, 1979.
Lipski, W. On semantic issues connected with incomplete information systems.ACM Transmissions on Database Systems, 4(3):262–296, 1979.
Liu, K.-C. and Sunderraman, R. Indefinite and maybe information in relational databases.ACM Transmissions on Database Systems, 15(1):1–39, 1990.
Liu, K.-C. and Sunderraman, R. A generalized relational model for indefinite and maybe information.IEEE Transmissions on Knowledge and Data Engineering 3(1):65–77, 1991.
Maier, D.The Theory of Relational Databases Rockville, MD: Computer Science Press, 1983.
Motro, A. Accommodating imprecision in database systems: issues and solutions.ACM SIGMOD Record, 19(4):69–74, 1990.
Papadimitriou, C.H. and Steiglitz, K..Combinatorial Optimization: Algorithms and complexity, Englewood Cliffs, NJ: Prentice-Hall, 1982, pp.221–226.
Suppes, P.Axiomatic Set Theory, Princeton, New Jersey: D. Van Nostrand Company, 1960, pp.99–100.
Tsai, P.S.M. and Chen, A.L.P. Querying uncertain data in heterogeneous databases.Proceedings of the IEEE International Workshop on Research Issues on Data Engineering (RIDE), Vienna, 1993.
Tseng, F.S.C., Chen, A.L.P., and Yang, W.P. Answering heterogeneous database queries with degrees of uncertainty.Distributed and Parallel Databases: An International Journal, 1(3):281–302, 1993a.
Tseng, F.S.C., Chen, A.L.P., and Yang, W.P. Implementing the division operation on a database containing uncertain data. Submitted, 1993b.
Tseng, F.S.C., Chen, A.L.P., and Yang, W.P. Evaluating aggregate operators over imprecise data. Submitted, 1993c.
Ullman, J.D.Principles of Database and Knowledge-Base Systems, Vol. 2, Rockville, MD: Computer Science Press, 1988.
Vassiliou, Y. Null values in data base management: A denotational semantics approach.Proceedings of the ACM-SIGMOD International Conference on the Management of Data, Boston, MA, 1979.
Vassiliou, Y. Functional dependencies and incomplete information.Proceedings of the Sixth International Conference on Very Large Data Bases, Montreal, 1980.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tseng, F.S.C., Chen, A.L.P. & Yang, WP. Searching a minimal semantically-equivalent subset of a set of partial values. VLDB Journal 2, 489–512 (1993). https://doi.org/10.1007/BF01263049
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01263049