scientific article; zbMATH DE number 3890770
[For a review of the first edition see Zbl 0416.68086.] The field of database management now plays a central role in the application of computers. The purpose of this monograph is to provide an overview on some important ideas in database theory including an explanation how the theory can be used for system design. The book is designed for practicing computer scientists and for database courses. Chapter 1 introduces basic concepts of a DBMS. The role of a data model is outlined and three most widely known data models are described. Chapter 2 discusses the principal file organization methods as the basic problem in physical database representation. In Chapters 3-4 the DBTG proposal, and the hierarchical data model, their implementation, and the data manipulation languages are studied. Chapter 5 explains the relational data model and covers three approaches to the design of query languages - i.e. relation algebra, domain and tuple calculus. The equivalence in expressive power of the three abstract languages is proved. In Chapter 6 some real languages such as ISBL, QUEL, Query-by- Example, and SEQUEL are described. Chapter 7 discusses the difficult topic of design theory for relational databases based on the notion of dependency. The given design algorithms concern functional and multivalued dependencies. In Chapter 8 the problem of query optimization is treated. The strategies are shown on actual DBMS such as System R and INGRES. Chapter 9 covers a discussion of universal relation systems, which supports a user view that looks like a single relation. In Chapter 10 integrity and security aspects of a DBMS are considered. Some methods of concurrency control are introduced in Chapter 11. Chapter 12 concludes the book by outlining optimization techniques and problems of concurrency control in distributed DBS. Throughout the book there are many exercises, some of which can be used as starting points for further research.
- Linear connectivity problems in directed hypergraphs
- On the existence of acyclic views in a database scheme
- Ordering conjunctive queries
- Inferences for numerical dependencies
- Non-finite specifiability of projections of functional dependency families
- The principle of optimality in the design of efficient algorithms
- Fixed-point extensions of first-order logic
- An algebraic theory of functional and multivalued dependencies in relational databases
- Correctness of semantic integrity checking in database management systems
- A natural semantics for modal logic over databases
- A family of NP-complete data aggregation problems
- Constraint satisfaction from a deductive viewpoint
- On the size of nonredundant FD-covers
- An integer programming formulation embedded in an algorithm for query processing optimization in distributed relational database systems
- Composing recursive logic programs with clausal join
- The generalized counting method for recursive logic queries
- On the desirability of \(\gamma\)-acyclic BCNF database schemes
- Optimal multidisk partial match file designs
- Concurrency and trie hashing
- Completeness issues for join dependencies derived from the universal relation join dependency
- Testing unboundedness of database schemes and functional dependencies
- HCB-tree: a height compressed B-tree for parallel processing
- Heuristics for syntactical optimization of relational queries
- Boyce-Codd normal form and object normal forms
- On the expressive power of database queries with intermediate types
- Connection-trap-free database schemes
- Functional dependencies and normal forms in the fuzzy relational database model
- Conceptual level concurrency control of relational update transactions
- Equivalence of the relational algebra and calculus for nested relations
- Polynomial tests of normal forms and some related results
- Generating hinges from arbitrary subhypergraphs
- On characterizing boundedness of database schemes with bounded dependencies
- Query languages for hierarchic databases
- Selective inheritance of attribute values in relational databases
- Preservation of integrity constraints in definite DATALOG programs
- SQL translation using an attribute grammar
- A relational approach to logic programming: The extended Alexander method
- Fuzzy information in extended fuzzy relational databases
- Irreversibility problem in NL-class relations
- Fast parallel constraint satisfaction
- A note on the equivalence of a set of egds to a set of FDs
- Optimal distributed execution of join queries
- Incorporating processor costs in optimizing the distributed execution of join queries
- A deontic approach to database integrity
- Incomplete deductive databases
- A logical design method for relational databases based on generalization and aggregation semantics
- Minimizing the response time of executing a join between fragmented relations in a distributed database system
- Finitely representable databases
- A first step towards implementing dynamic algebraic dependences
- Fuzzy functional dependencies and Bayesian networks
- Structural, elicitation and computational issues faced when solving complex decision making problems with influence diagrams
- Subscript-free modeling languages: A tool for facilitating the formulation and use of models
- Partially dynamic maintenance of minimum weight hyperpaths
- Directed hypergraphs and applications
- Page-queries as a tool for organizing secondary memory auxiliary databases. II: Optimal selection of SADB contents
- Evaluating multiple join queries in a distributed database system
- Independent database schemes under functional and inclusion dependencies
- A parallel implementation of flat concurrent Prolog
- Automatic generation of test data for relational queries
- Finite queries do not have effective syntax.
- A general framework for reasoning about change
- Sets and indices in linear programming modelling and their integration with relational data models
- Executing join queries in an uncertain distributed environment
- Allocating relations in a distributed database system
- The propagation of updates to relational tables in a distributed database system
- Fuzzy functional dependencies and independencies in extended fuzzy relational database models
- The dependency-preserving decomposition and a testing algorithm in a fuzzy relational data model
- Learning directed relational models with recursive dependencies
- Modelling relational statistics with Bayes nets
- An analytical approach to the inference of summary data of additive type
- On axioms constituting the foundation of hypergraph theory
- Fast learning of relational dependency networks
- A historical query language
- Objects in relational database schemes with functional, inclusion, and exclusion dependencies
- scientific article; zbMATH DE number 3852464 (Why is no real title available?)
- scientific article; zbMATH DE number 3852465 (Why is no real title available?)
- A formal semantics for sql
- A theory of data dependencies over relational expressions
- scientific article; zbMATH DE number 3907812 (Why is no real title available?)
- scientific article; zbMATH DE number 3915665 (Why is no real title available?)
- scientific article; zbMATH DE number 3926291 (Why is no real title available?)
- scientific article; zbMATH DE number 3930378 (Why is no real title available?)
- Une approche quantitative de l'exclusion mutuelle
- scientific article; zbMATH DE number 3984618 (Why is no real title available?)
- scientific article; zbMATH DE number 4005645 (Why is no real title available?)
- scientific article; zbMATH DE number 4068237 (Why is no real title available?)
- Relocation problems are hard
- scientific article; zbMATH DE number 42190 (Why is no real title available?)
- scientific article; zbMATH DE number 46334 (Why is no real title available?)
- scientific article; zbMATH DE number 108404 (Why is no real title available?)
- scientific article; zbMATH DE number 108405 (Why is no real title available?)
- The architectural logic of database systems
- scientific article; zbMATH DE number 193754 (Why is no real title available?)
- A guided tour of relational database and beyond
- scientific article; zbMATH DE number 549926 (Why is no real title available?)
- scientific article; zbMATH DE number 623591 (Why is no real title available?)
- scientific article; zbMATH DE number 978883 (Why is no real title available?)
- Algorithms and data structure in VLSI design. DBDD - foundations and applications
- Upper bound on the communication complexity of private information retrieval
- Fast parallel constraint satisfaction
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347338)