By Topic

Two approximate operators for a data base query language: sounds-like and close-to

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
E. B. McClelland ; Dept. of Comput. Sci., South Carolina Univ., Columbia, SC, USA ; R. P. Trueblood ; C. M. Eastman

Approximate retrieval in a database of formatted data allows values that are close to those requested to be retrieved. Two approximate retrieval operators added to a structured query language are discussed. The two operators are sounds-like (SL) and close-to (CT). The SL operator is used to match two character string values by comparing their phonic sounds. The CT operator is used to select a subset of numeric data values that are relatively close to a given value. These two operators have been implemented and tested in a relational database environment called BDB. These extensions suffice to handle all data types and to allow the approximate retrieval to objects as well as attributes

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:18 ,  Issue: 6 )