DPR-tree: a distributed parallel spatial index structure for high performance spatial databases

Author(s):  
Yan Zhou ◽  
Qing Zhu ◽  
Qiang Liu
Author(s):  
JUDY C.R. TSENG ◽  
TSONG-FENG HWANG ◽  
WEI-PANG YANG

The 2D string, proposed by Chang et al., is a spatial index structure which preserves the information of spatial relationships in a spatial database. In this paper, two new image retrieval algorithms for 2D string are proposed. The first one improves the retrieval efficiency, while the second reduces the space requirement. The performance analysis shows that the two methods perform much better than previous works especially when the spatial database is large.


2020 ◽  
Vol 8 (6) ◽  
pp. 4419-4428

Advancements of various Geographic Information Technologies have resulted in huge growth in Geo-Textual data. Many Indexing and searching algorithms are developed to handle this Geo-Textual data which contains spatial, textual and temporal information. In past, Indexing and searching algorithms are developed for the applications in which the object trajectory or velocity vector is known in advance and hence we can predict the future position of the objects. There are real time applications like emergency management systems, traffic monitoring, where the objects movements are unpredictable and hence future position of the objects cannot be predicted. Techniques are required to answer the geo-textual kNN query where the velocity vectors or trajectories of moving and moving queries are not known. In case of moving objects, capturing current position of the object and maintaining spatial index optimally is very much essential. The hybrid indexing techniques used earlier are based on R-tree spatial index. The nodes of the R-tree index structure are split or merged to maintain the locations of continuously moving objects, increasing the maintenance cost as compared to the grid index. In this paper a solution is proposed for creating and maintaining hybrid index for moving objects and queries based on grid and inverted list hybrid indexing techniques. The method is also proposed for finding Geo-Textual nearest neighbours for static and moving queries using hybrid index and conceptual partitioning of the grid. The overall gain reported by the experimental work using hybrid index over the non- hybrid index is 30 to 40 percent depending on the grid size chosen for mapping the data space and on the parameters of queries.


2013 ◽  
Vol 427-429 ◽  
pp. 2531-2535 ◽  
Author(s):  
Feng Dong Sun ◽  
Quan Guo ◽  
Lan Wang

The bottleneck is not the disk I/O but CUP clock speed faster than the memory speed in main memory database .In order to achieve high performance in main memory database ,it is a good approach to design new index structures to improve the memory access speed .This chapter presents a T-tree index structure and its algorithms in main memory database firstly .Then presents two results on Optimization of T-tree index ,including T-tail tree and TTB-tree. Our results indicate that the T-Tree provides good overall performance in main memory.


Sign in / Sign up

Export Citation Format

Share Document