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

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.

REFERENCES

• 1: Robert St. Amant , Thomas E. Horton , Frank E. Ritter, Model-based evaluation of cell phone menu interaction, Proceedings of the SIGCHI conference on Human factors in computing systems, p.343-350, April 24-29, 2004, Vienna, Austria [doi>10.1145/985692.985736]
• 2: Richard Ernest Bellman, Dynamic Programming, Dover Publications, Incorporated, 2003
• 3: M. Breene. US portable music device forecast, 2007 to 2012. Technical report, Jupiter Research, 2007.
• 4: D. Card. US portable music device forecast, 2006 to 2011. Technical report, Jupiter Research, 2006.
• 5: L. Chittaro and L. D. Marco. Evaluating the effectiveness of "effective view navigation" for very long ordered lists on mobile devices. In Interact 2005: 10th IFIP International Conference on Human-Computer Interaction, pages 482--495, 2005.
• 6: D. E. Knuth. Optimum binary search trees. Acta Informatica, 1(1):14--25, 1971.
• 7: J. Lehikoinen , I. Salminen, An Empirical and Theoretical Evaluation of BinScroll: A Rapid Selection Technique for Alphanumeric Lists, Personal and Ubiquitous Computing, v.6 n.2, p.141-150, April 2002 [doi>10.1007/s007790200013]
• 8: A. Lopez. Hierarchical phrase-based translation with suffix arrays. In Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, page 976985, 2007.
• 9: T. Matsumoto, D. M. W. Powers, and G. Jarrad. Application of search algorithms to natural language processi. In Australasian Language Technology Workshop, 2003.
• 10: Daniel Dominic Sleator , Robert Endre Tarjan, Self-adjusting binary search trees, Journal of the ACM (JACM), v.32 n.3, p.652-686, July 1985 [doi>10.1145/3828.3835]
• 11: Franz Josef Och , Richard Zens , Hermann Ney, Efficient search for interactive statistical machine translation, Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics, April 12-17, 2003, Budapest, Hungary [doi>10.3115/1067807.1067858]

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.3 Information Search and Retrieval
          Subjects: Retrieval models

General Terms:
Algorithms

Keywords:
binary search, optimal binary search tree