Class of Service in the High Performance Storage System

Quality of service capabilities are commonly deployed in archival mass storage systems as one or more client-specified parameters to influence physical location of data in multi-level device hierarchies for performance or cost reasons. The capabilities of new high-performance storage architectures and the needs of data-intensive applications require better quality of service models for modern storage systems. HPSS, a new distributed, high-performance, scalable, storage system, uses a Class of Service (COS) structure to influence system behavior. The authors summarize the design objectives and functionality of HPSS and describes how COS defines a set of performance, media, and residency attributes assigned to storage objects managed by HPSS servers. COS definitions are used to provide appropriate behavior and service levels as requested (or demanded) by storage system clients. They compare the HPSS COS approach with other quality of service concepts and discuss alignment possibilities

Speedy Transactions in Multicore In-Memory Databases

Silo is a new in-memory database that achieves excellent performance and scalability on modern multicore machines. Silo was designed from the ground up to use system memory and caches efficiently. For instance, it avoids all centralized contention points, including that of centralized transaction ID assignment. Silo's key contribution is a commit protocol based on optimistic concurrency control that provides serializability while avoiding all shared-memory writes for records that were only read. Though this might seem to complicate the enforcement of a serial order, correct logging and recovery is provided by linking periodically-updated epochs with the commit protocol. Silo provides the same guarantees as any serializable database without unnecessary scalability bottlenecks or much additional latency. Silo achieves almost 700,000 transactions per second on a standard TPC-C workload mix on a 32-core machine, as well as near-linear scalability. Considered per core, this is several times higher than previously reported results.Engineering and Applied Science

Parallel Evaluation of Multi-join Queries

A number of execution strategies for parallel evaluation of multi-join queries have been proposed in the literature. In this paper we give a comparative performance evaluation of four execution strategies by implementing all of them on the same parallel database system, PRISMA/DB. Experiments have been done up to 80 processors. These strategies, coming from the literature, are named: Sequential Parallel, Synchronous Execution, Segmented Right-Deep, and Full Parallel. Based on the experiments clear guidelines are given when to use which strategy. This is an extended abstract; the full paper appeared in Proc. ACM SIGMOD'94, Minneapolis, Minnesota, May 24–27, 199

ESQL : an extended SQL with object and deductive capabilities

Projet RODINESQL is an SQL upward-compatible database language that integrates in a uniform and clean way the essential concepts of relational, object-oriented and deductive databases. ESQL is intended for traditional data processing applications as well as more complex applications such as large expert systems. Therefore, ESQL's salient features are : a rich and extendible type system based on abstract data types (ADTs) implemented in various programming languages ; complex objects with object sharing by combining generic ADTs and object identity ; the capability of querying and updating relations containing simple or complex objects using SQL-compatible syntax and semantics ; and a Datalog-like deductive capability provided as an extension of the SQL view mechanism. ESQL's functional semantics enables uniform manipulation of ESQL data and should facilitate the implementation of the ESQL compiler

Contextual and Granular Policy Enforcement in Database-backed Applications

Database-backed applications rely on inlined policy checks to process users' private and confidential data in a policy-compliant manner as traditional database access control mechanisms cannot enforce complex policies. However, application bugs due to missed checks are common in such applications, which result in data breaches. While separating policy from code is a natural solution, many data protection policies specify restrictions based on the context in which data is accessed and how the data is used. Enforcing these restrictions automatically presents significant challenges, as the information needed to determine context requires a tight coupling between policy enforcement and an application's implementation. We present Estrela, a framework for enforcing contextual and granular data access policies. Working from the observation that API endpoints can be associated with salient contextual information in most database-backed applications, Estrela allows developers to specify API-specific restrictions on data access and use. Estrela provides a clean separation between policy specification and the application's implementation, which facilitates easier auditing and maintenance of policies. Policies in Estrela consist of pre-evaluation and post-evaluation conditions, which provide the means to modulate database access before a query is issued, and to impose finer-grained constraints on information release after the evaluation of query, respectively. We build a prototype of Estrela and apply it to retrofit several real world applications (from 1000-80k LOC) to enforce different contextual policies. Our evaluation shows that Estrela can enforce policies with minimal overheads

Glycocalyx Restricts Adenoviral Vector Access to Apical Receptors Expressed on Respiratory Epithelium In Vitro and In Vivo: Role for Tethered Mucins as Barriers to Lumenal Infection

Inefficient adenoviral vector (AdV)-mediated gene transfer to the ciliated respiratory epithelium has hindered gene transfer strategies for the treatment of cystic fibrosis lung disease. In part, the inefficiency is due to an absence of the coxsackie B and adenovirus type 2 and 5 receptor (CAR) from the apical membranes of polarized epithelia. In this study, using an in vitro model of human ciliated airway epithelium, we show that providing a glycosylphosphatidylinositol (GPI)-linked AdV receptor (GPI-CAR) at the apical surface did not significantly improve AdV gene transfer efficiency because the lumenal surface glycocalyx limited the access of AdV to apical GPI-CAR. The highly glycosylated tethered mucins were considered to be significant glycocalyx components that restricted AdV access because proteolytic digestion and inhibitors of O-linked glycosylation enhanced AdV gene transfer. To determine whether these in vitro observations are relevant to the in vivo situation, we generated transgenic mice expressing GPI-CAR at the surface of the airway epithelium, crossbred these mice with mice that were genetically devoid of tethered mucin type 1 (Muc1), and tested the efficiency of gene transfer to murine airways expressing apical GPI-human CAR (GPI-hCAR) in the presence and absence of Muc1. We determined that AdV gene transfer to the murine airway epithelium was inefficient even in GPI-hCAR transgenic mice but that the gene transfer efficiency improved in the absence of Muc1. However, the inability to achieve a high gene transfer efficiency, even in mice with a deletion of Muc1, suggested that other glycocalyx components, possibly other tethered mucin types, also provide a significant barrier to AdV interacting with the airway lumenal surface