Extending Functional Dependencies in Indefinite Sequence Relations

  • Wilfred Ng
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1728)

Abstract

We introduce the concept of an indefinite sequence relation r over a relation schema R in order to capture the semantics of sequence data having indefinite values. Indefinite information may arise in a relation containing data from a mobile environment or from a multi-database system. An indefinite tuple allows an attribute value to contain a set of values, which can be employed to represent disjunction of information. A definite sequence relation extracted from r, while maintaining its ordering, has all indefinite cells replaced with just one of the indefinite values. We establish a formal hierarchical structure over the class of indefinite sequence relations having a fixed schema and cardinality, which can be employed to classify the relations into different levels of precision. A functional dependency (FD) ƒ satisfies in r if there is a definite sequence relation over R, extracted from r, that satisfies ƒ as the same way a conventional relation does. Our main result shows that FDs in this context have the following two important features. First, Lien and Atzeni’s axiom system [23,3] for FDs in incomplete relations, rather than the well-known Armstrong’s axiom system, is sound and complete for FDs in indefinite sequence relations. It implies that the established results for FDs in incomplete relations, such as the closure and implication algorithms, can be extended to FDs in indefinite sequence relations. Second, the satisfaction for FDs is non-additive, meaning that in a given relation the satisfaction of each ƒ in F may not lead to the the satisfaction of F.

Keywords

