Sciweavers

896 search results - page 132 / 180
» Caching in Multidimensional Databases
Sort
View
SIGMOD
2003
ACM
112views Database» more  SIGMOD 2003»
14 years 9 months ago
A Theory of Redo Recovery
Our goal is to understand redo recovery. We define an installation graph of operations in an execution, an ordering significantly weaker than conflict ordering from concurrency co...
David B. Lomet, Mark R. Tuttle
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
14 years 9 months ago
Improving Index Performance through Prefetching
This paper proposes and evaluates Prefetching B+ -Trees pB+ -Trees, which use prefetching to accelerate two important operations on B+ -Tree indices: searches and range scans. To ...
Shimin Chen, Phillip B. Gibbons, Todd C. Mowry
EDBT
2008
ACM
147views Database» more  EDBT 2008»
14 years 9 months ago
BITPEER: continuous subspace skyline computation with distributed bitmap indexes
In this paper, we propose a bitmap approach for efficient subspace skyline computation in a distributed setting. Our approach computes extended skylines which have been shown to i...
Katerina Fotiadou, Evaggelia Pitoura
ICDE
2006
IEEE
131views Database» more  ICDE 2006»
14 years 3 months ago
A Peer-to-Peer Architecture to Enable Versatile Lookup System Design
The resource lookup requirements in applications such as web caching, web content search, content distribution, resource sharing, network monitoring and management, and e-commerce...
Vivek Sawant, Jasleen Kaur
VLDB
2005
ACM
85views Database» more  VLDB 2005»
14 years 2 months ago
Inspector Joins
The key idea behind Inspector Joins is that during the I/O partitioning phase of a hash-based join, we have the opportunity to look at the actual data itself and then use this kno...
Shimin Chen, Anastassia Ailamaki, Phillip B. Gibbo...