S+-trees: an efficient structure for the representation of large pictures
CVGIP: Image Understanding
Analytical comparison of two spatial data structures
Information Systems
Time and space efficient secondary memory representation of quadtrees
Information Systems
Efficient processing of window queries in the pyramid data structure
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
An effective way to represent quadtrees
Communications of the ACM
Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyperrectangles
IEEE Transactions on Knowledge and Data Engineering
A Paging Scheme for Pointer-Based Quadtrees
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
| Hi-index | 0.00 |
In this paper we propose and analyze a new spatial access method, namely the S*-tree, for the efficient secondary memory encoding and manipulation of images containing multiple non-overlapping features (i.e., coloured images). We show that the S*-tree is more space efficient than its precursor, namely the S+-tree, which was explicitly designed for binary images, and whose straightforward extension to coloured images can lead to large space wastage. Moreover, we tested time efficiency of the S*-tree in answering classical window queries, comparing it against a previous efficient access method, namely the HL-quadtree [7]. Our experiments show that the S*-tree can reach up to a 30% of time saving.