Efficient search algorithm on compact S-trees

Abstract Based on the S-tree, the modified S-tree is a newly proposed spatial data structure for representing digital binary images, which can support fast search and query in pictorial database. In this paper, we first present a new spatial data structure called the compact S-tree to represent binary images, which uses less memory when compared to the modified S-tree. We then present a fast search algorithm on the compact S-tree. Further, the application to neighbor finding is also investigated. Experimental results show that the proposed search algorithm is faster than the previous known results on the S-tree and the modified S-tree.