Fuzzy querying in conventional databases
Fuzzy logic for the management of uncertainty
GEFRED: a generalized model of fuzzy relational databases
Information Sciences—Informatics and Computer Science: An International Journal
Performance evaluation of G-tree and its application in fuzzy databases
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
An access structure for similarity-based fuzzy databases
Information Sciences—Informatics and Computer Science: An International Journal
On fuzzy-set interpretation of possibility theory
Fuzzy Sets and Systems
ACM Computing Surveys (CSUR)
G-Tree: A New Data Structure for Organizing Multidimensional Data
IEEE Transactions on Knowledge and Data Engineering
A Server for Fuzzy SQL Queries
FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
SQLf: a relational database language for fuzzy querying
IEEE Transactions on Fuzzy Systems
An impact ordering approach for indexing fuzzy sets
Fuzzy Sets and Systems
FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems
A DICOM viewer with flexible image retrieval to support diagnosis and treatment of scoliosis
Expert Systems with Applications: An International Journal
An Index-Based Location Management Scheme for PCS Network
Wireless Personal Communications: An International Journal
Hi-index | 0.21 |
This paper proposes an indexing technique for fuzzy numerical data which increases the performance of query processing when the query involves an atomic possibility measured flexible condition. The proposal is based on a classical indexing mechanism for numerical crisp data, B^+-tree, which is implemented in most commercial database management systems (DBMS). This makes the proposed technique a good candidate for integration in a fuzzy DBMS when it is developed as an extension of a crisp DBMS. The efficiency of the proposal is contrasted with another indexing method for similar data and queries, G-tree, which is specifically designed to index multidimensional data. Results show that the proposal performance is similar to and more stable than the measured for G-tree when used for indexing fuzzy numbers.