A spatial access method approach to continuous k-nearest neighbour processing for location-based services

2020 ◽  
Vol 11 (2) ◽  
pp. 253
Author(s):  
Wendy Osborn
Keyword(s):  
Location Based Services ◽  
Nearest Neighbour ◽  
Spatial Access ◽  
Access Method ◽  
Method Approach

scholarly journals IMPROVING NEAREST NEIGHBOUR SEARCH IN 3D SPATIAL ACCESS METHOD

2016 ◽  
Vol XLII-2/W1 ◽  
pp. 69-73
Author(s):  
A. Suhaibaha ◽  
A. A. Rahman ◽  
U. Uznir ◽  
F. Anton ◽  
D. Mioc
Keyword(s):  
Hierarchical Structure ◽  
Data Entry ◽  
Data Retrieval ◽  
Nearest Neighbour ◽  
Input Output ◽  
Spatial Access ◽  
Access Method ◽  
3D Objects ◽  
Query Response Time ◽  
3D Data

Nearest Neighbour (NN) is one of the important queries and analyses for spatial application. In normal practice, spatial access method structure is used during the Nearest Neighbour query execution to retrieve information from the database. However, most of the spatial access method structures are still facing with unresolved issues such as overlapping among nodes and repetitive data entry. This situation will perform an excessive Input/Output (IO) operation which is inefficient for data retrieval. The situation will become more crucial while dealing with 3D data. The size of 3D data is usually large due to its detail geometry and other attached information. In this research, a clustered 3D hierarchical structure is introduced as a 3D spatial access method structure. The structure is expected to improve the retrieval of Nearest Neighbour information for 3D objects. Several tests are performed in answering Single Nearest Neighbour search and k Nearest Neighbour (kNN) search. The tests indicate that clustered hierarchical structure is efficient in handling Nearest Neighbour query compared to its competitor. From the results, clustered hierarchical structure reduced the repetitive data entry and the accessed page. The proposed structure also produced minimal Input/Output operation. The query response time is also outperformed compared to the other competitor. For future outlook of this research several possible applications are discussed and summarized.

Spatial Access Method for Flash Memory Embedded Systems

2011 ◽  
Vol 403-408 ◽  
pp. 4311-4317
Author(s):  
Ki Young Lee ◽  
Joung Joon Kim ◽  
Myung Jae Lim ◽  
Kyu Ho Kim ◽  
Jeong Lae Kim
Keyword(s):  
Embedded Systems ◽  
Spatial Data ◽  
Flash Memory ◽  
Operation Technique ◽  
Spatial Access ◽  
Compression Technique ◽  
Access Method ◽  
Memory Space ◽  
Relative Coordinates ◽  
Redundant Storage

This paper proposed an efficient spatial Access method, called MDR-Tree (Mbr compression and Delayed write operation based R-Tree), that uses the node compression technique and the delayed write operation technique for flash memory embedded systems. The node compression technique of MDR-Tree increased the utilization of flash memory space by compressing the MBR of spatial data using relative coordinates and MBR size. Moreover, the delayed write operation technique reduced the number of write operations in flash memory by temporarily storing spatial data in the buffer and by reflecting them in flash memory at once instead of reflecting the insert, update and delete of spatial data in flash memory for each operation. Especially, the utilization of buffer space was enhanced by preventing the redundant storage of the same spatial data in the buffer.

Indexing Regional Objects in High-Dimensional Spaces

2011 ◽  
pp. 348-373
Author(s):  
Byunggu Yu ◽  
Ratko Orlandic
Keyword(s):  
Location Based Services ◽  
High Dimensional ◽  
Spatial Access ◽  
Database Applications ◽  
Access Methods ◽  
Query Performance ◽  
Efficient Approach ◽  
Spatial Search ◽  
Spatial Access Methods

Many spatial access methods, such as the R-tree, have been designed to support spatial search operators (e.g., overlap, containment, and enclosure) over both points and regional objects in multi-dimensional spaces. Unfortunately, contemporary spatial access methods are limited by many problems that significantly degrade the query performance in high-dimensional spaces. This chapter reviews the problems of contemporary spatial access methods in spaces with many dimensions and presents an efficient approach to building advanced spatial access methods that effectively attack these problems. It also discusses the importance of high-dimensional spatial access methods for the emerging database applications, such as location-based services.

A hybrid 3D spatial access method based on quadtrees and R-trees for globe data

2009 ◽  
Author(s):  
Jun Gong ◽  
Shengnan Ke ◽  
Xiaomin Li ◽  
Shuhua Qi
Keyword(s):  
Spatial Access ◽  
Access Method
Sign in / Sign up

Export Citation Format

Share Document