5 AUGUST 2015

The Oracle database offers powerful index structures such as B-Tree indexes which, when used appropriately, can significantly improve query performance. In this article I will explore the interval tree index, a well known structure for indexing time intervals, and demonstrate how a virtual interval tree can be built on top of a B-Tree index. The article will show the benefits in terms of performance of this technique and show how the drawbacks, such as added complexity, can be mitigated using Oracle features, for instance pipelined table functions and virtual columns.

Click here to read the full article by James Checkley, Consulting Solutions Manager at TEOCO as published in the latest edition of Oracle Scene online.

Click here to read the full edition of Oracle Scene online.