Kumar, H.P.; Plaisant, C.; Shneiderman, B.: Browsing hierarchical data with multi-level dynamic queries and pruning (1997)
0.00
0.002269176 = product of:
0.004538352 = sum of:
0.004538352 = product of:
0.009076704 = sum of:
0.009076704 = weight(_text_:a in 750) [ClassicSimilarity], result of:
0.009076704 = score(doc=750,freq=10.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.1709182 = fieldWeight in 750, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=750)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- The PDQ Tree-browser (Pruning with Dynamic Queries) visualization tool was specified, designed and developed for browsing hierarchies with a large number of nodes. It presents trees in 2 tightly coupled views, one a detailed view and the other an overview. Users can use dynamic queries, a method for rapidly filtering data, to filter nodes at each level of the tree. The dynamic query panels are user-customisable. Sub-trees of unselected nodes are pruned out, leading to compact views of the relevant nodes. Usability testing of the PDQ Tree-browser, done with 8 subjects, helped assess strengths and identify possible improvements. It was used in Network Management (600 nodes) and UniversityFinder (1100 nodes) applications. A controlled experiment, with 24 subjects, showed that pruning significantly improved performance speed and subject user satisfaction
- Type
- a
