Most traditional database systems exploit a record-oriented model where the attributes of a record are placed contiguously in a hard disk to achieve high performance writes. However, for read-mostly data warehouse systems, the column-oriented database has become a proper model because of its superior read performance. Today, flash memory is largely recognized as the preferred storage media for ...

Biometric identification has emerged as a reliable means of controlling access to both physical and virtual spaces. In spite of the rapid proliferation of large-scale databases, the research has thus far been focused only on accuracy within small databases. However, as the size of the database increases, not only does the response time deteriorate, but so does the accuracy of the system. Thus f...

While there has been growing interest in the use of Prolog for database applications, the size of these applications is limited by the capabilities of current Prolog systems for handling disk resident clauses. A major impediment is the inordinate amount of time required for retrieval and urujication of clauses from a large set stored on disk. Indexing is commonly used in conventional database s...

Color histogram matching has been shown to be a promising way of quickly indexing into a large image database. Yet, few experiments have been done to test the method on truly large databases, and even if they were performed, they would give little guidance to a user wondering if the technique would be useful with his or her database. In this paper we deene and analyze a measure relevant to exte...

Ef®cient indexing on a class hierarchy is essential for the achievement of high performance in query evaluation for object databases. In this paper, we present a practical indexing scheme, Partition Index Con®guration Scheme (PINS), which provides good index con®gurations for any real database environment. PINS considers the distribution of key values, as well as query patterns such as query fr...

This paper describes the design of an extensible 3-tiered semantic file system, backed by an existing extensible object-relational database. The system is designed to export the standard NFS interface, while providing indexing and query support for user-defined file types using the virtual directory abstraction. To illustrate the feasibility of the proposed architecture, we describe its impleme...

The Index Selection Problem (ISP) is an important element of research in the field of optimization of relational database systems. Commonly used commercial tools are based on a methodology that enables tables indexing for independent SQL queries. The article presents an original method, based on a genetic algorithm, for indexing tables for groups of queries in a relational database (MDI). Condu...

Indexing is one of the most important tool for efficiency enhancement, available in DMBS today. The necessity of speeding up queries in very large database systems is unquestioned. The use of new-fashioned technologies and applications such as Multimedia, E-Commerce or Geographic Information Systems in combination with commercial database systems show the shortness of current indexing mechanism...

Geographic visualisation and other real-time applications require efficient data access. An indexing mechanism, adapted to the characteristics of geographic data, can be used to improve retrieval of geographic data. This paper describes an indexing mechanism based on a method called Ellipsoidal Quadtree, EQT. EQT adapts the indexing structure of a database to the shape of the earth. EQT fulfils...

As in conventional DataBase Management Systems (DBMSs), to allow users to efficiently access and retrieve data objects, a MultiMedia DataBase Management System (MMDBMS) must employ an effective access method such as indexing and hashing. This paper provides a survey of treebased multidimensional indexing techniques for MMDBMSs that maintain image data represented as feature vectors. These techn...