An Extension of the Relational Data Model to Incorporate Ordered Domains

ACM Transactions on Database Systems

Volumn 26, Issue 3, 2001, Pages 344-383

  Ng, Wilfred ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Axiom system; Design; H.2.1 Database Management : Logical design data models; H.2.3 Database Management : Languages query languages; H.2.4 Database Management : Systems relational databases; Languages; Theory

Indexed keywords

ALGEBRA; DATA STRUCTURES; OBJECT ORIENTED PROGRAMMING; QUERY LANGUAGES; SEMANTICS;

LEXICOGRAPHICAL ORDERING; PARTIALLY ORDERED RELATIONAL ALGEBRA; VALUATION MAPPING;

RELATIONAL DATABASE SYSTEMS;

EID: 0347710442     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/502030.502033     Document Type: Article

References (49)

1. ABITEBOUL, S. AND GINSBURG, S. 1986. Tuple sequences and lexicographical indexes. J. ACM, 33, 3, 409-422.
2. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley, Reading, Mass.
3. ANSI/X3/SPARC 1975. Study Group on Database Management Systems, Interim Report. FDT Bull. of ACM SIGFIDET 7.
4. ARMSTRONG, W. W. 1974. Dependency structures of data base relationships. In Proceedings of the IFIP Congress (Stockholm), 580-583.
5. ATZENI, P. AND DE ANTONELLIS, V. 1993. Relational Database Theory. Benjamin/Cummings, Redwood City, Calif.
6. BANCILHON, F. 1978. On the completeness of query languages for relational databases. In Mathematical Foundations of Computer Science, Lecure Notes in Computer Science, vol. 64, Springer-Verlag, New York, 112-124.
7. BEERI, C. AND BERNSTEIN, P. A. 1979. Computational problems related to the design of normal form relational schemas. ACM Trans. Database Syst. 4, 1, 30-59.
8. BISKUP, J. 1990. An extension of SQL for querying graph relations. Comput. Lang. 15, 2, 65-82.
9. BLAHA, M. AND PREMERLANI, W. 1998. Object-Oriented Modeling and Design for Database Applications. Prentice-Hall, Englewood Cliffs, N.J.
10. BUNEMAN, P., JUNG, A., AND OHORI, A. 1991. Using powerdomains to generalise relational databases. Theor. Comput. Sci. 9, 1, 23-55.
11. CHANDRA, A. K. AND HAREL, D. 1980. Computable queries for relational databases. J. Comput. Syst. Sci. 21, 2, 156-178.
12. CODD, E. F. 1970. A relational model of data for large shared data banks. Commun. ACM 13, 6, 377-387.
13. CODD, E. F. 1979. Extending the database relational model to capture more meaning. ACM Trans. Database Syst. 4, 4, 397-434.
14. CODD, E. F. 1986. Missing information (applicable and inapplicable) in relational databases. ACM SIGMOD Rec. 15, 4, 53-78.
15. DATE, C. J. 1990. Relational Database Writings 1985-1989. Addison-Wesley, Reading, Mass.
16. DATE, C. J. 1997. A Guide to the SQL Standard. 4th ed., Addison-Wesley, Reading, Mass.
17. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York.
18. GINSBURG, S. AND HULL, R. 1983. Order dependency in the relational model. Theor. Comput. Sci. 26, 1-2, 149-195.
19. GINSBURG, S. AND HULL, R. 1986. Sort sets in the relational model. J. ACM 33, 3, 465-488.
20. GINSBURG, S. AND TANAKA, K. 1986. Computation tuple sequences and object histories. ACM Trans. Database Syst. 11, 2, 186-212.
21. GRAHNE, G. 1984. Dependency satisfaction in databases with incomplete information. In Proceedings of the Tenth VLDB International Conference, 37-45.
22. GRATZER, G. 1978. General Lattice Theory. Academic, New York.
23. GUTING, R. H., ZICARI, R., AND CHOY, D. M. 1989. An algebra for structured office documents. ACM Trans. Office Inf. Syst. 7, 4, 123-157.
24. HALMOS, P. 1974. Naive Set Theory, Springer-Verlag, New York.
25. HONEYMAN, P. 1982. Testing satisfaction of functional dependencies. J. ACM 29, 3, 668-677.
26. JUNG, A., LIBKIN, L., AND PUHLMANN, H. 1991. Decomposition of domains. In Proceedings of the Conference on Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science, vol. 598, Springer-Verlag, New York, 235-258.
27. JOHNSON, D. S. AND KLUG, A. 1984. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28, 1, 167-189.
28. LEVENE, M. AND LOIZOU, G. 1996. Maintaining consistency of imprecise relations. Comput. J. 39, 2, 114-123.
29. LEVENE, M. AND LOIZOU, G. 1997. Null inclusion dependencies in relational databases. Inf. Comput. 136, 2, 67-108.
30. LIBKIN, L. 1996. Aspects of partial information in databases. PhD Thesis, University of Pennsylvania.
31. LORENTZOS, N. A. 1992. DBMS support for time and totally ordered compound data types. Inf. Syst. 17, 5, 347-358.
32. LYNN, N. 1982. Implementation of ordered relations in a data base system. Masters Thesis, University of California.
33. MAIER, D. AND VANCE, B. 1993. A call to order. In Proceedings of the Twelfth ACM Symposium on Principles of Databases Systems, 1-16.
34. MAIER, D., MENDELZON, A. O., AND SAGIV, Y. 1979. Testing implication of data dependencies. ACM Trans. Database Syst. 4, 4, 455-469.
35. MANNILA, H. AND RAIHA, K.-J. 1988. Generating Armstrong databases for sets of functional and inclusion dependencies. Research Report A-1988-7, University of Tampere, Finland.
36. NG, W. 1999a. Lexicographical ordered functional dependencies and their application to temporal relations. In IEEE Proceedings of the International Database Engineering and Applications Symposium, 279-287.
37. NG, W. 1999b. Ordered functional dependencies in relational databases. Inf. Syst. 24, 1, 535-554.
38. NG, W. AND LEVENE, M. 1997a. An extension of OSQL to support ordered domains in relational databases. In IEEE Proceedings of the International Database Engineering and Applications Symposium, 358-367.
39. NG, W. AND LEVENE, M. 1997b. The development of ordered SQL packages for modelling advanced applications. In Proceedings of the eighth International Conference of Database and Expert Systems Application, Lecture Notes in Computer Science, vol. 1308, Springer-Verlag New York 529-538.
40. NG, W. K. 1999. Dynamic optimization of query execution plans. PhD Thesis, University of California, Los Angeles.
41. PAREDAENS, J. 1978. On the expressive power of the relational algebra. Inf. Process Lett. 7, 2, 107-111.
42. RAYMOND, D. 1996. Partial order databases. Ph.D. Thesis, University of Waterloo, Canada.
43. RUMBAUGH, J. 1988. Relational database design using an object-oriented methodology. Commun. ACM 31, 4, 417-427.
44. READ, R. 1995. Towards multiresolution data retrieval via the sandbag. PhD Thesis, University of Texas at Austin.
45. SESHADRI, P., LIVNY, M., AND RAMAKRISHNAN, R. 1996. The design and implementation of a sequence database system. In Proceedings of the 22nd VLDB Conference, 99-110.
46. TANSEL, A. ET AL. (EDS.) 1993. Temporal Databases: Theory, Design and Implementation. Benjamin/Cummings, Redwood City, Calif.
47. ULLMAN, J. D. 1988. Principles of Database and Knowledge-Base Systems, vol. I, Computer Science Press, Rockville, Md.
48. WIJSEN, J. 1998. Reasoning about qualitative trends in databases. Inf. Syst. 23, 7, 469-493.
49. ZANIOLO, C. 1984. Database relations with null values. J. Comput. Syst. Sci. 28, 1, 142-166.