We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
OLAP queries are typically heavy-weight and ad-hoc thus requiring high storage capacity and processing power. In this paper, we address this problem using a database cluster which...
Alexandre A. B. Lima, Marta Mattoso, Patrick Valdu...
—The availability of optical network infrastructure and appropriate user control software has recently made it possible for scientists to establish end-to-end circuits across mul...
This paper evaluates the performance of a novel View-Oriented Parallel Programming style for parallel programming on cluster computers. View-Oriented Parallel Programming is based...
We consider efficient communication schemes based on both network-supported and application-level multicast techniques for content-based publication-subscription systems. We show...
Anton Riabov, Zhen Liu, Joel L. Wolf, Philip S. Yu...