tree structure
Home > Data management / BI Definitions - Tree structure
SearchDataManagement.com Definitions (Powered by WhatIs.com)
EMAIL THIS
LOOK UP TECH TERMS Powered by: WhatIs.com
Search listings for thousands of IT terms:
Browse tech terms alphabetically:
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z #

tree structure


Show me everything on Data warehouse software

DEFINITION - A tree structure is an algorithm for placing and locating files (called records or keys) in a database. The algorithm finds data by repeatedly making choices at decision points called nodes. A node can have as few as two branches (also called children), or as many as several dozen. The structure is straightforward, but in terms of the number of nodes and children, a tree can be gigantic.

In a tree, records are stored in locations called leaves. This name derives from the fact that records always exist at end points; there is nothing beyond them. The starting point is called the root. The maximum number of children per node is called the order of the tree. The maximum number of access operations required to reach the desired record is called the depth. In some trees, the order is the same at every node and the depth is the same for every record. This type of structure is said to be balanced. Other trees have varying numbers of children per node, and different records might lie at different depths. In that case, the tree is said to have an unbalanced or asymmetrical structure.

The illustration shows three examples of tree structures. (Note that the portrayals are upside-down compared to real tree plants.) Structures A and B are balanced, and structure C is unbalanced. Roots are at the top, and are represented by red arrows and red lines. Nodes are shown as gray dots. Children are solid black lines. Leaves are at the bottom, and are represented by green dots. As the process moves toward the leaves and away from the root, children can branch out from a node, but children never merge into a node.

In a practical tree, there can be thousands, millions, or billions of nodes, children, leaves, and records. Not every leaf necessarily contains a record, but more than half do. A leaf that does not contain data is called a null. The trees shown here are simple enough to be rendered in two dimensions, but with some large databases, three dimensions are needed to clearly depict the structure.

Also see binary tree, B-tree, M-tree, quad tree, splay tree, and X-tree.

Learn more about Data warehouse software
Data Warehouse Platforms Product Directory: Inside this data warehouse platform product directory you'll find basic information about the major vendors in the data warehouse market and the products they sell.
How to evaluate data warehouse software in five steps: What's the process for evaluating data warehouse software?
How to choose between the Inmon vs. Kimball approach for data warehouse design: What's your take on the Ralph Kimball vs. Bill Inmon approaches to data warehouse design?
Understanding and comparing six types of processing systems: Learn about six types of processing systems and how transaction processing systems compare with batch processing, real-time, data warehouse, timesharing and client/ server systems.
Key benchmarks for measuring transaction processing performance: Find key benchmarks for measuring transaction processing performance at your company, plus learn about XA two-phase commit and types of transaction processing.
Transaction processing system examples and SOA approaches: Learn about transaction processing systems, processing systems components and different service-oriented architecture approaches, including representational state transfer.
Data Warehouse Platforms Product Directory: Inside this data warehouse platform product directory you'll find basic information about the major vendors in the data warehouse market and the products they sell.
SearchDataManagement.com product directory library: These product directories are designed to assist organizations in evaluating and purchasing data management software

LAST UPDATED: 04 Nov 2005

Do you have something to add to this definition? Let us know.
Send your comments to techterms@whatis.com





FILE EXTENSION AND FILE FORMAT LIST
File Extension and File Format List:
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z #


RELATED CONTENT
Oracle's data warehouse strategy unclear after Sun acquisition
With its acquisition of Sun Microsystems complete, Oracle faces a slew of questions regarding its data warehouse strategy.
Mega-vendors dominate Gartner's 2010 BI, data warehouse Magic Quadrants
IT heavyweights Oracle, IBM and Microsoft continue to control large segments of the BI software and data warehouse markets, according to Gartner's...
Transaction processing system examples and SOA approaches
Learn about transaction processing systems, processing systems components and different service-oriented architecture approaches, including...

RELATED GLOSSARY TERMS
Terms from Whatis.com − the technology online dictionary
data modeling  (SearchDataManagement.com)
Data modeling is the analysis of data objects that are used in a business or other context and the identification of the relationships among these...
extract, transform, load  (SearchDataManagement.com)
In managing databases, extract, transform, load (ETL) refers to three separate functions combined into a single programming tool.




tree structure Research White Papers
About Us  |  Contact Us  |  For Advertisers  |  For Business Partners  |  Site Index  |  RSS
SEARCH 
TechTarget provides technology professionals with the information they need to perform their jobs - from developing strategy, to making cost-effective purchase decisions and managing their organizations' technology projects - with its network of technology-specific websites, events and online magazines.

TechTarget Corporate Web Site  |  Media Kits  |  Site Map




All Rights Reserved, Copyright 2005 - 2010, TechTarget | Read our Privacy Policy
  TechTarget - The IT Media ROI Experts