The Geometry of Browsing

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.

[1]  Christopher Ahlberg,et al.  IVEE: an Information Visualization and Exploration Environment , 1995, Proceedings of Visualization 1995 Conference.

[2]  Thor Bestul Parallel paradigms and practices for spatial data , 1992 .

[3]  B. Shneiderman,et al.  The dynamic HomeFinder: evaluating dynamic queries in a real-estate information exploration system , 1992, SIGIR '92.

[4]  Ben Shneiderman,et al.  Visual information seeking: tight coupling of dynamic query filters with starfield displays , 1994, CHI '94.

[5]  Jade Goldstein-Stewart,et al.  Using aggregation and dynamic queries for exploring large data sets , 1994, CHI Conference Companion.

[6]  Ben Shneiderman,et al.  Visual information seeking: tight coupling of dynamic query filters with starfield displays , 1994, CHI Conference Companion.

[7]  Ben Shneiderman,et al.  Dynamic queries for visual information seeking , 1994, IEEE Software.

[8]  Maureen C. Stone,et al.  Enhanced dynamic queries via movable filters , 1995, CHI '95.

[9]  Ben Shneiderman,et al.  Design and evaluation of incremental data structures and algorithms for dynamic query interfaces , 1997, Proceedings of VIZ '97: Visualization Conference, Information Visualization Symposium and Parallel Rendering Symposium.

[10]  Frank Harary,et al.  Graph Theory , 2016 .

[11]  James P. O'Connor,et al.  Reuse in Command-and-Control Systems , 1994, IEEE Software.

[12]  Stephen G. Eick,et al.  Data visualization sliders , 1994, UIST '94.

[13]  Ben Shneiderman,et al.  Query previews in networked information systems , 1996, Proceedings of the Third Forum on Research and Technology Advances in Digital Libraries,.

[14]  Yannis E. Ioannidis Dynamic information visualization , 1996, SGMD.