Information retrieval: data structures and algorithms
Information retrieval: data structures and algorithms
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
S-tree: a dynamic balanced signature index for office retrieval
Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
Multidimensional access methods
ACM Computing Surveys (CSUR)
Parallel programming: techniques and applications using networked workstations and parallel computers
Visual information retrieval
Performance evaluation of parallel S-trees
Journal of Database Management
Improved methods for signature-tree construction
The Computer Journal
Study of a Parallel CBIR Implementation using MPI
CAMP '00 Proceedings of the Fifth IEEE International Workshop on Computer Architectures for Machine Perception (CAMP'00)
Efficient Similarity Search by Reducing I/O with Compressed Sketches
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Energy Conservation for Image Retrieval on Mobile Systems
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.00 |
This paper presents a technique for searching a memory-resident signature tree (S-tree) in a parallel fashion. Our implementation uses a very compact binary signature for the images' global colour histogram thus allowing the use of main-memory to store and search a reasonably sized image main-memory to store and search a reasonably sized image collection. Our results show that our parallel search of an S-tree is able to achieve good speedups; for instance, a 50,000 signature S-tree, with a branching factor of 8, searched using 4 processors is 3 times faster than using a single processor.