Browsing hierarchical data with multi-level dynamic queries and pruning
Users often must browse hierarchies with thousands of nodes in search of those that best match their information needs. ThePDQ Tree-browser(Pruning with Dynamic Queries) visualization tool was specified, designed and developed for this purpose. This tool presents trees in two tightly-coupled views,...
Saved in:
| Published in | International journal of human-computer studies Vol. 46; no. 1; pp. 103 - 124 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Ltd
01.01.1997
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1071-5819 1095-9300 |
| DOI | 10.1006/ijhc.1996.0085 |
Cover
| Abstract | Users often must browse hierarchies with thousands of nodes in search of those that best match their information needs. ThePDQ Tree-browser(Pruning with Dynamic Queries) 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. 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-customizable. Sub-trees of unselected nodes are pruned out, leading to compact views of relevant nodes. Usability testing of the PDQ Tree-browser, done with eight subjects, helped assess strengths and identify possible improvements. The PDQ Tree-browser 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 subjective user satisfaction. Future research directions are suggested. |
|---|---|
| AbstractList | Users often must browse hierarchies with thousands of nodes in search of those that best match their information needs. ThePDQ Tree-browser(Pruning with Dynamic Queries) 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. 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-customizable. Sub-trees of unselected nodes are pruned out, leading to compact views of relevant nodes. Usability testing of the PDQ Tree-browser, done with eight subjects, helped assess strengths and identify possible improvements. The PDQ Tree-browser 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 subjective user satisfaction. Future research directions are suggested. 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 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. Original abstract-amended. Users often must browse hierarchies with thousands of nodes in search of those that best match their information needs. The PDQ Tree-browser (Pruning with Dynamic Queries) 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. 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-customizable. Sub-trees of unselected nodes are pruned out, leading to compact views of relevant nodes. Usability testing of the PDQ Tree-browser, done with eight subjects, helped assess strengths and identify possible improvements. The PDQ Tree-browser was used in Network Management (600 nodes) and University Finder (1100 nodes) applications. A controlled experiment, with 24 subjects, showed that pruning significantly improved performance speed and subjective user satisfaction. Future research directions are suggested. |
| Author | Kumar, Harsha P. Plaisant, Catherine Shneiderman, Ben |
| Author_xml | – sequence: 1 givenname: Harsha P. surname: Kumar fullname: Kumar, Harsha P. – sequence: 2 givenname: Catherine surname: Plaisant fullname: Plaisant, Catherine – sequence: 3 givenname: Ben surname: Shneiderman fullname: Shneiderman, Ben |
| BookMark | eNqFkDFPwzAQRi1UJNrCypyJLeGc2HE8QgUFqRILzJZxLsRV4hQ7adV_T6IyIVVMdzp979PpLcjMdQ4JuaWQUID83m5rk1Ap8wSg4BdkTkHyWGYAs2kXNOYFlVdkEcIWAAQDmJP1o-8OwbqvqLbotTe1NbqJSt3r6GD7OmqHprdxg3scr0enW2ui7wG9xRBpV0Y7P7gRvyaXlW4C3vzOJfl4fnpfvcSbt_Xr6mETmwwyHudZxUVmSvaZsrwQkDJGmWCaGuApVpksmKCoC8FSzgooDKa6ZKkUXEqRI82W5O7Uu_Pd-EboVWuDwabRDrshqLFdsjwV_wbTnHFG82wMslPQ-C4Ej5Uytte97VzvtW0UBTXpVZNeNelVk94RS_5gO29b7Y_ngeIE4KhnP8pWwVh0Bkvr0fSq7Ow59AcaeJDa |
| CitedBy_id | crossref_primary_10_1142_S0218213001000726 crossref_primary_10_1080_01449290210136756 crossref_primary_10_1016_j_infsof_2015_02_007 crossref_primary_10_1177_016555150002600101 crossref_primary_10_1509_jmkg_71_1_160 crossref_primary_10_1109_TVCG_2008_109 crossref_primary_10_1007_s10111_005_0174_6 crossref_primary_10_1016_j_autcon_2010_10_003 crossref_primary_10_1016_j_ecoinf_2010_09_001 crossref_primary_10_1109_TVCG_2020_3030427 crossref_primary_10_1006_ijhc_2000_0420 crossref_primary_10_2190_F86D_NMXU_AE87_RUJ1 crossref_primary_10_1016_S0167_9236_03_00047_2 crossref_primary_10_1109_TVCG_2010_45 crossref_primary_10_1016_j_jvlc_2008_02_001 |
| ContentType | Journal Article |
| Copyright | 1997 Academic Press |
| Copyright_xml | – notice: 1997 Academic Press |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D E3H F2A |
| DOI | 10.1006/ijhc.1996.0085 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Library & Information Sciences Abstracts (LISA) Library & Information Science Abstracts (LISA) |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional Library and Information Science Abstracts (LISA) |
| DatabaseTitleList | Library and Information Science Abstracts (LISA) Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1095-9300 |
| EndPage | 124 |
| ExternalDocumentID | 10_1006_ijhc_1996_0085 S1071581996900853 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29J 4.4 457 4G. 53G 5GY 5VS 6TJ 7-5 71M 77K 8P~ 9JN 9JO AABNK AACTN AADFP AAEDT AAEDW AAFJI AAGJA AAGUQ AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABIVO ABJNI ABMAC ABMMH ABOYX ABXDB ABYKQ ACDAQ ACGFS ACHQT ACNNM ACRLP ACXNI ACZNC ADBBV ADEZE ADFGL ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AETEA AFKWA AFTJW AFYLN AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AI. AIALX AIEXJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD ASPBG AVARZ AVWKF AXJTR AZFZN B-7 BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HMW HVGLF HZ~ IHE J1W JJJVA K-O KOM LG5 LX9 M41 MO0 MVM N9A O-L O9- OAUVE OKEIE OZT P-8 P-9 P2P PC. PRBVW Q38 R2- RIG RNS ROL RPZ SBC SDF SDG SDP SES SEW SPC SPS SSB SSO SST SSV SSY SSZ T5K VH1 WH7 WUQ XJE XPP ZMT ZU3 ~G- AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AFXIZ AGCQF AGQPQ AGRNS AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP BNPGV CITATION SSH 7SC 8FD EFKBS JQ2 L7M L~C L~D E3H F2A |
| ID | FETCH-LOGICAL-c3035-63f573cd4b2468702441474a1c052ef398471ea874254808ce2ad429759976e13 |
| IEDL.DBID | .~1 |
| ISSN | 1071-5819 |
| IngestDate | Fri Sep 05 08:31:29 EDT 2025 Fri Sep 05 10:48:20 EDT 2025 Tue Jul 01 02:08:14 EDT 2025 Thu Apr 24 23:02:14 EDT 2025 Fri Feb 23 02:30:19 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3035-63f573cd4b2468702441474a1c052ef398471ea874254808ce2ad429759976e13 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 ObjectType-Article-1 ObjectType-Feature-2 |
| OpenAccessLink | https://www.sciencedirect.com/science/article/pii/S1071581996900853 |
| PQID | 26454163 |
| PQPubID | 23500 |
| PageCount | 22 |
| ParticipantIDs | proquest_miscellaneous_57394627 proquest_miscellaneous_26454163 crossref_citationtrail_10_1006_ijhc_1996_0085 crossref_primary_10_1006_ijhc_1996_0085 elsevier_sciencedirect_doi_10_1006_ijhc_1996_0085 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 1900 |
| PublicationDate | January 1997 1997-01-00 19970101 |
| PublicationDateYYYYMMDD | 1997-01-01 |
| PublicationDate_xml | – month: 01 year: 1997 text: January 1997 |
| PublicationDecade | 1990 |
| PublicationTitle | International journal of human-computer studies |
| PublicationYear | 1997 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| SSID | ssj0007400 |
| Score | 1.6616237 |
| Snippet | Users often must browse hierarchies with thousands of nodes in search of those that best match their information needs. ThePDQ Tree-browser(Pruning with... Users often must browse hierarchies with thousands of nodes in search of those that best match their information needs. The PDQ Tree-browser (Pruning with... The PDQ Tree-browser (Pruning with Dynamic Queries) visualization tool was specified, designed and developed for browsing hierarchies with a large number of... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 103 |
| SubjectTerms | Hierarchies Online information retrieval Pruning Searching |
| Title | Browsing hierarchical data with multi-level dynamic queries and pruning |
| URI | https://dx.doi.org/10.1006/ijhc.1996.0085 https://www.proquest.com/docview/26454163 https://www.proquest.com/docview/57394627 |
| Volume | 46 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELaqssCAeIpn8YDEZGLHjh2PVUUpILpApW5WEjuiqEqr0q78dnx58BJd2KLoIkef7Xv4zt8hdKksS7XQGZHSaSJiGpFY24gkoZC5N_eRKxlvHodyMBL342jcQr3mLgyUVda6v9Lppbau3wQ1msF8MgmefODCohiqaDU4DsD4KYSCtX79_lXmoQStGAkUIyDdEDdSGUxeXzK4rQfpCOil_Ldh-qWiS7vT30HbtcOIu9U_7aKWK_bQ1jcawX10C7E0xPwYGluXqQGPPIbiTwznrLisGiRTqA_CtmpBj_1gECXjpLB4vljB8cgBGvVvnnsDUjdIIBkHqknJ80jxzIrUI-s3njfVTCiRsIxGocu5BtPjktiHv0DrFkPzLyvgLq32Xohj_BC1i1nhjhDOhMo1zRPLHRehlXGiNPXPIU8dozk9RqRBx2Q1ezg0sZiaivdYGkDTAJoG0DxGV5_y84o3Y60ka8A2P2beeKW-9puLZlaM3w6Q40gKN1u9mRAYyryPuV7CI6aFDNXJP8Y9RZsVfS0cwZyh9nKxcufeKVmmnXLVddBG9-5hMPwAJgDfNQ |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV05T8MwFLZKGYABcYpy1QMSk6kTO3Y8oopSoO1CK3WzktgRRVValXblt-OXg0t0YYuiFyX6HL_D_vw9hK6k8WLFVUKEsIrwkAYkVCYgkc9F6sJ9YHPFm_5AdEf8cRyMa6hdnYUBWmXp-wufnnvr8k6rRLM1n0xaz65w8YIQWLQKEge2gTZ5wCTw-m7ev3gektNCkkB6BMwr5UYqWpPXlwSO68F-BDRT_jsy_fLReeDp7KHdMmPEt8VH7aOazQ7QzjcdwUN0D8U0FP0YOlvnewMOegzsTwwLrTinDZIpEISwKXrQY_cyKJNxlBk8X6xgfeQIjTp3w3aXlB0SSMJAa1KwNJAsMTx20LqZ52K1xyWPvIQGvk2Zgthjo9DVv6DrFkL3L8PhMK1yaYj12DGqZ7PMniCccJkqmkaGWcZ9I8JIKuqufRZbj6a0gUiFjk5K-XDoYjHVhfCx0ICmBjQ1oNlA15_280I4Y62lV4Gtfwy9dl597TPNalS0mw-wyRFldrZ60z5IlLkkc72FQ0xx4cvTf7y3iba6w35P9x4GT2dou9CyhfWYc1RfLlb2wmUoy_gy_wM_AGau4Mg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Browsing+hierarchical+data+with+multi-level+dynamic+queries+and+pruning&rft.jtitle=International+journal+of+human-computer+studies&rft.au=Kumar%2C+H+P&rft.au=Plaisant%2C+C&rft.au=Shneiderman%2C+B&rft.date=1997-01-01&rft.issn=1071-5819&rft.volume=46&rft.issue=1&rft.spage=103&rft.epage=124&rft_id=info:doi/10.1006%2Fijhc.1996.0085&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1071-5819&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1071-5819&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1071-5819&client=summon |