Relational database management systems manages the tables with predefined indexes. In RDBMS indexes are created on the basis of attribute values. The Imine indexing scheme is used to index item sets in relational databases. The index creation is performed with out any constraints. IMine provides a complete representation of the original database. The Imine indexing scheme reduces the input/outp...

TREC-9 evaluation experiments at the Justsystem site are described with a focus on “aboutness” based approach in text retrieval. Experiments on the effects of supplemental noun phrase indexing, pseudo-relevance feedback and reference database feedback in view of the effect of various length of queries are reported. The results show that pesudo-relevance feedback is always effective while refere...

Relational database management systems manages the tables with predefined indexes. In RDBMS indexes are created on the basis of attribute values. The Imine indexing scheme is used to index item sets in relational databases. The index creation is performed with out any constraints. IMine provides a complete representation of the original database. The Imine indexing scheme reduces the input/outp...

This paper is concerned with accurate and efficient indexing of fingerprint images. We present a model-based approach, which efficiently retrieves correct hypotheses using novel features of triangles formed by the triplets of minutiae as the basic representation unit. The triangle features that we use are its angles, handedness, type, direction, and maximum side. Geometric constraints based on ...

Biological research comes across different protein structures inside a cell which may be required to map to known proteins to quickly determine their functionality. Efficient techniques for searching a protein structure in a database containing all the known proteins are needed to classify the protein and predict its function. Comparing the structure of unknown protein individually with every p...

The field of relational database research has developed many database accessing methods for effective data retrieval, e.g. B tree indexing, Bitmap indexing, hash-based join, sort-merge join. These methods are oriented on finding or joining single items (represented by records) that satisfy point or range conditions. However, in the area of data mining research, there is often the need to effect...

This paper is concerned with accurate and efficient indexing of fingerprint images. We present a model-based approach, which efficiently retrieves correct hypotheses using novel features of triangles formed by the triplets of minutiae as the basic representation unit. The triangle features that we use are its angles, handedness, type, direction, and maximum side. Geometric constraints based on ...

In order to facilitate and speed up the search of massive DNA databases, the database is indexed at the beginning, employing a mapping function. By searching through the indexed data structure, exact query hits can be identified. If the database is searched against an annotated DNA query, such as a known promoter consensus sequence, then the starting locations and the number of potential genes ...

In this paper, we describe an efficient indexing method for a shape-based similarity search of the trajectory of dynamically changing locations of people and mobile objects. In order to manage trajectories in database systems, we define a data model of trajectories as directed lines in a space, and the similarity between trajectories is defined as the Euclidean distance between directed discret...

Object-relational database management systems allow users to define complex data types, such as objects, collections, and nested tables. Unfortunately, most commercially available database systems do not support either efficient querying or indexing of complex attributes. Different indexing schemes for complex data types have been proposed in the literature so far, most of them being applicatio...