Indexing possibilistic numerical data using interval B^+-trees

DOI10.1016/J.FSS.2020.04.011MaRDI QIDQ2048772zbMATH OpenOpenAlexFDO

Authors Carlos D. Barranco, Guy De Tré, Robin de Mol

Publication date 23 August 2021

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

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

zbMATH Keywords

\(B^+\)-treeindexingpossibilistic databases

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Recommendations

• 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
• The interval B-tree
• On indexing evidential data
• Indexing techniques to improve the performance of necessity-based fuzzy queries using classical indexing of RDBMS

Cites work

• A B^+-tree based indexing technique for fuzzy numerical data
• A relational model of data for large shared data banks
• Generalizing database relational algebra for the treatment of incomplete or uncertain information and vague queries
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• INDEXING FUZZY NUMERICAL DATA WITH A B⁺ TREE FOR FAST RETRIEVAL USING NECESSITY-MEASURED FLEXIBLE CONDITIONS
• Indexing techniques to improve the performance of necessity-based fuzzy queries using classical indexing of RDBMS

Cited in

(4)

• On indexing evidential data
• INDEXING FUZZY NUMERICAL DATA WITH A B⁺ TREE FOR FAST RETRIEVAL USING NECESSITY-MEASURED FLEXIBLE CONDITIONS
• scientific article; zbMATH DE number 1954477 (Why is no real title available?)
• A B^+-tree based indexing technique for fuzzy numerical data

This page was built for publication: Indexing possibilistic numerical data using interval \(B^+\)-trees

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