A multidimensional index structure for fuzzy spatial databases

Author(s):  
K. Akkaya ◽  
A. Yazici
2018 ◽  
Vol 2018 ◽  
pp. 1-15 ◽  
Author(s):  
Sultan Alamri ◽  
David Taniar ◽  
Kinh Nguyen

The indexing and tracking of objects moving in indoor spaces has increasingly become an important area of research, which presents a fundamentally different challenge. There are two main reasons for why indoor should be treated as cellular space. Firstly, an indoor space has entities, such as rooms and walls, that constrain the movement of the moving objects. Secondly, the relevant notion of locations of an object is cell based rather than an exact Euclidean coordinate. As a solution, in our earlier works, we proposed a cell-based indexing structure, called the C-tree, for indexing objects moving in indoor space. In this paper, we extend the C-tree to solve another interesting problem. It can be observed that many indoor spaces (such as shopping centers) contain wings/sections. For such a space, there are queries for which the wing/section location of an object, rather than the cellular location, is the relevant answer (e.g., “the object is in the east wing”). In this paper, we propose a new index structure, called the GMI-tree (“GMI” stands for “Graph-based Multidimensional Index”). The GMI-tree is based on two notions of distance, or equivalently, two notions of adjacency: one represents horizontal adjacency and the other represents vertical adjacency.


Author(s):  
Priya M. ◽  
Kalpana R.

Most web and mobile applications are based on searching the location-based objects called spatial objects. In spatial database systems, searching such objects is a challenging task since it deals with geo-spatial capabilities. Sometimes, the spatial queries are associated with text information in order to obtain the most relevant answers nearest to the given location. Such queries are called spatial textual query. Conventional spatial indexes and text indexes are not suitable for resolving such queries. Since these indexes use various approaches to perform searching, they can cause performance degradation. Effective processing of the query mainly depends on the index structure, searching algorithms, and location-based ranking. This chapter reviews the different hybrid index structures and search mechanisms to extract the spatial objects, the different ranking model it supports, and the performance characteristics.


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.


Sign in / Sign up

Export Citation Format

Share Document