Sciweavers

971 search results - page 52 / 195
» Planning with Reduced Operator Sets
Sort
View
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
16 years 6 months ago
Distributed data-parallel computing using a high-level programming language
The Dryad and DryadLINQ systems offer a new programming model for large scale data-parallel computing. They generalize previous execution environments such as SQL and MapReduce in...
Michael Isard, Yuan Yu
SIGMOD
2000
ACM
159views Database» more  SIGMOD 2000»
15 years 10 months ago
DLFM: A Transactional Resource Manager
The DataLinks technology developed at IBM Almaden Research Center and now available in DB2 UDB 5.2 introduces a new data type called DATALINK for a database to reference and manag...
Hui-I Hsiao, Inderpal Narang
178
Voted
BMCBI
2010
121views more  BMCBI 2010»
15 years 3 months ago
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...
DCC
2000
IEEE
15 years 10 months ago
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciec...
188
Voted
KDD
2001
ACM
253views Data Mining» more  KDD 2001»
16 years 6 months ago
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
Jens-Peter Dittrich, Bernhard Seeger