¹ College of Computer and Control, Harbin University of Science and Technology, Harbin, China
² College of Computer and Control Engineering, Qiqihar University, Qiqihar, China
³ College of Computer Science and Technology, Harbin Institute of Technology, Harbin, China

---

Abstract—Recently years, the nearest neighbor (N-N) query in the spatial database contracts much public attentions and is studied widely. Because of the kinds of the query objects, there are generally three types, point to point (p-p), point to segment (p-s) and segment to segment (s-s). Most of them are precise data, and related documents are rich. However, the research about querying fuzzy objects with influential region is seldom and the related documents are few. In this paper, we mainly study the N-N query with the fuzzy segment in spatial database. Four located relations based on fuzzy segments are come up with, and we list the N-N algorithm. The experimental result shows high query efficiency.

Index Terms—N-N query, spatial database, fuzzy segment, R-tree

[PDF]

Cite: Guangjun Song, Zhongxiao Hao, and Chunjuan Wang, " The Research of Fuzzy Segment Query under the Spatial Database," Journal of Computers vol. 5, no. 2, pp. 290-297, 2010.