Q-Hash: a novel index structure for moving object databases

Author

Deja Hepziba Francis

Keywords and Phrases

Q-Hash (Computer program); Quadtree (Computer program)

Abstract

"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, page iii.

Department(s)

Computer Science

Degree Name

M.S. in Computer Science

Publisher

University of Missouri--Rolla

Publication Date

Summer 2004

Pagination

ix, 79 pages

Rights

© 2004 Deja Hepziba Francis, All rights reserved.

Document Type

Thesis - Citation

File Type

text

Language

English

Subject Headings

Image processing
Data structures (Computer Science)
Indexing -- Computer programs

Thesis Number

T 8610

Print OCLC #

58474018

Link to Catalog Record

Full-text not available: Request this publication directly from Missouri S&T Library or contact your local library.

Recommended Citation

Francis, Deja Hepziba, "Q-Hash: a novel index structure for moving object databases" (2004). Masters Theses. 2653.
https://scholarsmine.mst.edu/masters_theses/2653