Encyclopedia of Database Systems

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


  • Jean-Daniel FeketeEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1132


Treemaps [ 1] have been designed to visualize rooted trees using containment to express the hierarchy (Fig. 1 right). It is a space-filling technique and uses all the available space to render the tree. One important feature of Treemaps is their use of surface to represent an attribute value that adds up with the hierarchy. The number of leaves under a node is the simplest of these attributes. This number is one for a leaf and, for an interior node, it is the sum of the number of leaves of all its children.
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Shneiderman B. Tree visualization with tree-maps: 2-d space-filling approach. ACM Trans Graph. 1992;11(1):92–9.zbMATHCrossRefGoogle Scholar
  2. 2.
    Bruls M, Huizing K, van Wijk JJ. Squarified treemaps. In: de Leeuw W, van Liere R, editors. Data Visualization 2000, proceedings of the joint eurographics and IEEE TCVG symposium on visualization. Springer: Vienna; 2000. p. 33–42.Google Scholar
  3. 3.
    Bederson BB, Shneiderman B, Wattenberg M. Ordered and quantum treemaps: making effective use of 2D space to display hierarchies. ACM Trans Graph. 2002;21(4):833–54.CrossRefGoogle Scholar
  4. 4.
    Fekete JD, Plaisant C. Interactive information visualization of a million items. In: Proceedings of the IEEE Symposium on Information Visualization; 2002. p. 117–24.Google Scholar
  5. 5.
    Balzer M, Deussen O. Voronoi treemaps. In: Proceedings of the IEEE Symposium on Information Visualization; 2005. p. 48–56.Google Scholar

Copyright information

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

Authors and Affiliations

  1. 1.INRIALRI University Paris SudOrsay CedexFrance

Section editors and affiliations

  • Daniel A. Keim
    • 1
  1. 1.Computer Science DepartmentUniversity of KonstanzKonstanzGermany