Sciweavers

169 search results - page 21 / 34
» Data management over flash memory
Sort
View
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
14 years 10 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
MICRO
2003
IEEE
147views Hardware» more  MICRO 2003»
14 years 2 months ago
Flexible Compiler-Managed L0 Buffers for Clustered VLIW Processors
Wire delays are a major concern for current and forthcoming processors. One approach to attack this problem is to divide the processor into semi-independent units referred to as c...
Enric Gibert, F. Jesús Sánchez, Anto...
CIKM
2009
Springer
14 years 1 months ago
Scalable indexing of RDF graphs for efficient join processing
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
George H. L. Fletcher, Peter W. Beck
SIGMOD
2010
ACM
221views Database» more  SIGMOD 2010»
14 years 2 months ago
Low overhead concurrency control for partitioned main memory databases
Database partitioning is a technique for improving the performance of distributed OLTP databases, since “single partition” transactions that access data on one partition do no...
Evan P. C. Jones, Daniel J. Abadi, Samuel Madden
CGO
2010
IEEE
14 years 2 months ago
An efficient software transactional memory using commit-time invalidation
To improve the performance of transactional memory (TM), researchers have found many eager and lazy optimizations for conflict detection, the process of determining if transaction...
Justin Emile Gottschlich, Manish Vachharajani, Jer...