On the Computation of Relational View Complements

ACM Transactions on Database Systems

Volumn 28, Issue 2, 2003, Pages 175-208

  Lechtenbörger, Jens ^a   Vossen, Gottfried ^a  

^a UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

Data warehouses; Minimal complements; Relational algebra; Self maintainability; View complements; Views

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; DATA ACQUISITION; DATABASE SYSTEMS;

RELATIONAL ALGEBRA; SELF-MAINTAINABILITY;

DATA WAREHOUSES;

EID: 0346329829     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/777943.777946     Document Type: Article

References (20)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley, Reading, Mass.
2. AHO, A. V. AND ULLMAN, J. D. 1979. The universality of data retrieval languages. In Proceedings of the 6th Annual Principles of Programming Languages (POPL 1979). 110-120.
3. DE AMO, S. AND HALFELD FERRARI ALVES, M. 2000. Efficient maintenance of temporal data ware-houses. In Proceedings of the 4th IDEAS. 188-196.
4. BANCILHON, F. AND SPYRATOS, N. 1981. Update semantics of relational views. ACM Trans. Datab. Syst. 6, 557-575.
5. CHANDRA, A. K. AND HAREL, D. 1980. Computable queries for relational data bases. J. Comput. Syst. Sci. 21, 156-178.
6. COSMADAKIS, S. S. AND PAPADIMITRIOU, C. H. 1984. Updates of relational views. J. ACM 31, 742-760.
7. CUI, Y. AND WIDOM, J. 2001. Lineage tracing for general data warehouse transformations. In Proceedings of the 27th VLDB. 471-480.
8. GOLFARELLI, M. AND RIZZI, S. 1998. A methodological framework for data warehousing design. In Proceedings of the Ist ACM DOLAP Workshop. ACM, New York, 3-9.
9. GOLFARELLI, M. AND RIZZI, S. 1999. Designing the data warehouse: Key steps and crucial issues, J. Comput. Sci. Inf. Manage. 2, 1-14.
10. GUPTA, A., JAGADISH, H. V., AND MUMICK, I. S. 1994. Data integration using self-maintainable views, Technical Memorandum, AT&T Bell Laboratories, Nov.
11. HEGNER, S. J. 1994. Unique complements and decomposition of database schemata. J. Comput. Syst. Sci. 48, 9-57.
12. HONEYMAN, P. 1980. Extension joins. In Proceedings of the 6th International Conference on Very Large Data Bases (VLDB). 239-244.
13. KARP, R. M. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller, Ed. Plenum Press, New York, 85-103.
14. KELLER, A. M. AND ULLMAN, J. D. 1984. On complementary and independent mappings on databases. In Proceedings of the ACM SIGMOD. ACM, New York, 143-148.
15. LAURENT, D., LECHTENBÖRGER, J., SPYRATOS, N., AND VOSSEN, G. 2001. Monotonic complements for independent data warehouses. VLDB J. 10, 295-315.
16. LECHTENBÖRGER, J. 2003. Data warehouse schema design. Ph.D. dissertation, University of Muenster. Available as Vol. 79 in "Dissertationen zu Datenbanken und Informationssystemen," Akademische Verlagsgesellschaft Aka GmbH, Berlin, Germany, 2001. (Extended Abstract in Proceedings of the 10th Conference on Database Systems for Business, Technology and Web (BTW), 2003, 513-522).
17. QUASS, D., GUPTA, A., MUMICK, I. S., AND WIDOM, J. 1996. Making views self-maintainable for data warehousing. In Proceedings of the 4th PDIS. 158-169.
18. SAGIV, Y. AND YANNAKAKIS, M. 1980. Equivalences among relational expressions with the union and difference operators. J. ACM 27, 633-655.
19. SILBERSCHATZ, A., KORTH, H. F., AND SUDARSHAN, S. 2002. Database System Concepts, 4th ed. McGraw-Hill, New York.
20. VOSSEN, G. 2000. Data Models, Database Languages and Database Management Systems, 4th ed. (in German), Oldenbourg.