Muutke küpsiste eelistusi

E-raamat: Fuzzy Preference Queries to Relational Databases [World Scientific e-raamat]

(Irisa/enssat, Univ Of Rennes 1, France), (Irisa/enssat, Univ Of Rennes 1, France)
  • Formaat: 348 pages
  • Ilmumisaeg: 24-Feb-2012
  • Kirjastus: Imperial College Press
  • ISBN-13: 9781848168701
Teised raamatud teemal:
  • World Scientific e-raamat
  • Hind: 151,54 €*
  • * hind, mis tagab piiramatu üheaegsete kasutajate arvuga ligipääsu piiramatuks ajaks
  • Formaat: 348 pages
  • Ilmumisaeg: 24-Feb-2012
  • Kirjastus: Imperial College Press
  • ISBN-13: 9781848168701
Teised raamatud teemal:
The manipulation of databases is an integral part of a world which is becoming increasingly and pervasively information-focused. This book puts forward a suggestion to advocate preference queries and fuzzy sets as a central concern in database queries and offers an important contribution to the design of intelligent information systems. It provides a comprehensive study on fuzzy preference queries in the context of relational databases. Preference queries, a recent hot topic in database research, provide a basis for rank-ordering the items retrieved, which is especially valuable for large sets of answers.This book aims to show that fuzzy set theory constitutes a highly expressive framework for modeling preference queries. It presents a study of the algorithmic aspects related to the evaluation of such queries in order to demonstrate that this framework offers a good trade-off between expressivity and efficiency. Numerous examples and proofs are liberally and lucidly demonstrated throughout, and greatly enhance the detailed theoretical aspects explored in the book.Researchers working in databases will greatly benefit from this comprehensive and up-to-date study of fuzzy preference queries, and it will also become an invaluable reference point for postgraduate students interested in advanced database techniques.The only other books which deal with this topic are edited books or conference proceedings which include a few contributions about some specific aspects of the question. This book provides a comprehensive view of the issue, starting with basic notions related to relational databases and fuzzy set theory, up to the detailed study of complex fuzzy queries and the way they can be efficiently processed. It is the compendium of more than 20 years of research by the authors who benefit from a great international recognition in the domain of intelligent information systems, on the subject.
Foreword vii
Acknowledgments ix
1 Introduction
1(4)
1.1 Databases and their Evolution
1(1)
1.2 Preferences and Fuzzy Sets
2(1)
1.3 Overview of the Book
3(2)
2 Reminders on Relational Databases
5(26)
2.1 Basic Notions and Vocabulary
5(3)
2.2 Algebraic Operations
8(13)
2.2.1 Set operations
8(3)
2.2.2 Relational operations
11(9)
2.2.3 Properties
20(1)
2.3 An Overview of SQL
21(10)
2.3.1 The base block
22(3)
2.3.2 Combining base blocks
25(2)
2.3.3 Partitioning
27(2)
2.3.4 Expressing division and antidivision
29(2)
3 Basic Notions on Fuzzy Sets
31(46)
3.1 Introduction
31(2)
3.2 Definitions and Notations
33(3)
3.3 Composition of Fuzzy Sets
36(14)
3.3.1 Intersection and union of fuzzy sets
36(5)
3.3.2 Difference between fuzzy sets
41(2)
3.3.3 Cartesian product of fuzzy sets
43(1)
3.3.4 Trade-off operators
44(1)
3.3.5 Nonsymmetric operators
45(5)
3.4 Inclusions and Implications
50(18)
3.4.1 Fuzzy implications
50(8)
3.4.2 Inclusions
58(10)
3.5 Fuzzy Measures and Integrals
68(3)
3.5.1 Introduction
68(1)
3.5.2 Fuzzy measures
68(2)
3.5.3 Fuzzy integrals
70(1)
3.6 The Extension Principle
71(2)
3.7 Fuzzy Quantified Propositions
73(4)
3.7.1 Fuzzy linguistic quantifiers
73(1)
3.7.2 Quantified propositions
73(4)
4 Non-Fuzzy Approaches to Preference Queries: A Brief Overview
77(14)
4.1 Introduction
77(1)
4.2 Quantitative Approaches
78(4)
4.2.1 Distances and similarity
78(1)
4.2.2 Linguistic preferences
79(1)
4.2.3 Explicit scores attached to entities
80(1)
4.2.4 Top-k queries
81(1)
4.2.5 Outranking
81(1)
4.3 Qualitative Approaches
82(7)
4.3.1 Secondary preference criterion
82(1)
4.3.2 Pareto-order-based approaches
83(2)
4.3.3 CP-nets
85(2)
4.3.4 Domain linearization
87(1)
4.3.5 Possibilistic-logic-based approach
88(1)
4.4 Conclusion
89(2)
5 Simple Fuzzy Queries
91(40)
5.1 Introduction
91(2)
5.2 An Extended Relational Algebra
93(1)
5.3 An Overview of a Basic Version of SQLf
94(12)
5.3.1 Introduction
94(1)
5.3.2 The multiple relation base block
95(1)
5.3.3 Subqueries
96(6)
5.3.4 Set-oriented operators
102(2)
5.3.5 Relation partitioning
104(2)
5.4 Interface for User-Defined Terms and Operators
106(2)
5.5 Contextual Queries
108(6)
5.5.1 Queries with one level of context
110(3)
5.5.2 Queries with several levels of context
113(1)
5.6 Evaluation of Simple Fuzzy Queries
114(14)
5.6.1 Derivation principle
114(7)
5.6.2 Derivation-based processing of SQLf queries
121(7)
5.7 Conclusion
128(3)
6 Fuzzy Queries Involving Quantified Statements or Aggregates
131(54)
6.1 Introduction
131(1)
6.2 Quantified Statements
132(28)
6.2.1 Introduction
132(1)
6.2.2 Quantified statements and fuzzy integral theory
133(5)
6.2.3 Interpretation of statements of the type "Q X are A"
138(11)
6.2.4 Integration into SQLf
149(3)
6.2.5 Evaluation of SQLf queries involving quantified statements
152(8)
6.3 Aggregates
160(22)
6.3.1 Introduction
160(1)
6.3.2 The case of monotonic predicates and aggregates
161(3)
6.3.3 Dealing with the general case
164(5)
6.3.4 SQLf queries involving aggregates
169(7)
6.3.5 Evaluation of SQLf queries involving aggregates
176(6)
6.4 Conclusion
182(3)
7 Division and Antidivision of Fuzzy Relations
185(36)
7.1 Introduction
185(1)
7.2 Division of Fuzzy Relations
186(7)
7.2.1 Principles
186(3)
7.2.2 On the choice of implication
189(1)
7.2.3 Primitivity of the extended division operator
190(2)
7.2.4 Expressing extended division in SQLf
192(1)
7.3 Tolerant Division
193(5)
7.3.1 Exception-based tolerant division
193(3)
7.3.2 Resemblance-based tolerant division
196(2)
7.4 Stratified Division
198(9)
7.4.1 Introduction
198(2)
7.4.2 The queries
200(5)
7.4.3 Quotient property of the result delivered
205(2)
7.5 Queries Mixing Division and Antidivision
207(4)
7.5.1 Motivation
207(1)
7.5.2 Mixed stratified queries
208(3)
7.6 Evaluation of Division Queries
211(8)
7.6.1 Processing the division of fuzzy relations
211(2)
7.6.2 Processing the tolerant divisions of fuzzy relations
213(2)
7.6.3 Processing the conjunctive stratified division
215(4)
7.7 Conclusion
219(2)
8 Bipolar Fuzzy Queries
221(30)
8.1 Introduction
221(1)
8.2 Preliminaries
222(2)
8.2.1 About bipolarity
222(2)
8.3 Extended Algebraic Operators
224(22)
8.3.1 Intersection
224(1)
8.3.2 Union
225(1)
8.3.3 Cartesian product
226(1)
8.3.4 Negation
226(6)
8.3.5 Difference
232(3)
8.3.6 Selection
235(2)
8.3.7 Projection
237(1)
8.3.8 Join
238(1)
8.3.9 Division
239(7)
8.4 Implementation Aspects
246(2)
8.5 Conclusion
248(3)
9 Fuzzy Group By
251(16)
9.1 Introduction
251(1)
9.2 An Extended Group By Clause
252(3)
9.2.1 Use of a crisp partition
252(1)
9.2.2 Use of a fuzzy partition
253(2)
9.3 Having Clause
255(3)
9.3.1 Inclusion constraint
256(1)
9.3.2 Aggregate1 θ aggregate2
256(1)
9.3.3 Aggregate is ψ
257(1)
9.4 Application to Association Rule Mining
258(4)
9.4.1 Rules of the type A is Li → B is L1
259(2)
9.4.2 Rules of the type A is L → B is L12
261(1)
9.5 Evaluation of a Fuzzy Group By
262(1)
9.6 Related Work
262(2)
9.6.1 Extended group by
262(1)
9.6.2 Fuzzy OLAP
263(1)
9.6.3 Fuzzy database summarization techniques
263(1)
9.6.4 Mining association rules with SQL
264(1)
9.7 Conclusion
264(3)
10 Empty and Plethoric Answers
267(42)
10.1 Introduction
267(1)
10.2 Empty Answer Problem
268(19)
10.2.1 Query relaxation
268(1)
10.2.2 Relaxation by predicate weakening
269(10)
10.2.3 Case-based reasoning approach
279(8)
10.3 Plethoric Answer Problem
287(19)
10.3.1 Introduction
287(1)
10.3.2 Approach based on predicate strengthening
288(6)
10.3.3 Approach based on query expansion
294(12)
10.4 Conclusion
306(3)
11 Conclusion
309(4)
Bibliography 313(14)
Index 327