In this paper, we present a new and effective image indexing technique that extracts features directly from DCT domain. Our proposed approach is an object-based image indexing. For each block of size 8*8 in DCT domain a feature vector is extracted. Then, feature vectors of all blocks of image using a kmeans algorithm is clustered into groups. Each cluster represents a special object of the imag...

This paper addresses the problem of quickly performing point queries against high-dimensional regions. Such queries are useful in the increasingly important problems of multimedia identification and retrieval, where different database entries have different metrics for similarity. While the database literature has focused on indexing for high-dimensional nearest neighbor and epsilon range queri...

MOTIVATION The exponential growth of sequence databases poses a major challenge to bioinformatics tools for querying alignment and annotation databases. There is a pressing need for methods for finding overlapping sequence intervals that are highly scalable to database size, query interval size, result size and construction/updating of the interval database. RESULTS We have developed a new in...

This paper proposes an efficient indexing technique for fingerprint database using minutiae based geometric hashing. A fixed length feature vector built from each minutia, known as Minutia Binary Pattern, has been suggested for the accurate match at the time of searching. Unlike existing geometric based indexing techniques, the proposed technique inserts each minutia along with the feature vect...

Ecient indexing in a class hierarchy is essential for the achievement of high performance in query evaluation for object database management systems. In this paper, we present a practical indexing scheme, index set, which provides good index con®guration for any real database environment. The proposed scheme considers the distribution of key values, as well as query patterns such as query weig...

Complex query types huge data volumes and very high read update ratios make the indexing techniques designed and tuned for traditional database systems unsuitable for data warehouses DW We propose an encoded bitmap indexing for DWs which improves the performance of known bitmap indexing in the case of large cardinality domains A performance analysis and theorems which identify properties of goo...

The like regular expression predicate has been part of the SQL standard since at least 1989. However, despite its popularity and wide usage, database vendors provide only limited indexing support for regular expression queries which almost always require a full table scan. In this paper we propose a rigorous and robust approach for providing indexing support for regular expression queries. Our ...