Balancing confidentiality and efficiency in untrusted relational DBMSs

E Damiani, SDC Vimercati, S Jajodia… - Proceedings of the 10th …, 2003 - dl.acm.org
The scope and character of today's computing environments are progressively shifting from
traditional, one-on-one client-server interaction to the new cooperative paradigm. It then …

Hippodrome: running circles around storage administration

E Anderson, M Hobbs, K Keeton, S Spence… - Conference on File and …, 2002 - usenix.org
Storage system configuration, even at the enterprise scale, is traditionally undertaken by
human experts using a time-consuming process of trial and error, guided by simple rules of …

Improved algorithms and data structures for solving graph problems in external memory

V Kumar, EJ Schwabe - Proceedings of SPDP'96: 8th IEEE …, 1996 - ieeexplore.ieee.org
Recently, the study of I/O-efficient algorithms has moved beyond fundamental problems of
sorting and permuting and into wider areas such as computational geometry and graph …

Modeling and assessing inference exposure in encrypted databases

A Ceselli, E Damiani, SDCD Vimercati… - ACM Transactions on …, 2005 - dl.acm.org
The scope and character of today's computing environments are progressively shifting from
traditional, one-on-one client-server interaction to the new cooperative paradigm. It then …

Quickly finding near-optimal storage designs

E Anderson, S Spence, R Swaminathan… - ACM Transactions on …, 2005 - dl.acm.org
Despite the importance of storage in enterprise computer systems, there are few adequate
tools to design and configure a storage system to meet application data requirements …

Designing interconnect fabrics

JA Ward, TA Shahoumian, J Wilkes - US Patent 7,076,537, 2006 - Google Patents
A technique for designing an interconnect fabric for communication between a set of source
nodes and a set of terminal nodes. A design for an interconnect fabric is obtained having an …

Implementation of a storage mechanism for untrusted DBMSs

E Damiani, SDC Di Vimercati, M Finetti… - … Security in Storage …, 2003 - ieeexplore.ieee.org
Several architectures have been recently proposed that store relational data in encrypted
form on untrusted relational databases. Such architectures permit the creation of novel …

Automated planners for storage provisioning and disaster recovery

S Gopisetty, E Butler, S Jaquet… - IBM Journal of …, 2008 - ieeexplore.ieee.org
Introducing an application into a data center involves complex interrelated decision-making
for the placement of data (where to store it) and resiliency in the event of a disaster (how to …

Automated application component placement in data centers using mathematical programming

X Zhu, C Santos, D Beyer, J Ward… - International Journal of …, 2008 - Wiley Online Library
In this article we address the application component placement (ACP) problem for a data
center. The problem is defined as follows: for a given topology of a network consisting of …

Switch scheduling and network design for real-time systems

S Gopalakrishnan, M Caccamo… - 12th IEEE Real-Time and …, 2006 - ieeexplore.ieee.org
The rapid need for high bandwidth and low latency communication in distributed real-time
systems is driving system architects towards high-speed switches developed for high …