This Postgraduate diploma will allow you to update your knowledge on Database Management in a practical way, 100% Online, without renouncing to the maximum academic rigor”

This program is intended for those interested in achieving a higher level of knowledge in Database Management. The main objective is to enable the student to apply in the real world the knowledge acquired in this Postgraduate diploma, in a work environment that reproduces the conditions that can be found in their future, in a rigorous and realistic way.

This Postgraduate diploma will prepare students for professional practice of Computer Engineering, thanks to a transversal and versatile training adapted to new technologies and innovations in this field. You will obtain wide knowledge in Database

Management, from the hand of professionals in the sector.

The professional should take advantage of the opportunity and take this course in a 100% online format, without having to give up their obligations, and making it easy for them to return to university. Update your knowledge and get your Postgraduate diploma  to continue growing personally and professionally.

This program will allow you to enhance your skills and update your knowledge in Database Management”

This Postgraduate diploma in Database Management contains the most complete and up-to-date program on the market. The most important features include:

• Development of 100 simulated scenarios presented by experts in Database Management
• Its graphic, schematic and practical contents, with which they are created, provide scientific and practical information on Database Management
• News on latest developments in Database Management
• Practical exercises where self-assessment can be used to improve learning
• Interactive learning system based on case method and its application to real practice
• All of this will be complemented by theoretical lessons, questions to the expert, debate forums on controversial topics, and individual reflection assignments
• Content that is accessible from any fixed or portable device with an Internet connection

Get qualified in Database Management with this intensive program, from the comfort of your own home”

It includes in its teaching staff a team of professionals belonging to the field of Computer Engineering, who pour into this program their work experience, in addition to recognized specialists belonging to reference societies and prestigious universities.

Its multimedia content developed with the latest educational technology will allow the professional a situated and contextual learning, that is, a simulated environment that will provide an immersive learning programmed to prepare for real situations.

The program design focuses on Problem-Based Learning, by means of which the teacher must try to solve the different professional practice situations that arise during the academic year. For this purpose, the professional will be assisted by an innovative system of interactive videos made by recognized experts in information systems with extensive teaching experience.

Take advantage of the latest educational technology to get up to date in Database Management without leaving home"

Learn about the latest techniques in Database Management from experts in the field"

The structure of the contents has been designed by a team of computer engineering professionals, aware of the current relevance of education to deepen in this area of knowledge, in order to humanistically enrich the student and raise the level of knowledge in Database Management by means of the latest educational technologies available.

This Postgraduate diploma in Database Management contains the most complete and updated of learning program on the market”

Module 1. Data Structure

1.1. Introduction to C ++ Programming

1.1.1. Classes, Constructors, Methods and Attributes
1.1.2. Variables
1.1.3. Conditional Expressions and Loops
1.1.4. Objects

1.2. Abstract Data Types (ADT)

1.2.1. Types of Data
1.2.2. Basic Structures and TADs
1.2.3. Vectors and Arrays

1.3. Linear data Structures

1.3.1. TAD List.Definition
1.3.2. Linked and Doubly Linked Lists
1.3.3. Sorted Lists
1.3.4. Lists in C++
1.3.5. TAD Stack
1.3.6. TAD Queue
1.3.7. Stack and Queue in C++

1.4. Hierarchical Data Structures

1.4.1. TAD Tree
1.4.2. Paths
1.4.3. N-Ary Trees
1.4.4. Binary Trees
1.4.5. Binary Search Trees

1.5. Hierarchical Data Structures: Complex Trees

1.5.1. Perfectly Balanced or Minimum Height Trees
1.5.2. Multipath Trees
1.5.3. Bibliographical References

1.6. Priority Mounds and Queue

1.6.1. TAD Mounds
1.6.2. TAD Priority Queue

1.7. Hash Tables

1.7.1. TAD Hash Table
1.7.2. Hash Functions
1.7.3. Hash Function in Hash Tables
1.7.4. Redispersion
1.7.5. Open Hash Tables

1.8. Graphs

1.8.1. TAD Graph
1.8.2. Types of Graphs
1.8.3. Graphical Representation and Basic Operations
1.8.4. Graph Design

1.9. Algorithms and Advanced Graph Concepts

1.9.1. Problems about Graphs
1.9.2. Path Algorithms
1.9.3. Search or Path Algorithms
1.9.4. Other Algorithms

1.10. Other Data Structures

1.10.1. Sets
1.10.2. Parallel Arrays
1.10.3. Symbol Tables
1.10.4. Tries

Module 2. Databases

2.1. Applications and Purposes of Database Systems

2.1.1. Applications of the Different Database Systems
2.1.2. Purpose of the Different Database Systems
2.1.3. Data overview

