Sciweavers

1314 search results - page 248 / 263
» Approximate data mining in very large relational data
Sort
View
VLDB
2004
ACM
118views Database» more  VLDB 2004»
15 years 5 months ago
On the performance of bitmap indices for high cardinality attributes
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
Kesheng Wu, Ekow J. Otoo, Arie Shoshani
BMCBI
2010
135views more  BMCBI 2010»
14 years 12 months ago
GIGA: a simple, efficient algorithm for gene tree inference in the genomic age
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
Paul D. Thomas
PVLDB
2010
178views more  PVLDB 2010»
14 years 10 months ago
Hadoop++: Making a Yellow Elephant Run Like a Cheetah (Without It Even Noticing)
MapReduce is a computing paradigm that has gained a lot of attention in recent years from industry and research. Unlike parallel DBMSs, MapReduce allows non-expert users to run co...
Jens Dittrich, Jorge-Arnulfo Quiané-Ruiz, A...
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
15 years 12 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
CSB
2003
IEEE
15 years 5 months ago
Group Testing With DNA Chips: Generating Designs and Decoding Experiments
DNA microarrays are a valuable tool for massively parallel DNA-DNA hybridization experiments. Currently, most applications rely on the existence of sequence-specific oligonucleot...
Alexander Schliep, David C. Torney, Sven Rahmann