Indexing techniques to improve the performance of necessity-based fuzzy queries using classical indexing of RDBMS

DOI10.1016/J.FSS.2017.09.008zbMATH Open1397.68049OpenAlexW2757499276MaRDI QIDQ1795367FDOQ1795367

Authors: Juan Miguel Medina, Carlos D. Barranco, O. Pons 

Publication date: 16 October 2018

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.fss.2017.09.008

Recommendations

• INDEXING FUZZY NUMERICAL DATA WITH A B⁺ TREE FOR FAST RETRIEVAL USING NECESSITY-MEASURED FLEXIBLE CONDITIONS
• A B\(^+\)-tree based indexing technique for fuzzy numerical data
• Evaluating different approaches for indexing fuzzy sets.
• Design and implementation of index structures for fuzzy spatial databases
• Fuzzy improvement of the SQL

zbMATH Keywords

relational databasesfuzzy databasesdatabase indexingfuzzy database indexingnecessity query

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Generalizing database relational algebra for the treatment of incomplete or uncertain information and vague queries
• Title not available (Why is that?)
• Fuzzy And Uncertain Object-Oriented Databases
• Title not available (Why is that?)
• A B\(^+\)-tree based indexing technique for fuzzy numerical data
• INDEXING FUZZY NUMERICAL DATA WITH A B⁺ TREE FOR FAST RETRIEVAL USING NECESSITY-MEASURED FLEXIBLE CONDITIONS
• Title not available (Why is that?)

Cited In (4)

• INDEXING FUZZY NUMERICAL DATA WITH A B⁺ TREE FOR FAST RETRIEVAL USING NECESSITY-MEASURED FLEXIBLE CONDITIONS
• A B\(^+\)-tree based indexing technique for fuzzy numerical data
• Evaluating different approaches for indexing fuzzy sets.
• Indexing possibilistic numerical data using interval \(B^+\)-trees

This page was built for publication: Indexing techniques to improve the performance of necessity-based fuzzy queries using classical indexing of RDBMS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1795367)