Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Visualizing Hierarchical Data

  • Graham WillsEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1380


Hierarchical graph layout; Hierarchical visualization; Information visualization on hierarchies; Multilevel visualization;Tree drawing; Visualizing trees


Hierarchical data is a data that can be arranged in the form of a tree. Each item of data defines a node in the tree, and each node may have a collection of other nodes as child nodes. The relationship between the parent nodes and the child nodes forms a tree network. The formal definition of a tree is that the graph formed by the nodes and edges (defined between parent and child node) is both connected and contains no cycles. The following properties of a tree are of more practical use from the point of view of displaying visualizations:
  • One node, called the root node, has no parent.

  • All other nodes have exactly one parent.

  • Nodes with no children are termed leaf nodes. Nodes with children are termed interior nodes.

  • For all nodes in a tree, there is a single unique path up the tree going from parent to parent’s...

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Di Battista G, Eades P, Tamassia R, Tollis I. Graph drawing: algorithms for the visualization of graphs. Englewood Cliffs: Prentice-Hall; 1999.zbMATHGoogle Scholar
  2. 2.
    Friendly M. The gallery of data visualization. http://www.math.yorku.ca/SCS/Gallery/

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.SPSS Inc.ChicagoUSA

Section editors and affiliations

  • Hans Hinterberger
    • 1
  1. 1.Inst. of Scientific ComputingETH ZürichZurichSwitzerland