Results 1 - 10
of
82
Continual Queries for Internet Scale Event-Driven Information Delivery
- IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
, 1999
"... In this paper we introduce the concept of continual queries, describe the design of a distributed event-driven continual query system -- OpenCQ, and outline the initial implementation of OpenCQ on top of the distributed interoperable information mediation system DIOM [21, 19]. Continual queries a ..."
Abstract
-
Cited by 153 (13 self)
- Add to MetaCart
In this paper we introduce the concept of continual queries, describe the design of a distributed event-driven continual query system -- OpenCQ, and outline the initial implementation of OpenCQ on top of the distributed interoperable information mediation system DIOM [21, 19]. Continual queries are standing queries that monitor update of interest and return results whenever the update reaches specified thresholds. In OpenCQ, users may specify to the system the information they would like to monitor (such as the events or the update thresholds they are interested in). Whenever the information of interest becomes available, the system immediately delivers it to the relevant users; otherwise, the system continually monitors the arrival of the desired information and pushes it to the relevant users as it meets the specified update thresholds. In contrast to conventional pull-based data management systems such as DBMSs and Web search engines, OpenCQ exhibits two important featu...
A logical framework for reasoning about access control models
- ACM Trans. Inf. Syst. Secur
, 2003
"... The increased awareness of the importance of data protection has made access control a relevant component of current data management systems. Moreover, emerging applications and data models call for flexible and expressive access control models. This has led to an extensive research activity that ha ..."
Abstract
-
Cited by 71 (1 self)
- Add to MetaCart
The increased awareness of the importance of data protection has made access control a relevant component of current data management systems. Moreover, emerging applications and data models call for flexible and expressive access control models. This has led to an extensive research activity that has resulted in the definition of a variety of access control models that differ greatly with respect to the access control policies they support. Thus, the need arises for developing tools for reasoning about the characteristics of these models. These tools should support users in the tasks of model specification, analysis of model properties, and authorization management. For example, they must be able to identify inconsistencies in the model specification and must support the administrator in comparing the expressive power of different models. In this paper, we make a first step in this direction by proposing a formal framework for reasoning about access control models. The framework we propose is based on a logical formalism and is general enough to model discretionary, mandatory, and role-based access control models. Each instance of the proposed framework corresponds to a C-Datalog program, interpreted according to a stable model semantics. In the paper, besides giving the syntax and the formal semantics of our framework, we show some examples of its application. Additionally, we present a number of dimensions along which access control models can be analyzed and compared. For each dimension, we show decidability results and we present some examples of its application.
Active Database Systems
- Modern Database Systems
, 1994
"... Integrating a production rules facility into a database system provides a uniform mechanism for a number of advanced database features including integrity constraint enforcement, derived data maintenance, triggers, alerters, protection, version control, and others. In addition, a database system wit ..."
Abstract
-
Cited by 68 (6 self)
- Add to MetaCart
Integrating a production rules facility into a database system provides a uniform mechanism for a number of advanced database features including integrity constraint enforcement, derived data maintenance, triggers, alerters, protection, version control, and others. In addition, a database system with rule processing capabilities provides a useful platform for large and efficient knowledge-base and expert systems. Database systems with production rules are referred to as active database systems, and the field of active database systems has indeed been active. This chapter summarizes current work in active database systems; topics covered include active database rule models and languages, rule execution semantics, and implementation issues. 1 Introduction Conventional database systems are passive: they only execute queries or transactions explicitly submitted by a user or an application program. For many applications, however, it is important to monitor situations of interest, and to ...
File System Support for Delta Compression
, 2000
"... Delta compression, which consists of compactly encoding one le version as the result of changes to another, can improve eciency in the use of network and disk resources. Delta compression techniques are readily available and can result in compression factors of ve to ten on typical data. Managing de ..."
Abstract
-
Cited by 53 (0 self)
- Add to MetaCart
Delta compression, which consists of compactly encoding one le version as the result of changes to another, can improve eciency in the use of network and disk resources. Delta compression techniques are readily available and can result in compression factors of ve to ten on typical data. Managing delta-compressed storage, however, is a dicult task. I will present a system that attempts to isolate the complexity of delta-compressed storage management by separating the task of version labeling from performance issues. I will show how the system integrates delta-compressed transport with delta-compressed storage. Existing tools for managing delta-compressed storage suer from weak le system support. Lack of transaction support is responsible for inecient application behavior. The only atomic operation in the traditional le system forces unnecessary disk activity due to copying costs. I will demonstrate that transaction support can improve application performance and extensibility wit...
Efficient Assembly of Complex Objects
, 1991
"... Although object-oriented database systems offer advantages over relational or record-oriented database systems, such as modeling facilities for complex objects, they are criticized for poor performance and query capabilities on set-oriented applications. The unacceptable performance is due in part t ..."
Abstract
-
Cited by 50 (3 self)
- Add to MetaCart
Although object-oriented database systems offer advantages over relational or record-oriented database systems, such as modeling facilities for complex objects, they are criticized for poor performance and query capabilities on set-oriented applications. The unacceptable performance is due in part to the object-at-a-time processing typically used by object-oriented database systems. We believe that improved performance of object-oriented database systems depends partially on the efficient and selective retrieval of sets of complex objects from secondary storage. In this report, we present the method of complex object retrieval and assembly used in the Volcano query processing system and the Revelation project. We also present experimental results comparing set-oriented versus object-at-a-time complex object assembly. 1. Introduction Relational database management systems provide a simple and well-understood model of data. The simplicity and theory of the relational model result in eff...
ObjectGlobe: Ubiquitous Query Processing on the Internet
, 2001
"... We present the design of ObjectGlobe, a distribust and open processor for Internet datasouc;Gp Today, data is pu
Abstract
-
Cited by 41 (11 self)
- Add to MetaCart
We present the design of ObjectGlobe, a distribust and open processor for Internet datasouc;Gp Today, data is pu<y<Mcm on the Internet via Web servers which have, if at all, very localizedquli processing capabilities. The goal of the ObjectGlobe project is to establish an open marketplace in which data and query proEkTNNk capabilities can be distribuib and udc by any kind of Internet application.Fuplic - more, ObjectGlobe integrates cycle pro viders (i.e., machines) which carryou quyc processing operators. The overall pictuc is to make it possible to execu@ aquGG with -- in principle -- u@;@EcmE quE operators, cycle providers, and data souac;p Su an infrastruMpyc can serve as enabling technology for scalable e-commerce applications, e.g., B2B and B2C market places, to be able to integrate data and data processing operations of a largenuy>G of participants. One of the main challenges in the design ofsuy an open system is to ensu@ privacy andsecuE;> .
Creating Reference Architectures: An Example from Avionics
- ACM SIGSOFT Symposium on Software Reusability
, 1995
"... ADAGE is a project to define and build a domain-specific software architecture (DSSA) environment for assisting the development of avionics software. A central concept of DSSA is the use of software system generators to implement component-based models of software synthesis in the target domain [SEI ..."
Abstract
-
Cited by 40 (14 self)
- Add to MetaCart
ADAGE is a project to define and build a domain-specific software architecture (DSSA) environment for assisting the development of avionics software. A central concept of DSSA is the use of software system generators to implement component-based models of software synthesis in the target domain [SEI90]. In this paper, we present the ADAGE component-based model (or reference architecture) for avionics software synthesis. We explain the modeling procedures used, review our initial goals, show how component reuse is achieved, and examine what we were (and were not) able to accomplish. The contributions of our paper are the avionics reference architecture and the lessons that we learned; both may be beneficial to others in future modeling efforts. 1
Data Placement in Shared-Nothing Parallel Database Systems
, 1994
"... . Data placement in shared-nothing database systems has been studied extensively in the past and various placement algorithms have been proposed. However, there is no consensus on the most efficient data placement algorithm and placement is still performed manually by a database administ ..."
Abstract
-
Cited by 40 (0 self)
- Add to MetaCart
.<F3.733e+05> Data placement in shared-nothing database systems has been studied extensively in the past and various placement algorithms have been proposed. However, there is no consensus on the most efficient data placement algorithm and placement is still performed manually by a database administrator with periodic reorganization to correct mistakes. This paper presents the first comprehensive simulation study of data placement issues in a shared-nothing system. The results show that current hardware technology trends have significantly changed the performance tradeoffs considered in past studies. A simplistic data placement strategy based on the new results is developed and shown to perform well for a variety of workloads.<F7.947e+05> Key words:<F3.733e+05> Declustering -- Disk allocation -- Resource allocation -- Resource scheduling<F7.947e+05> 1 Introduction<F3.733e+05> The last decade has seen a significant change in the characteristics of database applications. The demands of...
Dynamic Memory Allocation for Multiple-Query Workloads
- In VLDB
, 1993
"... This paper studies the problem of memory allocation and scheduling in a multiple query workload with widely varying resource requirements. Several memory allocation and scheduling schemes are presented and their performance is compared using a detailed simulation study. The results demonstrate the i ..."
Abstract
-
Cited by 40 (2 self)
- Add to MetaCart
This paper studies the problem of memory allocation and scheduling in a multiple query workload with widely varying resource requirements. Several memory allocation and scheduling schemes are presented and their performance is compared using a detailed simulation study. The results demonstrate the inadequacies of static schemes with fixed scheduling and memory allocation policies. A dynamic adaptive scheme which integrates scheduling and memory allocation is developed and is shown to perform effectively under widely varying workloads. 1. Introduction An important reason for the popularity of relational database systems is their ability to process ad-hoc queries posed by the users. Past research on query processing has dealt with issues of query optimization, scheduling, and resource allocation. Unfortunately, most of the work in this area has concentrated on processing single queries and does not consider multi-user issues. A particularly important issue that has largely been ignored...
Tioga: Providing Data Management Support for Scientific Visualization Applications
, 1993
"... We present a user interface paradigm for database management systems that is motivated by scienti c visualization applications. Our graphical user interface includes a \boxes and arrows" notation for database access and a ight simulator model of movement through information space. We also provide me ..."
Abstract
-
Cited by 35 (7 self)
- Add to MetaCart
We present a user interface paradigm for database management systems that is motivated by scienti c visualization applications. Our graphical user interface includes a \boxes and arrows" notation for database access and a ight simulator model of movement through information space. We also provide means to specify a hierarchy of abstracts of data of di erent types and resolutions, so that a \zoom " capability can be supported. The underlying DBMS support for this system is described and includes the compilation of query plans into megaplans, new algorithms for data bu ering, and provisions for a guaranteed rate of data delivery. The current state of the Tioga implementation is also described.

