Sciweavers

1675 search results - page 85 / 335
» Implementing Data Cubes Efficiently
Sort
View
ASPLOS
2008
ACM
14 years 22 hour ago
General and efficient locking without blocking
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
Yannis Smaragdakis, Anthony Kay, Reimer Behrends, ...
PAKDD
2001
ACM
148views Data Mining» more  PAKDD 2001»
14 years 2 months ago
Scalable Hierarchical Clustering Method for Sequences of Categorical Values
Data clustering methods have many applications in the area of data mining. Traditional clustering algorithms deal with quantitative or categorical data points. However, there exist...
Tadeusz Morzy, Marek Wojciechowski, Maciej Zakrzew...
SIAMCOMP
2010
105views more  SIAMCOMP 2010»
13 years 4 months ago
Fast Access to Distributed Atomic Memory
We study efficient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as...
Partha Dutta, Rachid Guerraoui, Ron R. Levy, Marko...
SIGMOD
2008
ACM
103views Database» more  SIGMOD 2008»
14 years 10 months ago
XArch: archiving scientific and reference data
Database archiving is important for the retrieval of old versions of a database and for temporal queries over the history of data. We demonstrate XArch, a management system for ma...
Heiko Müller, Ioannis Koltsidas, Peter Bunema...
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 10 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010