Browsing Hierarchical Data with Multi-Level Dynamic Queries and Pruning

Abstract

Users often must browse hierarchies with thousands of nodes in search of those that best match their information needs. The Tree-browser visualization tool was specified, designed and developed for this purpose. This tool presents trees in two tightly-coupled views, one a detailed view and the other an overview. Userscan use dynamic queries, a method for rapidly filtering data, to filter nodes ateach level of the tree. The dynamic query panels are user-customizable. Sub trees of unselected nodes are pruned out, leading to compact views of relevant nodes.The software architecture, data structures and algorithms used to achieve this behavior are specified. Usability testing of the Tree-browser, done with 8 subjects, helped assess strengths and identify possible improvements. TheTree-browser was applied to the Network Management (600 nodes) and UniversityFinder (1100 nodes) applications. Future research directions are suggested.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1994
Accession Number
AD1005555

Entities

People

  • Harsha P. Kumar

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Space

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Satellites
  • Beta Testing
  • Communication Networks
  • Department Of Defense
  • Filters
  • Filtration
  • Hierarchies
  • Maryland
  • Networks
  • Software Design
  • Universities
  • Visualizations
  • Websites

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Database Systems and Applications
  • Systems Analysis and Design