Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
A more humanized way to query a database system
Yang F. ACM Inroads4 (4):68-72,2013.Type:Article
Date Reviewed: Apr 28 2014

Interfaces that are not user-friendly often limit the usability of a system. The author notes that user interfaces that do not take human factors into consideration frustrate users and limit the functionality of the system.

Query interfaces for database systems support keyword-based filters. For example, in Amazon’s user interface, a user could filter books based on their prices ($0 to $10, $10 to $50, and so on). However, the criteria for filtering the results of a query rely on an exact match between the supplied keywords and the entries in a database table, which the author notes as too stringent a requirement for users, either due to an “incomplete memory” or due to typographical errors. To cope with users’ tendencies to specify incomplete keywords, the author proposes that query filters support partial matches. To support partial matches, the equality conditions in a query are replaced by regular expressions that include wild card characters.

The article is motivated by the fact that humans often either (a) fail to specify the correct keywords, or (b) specify incomplete keywords. The author’s proposal solves only a small fraction of the problem. By replacing equality conditions in a query with wild card expressions, only the second case (b) is solved. However, allowing for partial matches doesn’t help users query a database system when misspelled or incorrect keywords are specified. That said, the author’s proposal could be generalized to handle misspellings by defining a notion of similarity/dissimilarity between words [1,2].

Although the article addresses a very small fraction of the bigger problem of designing more user-friendly query interfaces, it encourages readers to focus on redesigning query interfaces to expose the querying functionalities in a more “humanized” way.

Reviewer:  Abhijeet Mohapatra Review #: CR142225 (1407-0574)
1) Levenshtein, V. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10, (1966), 707–710.
2) Cormen, T.; Leiserson, C.; Rivest, R.; Stein, C. Introduction to algorithms (2nd ed.). MIT Press, Cambridge, MA, 2001.
Bookmark and Share
  Reviewer Selected
 
 
Query Processing (H.2.4 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Query Processing": Date
A correction of the termination conditions of the Henschen-Naqvi technique
Briggs D. Journal of the ACM 31(4): 711-719, 1984. Type: Article
Sep 1 1992
A compression technique to materialize transitive closure
Jagadish H. (ed) ACM Transactions on Database Systems 15(3): 558-598, 1990. Type: Article
Oct 1 1992
Efficient and optimal query answering on independent schemes
Atzeni P. (ed), Chan E. Theoretical Computer Science 77(3): 291-308, 1990. Type: Article
Nov 1 1991
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy