A Closed Approach to Vague Collections in Partly Inaccessible Distributed Databases

Inaccessibility of part of the database is a research topic hardly addressed in the literature about distributed databases. However, there are various application areas, where the database has to remain operable even if part of the database is inaccessible. In particular, queries to the database should be processed in an appropriate way. This means that the final and all intermediate results of a query in a distributed database system must be regarded as potentially vague. In this paper we propose hybrid representations for vague sets, vague multisets, and vague lists, which address the accessible elements in an enumerating part and the inaccessible elements in a descriptive part. These representations allow to redefine the usual query language operations for vague sets, vague multisets, and vague lists. The main advantage of our approach is that the descriptive part of the representation can be used to improve the enumerating part during query processing.

[1]  Philippe Bonnet,et al.  The distributed information search component (Disco) and the World Wide Web , 1997, SIGMOD '97.

[2]  Andreas Heuer,et al.  Database Access in Mobile Environments , 1996, DEXA.

[3]  Joan M. Morrissey,et al.  Imprecise information and uncertainty in information systems , 1990, TOIS.

[4]  Eugene Wong,et al.  A statistical approach to incomplete information in database systems , 1982, TODS.

[5]  Serge Abiteboul,et al.  On the representation and querying of sets of possible worlds , 1987, SIGMOD '87.

[6]  Wenfei Fan,et al.  Keys with Upward Wildcards for XML , 2001, DEXA.

[7]  Li-Yan Yuan,et al.  A sound and complete query evaluation algorithm for relational databases with disjunctive information , 1989, PODS '89.

[8]  Amihai Motro,et al.  Accommodating imprecision in database systems: issues and solutions , 1990, SGMD.

[9]  Philippe Bonnet,et al.  Partial Answers for Unavailable Data Sources , 1998, FQAS.

[10]  W.-L. Gau,et al.  Vague sets , 1993, IEEE Trans. Syst. Man Cybern..

[11]  Witold Lipski On relational algebra with marked nulls preliminary version , 1984, PODS '84.

[12]  Yannis Vassiliou,et al.  Null values in data base management a denotational semantics approach , 1979, SIGMOD '79.

[13]  Laurent Amsaleg,et al.  Scrambling query plans to cope with unexpected delays , 1996, Fourth International Conference on Parallel and Distributed Information Systems.

[14]  E. F. Codd,et al.  Extending the database relational model to capture more meaning , 1979, ACM Trans. Database Syst..

[15]  Andreas Henrich,et al.  Error propagation in distributed databases , 1995, CIKM '95.

[16]  Andreas Henrich,et al.  A Hybrid Representation of Vague Collections for Distributed Object Management Systems , 2000, IEEE Trans. Knowl. Data Eng..

[17]  G. H. Gessert Handling missing data by using stored truth values , 1991, SGMD.

[18]  Tomasz Imielinski,et al.  Incomplete Information in Relational Databases , 1984, JACM.

[19]  Witold Lipski On Relational Algebra with Marked Nulls. , 1984, PODS 1984.

[20]  R. Deb,et al.  Soft sets: an ordinal formulation of vagueness with some applications to the theory of choice , 1992 .