What are stored and derived attributes, Data Structure & Algorithms

What are stored and derived attributes? 

Stored attributes: The attributes kept in a data base are called stored attributes. 

Derived attributes: The attributes that are derived from the kept attributes are known as derived attributes.  

 

Posted Date: 7/27/2013 6:47:03 AM | Location : United States







Related Discussions:- What are stored and derived attributes, Assignment Help, Ask Question on What are stored and derived attributes, Get Answer, Expert's Help, What are stored and derived attributes Discussions

Write discussion on What are stored and derived attributes
Your posts are moderated
Related Questions
Assume you are in the insurance business. Find two examples of Type 2 slowly changing dimensions in that business. As an analyst on the project, write the specifications for applyi

Describe different methods of developing algorithms with examples.

Operation of Algorithm The following sequence of diagrams shows the operation of Dijkstra's Algorithm. The bold vertices show the vertex to which shortest path has been find ou

Q. Illustrate the result of running BFS and DFS on the directed graph given below using vertex 3 as source.  Show the status of the data structure used at each and every stage.

MID SQUARE METHOD

Representation of Linked list in Memory:- Each node has an info part and a pointer to the next node also known as link. The number of pointers is two in case of doubly linked

An adjacency matrix representation of a graph cannot having information of : Parallel edges

In assignment, you have already started the process of designing a database for the Beauty Salon mini-case (enclosed again below), mainly in the phase of conceptual database design

Algorithm to Delete a given node from a doubly linked list Delete a Node from Double Linked List DELETEDBL(INFO, FORW, BACK, START, AVAIL,LOC) 1. [Delete Node] Set FOR

We have discussed that the above Dijkstra's single source shortest-path algorithm works for graphs along with non-negative edges (like road networks). Given two scenarios can emerg