.png){kind=icon}
返回
Indexing possibilistic numerical data using Interval B+-trees
.png){kind=icon}
PRE
AI
DOI：10.1016/j.fss.2020.04.011.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
When record sets become large, indexing becomes a required technique for speeding up querying. This paper proposes an indexing technique for interval data. Such data are common in possibility based relational databases but are also frequently used in other applications. Our approach is an adaptation of a B+-tree, which is currently still one of the most efficient indexing techniques. Because it can store interval data, we name it the Interval B+-tree (IBPT). It is illustrated how an IBPT index can be built and applied in practice to speed up the evaluation of fuzzy queries on possibilistic relational databases. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Indexing
Possibilistic databases
B+-tree
期刊
IF:
2.7
论文数:
7.6K
被引数:
1.5W
机构
引用论文
.png){kind=icon}
Indexing techniques to improve the performance of necessity-based fuzzy queries using classical indexing of RDBMS使用RDBMS的经典索引提高基于必要性的模糊查询性能的索引技术
PREAI
分享收藏 没有更多内容
没有更多内容