毕业设计（论文）_移动对象的存储和查询系统设计与实现.docVIP

摘 要 随着GPS技术的发展和成熟，很多“基于位置的服务”应用软件也迅速的发展起来。旅行时迷路了，我们可以用手机上的导航系统定位现在所处的位置，还可以查询离我们最近的公交点，甚至可以查询正向我们这个方向驶来的无人出租车。 人，公交点，出租车都可抽象成一个个的移动对象，这些对象的运动生成一条条的轨道。移动对象的位置可能时刻发生变化，像以往的数据库，是无法存储这种数据量极大且更新频繁的数据，为了解决大量移动对象位置频繁更新所带来的性能下降问题，我们提出了一种基于改进的四叉树和哈希表的基于位置和时间的索引结构。这种索引结构以位置为主索引，时间为第二索引，并对四叉树的叶子节点采用适时合并的方法来防范分支太深而造成的查询效率低下。 本论文主要讨论对移动对象数据几种主要建模方法，并对相关索引及其存储查询技术进行概述分析。本论文以时空历史点数据的密度为依据，引入四叉树对轨道点进行区域划分存储和查询，并在四叉树单元内采用时态索引机制对数据块进行索引。同时介绍了几种在这种索引存储结构上的几种算法，通过对算法的描述我们可看出这种索引结构的优势所在。 关键词： 移动对象；四叉树；索引结构 ABSTRACT With the development and maturation of GPS technology, a lot of location-based services applications are rapidly developed. When we get lost on travel, phone navigation system can tell us where we are. We can get the nearest public transportation points, or even the taxis coming in our direction. Either people, public transportation points or taxis can be abstracted into a moving object. The Movement of these objects can be described as a track. The position of moving objects may change all the time. Traditional index structures do not work well on moving objects because of the need of frequently updating the index which leads to the poor performance. We presents a novel indexing structure based on quadtree and Hash table which use location as the first index and time second. Merging timely the corresponding nodes to degrade the depth of the tree can guarantee the query efficiency. This paper focuses on several major data modeling of moving objects and analyze its indexing and storage and query technology. In this study, we base on the density of space-time history point data, introduce the quadtree and divide the track point on region to storage and query. Inside the quad tree cell system, the data blocks are divided by time index. Last we introduce several query on this index storage structure and we can see the advantages of this index storage structure. Keywords: moving object; quadtree; index structure 目 录 第1章 绪论 1 1.1 研究背景和意义 1 1.2 国内外研究现状 1 1.2.1时空数据库国