ACM SIGMOD Anthology VLDB dblp.uni-trier.de

Searching a Minimal Semantically-Equivalent Subset of a Set of Partial Values.

Frank Shou-Cheng Tseng, Arbee L. P. Chen, Wei-Pang Yang: Searching a Minimal Semantically-Equivalent Subset of a Set of Partial Values. VLDB J. 2(4): 489-512(1993)
@article{DBLP:journals/vldb/TsengCY93,
  author    = {Frank Shou-Cheng Tseng and
               Arbee L. P. Chen and
               Wei-Pang Yang},
  title     = {Searching a Minimal Semantically-Equivalent Subset of a Set of
               Partial Values},
  journal   = {VLDB J.},
  volume    = {2},
  number    = {4},
  year      = {1993},
  pages     = {489-512},
  ee        = {db/journals/vldb/TsengCY93.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

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.

Copyright © 1993 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Key Words

Imprecise data, minimal elements, multidatabase systems, partial values, bipartite graph, graph matching.

Online Paper

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 4 Issue 1, Books, VLDB-j, TODS, ..." and ... DVD Version: Load ACM SIGMOD Anthology DVD 2" and ... BibTeX

References

[Abiteboul & Grahne 1985]
Serge Abiteboul, Gösta Grahne: Update Semantics for Incomplete Databases. VLDB 1985: 1-12 BibTeX
[Bancilhon & Spyratos 1981]
François Bancilhon, Nicolas Spyratos: Update Semantics of Relational Views. ACM Trans. Database Syst. 6(4): 557-575(1981) BibTeX
[Biskup 1983]
Joachim Biskup: A Foundation of Codd's Relational Maybe-Operations. ACM Trans. Database Syst. 8(4): 608-636(1983) BibTeX
[Bondy & Murty 1976]
...
[Codd 1979]
E. F. Codd: Extending the Database Relational Model to Capture More Meaning. ACM Trans. Database Syst. 4(4): 397-434(1979) BibTeX
[Codd 1986]
E. F. Codd: Missing Information (Applicable and Inapplicable) in Relational Databases. SIGMOD Record 15(4): 53-78(1986) BibTeX
[Codd 1987]
E. F. Codd: More Commentary on Missing Information in Relational Databases (Applicable and Inapplicable Information). SIGMOD Record 16(1): 42-50(1987) BibTeX
[DeMichiel 1989]
Linda G. DeMichiel: Resolving Database Incompatibility: An Approach to Performing Relational Operations over Mismatched Domains. IEEE Trans. Knowl. Data Eng. 1(4): 485-493(1989) BibTeX
[Ford & Fulkerson 1962]
...
[Garey & Johnson 1979]
M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX
[Grant 1977]
John Grant: Null Values in a Relational Data Base. Inf. Process. Lett. 6(5): 156-157(1977) BibTeX
[Grant 1979]
John Grant: Partial Values in a Tabular Database Model. Inf. Process. Lett. 9(2): 97-99(1979) BibTeX
[Hall 1935]
...
[Hopcroft & Karp 1973]
John E. Hopcroft, Richard M. Karp: An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM J. Comput. 2(4): 225-231(1973) BibTeX
[Imielinski & Lipski 1981]
Tomasz Imielinski, Witold Lipski Jr.: On Representing Incomplete Information in a Relational Data Base. VLDB 1981: 388-397 BibTeX
[Imielinski & Lipski 1983]
Tomasz Imielinski, Witold Lipski Jr.: Incomplete Information and Dependencies in Relational Databases. SIGMOD Conference 1983: 178-184 BibTeX
[Imielinsky & Vadaparty 1989]
Tomasz Imielinski, Kumar V. Vadaparty: Complexity of Query Processing in Databases with OR-Objects. PODS 1989: 51-65 BibTeX
[Imielinsky 1991]
...
[Lewis & Papadimitriou 1981]
...
[Lien 1979]
Y. Edmund Lien: Multivalued Dependencies with Null Values in Relational Data Bases. VLDB 1979: 61-66 BibTeX
[Lipski 1979]
Witold Lipski Jr.: On Semantic Issues Connected with Incomplete Information Databases. ACM Trans. Database Syst. 4(3): 262-296(1979) BibTeX
[Liu & Sunderraman 1990]
Ken-Chih Liu, Rajshekhar Sunderraman: Indefinite and Maybe Information in Relational Databases. ACM Trans. Database Syst. 15(1): 1-39(1990) BibTeX
[Liu & Sunderraman 1991]
Ken-Chih Liu, Rajshekhar Sunderraman: A Generalized Relational Model for Indefinite and Maybe Information. IEEE Trans. Knowl. Data Eng. 3(1): 65-77(1991) BibTeX
[Maier 1983]
David Maier: The Theory of Relational Databases. Computer Science Press 1983, ISBN 0-914894-42-0
Contents BibTeX
[Motro 1990]
Amihai Motro: Accommodating Imprecision in Database Systems: Issues and Solutions. SIGMOD Record 19(4): 69-74(1990) BibTeX
[Papadimitriou & Steiglitz 1982]
Christos H. Papadimitriou, Kenneth Steiglitz: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall 1982, ISBN 0-13-152462-3
BibTeX
[Suppes 1960]
...
[Tsai & Chen 1993]
Pauray S. M. Tsai, Arbee L. P. Chen: Querying Uncertain Data in Heterogeneous Databases. RIDE-IMS 1993: 161-168 BibTeX
[Tseng et al. 1993a]
Frank Shou-Cheng Tseng, Arbee L. P. Chen, Wei-Pang Yang: Answering Heterogeneous Database Queries with Degrees of Uncertainty. Distributed and Parallel Databases 1(3): 281-302(1993) BibTeX
[Tseng et al. 1993b]
...
[Tseng et al. 1993c]
...
[Ullman 1988]
Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
Contents BibTeX
[Vassiliou 1979]
Yannis Vassiliou: Null Values in Data Base Management: A Denotational Semantics Approach. SIGMOD Conference 1979: 162-169 BibTeX
[Vassiliou 1980]
Yannis Vassiliou: Functional Dependencies and Incomplete Information. VLDB 1980: 260-269 BibTeX

Referenced by

  1. Arbee L. P. Chen, Jui-Shang Chiu, Frank Shou-Cheng Tseng: Evaluating Aggregate Operations Over Imprecise Data. IEEE Trans. Knowl. Data Eng. 8(2): 273-284(1996)
  2. Jui-Shang Chiu, Arbee L. P. Chen: An Exploration of Relationships Among Exclusive Disjunctive Data. IEEE Trans. Knowl. Data Eng. 7(6): 928-940(1995)
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
VLDB Journal: 1992-1995 Copyright © by VLDB Endowment / 1996-... Copyright © by Springer Verlag,
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sun May 17 00:31:19 2009