Functional Dependency Inference Rule Sequence Relation Axiom System Relation Schema 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Abiteboul and S. Ginsburg. Tuple Sequences and Lexicographical Indexes. Journal of the Association for Computing Machinery 33(3), pp. 409–422 (1986).MathSciNetGoogle Scholar
  2. 2.
    W.W. Armstrong. Dependency Structures of Data Base Relationships. In Proceedings of the IFIP Congress, Stockholm, pp. 580–583, (1974).Google Scholar
  3. 3.
    P. Atzeni and V. De Antonellis. Relational Database Theory. Benjamin/Cummings Publishing Company, Inc., (1993).Google Scholar
  4. 4.
    B.R. Badrinath and T. Imielinski. Replication and Mobility. In Proceedings of the 2nd IEEE Workshop on Management of Replicated Data, (1992).Google Scholar
  5. 5.
    P. Bosc, D. Dubois and H. Prade. Fuzzy functional dependencies — An Overview and a Critical Discussion. In Proceedings of the IEEE International Conference on Fuzzy Systems, Orando, FL, pp. 325–330, (1994).Google Scholar
  6. 6.
    E.F. Codd. Extending Database Relational Model to Capture More Meaning. ACM Transactions on Database Systems, 4, pp. 397–434, (1979).CrossRefGoogle Scholar
  7. 7.
    W. Feller. An Introduction to Probability Theory and Its Applicaitons. John Wiley & Sons Publishing Company, Inc., 2nd edition, (1971).Google Scholar
  8. 8.
    R. Read. Towards Multiresolution Data Retrieval via the Sandbag. Ph.D. Thesis, University of Texas at Austin, United States, (1995).Google Scholar
  9. 9.
    D.S. Johnson and A. Klug. Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies. Journal of Computer and System Sciences, 28, pp. 167–189, (1984).MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York, (1979).MATHGoogle Scholar
  11. 11.
    S. Ginsburg and K. Tanaka. Computation-Tuple Sequences and Object Histories. ACM Transactions on Database Systems 11(2), pp. 186–212, (1986).MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    G. Grahne. Dependency Satisfaction in Databases with Incomplete Information. In Proceedings of the International Conference on Very Large Data Bases, Singapore, pp. 37–45, (1984).Google Scholar
  13. 13.
    G. Gratzer. General Lattice Theory. NewYork: Academic Press, (1978).Google Scholar
  14. 14.
    R.H. Guting, R. Zicari and D.M. Choy. An Algebra for Structured Office Documents. ACM Transactions on Office Information Systems 7(4), pp. 123–157, (1989).CrossRefGoogle Scholar
  15. 15.
    P. Halmos. Naive Set Theory, Springer-Verlag, New York, (1974).Google Scholar
  16. 16.
    P. Honeyman. Testing Satisfaction of Functional Dependencies. Journal of the ACM 29, pp. 668–677, (1982).Google Scholar
  17. 17.
    T. Imielinski, R. Van Der Meyden and K. Vadaparty. Complexity Tailored Design: A New Design Methodology for Databases with Incomplete Information. Journal of Computer and System Sciences, 51, pp.405–432, (1995).CrossRefMathSciNetGoogle Scholar
  18. 18.
    W.H. Inmon. Building the Data Warehouse. John Wiley & Sons. Inc., (1996)Google Scholar
  19. 19.
    H-J. Klein. Efficient Algorithms for Approximating Answers to Queries Against Incomplete Relational Databases, In: Proceedings of KRDB’99, Lingkoping, E. Franconi, M. Kifer (Eds.), pp. 26–30, (1999).Google Scholar
  20. 20.
    P. Lech and S. Andrej. Proceedings: Rough sets and current trends in computing: first International Conference, RSCTC’ 98, LNCS Vol. 1424, Warsaw, Poland, (1998).Google Scholar
  21. 21.
    M. Levene and G. Loizou. Maintaining consistency of imprecise relations. The Computer Journal 39, pp. 114–123, (1996).MATHCrossRefGoogle Scholar
  22. 22.
    L. Libkin. Aspects of Partial Information in Databases. Ph.D. Thesis, University of Pennsylvania, United States, (1996).Google Scholar
  23. 23.
    Y. E. Lien. On the Equivalence of Data Models. Journal of the ACM 2, pp. 333–362, (1982).CrossRefGoogle Scholar
  24. 24.
    N.A. Lorentzos. DBMS Support for Time and Totally Ordered Compound Data Types. Information Systems 17(5), pp. 347–358, (1992).MATHCrossRefGoogle Scholar
  25. 25.
    D. Maier and B. Vance. A Call to Order, In ACM symp. on Principles of Databases Systems, pp. 1–16, (1993).Google Scholar
  26. 26.
    H. Mannila and K-J Raiha. Generating Armstrong Databases for Sets of Functional and Inclusion Dependencies. Research Report A-1988-7, University of Tampere, Finland, (1988).Google Scholar
  27. 27.
    MIM User Mannual. Logical Information Machines, (1994).Google Scholar
  28. 28.
    K. Ng and R. Muntz. Parallelizing User-Defined Functions in Distributed Object-Relational DBMS. IEEE Proceedings of the International Database Engineering and Applications Symposium, Montreal, Canada, pp. 279–287, (1999).Google Scholar
  29. 29.
    W. Ng and M. Levene. The Development of Ordered SQL Packages to Support Data Warehousing. Proceedings of the 8th International Database Workshop, Hong Kong, pp. 208–235, (1997).Google Scholar
  30. 30.
    W. Ng and M. Levene. The Development of Ordered SQL Packages for Modelling Advanced Applications. Lecture Notes in Computer Science Vol. 1308: Database and Expert Systems Applications, Toulouse, France, pp. 529–538, (1997).CrossRefGoogle Scholar
  31. 31.
    W. Ng. Lexicographically Ordered Functional Dependencies and Their Application to Temporal Relations. IEEE Proceedings of the International Database Engineering and Applications Symposium, Montreal, Canada, pp. 279–287, (1999).Google Scholar
  32. 32.
    W. Ng. Functional Dependencies in Ordered Relational Databases. To appear in Information Systems, (1999).Google Scholar
  33. 33.
    K.V.S.V.N. Raju and A.K. Majumdar Fuzzy Functional Dependencies and Lossless Join Decomposition of Fuzzy Relational Database Systems. ACM Transactions on Database Systems 13(2), pp. 129–166, (1988).CrossRefGoogle Scholar
  34. 34.
    P. Seshadri, M. Livny and R. Ramakrishnan. The Design and Implementation of a Sequence Database System. Proceedings of the 22nd VLDB Conference, Mumbai, India, pp. 99–110, (1996).Google Scholar
  35. 35.
    S. Shenoi, A Melton and L.T. Fan. An Equivalence Classes Model of Fuzzy Relational Databases. Fuzzy Sets and Systems, 38, pp. 153–170, (1990).MATHCrossRefMathSciNetGoogle Scholar
  36. 36.
    A. Silberschatz, M. Stonebraker and J.D. Ullman. Database Systems: Achievements and Opportunities. Sigmod record, 19(4), pp 6–22, (1990).CrossRefGoogle Scholar
  37. 37.
    A. Tansel et al. (editors). Temporal Databases: Theory, Design and Implementation. The Benjamin/Cummings Publishing Company, Inc., (1993)Google Scholar
  38. 38.
    J.D. Ullman. Principles of Database and Knowledge-Base Systems, Vol. I, Rockville, MD., Computer Science Press, (1988).Google Scholar
  39. 39.
    K. Vadaparty and S. Naqvi. Using Constraints for Efficient Query Processing in Nondeterministic Databases. IEEE Transactions on Knowledge and Data Engineering 7, pp.850–864, (1995).CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Wilfred Ng
    • 1
  1. 1.Department of ComputingHong Kong Polytechnic UniversityHong Kong

Personalised recommendations