This paper aims to develop a simple and robust representation scheme for indexing line patterns. The application vehicle used in this study involves indexing into an aerial image database using a cartographic model. The images contained in the database are of urban and semi-urban areas. The cartographic model represents a road network known to appear in a subset of the images contained within t...

Random Indexing is a vector space technique that provides an efficient and scalable approximation to distributional similarity problems. We present experiments showing Random Indexing to be poor at handling large volumes of data and evaluate the use of weighting functions for improving the performance of Random Indexing. We find that Random Index is robust for small data sets, but performance d...

In this paper we present a very general approach to indexing and retrieval of images in image database systems. We allow different ways of indexing and matching for objects in an image, and integrate them with our existing approach of the generalized extended pseudo-2D string and generalized combined 2D string representation of the image to formulate a more general framework for iconic indexing...

There has been much research about XML storage and information retrieval. Traditionally XML documents are mapped onto relational databases. Then the data can be queried by relational queries. Nowadays many digital libraries store XML documents in a native XML database. Native means that the documents are stored and retrieved in their original format. An important task of such a database is inde...

The purpose of this article is to investigate the possibility of the automation of sophisticated subject indexing of medical journal articles. Approaches to subject descriptor assignment in information retrieval research are usually either based upon the manual descriptors included in the database or the attempted generation of alternative search parameters, using statistical, probabilistic or ...

Definition The indexing set of dimension p in a particular space; denoted by IP P is the set of all indexing points of p in that space. A spatial database allows for storing and retrieving spatial objects and consists of spatial relations which may contain spatial as well as non-spatial data. Spatial data can be points. lines, rectangles, surfaces. or more complex objects. Similar to other data...

Data warehouse is a collection of huge database which is subject oriented, integrated, time-variant and non volatile. As it is a set of huge database, fast data access is the major performance parameter of any data warehouse. Generally the information retrieved from Data Warehouse is summarized or aggregated as it is required for some decision making process of organization. To retrieve such a ...

This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares the shock graph topology and attributes to produce a similarity metric, and results in 100% recognition rate in querying a database of approximately 200 shapes. However, indexing into a significantly larger database is ...

Database indices are fundamental data structures that improve the speed of data retrieval operations. In this paper, we focus on native XML database systems and provide an elementary survey of existing approaches for indexing semistructured data employed in selected academic open-source systems. Considering the requirements set for a particular system, ExDB, and the results of the accomplished ...