Sciweavers

1007 search results - page 147 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
DEBS
2009
ACM
15 years 6 months ago
Efficient event-based resource discovery
The ability to find services or resources that satisfy some criteria is an important aspect of distributed systems. This paper presents an event-based architecture to support more...
Wei Yan, Songlin Hu, Vinod Muthusamy, Hans-Arno Ja...
INFOCOM
2011
IEEE
14 years 6 months ago
Scheduling in mapreduce-like systems for fast completion time
Abstract—Large-scale data processing needs of enterprises today are primarily met with distributed and parallel computing in data centers. MapReduce has emerged as an important p...
Hyunseok Chang, Murali S. Kodialam, Ramana Rao Kom...
ICWS
2009
IEEE
15 years 11 months ago
RDF Data-Centric Storage
—The vision of the Semantic Web has brought about new challenges at the intersection of web research and data management. One fundamental research issue at this intersection is t...
Justin J. Levandoski, Mohamed F. Mokbel
SIGMOD
2006
ACM
102views Database» more  SIGMOD 2006»
16 years 2 months ago
DADA: a data cube for dominant relationship analysis
The concept of dominance has recently attracted much interest in the context of skyline computation. Given an Ndimensional data set S, a point p is said to dominate q if p is bett...
Cuiping Li, Beng Chin Ooi, Anthony K. H. Tung, Sha...
ICCS
2001
Springer
15 years 6 months ago
High-Performance Algorithm Engineering for Computational Phylogenetics
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
Bernard M. E. Moret, David A. Bader, Tandy Warnow