High Dimensional Similarity Search with Bundled Query Processing on Hilbert R-Tree

Yohei Nasu, Naoki Kishikawa, Kei Tashima, Shin Kodama, Yasunobu Imamura, Takeshi Shinohara, Koichi Hirata, Tetsuji Kuboyama

2015

Abstract

Hilbert R-tree is an R-tree, which is a B-tree-like multiway balanced tree, such that data objects with high dimensions are sorted along the Hilbert curve. In this paper, we first point out that the compact Hilbert R-tree, which is a Hilbert R-tree without preserving Hilbert values, realizes the same performance as the standard Hilbert R-tree, by using the Hilbert sort and the Hilbert merge. Then, to improve search time for high dimensional objects in the compact Hilbert R-tree, we propose a bundled query processing. Furthermore, we introduce two methods, the pre-processing by the Hilbert merge and the control for the order of visiting nodes. From experimental results, we observe that, in the similarity search of sound and image data, the bundled query processing is about 30% faster than the combinations of individual query processing.

References

1. (0) individual processing Bader, M. (2013). Space-filling curves. Springer.
2. Butz, A. R. (1971). Alternative algorithm for Hilbert's space-filling curves. IEEE Trans. Computers, C20:424-426.
3. Ciaccia, P. and M. Patella, P. Z. (1997). M-tree: An efficient access method for similarity search in metric spaces. Proc. 23rd Int. Conf. on Very Large Data Bases, pages 426-435.
4. Guttman, A. (1984). R-trees: A dynamic index structure for spatial searching. In Proc. SIGMOD'84, pages 47-57.
5. Kamel, I. and Faloutos, C. (1993). On packing R-trees. In Proc. CIKM'93, pages 490-499.
6. Kamel, I. and Faloutos, C. (1994). Hilbert R-tree: An improved R-tree using fractals. In Proc. VLDB'94, pages 500-509.
7. Lawder, J. K. and King, P. J. H. (2001a). Querying multidimensional data indexed using the Hilbert spacefilling curve. ACM SIGMOD Record, 30:19-24.
8. Lawder, J. K. and King, P. J. H. (2001b). Using state diagrams for Hilbert curve mappings. Internat. J. Computer Math., 78:327-342.
9. Samet, H. (2006). Foundations of multidimentional and metric data structures. Morgan Kaufmann.
10. Shinohara, T. and Ishizaka, H. (2002). On dimension reduction mappings for approximate retrieval of multidimensional data. Progress in Discovery Sciencer (LNCS 2281), pages 224-231.
11. Tanaka, A. (2001). Study on a fast ordering of high dimensional data to spatial index. Master Thesis, Kyushu Institute of Technology.
12. Tashima, K. (2011). Study on efficient method of insertion for spatial index structure by using Hilbert sort. Master Thesis, Kyushu Institute of Technology.

Paper Citation

in Harvard Style

Nasu Y., Kishikawa N., Tashima K., Kodama S., Imamura Y., Shinohara T., Hirata K. and Kuboyama T. (2015). High Dimensional Similarity Search with Bundled Query Processing on Hilbert R-Tree . In Proceedings of the International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM, ISBN 978-989-758-076-5, pages 354-359. DOI: 10.5220/0005279503540359

in Bibtex Style

@conference{icpram15,
author={Yohei Nasu and Naoki Kishikawa and Kei Tashima and Shin Kodama and Yasunobu Imamura and Takeshi Shinohara and Koichi Hirata and Tetsuji Kuboyama},
title={High Dimensional Similarity Search with Bundled Query Processing on Hilbert R-Tree},
booktitle={Proceedings of the International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,},
year={2015},
pages={354-359},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005279503540359},
isbn={978-989-758-076-5},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,
TI - High Dimensional Similarity Search with Bundled Query Processing on Hilbert R-Tree
SN - 978-989-758-076-5
AU - Nasu Y.
AU - Kishikawa N.
AU - Tashima K.
AU - Kodama S.
AU - Imamura Y.
AU - Shinohara T.
AU - Hirata K.
AU - Kuboyama T.
PY - 2015
SP - 354
EP - 359
DO - 10.5220/0005279503540359