Abstract 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.

中文翻译：

---

使用区间 B+ 树索引可能的数值数据

摘要 当记录集变大时，索引成为加速查询的必要技术。本文提出了一种区间数据的索引技术。此类数据在基于可能性的关系数据库中很常见，但在其他应用程序中也经常使用。我们的方法是对 B+ 树的改编，它目前仍然是最有效的索引技术之一。因为它可以存储区间数据，我们将其命名为区间 B+-tree (IBPT)。说明了如何在实践中构建和应用 IBPT 索引以加快对可能性关系数据库的模糊查询的评估。