Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Interval Hash Tree: An Efficient Index Structure for Searching Object Queries in Large Image Databases


    Contributors:

    Conference:

    Workshop, Content-based access of image and video libraries; CBAIVL-2000 ; 2000 ; Hilton Head Island, SC



    Publication date :

    2000-01-01


    Size :

    5 pages


    Remarks:

    IEEE Computer Society order no PR00695



    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English





    Efficient processing of spatial queries in line segment databases

    Hoel, E.G. / Hanan Samet | Tema Archive | 1991


    An Effective Directory Index Framework Taking Advantages of Hash Table and B^+-Tree

    Liu, X. / Wang, J. / Zhu, M. et al. | British Library Online Contents | 2013


    Efficient search scheme for very large image databases [3964-08]

    Pramanik, S. K. / Li, J. / Ruan, J. et al. | British Library Conference Proceedings | 2000


    Searching Across the International Space Station Databases

    Maluf, David A. / McDermott, William J. / Knight, Christopher D. et al. | IEEE | 2007