Sciweavers

238 search results - page 22 / 48
» Optimistic parallelism benefits from data partitioning
Sort
View
PDIS
1994
IEEE
13 years 11 months ago
Session Guarantees for Weakly Consistent Replicated Data
Four per-session guarantees are proposed to aid users and applications of weakly consistent replicated data: Read Your Writes, Monotonic Reads, Writes Follow Reads, and Monotonic ...
Douglas B. Terry, Alan J. Demers, Karin Petersen, ...
SIGMOD
2007
ACM
136views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive optimization in a shared-nothing parallel database
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache...
PVLDB
2008
126views more  PVLDB 2008»
13 years 7 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
ACMSE
2005
ACM
14 years 1 months ago
The bipartite clique: a topological paradigm for WWWeb user search customization
Web user search customization research has been fueled by the recognition that if the WWW is to attain to its optimal potential as an interactive medium the development of new and...
Brenda F. Miles, Vir V. Phoha
ICPPW
2002
IEEE
14 years 16 days ago
Data Distribution Schemes of Sparse Arrays on Distributed Memory Multicomputers
A data distribution scheme of sparse arrays on a distributed memory multicomputer, in general, is composed of three phases, data partition, data distribution, and data compression...
Chun-Yuan Lin, Yeh-Ching Chung, Jen-Shiuh Liu