Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Skip header Section
Relational database theoryJanuary 1993
Publisher:
  • Benjamin-Cummings Publishing Co., Inc.
  • Subs. of Addison-Wesley Longman Publ. Co390 Bridge Pkwy. Redwood City, CA
  • United States
ISBN:978-0-8053-0249-3
Published:01 January 1993
Pages:
368
Skip Bibliometrics Section
Bibliometrics
Abstract

No abstract available.

Cited By

  1. Guo Q, Zhang C, Zhang S and Lu J (2024). Multi-model query languages: taming the variety of big data, Distributed and Parallel Databases, 42:1, (31-71), Online publication date: 1-Mar-2024.
  2. ACM
    Besta M, Gerstenberger R, Peter E, Fischer M, Podstawski M, Barthels C, Alonso G and Hoefler T (2023). Demystifying Graph Databases: Analysis and Taxonomy of Data Organization, System Designs, and Graph Queries, ACM Computing Surveys, 56:2, (1-40), Online publication date: 29-Feb-2024.
  3. Hegner S FD covers and universal complements of simple projections Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems, (184-202)
  4. Biskup J Some remarks on relational database schemes having few minimal keys Conceptual Modelling and Its Theoretical Foundations, (19-28)
  5. Santos E, Martins J and Galhardas H An Argumentation-based Approach to Database Repair Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence, (125-130)
  6. ACM
    Batini C, Grega S and Maurino A Optimal enterprise data architecture using publish and subscribe Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing, (541-547)
  7. ACM
    Hill J CUTS Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2, (309-310)
  8. ACM
    Belohlavek R and Vychodil V Query systems in similarity-based databases Proceedings of the 2010 ACM Symposium on Applied Computing, (1648-1655)
  9. ACM
    Batini C, Cappiello C, Francalanci C and Maurino A (2009). Methodologies for data quality assessment and improvement, ACM Computing Surveys (CSUR), 41:3, (1-52), Online publication date: 1-Jul-2009.
  10. ACM
    Jones M and Diatchki I (2008). Language and program design for functional dependencies, ACM SIGPLAN Notices, 44:2, (87-98), Online publication date: 28-Jan-2009.
  11. ACM
    Jones M and Diatchki I Language and program design for functional dependencies Proceedings of the first ACM SIGPLAN symposium on Haskell, (87-98)
  12. Mouhoub M and Feng C Efficient Handling of Relational Database Combinatorial Queries Using CSPs Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence, (369-378)
  13. Ng W Prioritized preferences and choice constraints Proceedings of the 26th international conference on Conceptual modeling, (261-276)
  14. Lu A and Ng W Handling inconsistency of vague relations with functional dependencies Proceedings of the 26th international conference on Conceptual modeling, (229-244)
  15. Carreira P, Galhardas H, Lopes A and Pereira J (2007). One-to-many data transformations through data mappers, Data & Knowledge Engineering, 62:3, (483-503), Online publication date: 1-Sep-2007.
  16. Ng W Preference functional dependencies for managing choices Proceedings of the 25th international conference on Conceptual Modeling, (140-154)
  17. Hartmann S and Trinh T Axiomatising functional dependencies for XML with frequencies Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems, (159-178)
  18. Penzo W (2005). Rewriting Rules To Permeate Complex Similarity and Fuzzy Queries within a Relational Database System, IEEE Transactions on Knowledge and Data Engineering, 17:2, (255-270), Online publication date: 1-Feb-2005.
  19. Vardi M Model checking for database theoreticians Proceedings of the 10th international conference on Database Theory, (1-16)
  20. Osei-Bryson K and Ngwenyama O (2019). Supporting Semantic Diversity in the Relational Data Model, Information Systems Frontiers, 6:3, (277-285), Online publication date: 1-Sep-2004.
  21. Seleznjev O and Thalheim B (2003). Average Case Analysis in Database Problems, Methodology and Computing in Applied Probability, 5:4, (395-418), Online publication date: 1-Dec-2003.
  22. Dardzińska A and Raś Z CHASE Proceedings of the Second international conference on Active Mining, (255-267)
  23. Hartmann S (2019). On the implication problem for cardinality constraints and functional dependencies, Annals of Mathematics and Artificial Intelligence, 33:2-4, (253-307), Online publication date: 26-Nov-2001.
  24. ACM
    Ng W (2001). An extension of the relational data model to incorporate ordered domains, ACM Transactions on Database Systems (TODS), 26:3, (344-383), Online publication date: 1-Sep-2001.
  25. Castano S, De Antonellis V and De Capitani di Vimercati S (2001). Global Viewing of Heterogeneous Data Sources, IEEE Transactions on Knowledge and Data Engineering, 13:2, (277-297), Online publication date: 1-Mar-2001.
  26. Moal F, Turmeaux T and Vrain C Mining Relational Databases Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery, (536-541)
  27. Levene M and Vincent M (2000). Justification for Inclusion Dependency Normal Form, IEEE Transactions on Knowledge and Data Engineering, 12:2, (281-291), Online publication date: 1-Mar-2000.
  28. Ng W Lexicographically Ordered Functional Dependencies and Their Application to Temporal Relations Proceedings of the 1999 International Symposium on Database Engineering & Applications
  29. ACM
    Levene M and Loizou G (1999). Database design for incomplete relations, ACM Transactions on Database Systems (TODS), 24:1, (80-126), Online publication date: 1-Mar-1999.
  30. Castano S and Antonellis V Deriving Global Conceptual Views from Multiple Information Sources Selected Papers from the Symposium on Conceptual Modeling, Current Issues and Future Directions, (44-55)
  31. Castano S and De Antonellis V (1999). A Discovery-Based Approach to Database Ontology Design, Distributed and Parallel Databases, 7:1, (67-98), Online publication date: 1-Jan-1999.
  32. Meo R, Psaila G and Ceri S (1998). An Extension to SQL for Mining Association Rules, Data Mining and Knowledge Discovery, 2:2, (195-224), Online publication date: 1-Jun-1998.
  33. Lim W Discovery of Constraints from Data for Information System Reverse Engineering Proceedings of the Australian Software Engineering Conference
  34. ACM
    Russomanno D An automated inference approach to network derivation for AM/FM/GIS systems Proceedings of the 4th ACM international workshop on Advances in geographic information systems, (90-97)
  35. Meo R, Psaila G and Ceri S A New SQL-like Operator for Mining Association Rules Proceedings of the 22th International Conference on Very Large Data Bases, (122-133)
  36. ACM
    Catarci T, Costabile M, Massari A, Saladini L and Santucci G (1996). A multiparadigmatic environment for interacting with databases, ACM SIGCHI Bulletin, 28:3, (89-96), Online publication date: 1-Jul-1996.
  37. Roddick J, Craske N and Richards T (1996). Handling Discovered Structure in Database Systems, IEEE Transactions on Knowledge and Data Engineering, 8:2, (227-240), Online publication date: 1-Apr-1996.
  38. ACM
    Mok W, Ng Y and Embley D (1996). A normal form for precisely characterizing redundancy in nested relations, ACM Transactions on Database Systems (TODS), 21:1, (77-106), Online publication date: 1-Mar-1996.
  39. Eden P A Step by Step Method for Conceptual Data Analysis Proceedings of the 1996 International Conference on Software Engineering: Education and Practice (SE:EP '96)
Contributors
  • Roma Tre University
  • University of Brescia

Reviews

Jane B. Grimson

It is interesting to note that although dozens of new books on databases, and on relational databases in particular, are published every year, few address relational database theory in a comprehensive way. Indeed, this book is the first major book on relational database theory to be published since Maier's work [1] ten years ago. Yet even a cursory glance at the main database research journals reveals an enormous amount of research in theory over the past decade. Why, therefore, the reluctance to publish textbooks on the subject__?__ While virtually all undergraduate programs in computer science include a course on databases, the theoretical aspects are usually only covered at the postgraduate level and hence the market for such textbooks is much smaller. Another reason could be that it is difficult to make the subject interesting. Few people would sit down and read a textbook on any subject from cover to cover, and virtually no one will if the book is concerned primarily with theory. Atzeni and De Antonellis make a valiant attempt to make the subject interesting by including lots of practical examples of the theoretical concepts they present. The authors' relaxed, informal style guides the reader easily through the maze of notation. The somewhat dull visual presentation of the book does little to overcome the inherent dryness of the topic, however. The book appears to have been prepared directly from a camera-ready <__?__Pub Fmt texinput>\LaTeX<__?__Pub Fmt /texinput>-<__?__Pub Caret1>prepared manuscript, which makes the price of $51.75 (hardcover) seem high. I found the notation used unnecessarily fussy and sometimes at odds with what is commonplace elsewhere in the literature. This complexity could surely only confuse the student who is struggling to come to terms with what is undoubtedly a difficult area. On the positive side, the book provides comprehensive and up-to-date coverage of relational database theory and includes recent research results on the weak instance approach, generalization, and logic and databases. These topics occupy the last three chapters, which were well worth reading. Another useful feature of the book is a comprehensive annotated bibliography at the end of each chapter. It provides an excellent guide to the vast research literature, both old and new, and should prove invaluable to researchers. This new book on relational database theory is welcome and will provide a useful addition to Maier. Also, at approximately half the length of Maier's book, it might be less daunting.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Recommendations