Efficient processing of nested fuzzy SQL queries in a fuzzy database

Citation
Q. Yang et al., Efficient processing of nested fuzzy SQL queries in a fuzzy database, IEEE KNOWL, 13(6), 2001, pp. 884-901
Citations number
43
Language
INGLESE
art.tipo
Article
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
ISSN journal
1041-4347 → ACNP
Volume
13
Issue
6
Year of publication
2001
Pages
884 - 901
Database
ISI
SICI code
1041-4347(200111/12)13:6<884:EPONFS>2.0.ZU;2-0
Abstract
In a fuzzy relational database where a relation is a fuzzy set of tuples an d ill-known data are represented by possibility distributions, nested fuzzy queries can be expressed in the Fuzzy SOL language, as defined in [25], [2 3]. Although it provides a very convenient way for users to express complex queries, a nested fuzzy query may be very inefficient to process with the naive evaluation method. based on its semantics. In conventional databases, nested queries are unnested to improve the efficiency of their evaluation. In this paper, we extend the unnesting techniques to process several types of nested fuzzy queries. An extended merge-join is used to evaluate the un nested fuzzy queries. As shown by both theoretical analysis and experimenta l results, the unnesting techniques with the extended merge-join significan tly improve the performance of evaluating nested fuzzy queries.