Design & Performance Evaluation of Storage and Index Structures for Spatial Network Databases


The KIPS Transactions:PartD, Vol. 13, No. 3, pp. 325-336, Jun. 2006
10.3745/KIPSTD.2006.13.3.325,   PDF Download:

Abstract

For supporting LBS service, recent studies on spatial network databases (SNDB) have been done actively. In order to gain good performance on query processing in SNDB, we, in this paper, design efficient storage and index structures for spatial network data, point of interests (POIs), and moving objects on spatial networks. First, we design a spatial network file organization for maintaining the spatial network data itself consisting of both node and edges. Secondly, we design a POI storage and index structure which is used for gaining fast accesses to POIs, like restaurant, hotel, and gas station. Thirdly, we design a signature-based storage and index structure for efficiently maintaining past, current, and expected future trajectory information of moving objects. Finally, we show that the storage and index structures designed in this paper outperform the existing storage structures for spatial networks as well as the conventional trajectory index structures for moving objects.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. H. Um and J. W. Chang, "Design & Performance Evaluation of Storage and Index Structures for Spatial Network Databases," The KIPS Transactions:PartD, vol. 13, no. 3, pp. 325-336, 2006. DOI: 10.3745/KIPSTD.2006.13.3.325.

[ACM Style]
Jung Ho Um and Jae Woo Chang. 2006. Design & Performance Evaluation of Storage and Index Structures for Spatial Network Databases. The KIPS Transactions:PartD, 13, 3, (2006), 325-336. DOI: 10.3745/KIPSTD.2006.13.3.325.