INDEXING FUZZY NUMERICAL DATA WITH A B+ TREE FOR FAST RETRIEVAL USING NECESSITY-MEASURED FLEXIBLE CONDITIONS
From MaRDI portal
Publication:3638782
DOI10.1142/S0218488509006005zbMath1193.68096MaRDI QIDQ3638782
Juan Miguel Medina, Jesús R. Campaña, Carlos D. Barranco
Publication date: 28 October 2009
Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)
Related Items (2)
Indexing techniques to improve the performance of necessity-based fuzzy queries using classical indexing of RDBMS ⋮ Indexing possibilistic numerical data using interval \(B^+\)-trees
Cites Work
- Unnamed Item
- Generalizing database relational algebra for the treatment of incomplete or uncertain information and vague queries
- A B\(^+\)-tree based indexing technique for fuzzy numerical data
- Evaluating different approaches for indexing fuzzy sets.
- Organization and maintenance of large ordered indexes
- Fuzzy And Uncertain Object-Oriented Databases
This page was built for publication: INDEXING FUZZY NUMERICAL DATA WITH A B+ TREE FOR FAST RETRIEVAL USING NECESSITY-MEASURED FLEXIBLE CONDITIONS