| Description |
ix, 79 leaves : illustrations ; 28 cm. |
| Summary |
"Moving objects' environments contain large numbers of queries and continuously moving objects. One of the problems faced while storing data of continuously moving objects is the numerous updates required to answer the queries proficiently and accurately. This makes the database very bulky and results in very poor performance...In this thesis, an index structure called Constraint-based Q-Hash is designed and implemented to store the positions of moving objects efficiently."--Abstract, leaf iii. |
|