In this paper we present a storage method for sets of first order logic terms in a relational database using function symbols based indexing method of Discrimination trees. This is an alternative method to a published one, based on attribute indexing. This storage enables effective implementation of several retrieval operations: unification, generalization, instantation and variation of a given...

In this paper we propose a method for automatic color extraction and indexing to support color queries of image and video databases. This approach identifies the regions within images that contain colors from predetermined color sets. By searching over a large number of color sets, a color index for the database is created in a fashion similar to that for file inversion. This allows very fast i...

This paper introduces and studies new indexing techniques for content-based queries in images databases. Indexing is the key to providing sophisticated, accurate and fast searches for queries in image data. This research describes a new indexing approach, which depends on linear modeling of signals, using bases for modeling. A basis is a set of chosen images, and modeling an image is a least-sq...

Biometric feature is used for human identification and verification in access management of physical, virtual work space and many other real time applications. The current state-of-art biometric identification algorithm focuses on accuracy and hence works well in terms of response time on small scale database.In real life scenario biometric database are huge and without any intelligent scheme t...

Proper reparametrization is a basic simplifying process for rational parameterized curves. There are complete results proposed for the curves with exact coefficients but few papers discuss the situations with numerical coefficients which have many practical applications. In this paper, we deal with mathematical objects that are assumed to be given approximately. The approximate improper index i...

DEFINITION A bi-temporal index is a data structure that supports both temporal time dimensions, namely, transactiontime (the time when a fact is stored in the database) and valid-time (the time when a fact becomes valid in reality). The characteristics of the time dimensions supported imply various properties that the bi-temporal index should have to be efficient. As traditional indices, the pe...

It is often necessary to compare data-rich charts, tables, diagrams, or drawings rather than the articles that contextualize that data. The objective of this research has been to create a database of non-textual components (here,maps) that are searchable independently of the articles from which they are taken, with the option to view the source articles. The method mines words from the articles...

In recent years, database research and product development activities have focused on support for non-traditional data types, such as text or multi-media documents. This paper describes an approach of coupling SQL databases and content-specific search engines, such as fulltext retrieval engines, in an efficient manner. It is based on a query rewrite scheme that exploits so-called table function...

To keep pace with the increased popularity of digital video as an archival medium, the development of techniques for fast and eecient analysis of video streams is essential. In particular, solutions to the problems of storing, indexing, browsing, and retrieving video data from large multimedia databases are necessary to allow access to these collections. Given that video is often stored eecient...

This paper introduces a new method to analyse the image texture and to index the image database. We present a new strategy to reduce the computational time to extract image features with high retrieval accuracy. We also propose a method to reduce the image feature dimension, so any robust indexing methods can be used. By weighting the extracted image features, a system may perceive the image co...