Saliwanchik, Lloyd & Eisenschenk
Progressive continuous range query for moving objects with a tree-like index
Methods for progressive continuous range query (PCRQ) are provided. A method can include using branch-and-bound to index interest points with a tree-index and generating a nearest enter split-point for a root node in the tree-index and adding to min-heap. Next, whether min-heap has more elements and whether a next split-point in min-heap is closer than a destination can be determined. Whether a query point has reached a split-point can be investigated followed by retrieving an entry that has generated the split-point. The split-point can be then be removed from min-heap.
The Florida International University Board of Trustees
G G G
G06F G06F G06F
inventional inventional inventional
Tao Naphtali Mingjin Weitong
Li Rishe Zhang Liu