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

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. Author Keywords Binary Search, Optimal Binary Search Tree ACM Classification Keywords H.3.3 INFORMATION STORAGE AND RETRIEV...

• Type: Conference
• Year: 2009
• Where: IUI
• Authors: Guy Shani, Christopher Meek, Tim Paek, Bo Thiesson, Gina Danielle Venolia
• Keywords: IUI 2009, Keywords Binary Search, Optimal Binary Search, Software Engineering, Ternary Search Tree