Query and Update Efficient B + -Tree Based Indexing of Moving Objects

This report presents a way of indexing moving objects with a B + -tree based data structure. This concept was first described 2004 by Jensen, Lin and Ooi in the paper „Query and Update Efficient B + -Tree Based Indexing of Moving Objects“ [1]. Apart from the structure of the index this report also describes how to execute range and kNN queries and how to perform updates on the index.