Sciweavers

1007 search results - page 168 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
EDBT
2009
ACM
175views Database» more  EDBT 2009»
15 years 9 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
PODC
2009
ACM
16 years 2 months ago
Randomized mutual exclusion in O(log N / log log N) RMRs
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
Danny Hendler, Philipp Woelfel
140
Voted
PODS
2003
ACM
158views Database» more  PODS 2003»
16 years 2 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
DEBU
2010
128views more  DEBU 2010»
14 years 11 months ago
Panda: A System for Provenance and Data
Panda (for Provenance and Data) is a new project whose goal is to develop a general-purpose system that unifies concepts from existing provenance systems and overcomes some limita...
Robert Ikeda, Jennifer Widom
PODC
2010
ACM
15 years 6 months ago
Finding mobile data under delay constraints with searching costs
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002,...