The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - September-October (1997 vol.12)
pp: 48-59
ABSTRACT
This article presents methods to guide and control heuristically the relaxation of deductive and relational database queries. These methods enable a database system to compose responses that align with user needs. Query relaxation provides a user with an automatic means to identify new queries that are related to the user's original query. However, for large databases, many relaxations might be possible. These methods to control and restrict the relaxation process add focus and make relaxation more efficient. User restrictions over the database domain are expressed as user constraints, which restrict relaxed queries. The author presents a set of heuristics, based on semantic query-optimization techniques, for controlling relaxation. She then describes how the methods interact to relax queries, process user constraints, and apply the heuristic rules. Finally, she shows how to use electronic thesaurii as sources of semantic information and gives examples of two thesaurus-based applications of user-constrained relaxation.
INDEX TERMS
cooperative control, logic and deduction, nonstandard query answering, query relaxation, user preferences.
CITATION
Terry Gaasterland, "Cooperative Answering through Controlled Query Relaxation", IEEE Intelligent Systems, vol.12, no. 5, pp. 48-59, September-October 1997, doi:10.1109/64.621228
80 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool