Sciweavers

926 search results - page 68 / 186
» Parallel Databases
Sort
View
VLDB
2007
ACM
166views Database» more  VLDB 2007»
14 years 3 months ago
To Share or Not To Share?
Intuitively, aggressive work sharing among concurrent queries in a database system should always improve performance by eliminating redundant computation or data accesses. We show...
Ryan Johnson, Nikos Hardavellas, Ippokratis Pandis...
ICDT
2009
ACM
121views Database» more  ICDT 2009»
14 years 9 months ago
Optimal splitters for database partitioning with size bounds
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
Kenneth A. Ross, John Cieslewicz
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
14 years 2 months ago
A reconfigurable architecture for scanning biosequence databases
—Unknown protein sequences are often compared to a set of known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithm...
Timothy F. Oliver, Bertil Schmidt, Douglas L. Mask...
DEBS
2003
ACM
14 years 2 months ago
Information sharing with the Oracle database
Database systems have been designed to manage business critical information and make this information accessible on request to connected clients. There is, however, an ever-increa...
Dieter Gawlick, Shailendra Mishra
EUROPAR
2003
Springer
14 years 2 months ago
Preventive Multi-master Replication in a Cluster of Autonomous Databases
We consider the use of a cluster of PC servers for Application Service Providers where applications and databases must remain autonomous. We use data replication to improve data av...
Esther Pacitti, M. Tamer Özsu, Cédric ...