Using Hilbert curve in image storing and retrieving

被引:14
作者
Song, ZX [1 ]
Roussopoulos, N
机构
[1] Univ Maryland, Dept Comp Sci, College Pk, MD 20705 USA
[2] Univ Maryland, Inst Adv Comp Studies, College Pk, MD 20705 USA
关键词
row-wise order; Hilbert order; subset query;
D O I
10.1016/S0306-4379(02)00019-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we propose a method to accelerate the speed of subset query on uncompressed images. First, we change the method to store images: the pixels of images are stored on the disk in the Hilbert order instead of row-wise order that is used in traditional methods. After studying the properties of the Hilbert curve, we give a new algorithm which greatly reduces the number of data segments in subset query range. Although, we have to retrieve more data than necessary, because the speed of sequential readings is much faster than the speed of random access readings, it takes about 10% less elapsed time in our algorithm than in the traditional algorithms to execute the subset queries. In some systems, the saving is as much as 90%. (C) 2002 Published by Elsevier Science Ltd.
引用
收藏
页码:523 / 536
页数:14
相关论文
共 11 条
  • [1] Ballard D.H., 1982, Computer Vision
  • [2] BARCLAY T, 2000, P ACM SIGMOD DALL TE
  • [3] BERCHTOLD S, 1997, P ACM SIGMOD TUCS AR
  • [4] SPACE-FILLING CURVES - THEIR GENERATION AND THEIR APPLICATION TO BANDWIDTH REDUCTION
    BIALLY, T
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1969, 15 (06) : 658 - +
  • [5] Faloutsos C., 1994, Journal of Intelligent Information Systems: Integrating Artificial Intelligence and Database Technologies, V3, P231, DOI 10.1007/BF00962238
  • [6] GEVERS T, 1993, P DAT EXP SYST APPL
  • [7] GRIFFITHS J, 1986, SOFTWARE PRACT EXPER, P403
  • [8] Gropp W. D., 1994, Using MPI-Portable Parallel Programming with the Message -Parsing Interface
  • [9] HIRATA K, 1992, P ADV DAT TECHN VIEN
  • [10] Kamel I, 1994, Proc. International Conference on Very Large Databases, P500