2.2. Database and Architecture

2.2.1. Relational Database
2.2.2. Database Design
2.2.3. Object-Based and Semi-Structured Databases
2.2.4. Data Storage and Queries
2.2.5. Transaction Management
2.2.6. Data Mining and Analysis
2.2.7. Database Architecture

2.3. The Relational Model: Structure, Operations and Extended Relational Algebra

2.3.1. The Structure of Relational Databases
2.3.2. Fundamental Operations in the Relational Algebra
2.3.3. Other Relational Algebra Operations
2.3.4. Extended Relational Algebra Operations
2.3.5. Null Values
2.3.6. Database Modification

2.4. SQL (I)

2.4.1. What is SQL?
2.4.2. The Definition of Data
2.4.3. Basic Structure of SQL Queries
2.4.4. Operations on Sets
2.4.5. Aggregation Functions
2.4.6. Null Values

2.5. SQL (II)

2.5.1. Nested Subqueries
2.5.2. Complex Queries
2.5.3. Views
2.5.4. Cursors
2.5.5. Complex Queries
2.5.6. Triggers

2.6. Database Design and the E-R Model

2.6.1. Overview of the Design Process
2.6.2. The Entity-Relationship Model
2.6.3. Restrictions

2.7. Entity-Relationship Diagrams

2.7.1. Entity-Relationship Diagrams
2.7.2. Entity-Relationship Design Aspects
2.7.3. Weak Entity Sets

2.8. The Extended Entity-Relationship Model

2.8.1. Characteristics of the Extended E-R Model
2.8.2. Design of a Database
2.8.3. Reduction to Relational Schemas

2.9. Designing from Relational Databases

2.9.1. Characteristics of Good Relational Designs
2.9.2. Atomic Domains and the First Normal Form (1FN)
2.9.3. Decomposition by Functional Dependencies
2.9.4. Theory of Functional Dependencies
2.9.5. Decomposition Algorithms
2.9.6. Decomposition by Means of Multivalued Dependencies
2.9.7. More Normal Forms
2.9.8. Database Design Process

2.10. NoSQL Databases

2.10.1. What are NoSQL Databases?
2.10.2. Analysis of the Different NoSQL Options and their Characteristics.
2.10.3. Mongo DB

Module 3. Advanced Databases

3.1. Introduction to the Different Database Systems

3.1.1. Historical Recap
3.1.2. Hierarchical Databases
3.1.3. Network Databases
3.1.4. Relational Databases
3.1.5. Non-Relational Databases

3.2. XML and Databases for the Web

3.2.1. Validation of XML Documents
3.2.2. XML Document Transformations
3.2.3. XML Data Storage
3.2.4. XML Relational Databases
3.2.5. SQL/XML
3.2.6. Native XML Databases

3.3. Parallel Databases

3.3.1. Parallel Systems
3.3.2. Parallel Database Architectures
3.3.3. Parallelism in Queries
3.3.4. Query Parallelism
3.3.5. Design of Parallel Systems
3.3.6. Parallel Processing in SQL

3.4. Distributed Databases

3.4.1. Distributed Systems
3.4.2. Distributed Storage
3.4.3. Availability
3.4.4. Distributed Query Processing
3.4.5. Distributed Database Providers

3.5. Indexing and Association

3.5.1. Ordered Indexes
3.5.2. Dense and Sparse Indexes
3.5.3. Multilevel Indices
3.5.4. Index Updating
3.5.5. Static Association
3.5.6. How to Use Indexes in Databases

3.6. Introduction to Transactional Processing

3.6.1. States of a Transaction
3.6.2. Implementation of atomicity and durability
3.6.3. Sequentiality
3.6.4. Recoverability
3.6.5. Isolation Implementation

3.7. Recovery Systems

3.7.1. Failure Classification
3.7.2. Storage Structures
3.7.3. Recovery and Atomicity
3.7.4. Retrieval Based on Historical Record
3.7.5. Concurrent Transactions and Retrieval
3.7.6. High Availability in Databases

3.8. Execution and Processing of Queries

3.8.1. Cost of a Query
3.8.2. Selection Operation
3.8.3. Sorting
3.8.4. Introduction to Query Optimization
3.8.5. Performance Monitoring

3.9. Non-Relational Databases

3.9.1. Document-Oriented Databases
3.9.2. Graph-Oriented Databases
3.9.3. Key-Value Databases

3.10. Data Warehouse, OLAP and Data Mining

3.10.1. Components of Data Warehouses
3.10.2. Architecture of a Data Warehouse
3.10.3. OLAP
3.10.4. Data Mining Functionality
3.10.5. Other Types of Mining

A unique, key, and decisive educational experience to boost your professional development”