Directory Search Keystroke Reduction via Dynamic Subset Display
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing directory search methods in packet-based telephony systems require numerous keystrokes and server calls to identify matching user records, leading to inefficiencies in user interaction and network traffic.
Innovation Solution
A method that allows users to input strings using a keypad, where each symbol is associated with a character set, enabling the server to identify matching records based on character-by-character matching criteria, reducing the number of keystrokes and server calls by dynamically updating and displaying subsets of records.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional directory search methods are used in packet-based telephony systems, then users can search for user-directory records, but the number of keystrokes and server calls required is large, leading to inefficiency
Solution Approach 1:
The system performs preliminary actions by pre-processing and indexing directory data on the server side, organizing it into efficient search structures. This allows the mobile device to perform faster local searches and reduce the number of server calls needed, thereby improving productivity while reducing search time
Solution Approach 2:
An intermediary indexing structure is introduced between the user input and the directory database. This intermediary layer pre-organizes directory data into searchable formats, enabling faster matching without requiring multiple sequential server calls, thus resolving the contradiction between search efficiency and time consumption
2Reliability
If traditional directory search methods are used, then complete directory records can be found, but the number of server calls required increases network traffic
Solution Approach 1:
The system extracts and transmits only the essential matching criteria and minimal necessary data to the mobile device for local processing. By taking out only the critical information needed for accurate matching rather than transmitting complete directory datasets, the system maintains reliability while significantly reducing network traffic and energy loss
3Measurement precision
If users input complete names character by character, then accurate records can be identified, but the number of keystrokes required is large
Solution Approach 1:
The system implements partial action by allowing users to input only a portion of the name (e.g., first letter or abbreviated form) rather than the complete name. The server's pre-processed index structures enable accurate record identification even with partial input, thereby maintaining measurement precision while significantly improving ease of operation by reducing keystrokes
Data Source
AI summary
Methods are provided for identifying user-directory records that match input strings entered into a packet-based telephone. Each input string comprises symbols associated with character sets, and each record comprises multiple attributes. A record matches a set of input strings when, independent of the order of the input strings, there is a one-to-one correspondence matching the input strings with an equal number of attributes of the record. An input string matches an attribute when, on a character-by-character, symbol-by-symbol basis, the characters of at least a portion of the attribute are elements of the character sets associated with the symbols of the input string. Subsets of matching records are dynamically sent to the packet-based telephone for display.