Existing search techniques for retrieving images from the web store text-based and content-based features separately. They use structures like inverted-index, forward-index, document-term matrix, Tries, Prefix B-Tree, String B-Tree, etc. for text-based features and R-tree, SR-tree, K-B-D Tree, etc., for content-based features. We propose to use a hybrid indexing scheme which is more intuitive for hybrid image feature vectors and can be used to both store and query non-ordered discrete and continuous features simultaneously. Also, since most of the existing hybrid image search engines do not store two types of features together, they usually perform retrieval in two distinct steps, first finding results with only text-based information and later filtering results based on content-based information. In contrast, our approach of hybrid indexing supports retrieval in a single step. We introduce a k-nearest neighbour search algorithm for the hybrid indexing scheme used.Hybrid index-based image search from the web 253 S.K. Ghosh received his MTech and his PhD from IIT Kharagpur where he is currently working as an Associate Professor. He has served on the programme committee and executive committee of a number of international conferences. He has published more than 60 research papers in reputed journals and conferences. His research interests include geo-spatial databases, remote sensing and network security.Shamik Sural received his PhD from Jadavpur University, Calcutta, India in 2000. He is currently working as an Associate Professor at the School of Information Technology, Indian Institute of Technology, Kharagpur, India. He has served on the programme committee of a number of international conferences. He is a senior member of the IEEE and has published more than 100 research papers in reputed journals and conferences. His research interests include database security, data mining and multimedia database systems.