Interval Hash Tree: An Efficient Index Structure for Searching Object Queries in Large Image Databases
Workshop, Content-based access of image and video libraries; CBAIVL-2000 ; 2000 ; Hilton Head Island, SC
2000-01-01
5 pages
IEEE Computer Society order no PR00695
Conference paper
English
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Efficient processing of spatial queries in line segment databases
Tema Archive | 1991
|An Effective Directory Index Framework Taking Advantages of Hash Table and B^+-Tree
British Library Online Contents | 2013
|Efficient search scheme for very large image databases [3964-08]
British Library Conference Proceedings | 2000
|