485 research outputs found
Research issues in real-time database systems
Cataloged from PDF version of article.Today's real-time systems are characterized by managing large volumes of data.
Efficient database management algorithms for accessing and manipulating data are
required to satisfy timing constraints of supported applications. Real-time database
systems involve a new research area investigating possible ways of applying database
systems technology to real-time systems. Management of real-time information through
a database system requires the integration of concepts from both real-time systems and
database systems. Some new criteria need to be developed to involve timing constraints
of real-time applications in many database systems design issues, such as
transaction/query processing, data buffering, CPU, and IO scheduling. In this paper, a
basic understanding of the issues in real-time database systems is provided and the
research efforts in this area are introduced. Different approaches to various problems of
real-time database systems are briefly described, and possible future research directions
are discussed
Multiclass Query Scheduling in Real-Time Database Systems
In recent years, a demand for real-time systems that can manipulate large amounts of shared data has led to the emer-gence of real-time database systems (RTDBS) as a research area. This paper focuses on the problem of scheduling queries in RTDBSs. We introduce and evaluate a new algorithm called Priority Adaptation Query Resource Scheduling (PAQRS) for handling both single class and multiclass query workloads. The performance objective of the algorithm is to minimize the number of missed deadlines, while at the same time ensuring that any deadline misses are scattered across the different classes according to an administratively-defined miss distribution. This objective is achieved by dynamically adapting the system’s admission, mem-ory allocation, and priority assignment policies according to its current resource configuration and workload characteristics. A series of experiments confirms that PAQRS is very effective for real-time query scheduling
Pricing of Information Services Using Real-Time Databases: A Framework for Integrating User Preferences and Real-Time Workload (Best Paper Runner Up)
Many revolutionary information products are being offered or envisioned in electronic commerce setting. Since an economic paradigm and mass customization are implicit in electronic commerce, these products must be produced and delivered at appropriate prices with user desired service characteristics such as response time, correctness, and completeness. In this research, we investigate the information services pricing with response time (or delay) as the only service characteristic since response time can implicitly characterize other quality attributes such as correctness. In order to recognize customers’ preferences, real-time databases, where transaction processing is time-cognizant, are central to information providers and can be thought of as “manufacturers” of customized products. We propose to capture user preferences by a priority pricing mechanism based on economic theory. This pricing is concerned with database access and is independent of content pricing. Our approach has a natural overload1 management and admission control2 techniques that can potentially increase collective benefits. Our model is evaluated using simulation and is shown to outperform a system without access pricing mechanism with respect to both system wide benefits and RTDB performance
Recommended from our members
A Comparative Study of Divergence Control Algorithms
This paper evaluates and compares the performance of two-phase locking divergence control (2PLDC) and optimistic divergence control (ODC) algorithms using a comprehensive centralized database simulation model. We examine a system with multiclass workloads in which on-line update transactions and long-duration queries progress based on epsilon serializability (ESR). Our results demonstrate that significant performance enhancements can be achieved with a non-zero tolerable inconsistency (ϵ-spec). With sufficient ϵ-spec and limited system resources, both algorithms achieve comparable performance. However, with low resource contention, ODC performs significantly better than 2PLDC. Moreover, given a small ϵ-spec, ODC returns more accurate results on the committed queries then 2PLDC
Recommended from our members
Parallelizing support vector machines for scalable image annotation
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Machine learning techniques have facilitated image retrieval by automatically classifying and annotating images with keywords. Among them Support Vector Machines (SVMs) are used extensively due to their generalization properties. However, SVM training is notably a computationally intensive process especially when the training dataset is large.
In this thesis distributed computing paradigms have been investigated to speed up SVM training, by partitioning a large training dataset into small data chunks and process each chunk in parallel utilizing the resources of a cluster of computers. A resource aware parallel SVM algorithm is introduced for large scale image annotation in parallel using a cluster of computers. A genetic algorithm based load balancing scheme is designed to optimize the performance of the algorithm in heterogeneous computing environments.
SVM was initially designed for binary classifications. However, most classification problems arising in domains such as image annotation usually involve more than two classes. A resource aware parallel multiclass SVM algorithm for large scale image annotation in parallel using a cluster of computers is introduced.
The combination of classifiers leads to substantial reduction of classification error in a wide range of applications. Among them SVM ensembles with bagging is shown to outperform a single SVM in terms of classification accuracy. However, SVM ensembles training are notably a computationally intensive process especially when the number replicated samples based on bootstrapping is large. A distributed SVM ensemble algorithm for image annotation is introduced which re-samples the training data based on bootstrapping and training SVM on each sample in parallel using a cluster of computers.
The above algorithms are evaluated in both experimental and simulation environments showing that the distributed SVM algorithm, distributed multiclass SVM algorithm, and distributed SVM ensemble algorithm, reduces the training time significantly while maintaining a high level of accuracy in classifications
- …