Digital Library

cab1

 
Title:      AN OPTIMIZING INDEX STRUCTURE FOR INDEXING THE HISTORIES IN MOVING OBJECT DATABASE
Author(s):      Zhang Wenjie , Li Jianzhong , Zhang Wei
ISBN:      972-8924-09-7
Editors:      Nuno Guimarães, Pedro Isaías and Ambrosio Goikoetxea
Year:      2006
Edition:      Single
Keywords:      Moving object database 3D R-Tree.
Type:      Short Paper
First Page:      684
Last Page:      688
Language:      English
Cover:      cover          
Full Contents:      click to dowload Download
Paper Abstract:      To index the histories efficiently is an important aspect in moving object database management. This paper implements an optimizing index structure called E3D R-Tree based on 3D R-Tree. E3D R-Tree takes into account the features of moving object data and takes advantage of new cost parameters. In particular, best-first search algorithm is used in the insertion algorithm to find the overall best way to insert a new record in E3D R-Tree. The proof of the vidility of the algorithm is given.
   

Social Media Links

Search

Login