In this work, we develop an intelligent storage system framework for soft real-time applications. Modern software systems consist of a collection of layers and information exchange across the layers is performed via well-defined interfaces. Due to the ...

This paper examines the idea of incorporating machine learning algorithms into a database system for monitoring its stream of incoming queries and generating hierarchies with the most important concepts expressed in those queries. The goal is for these ...

Steady progress in the development of optical disc technology over the past decade has brought it to the point where it is beginning to compete directly with magnetic disc technology. WORM optical discs in particular, which permanently register information ...

Informal education centers, such as museums and aquaria, serve as important educational resources for the broader community and therefore must accommodate a vast diversity of visitors. This diversity typically includes differences in culture, abilities, ...

The aim of the paper is to introduce techniques in order to tune sequential in-core sorting algorithms in the frameworks of two applications. The first application is parallel sorting when the processor speeds are not identical in the parallel system. ...

Reconfigure servers without changing mount points on the clients with this Kerberos-authenticated network filesystem.

Secure chips, e.g. present in smart cards, USB dongles, i-buttons, are now ubiquitous in applications with strong security requirements. And they require embedded data management techniques. However, secure chips have severe hardware constraints which ...

Both single-level and two-level indexed descriptor schemes for multikey retrieval are presented and compared. The descriptors are formed using superimposed coding techniques and stored using a bit-inversion technique. A fast-batch insertion algorithm ...

Abstract--In this paper, a disk scheduler called MS-EDF is proposed not only to meet the deadlines of all requests, but also to offer the optimal seek time. Through the experiments, the results show our disk scheduling algorithm outperforms the others ...

The traditional database security solutions are proving to be inadequate to solve the problems in a federated database system. These problems are largely based on the federation's structure and the degree of local autonomy of participating component ...

Resource Brokers on the Grid consult a number of distributed information services to select the best data source and/or computational resource based on user requirements. The consultation task increases the design complexity of Resource Brokers. This ...

In new application areas of relational database systems, such as artificial intelligence, the join operator is used more extensively than in conventional applications. In this paper, we propose a simple data structure, called a join index, for improving ...

A new multiattribute index structure called the hB-tree is introduced. It is derived from the K-D-B-tree of Robinson [15] but has additional desirable properties. The hB-tree internode search and growth processes are precisely analogous to the corresponding ...

This paper describes a utility named <tt>ruf</tt> that reads files from an unmounted file system. The files are accessed by reading disk structures directly so the program is peculiar to the specific file system employed. The current implementation ...

Large, spatial databases may be required to prosses both intense query and intense update loads. For example, a data warehouse which contains spatial data may be required to answer difficult, analytical queries at the same time as it accepts massive ...

This paper presents MojaveFS, a distributed file system with support for sequential consistency. It provides location transparency and makes use of replication for reliability and fault tolerance. We employ a hybrid hash-based and tree-based lookup mechanism ...

In this paper, we propose Diagonal Ordering, a new technique for K-Nearest-Neighbor (KNN) search in a high-dimensional space. Our solution is based on data clustering and a particular sort order of the data points, which is obtained by "slicing" each ...