The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Dynamic queries for visual information seeking
Open accessAbstract
Considers how dynamic queries allow users to "fly through" databases by adjusting widgets and viewing the animated results. In studies, users reacted to this approach with an enthusiasm more commonly associated with video games. Adoption requires research into retrieval and display algorithms and user-interface design. The author discusses how experts may benefit from visual interfaces because they will be able to formulate more complex queries and interpret intricate results.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84 · doi:10.1145/602259.602266 · Cited by 6,580
The visual display of quantitative information
(1985) · General Pharmacology: The Vascular System · doi:10.1016/0306-3623(85)90230-7 · Cited by 5,070
Computer graphics: principles and practice
(2014) · Choice Reviews Online · doi:10.5860/choice.51-2713 · Cited by 4,651
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98741 · Cited by 4,161
The design and analysis of spatial data structures
Samet, H. (1989) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,380
Direct Manipulation: A Step Beyond Programming Languages
Shneiderman (1983) · Computer · doi:10.1109/mc.1983.1654471 · Cited by 1,939
Tree-Maps: A Space Filling Approach to the Visualization of Hierarchical Information Structures
Johnson, B., & Shneiderman, B. (1991) · Cited by 1,121
Self-citationBecker, R. A., & Cleveland, W. S. (1987) · Technometrics · doi:10.1080/00401706.1987.10488204 · Cited by 696
Data Structures for Range Searching
Bentley, J. L., & Friedman, J. H. (1979) · ACM Computing Surveys · doi:10.1145/356789.356797 · Cited by 622
Tree-maps: a space-filling approach to the visualization of hierarchical information structures
Johnson, B., & Shneiderman, B. (2002) · Proceeding Visualization '91 · doi:10.1109/visual.1991.175815 · Cited by 611
Self-citation
Cited by
Keyword searching and browsing in databases using BANKS
Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., & Sudarshan, S. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994756 · Cited by 871
The Eyes Have It: A Task by Data Type Taxonomy for Information Visualizations
Shneiderman, B. (2003) · The Craft of Information Visualization · doi:10.1016/b978-155860915-0/50046-9 · Cited by 515
Self-citationSpaceTree: supporting exploration in large node link tree, design evolution and empirical evaluation
Plaisant, C., Grosjean, J., & Bederson, B. B. (2003) · IEEE Symposium on Information Visualization, 2002. INFOVIS 2002. · doi:10.1109/infvis.2002.1173148 · Cited by 313
Heer, J., & Shneiderman, B. (2012) · Queue · doi:10.1145/2133416.2146416 · Cited by 269
Self-citationVisualizing multi-dimensional clusters, trends, and outliers using star coordinates
Kandogan, E. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502530 · Cited by 264
Metadata
- Authors
- Shneiderman, B.
- Venue
- IEEE Software
- Published
- 1994-11
- Volume
- 11
- Issue
- 6
- Pages
- 70-77
- ISSN
- 0740-7459 (ISSN-L)
- OpenAlex
- W2153217804
- Cited by
- 573
- References
- 23
- FWCI
- 27.24
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dynamic queries for visual information seeking. https://app.cochat.ai/papers/10.1109/52.329404
- The paper
- Shneiderman, B. (1994). Dynamic queries for visual information seeking. IEEE Software. https://doi.org/10.1109/52.329404
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
