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
A Stack has an ordered list of elements & an array is also utilized to store ordered list of elements. Therefore, it would be very simple to manage a stack by using an array. Thoug

CIRCULARLY LINKED LISTS IMPLEMENTATION A linked list wherein the last element points to the first element is called as CIRCULAR linked list. The chains do not specified first o

Asymptotic notation Let us describe a few functions in terms of above asymptotic notation. Example: f(n) = 3n 3 + 2n 2 + 4n + 3 = 3n 3 + 2n 2 + O (n), as 4n + 3 is of

Q.1 What is an algorithm? What are the characteristics of a good algorithm? Q.2 How do you find the complexity of an algorithm? What is the relation between the time and space c

The complexity of multiplying two matrices of order m*n and n*p is    mnp

Q. Give the adjacency matrix for the graph drawn below:                                                 Ans: Adjacency matrix for the graph given to us

A  BST is traversed in the following order recursively: Right, root, left e output sequence will be in In Descending order

Q. Draw a B-tree of order 3 for the sequence of keys written below: 2, 4, 9, 8, 7, 6, 3, 1, 5, 10

A LGORITHM (Deletion of an element from the linked list) Step 1  Begin Step 2  if the list is empty, then element cannot be deleted Step 3  else, if the element to be del

The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum One node