Searching large indexes on tiny devices: optimizing binary search with character pinning

Authors:
Guy Shani;Christopher Meek;Tim Paek;Bo Thiesson;Gina Danielle Venolia
Affiliations:
Microsoft Research, Redmond, WA, USA;Microsoft Research, Redmond, WA, USA;Microsoft Research, Redmond, WA, USA;Microsoft Research, Redmond, WA, USA;Microsoft Research, Redmond, WA, USA
Venue:
Proceedings of the 14th international conference on Intelligent user interfaces
Year:
2009

Citing 6
Cited 1

Self-adjusting binary search trees

Journal of the ACM (JACM)
An Empirical and Theoretical Evaluation of BinScroll: A Rapid Selection Technique for Alphanumeric Lists

Personal and Ubiquitous Computing
Dynamic Programming

Dynamic Programming
Model-based evaluation of cell phone menu interaction

Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Efficient search for interactive statistical machine translation

EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Evaluating the effectiveness of “effective view navigation” for very long ordered lists on mobile devices

INTERACT'05 Proceedings of the 2005 IFIP TC13 international conference on Human-Computer Interaction

New methods for compression of MP double array by compact management of suffixes

Information Processing and Management: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large online stores it becomes increasingly important to help the user select a particular item efficiently. Thus, we propose binary search with character pinning, where users can constrain their search to match selected prefix characters while making simple binary decisions about the position of their intended item in the lexicographic order. The underlying index for our method is based on a ternary search tree that is optimal under certain user-oriented constraints. To better scale to larger indexes, we analyze several heuristics that rapidly construct good trees. A user study demonstrates that our method helps users conduct rapid searches, using less keystrokes, compared to other methods.