Full Program »
I2B+tree: Interval B+ tree variant towards fast indexing of time-dependent data
Index structures are fast-access methods. In the past, they were often used to minimize fetch operations on primary storage devices. Nowadays, despite the previous still holding, new applications residing in main-memory require fast access methods: from in-memory databases to client applications in mobile devices. Within this scope, this paper focuses on index structures to store, access and delete interval-based time-dependent (temporal) data from very large datasets in the most efficient way. Index structures for this domain have specific characteristics, given the nature of time and the requirement to index time intervals. This work presents an open-source time-efficiency focused variant of the Interval B+ tree. It presents results and draws conclusions regarding performed experiments that confirm the empirical verification of the logarithmic performance on inserts, range queries and deletions.