Specifically , objects are first partitioned according to their update time .
In order to adopt the B+ tree as a moving object index , the B - tree uses a linearization technique which helps to integrate objects ' location at time t into single dimensional value .
Objects are first partitioned according to their update time .
In order to adopt the B+ tree as a moving object index , the B - tree uses a linearization technique which helps to integrate objects ' location at time t into single dimensional value .