Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Articles on Trending Technologies
Technical articles with clear explanations and examples
Many-to-Many Relationship in DBMS
Many-to-Many relationship in DBMS is a relationship between more than one instance of an entity with more than one instance of another entity i.e. both the entities can have many relationships between each other.The relation can be stated as −Let us see an example −Many Authors can write a Book, whereas an Author has written more than one book.Here, Book and Author are entities.Let’s say a book has two authors, whereas an individual author has written six books till now.
Read MoreDatabase Design Methodologies
Database Design Methodologies has phases to guide the designer for assistance. The Methodology has a structured approach to help in the design process.The following are the phases/ models −Conceptual PhaseThe Conceptual phase lets you know the entities and the relation between them. It describes the conceptual schema. The entities & relations are defined here.Logical PhaseLogical data model provides details about the data to the physical phase. The physical process gives ER Diagram, data dictionary, schema, etc that acts as a source for the physical design process.Physical PhaseThe physical database design allows the designer to decide on how the database will ...
Read MoreHistory of Data Models and Databases
The history of data models had three generations of DBMS −Hierarchical System was the first generation of DBMS. The first generation also came with the CODASYL system. Both of them introduced in 1960s.The second generation includes the Relational Model. Dr. E.F.Codd introduced it in 1970.The third generation includes Object-Relational DBMS and Object-Oriented DBMS.The history timeline of databases is shown below −File based systemsFile based systems came in 1960s and was widely used. It stores information and organize it into storage devices like a hard disk, a CD-ROM, USB, SSD, floppy disk, etc.Relational ModelRelational Model introduced by E.F.Codd in 1969. The ...
Read MoreTypes of Entity Relationships in DBMS
Entity in DBMS can be a real-world object with an existence, For example, in a Company database, the entities can be Employees, Department, Project, etc. In a College database, the entities are Profession, Students, Result, Activities, etc.An entity is represented as a single rectangle, shown belowThe following are the entity relationships −One-to-One RelationshipUnder One-to-One (1:1) relationship, an instance of entity P is related to instance of entity Q and an instance of entity Q is related to instance of entity P.Let us see an example −A person can have only one passport, and a passport is assigned to a single person.One-to-Many RelationshipUnder ...
Read MoreIdentifying Entity Relationships in DBMS
Identifying entity relationships in DBMS is used to identify a relationship between strong and weak entity.Before beginning, let us take an example of Professor entity, which is our Strong Entity, with Professor_ID as a Primary Key −Professor_IDProfessor_NameProfessor_CityProfessor_SalaryThe weak entity is Professor_Dependents entity:NameDOBRelationNow, let us continue, Weak EntityWeak Entity is dependent on Strong Entity and does not have a primary key. Weak Entity has a partial key. It is represented as double rectangle −Strong EntityOther entities are dependent on Strong Entity and it has a key attribute i.e. a primary key and represented as a single rectangle.Identifying RelationshipsIt links the strong and weak entity ...
Read MoreEvolution of Data Models
Managing data was the key and was essential. Therefore, data model originated to solve the file system issues. Here are the Data Models in DBMS −Hierarchical ModelIn Hierarchical Model, a hierarchical relation is formed by collection of relations and forms a tree-like structure.The relationship can be defined in the form of parent child type.One of the first and most popular Hierarchical Model is Information Management System (IMS), developed by IBM.ExampleThe hierarchy shows an Employee can be an Intern, on Contract or Full- Time. Sub-levels show that Full-Time Employee can be hired as a Writer, Senior Writer or Editor:AdvantagesThe design of ...
Read MoreDepth-first search traversal in Javascript
DFS visits the child vertices before visiting the sibling vertices; that is, it traverses the depth of any particular path before exploring its breadth. A stack (often the program's call stack via recursion) is generally used when implementing the algorithm.Following is how a DFS works −Visit the adjacent unvisited vertex. Mark it as visited. Display it. Push it in a stack.If no adjacent vertex is found, pop up a vertex from the stack. (It will pop up all the vertices from the stack, which do not have adjacent vertices.)Repeat Rule 1 and Rule 2 until the stack is empty.Let us ...
Read MoreTopological sorting using Javascript DFS
A topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge UV from vertex u to vertex v, u comes before v in the ordering. This only makes sense in directed graphs.There are many places where topological sort makes a lot of sense. For example, let's say you're following a recipe, in this, there are some steps that are must for going to the next steps. But some of these can be performed in parallel. In a similar fashion, during college when selecting courses, there are some prerequisites ...
Read MoreShortest path algorithms in Javascript
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. Here we need to modify our add edge and add directed methods to allow adding weights to the edges as well. Let us look at how we can add this −Example/** * Adds 2 edges with the same weight in either direction * * weight * node1 node2 * ...
Read MoreDijkstra's algorithm in Javascript
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a weighted graph. We'll use the new addEdge and addDirectedEdge methods to add weights to the edges when creating a graph. Let us look at how this algorithm works −Create a distance collection and set all vertices distances as infinity except the source node.Enqueue the source node in a min-priority queue with priority 0 as the distance is 0.Start a loop till the priority queue is empty and dequeue the node with the minimum distance from it.Update the distances of the connected nodes to the popped node ...
Read More