Q-Hash: a novel index structure for moving object databases
Keywords and Phrases
Q-Hash (Computer program); Quadtree (Computer program)
"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.
M.S. in Computer Science
University of Missouri--Rolla
ix, 79 leaves
© 2004 Deja Hepziba Francis, All rights reserved.
Thesis - Citation
Library of Congress Subject Headings
Data structures (Computer Science)
Indexing -- Computer programs
Print OCLC #
Link to Catalog Record
Full-text not available: Request this publication directly from Missouri S&T Library or contact your local library.http://laurel.lso.missouri.edu/record=b5286237~S5
Francis, Deja Hepziba, "Q-Hash: a novel index structure for moving object databases" (2004). Masters Theses. 2653.
Share My Thesis If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.