FM-index分块并行算法及其实现

查询海量数据有压缩和索引两种方法来提高速度,该文结合这两种方法提出了压缩查询的方法.FM-index是一种自索引的全文查询算法,存在内存占用过大的问题,对于复杂的查询效率也不理想.该文提出分块FM-index算法,在分块的基础上采用MPI对算法进行并行化,解决了内存占用过多的问题,达到了较好的并行效率.

A shortest path algorithm for moving objects in spatial network databases

One of the most important kinds of queries in Spatial Network Databases (SNDB) to support location-based services (LBS) is the shortest path query. Given an object in a network, e.g. a location of a car on a road network, and a set of objects of interests, e.g. hotels,gas station, and car, the shortest path query returns the shortest path from the query object to interested objects. The studies of shortest path query have two kinds of ways, online processing and preprocessing. The studies of preprocessing suppose that the interest objects are static. This paper proposes a shortest path algorithm with a set of index structures to support the situation of moving objects. This algorithm can transform a dynamic problem to a static problem. In this paper we focus on road networks. However, our algorithms do not use any domain specific information, and therefore can be applied to any network. This algorithm’s complexity is O(klog2 i), and traditional Dijkstra’s complexity is O((i + k)2).

a shortest path algorithm for moving objects in spatial network databases

中国计算机学会

a simple but effective improvement to the plumb-line algorithm

Emporiki Bank; Microsoft; Alpha Bank