Research Article
An Adaptive Parallel Method for Indexing Transportation Moving Objects
Algorithm 1
Object
insert leaf node add_to_leaf.
| Input: move the object | | Output: no output; the leaf node is updated after the operation is completed | (1) | _leaf = get_leaf /∗ find the inserted leaf node by location ∗/ | (2) | if (is_fill(cur_leaf.p_bucket)) | (3) | = new Bucket(); | (4) | ; | (5) | Insert_object(); /∗ insert the object into the bucket of the current node ∗/ |
|