Sciweavers

492 search results - page 88 / 99
» Computing aggregations in database query languages
Sort
View
SAC
2003
ACM
14 years 3 months ago
Similar_Join: Extending DBMS with a Bio-specific Operator
Existing sequence comparison software applications lack automation, abstraction, performance, and flexibility. Users need a new way of studying and applying sequence comparisons i...
Jake Yue Chen, John V. Carlis
PODS
1994
ACM
138views Database» more  PODS 1994»
14 years 1 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
POST
2012
218views more  POST 2012»
12 years 5 months ago
A Core Calculus for Provenance
Provenance is an increasing concern due to the revolution in sharing and processing scientific data on the Web and in other computer systems. It is proposed that many computer sys...
Umut A. Acar, Amal Ahmed, James Cheney, Roly Perer...
PODS
2008
ACM
178views Database» more  PODS 2008»
14 years 10 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 4 months ago
Incorporating partitioning and parallel plans into the SCOPE optimizer
— Massive data analysis on large clusters presents new opportunities and challenges for query optimization. Data partitioning is crucial to performance in this environment. Howev...
Jingren Zhou, Per-Åke Larson, Ronnie Chaiken