Sciweavers

Share
2 search results - page 1 / 1
» Push vs. pull: data movement for linked data structures
Sort
View
ICS
2000
Tsinghua U.
10 years 3 months ago
Push vs. pull: data movement for linked data structures
As the performance gap between the CPU and main memory continues to grow, techniques to hide memory latency are essential to deliver a high performance computer system. Prefetchin...
Chia-Lin Yang, Alvin R. Lebeck
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
10 years 6 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
books