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
1. develop an algorithm which reads two decimal numbers x and y and determines and prints out wether x>y or y>x. the input values, x and y, are whole number > or equal to 0, which

Write an algorithm by using pseudocode which: Inputs top speeds of 5000 cars Outputs fastest speed and the slowest speed Outputs average speed of all the 5000 cars

Determine about the Post conditions assertion A  post condition is an assertion which should be true at completion of an operation. For instance, a post condition of the squ

Question 1 Discuss the advantages of implementation checks preconditions Question 2 Write a ‘C' program to search for an item using binary search Question 3 Show that To

Q. Write  down the  algorithm  to  insert  an  element  to  a  max-heap  which  is  represented sequentially.           Ans: The algorithm to insert an element "newkey" to

What are the languages which support assertions Languages which support assertions often provide different levels of support. For instance, Java has an assert statement which t

It does not have any cycles (circuits, or closed paths), which would imply the existence of more than one path among two nodes. It is the most general kind of tree, and might be co

A stack is a last in, first out (LIFO) abstract data type and sequential data structure. A stack may have any abstract data type as a component, but is characterized by two fundame

Example: Insertion of a key 33 into a B-Tree (w/split) Step 1: Search first node for key closet to 33. Key 30 was determined. Step 2: Node pointed through key 30, is se

calculate gpa using an algorithm