Skip to main content

The geometry of browsing

Invited paper

  • Conference paper
  • First Online:
LATIN'98: Theoretical Informatics (LATIN 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1380))

Included in the following conference series:

Abstract

We present a geometric counting problem that arises in browsing and solve it in constant time per query using nonexhaustive tables. On the other hand, we prove that several closely related problems require exhaustive tables, no matter how much time we allow per query.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahlberg, C. and Shneiderman, B., Visual Information Seeking: Tight Coupling of Dynamic Query Filters with Starfield Displays, Proc. ACM SIGCHI (1994) 313–317

    Google Scholar 

  2. Ahlberg, C. and Wistrand, E., IVEE: An Information Visualization and Exploration Environment, Proc. IEEE Info. Vis., (1995) 66–73

    Google Scholar 

  3. Bestul, T., Parallel paradigms and practices for spatial data, Ph.D. Thesis, Univ. Maryland Dept. Comp. Sci., TR-2897, (1992)

    Google Scholar 

  4. Doan, K., Plaisant, C., and Shneiderman, B., Query Previews in Networked Information Systems, Proc. Forum Adv. Digit. Libr., IEEE Comp. Soc. Press, (1996) 120–129

    Google Scholar 

  5. Eick, S., Data Visualization Sliders, Proc. User Interf. Softw. Techn. (1994) 119–120

    Google Scholar 

  6. HCIL, http://www.cs.umd.edu/projects/hcil/Research/1995/dq-for-eosdis.html

    Google Scholar 

  7. Fishkin, K. and Stone, M. C., Enhanced Dynamic Queries via Movable Filters, Proc. ACM SIGCHI (1995) 415–420

    Google Scholar 

  8. Goldstein, J. and Roth, S. F., Using Aggregation and Dynamic Queries for Exploring Large Data Sets, Proc. ACM SIGCHI (1994) 23–29

    Google Scholar 

  9. Harary, F., Graph Theory, Addison-Wesley (1969)

    Google Scholar 

  10. HCIL, ftp://ftp.cs.umd.edu/pub/hcil/Demos/DQ/dq-home.zip. Down-loadable PC demonstration.

    Google Scholar 

  11. Ioannidis, Y., Dynamic Information Visualization, ACM SIGMOD Rec., 25 (1996) 16–20

    Article  Google Scholar 

  12. Information Visualization and Exploration Environment (IVEE) Development AB, http://www.ivee.com/. Online Java demo and down-loadable demos for various platforms

    Google Scholar 

  13. Shneiderman, B., Dynamic Queries for Visual Information Seeking, IEEE Softw., 11 (1994) 70–77

    Article  Google Scholar 

  14. Shneiderman, B., Racing to the winning line with visual data mining, http://www.ivee.com/corporate/columns/race.html

    Google Scholar 

  15. Tanin, E., Beigel, R., and Shneiderman, B., Incremental Data Structures and Algorithms for Dynamic Query Interfaces, ACM SIGMOD Rec., 25 (1996) 21–24

    Article  Google Scholar 

  16. Williamson, C. and Shneiderman, B., The Dynamic HomeFinder: Evaluating Dynamic Queries in a Real-Estate Information Exploration System, Proc. ACM SIGIR (1992) 339–346

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Cláudio L. Lucchesi Arnaldo V. Moura

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beigel, R., Tanin, E. (1998). The geometry of browsing. In: Lucchesi, C.L., Moura, A.V. (eds) LATIN'98: Theoretical Informatics. LATIN 1998. Lecture Notes in Computer Science, vol 1380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054333

Download citation

  • DOI: https://doi.org/10.1007/BFb0054333

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64275-6

  • Online ISBN: 978-3-540-69715-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics