Skip to main content

A Closed Approach to Vague Collections in Partly Inaccessible Distributed Databases

  • Conference paper
  • First Online:
Advances in Databases and Information Systems (ADBIS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1691))

  • 250 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. S. Abiteboul, P. Kanellakis, and G. Grahne. On the representation and querying of sets of possible worlds. In Proc. ACM SIGMOD 1987 Int. Conf. on Management of Data, pages 34–48, San Franzisco, Cal., USA, 1987.

    Google Scholar 

  2. L. Amsaleg, M.J. Franklin, A. Thomasic, and T. Urhan. Scrambling Query Plans to Cope With Unexpected Delays. In Proc. 4th Int. Conf. on Parallel and Distributed Information Systems (PDIS96), Miami Beach, Florida, Dec 1996.

    Google Scholar 

  3. K. Basu, R. Deb, and P. K. Pattanaik. Soft sets: An ordinal formulation of vagueness with some applications to the theory of choice. Fuzzy Sets and Systems, 45:45–58, 1992.

    Article  MathSciNet  Google Scholar 

  4. P. Bonnet and A. Thomasic. Partial Answers to Unavailable Data Sources, 1997. INRIA Rocquencourt, Rapport de Recherche 3127.

    Google Scholar 

  5. E. F. Codd. Extending the database relational model to capture more meaning. ACM Transactions on Database Systems, 4(4):397–434, 1979.

    Article  Google Scholar 

  6. European Computer Manufacturers Association, Geneva. Portable Common Tool Environment–Abstract Specification (Standard ECMA-149), 1993.

    Google Scholar 

  7. W. L. Gau and D. J. Buehrer. Vague sets. IEEE Transactions on Systems, Man and Cybernetics, 23(2):610–614, 1993.

    Article  Google Scholar 

  8. G.H. Gessert. Handling missing data by using stored truth values. ACM SIGMOD Record, 20(3):30–42, 1991.

    Article  Google Scholar 

  9. O. Haase and A. Henrich. Error propagation in distributed databases. In Proc. 4th Int. Conf. on Information and Knowledge Management (CIKM’95), pages 387–394, 1995.

    Google Scholar 

  10. O. Haase and A. Henrich. A hybrid representation of vague collections for distributed object management systems. accepted for publication in IEEE Transactions on Knowledge and Data Engineering, 1999.

    Google Scholar 

  11. A. Heuer and A. Lubinski. Database access in mobile environments. In Proc. 7th Int. Conf. on Database and Expert Systems Applications, volume 1134 of LNCS, pages 544–553, Zürich, 1996. Springer.

    Chapter  Google Scholar 

  12. T. Imieliński and W. Lipski. Incomplete information in relational databases. Journal Association for Computing Machinery, 31(4):761–791, 1984.

    Article  MathSciNet  Google Scholar 

  13. W. Lipski. On relational algebra with marked nulls. In Proc. 3rd ACM SIGACT–SIGMOD Symposium on Principles of Database Systems, pages 201–203, Waterloo, Canada, 1984..

    Google Scholar 

  14. J.M. Morrissey. Imprecise information and uncertainty in information systems. ACM Transactions On Information Systems, 8(2):159–180, 1990.

    Article  Google Scholar 

  15. A. Motro. Accommodating imprecision in database systems: Issues and solutions. ACM SIGMOD Record, 19(4):69–74, 1990.

    Article  Google Scholar 

  16. Z. Pawlak. Rough Sets. International Journal of Computer and Information Sciences, 11(5):341–356, 1982.

    Article  MathSciNet  Google Scholar 

  17. A. Thomasic, R. Amouroux, P. Bonnet, O. Kapitskaia, H. Naacke, and L. Raschid. The Distributed Information Search Component (Disco) and the World WideWeb. In Proc. SIGMOD 1997 Conference, pages 546–548, Tucson, Arizona, May 1997.

    Google Scholar 

  18. Y. Vassiliou. Null values in data base managment: A denotational semantics approach. In Proc. ACM SIGMOD 1979 Int. Conf. on Management of Data, pages 162–169, Boston, Mass., USA, 1979.

    Google Scholar 

  19. E. Wong. A statistical approach to incomplete information in database systems. ACM Transactions on Database Systems, 7(3):470–488, 1982.

    Article  MathSciNet  Google Scholar 

  20. L. Y. Yuan and D.-A. Chiang. A sound and complete query evaluation algorithm for relational databases with disjunctive information. In Proc. 8th ACM SIGACT–SIGMOD-SIGART Symposium on Principles of Database Systems, pages 66–74, Philadelphia, Pa., USA, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Haase, O., Henrich, A. (1999). A Closed Approach to Vague Collections in Partly Inaccessible Distributed Databases. In: Eder, J., Rozman, I., Welzer, T. (eds) Advances in Databases and Information Systems. ADBIS 1999. Lecture Notes in Computer Science, vol 1691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48252-0_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-48252-0_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66485-7

  • Online ISBN: 978-3-540-48252-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics