Relational Algebra and Relational Calculus Relational model is completely based on relational algebra. It consists of a collection of operators that operate on relations. Its main objective is data retrieval. It is more operational and very much useful to represent execution plans, while relational calculus is non-operational and declarative. Here,Continue Reading
Concept of rdbms Tutorial Study Material Notes with Examples Relational Database Management System (RDBMS) A System in who users access data with use of relation (i.e., data must be available in tabular form i.e., as a collection of tables, where each consisting a set of rows and columns). That provides aContinue Reading
Schema in dbms Tutorial Study Material Notes with Examples What is Schema A schema is also known as database schema. It is a logical design of the database and a database instance is a snapshot of the data n the database at a given instant of time. A relational schemaContinue Reading
Tree in Design and Analysis of Algorithm Study Notes with Examples Tree A tree is the data structure that are based on hierarchical tree structure with set of nodes. It is a acyclic connected graph with one or more children nodes and at most one root node. In a tree,Continue Reading
Collision in Design and Analysis of Algorithm Study Notes with Example Collision No matter what the hash function, there is the Possibility that two different keys could resolve to the same hash address. This situation is known as a collision .When this situation occur, there are two simple methods toContinue Reading
Hashing in Design and Analysis of Algorithm Study Notes with Example Hashing Hashing is a common method of accessing data records. Hashing is the process of mapping large amount of data item to a smaller table with the help of hashing function. Linear Search Versus HashingContinue Reading
Sorting in Design and Analysis of Algorithm Study Notes with Example Sorting In Computer Science, sorting operation is used to put the elements of list in a certain order, i.e., either in non-decreasing or decreasing order. Sorting can be of two types In-place sorting Stable Sorting In-place Sorting The in-placeContinue Reading
Searching in Design and Analysis of Algorithm Study Notes with Example Searching In computer science, search operation is used for finding an item with specified properties among a collection of items. Searching can be done in two ways Sequential Search (Linear Search) This is the most common algorithm which startsContinue Reading
Introduction of Design and Analysis of Algorithm Study Notes with Example Design and Analysis of AlgorithmsContinue Reading
Graph in C Language Tutorial Notes Study Material with Examples Graph A graph is a set of vertices and edges which connects them. A graph G consists of two things A set of vertices V. A set of edges E such that edge e in E is identified with aContinue Reading
Designed using Magazine News Byte. Powered by WordPress.