1007 search results - page 122 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
207
Voted
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
119
Voted
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper addresses the problem of fine-grained data replication in large distributed systems, such as the Internet, so as to minimize the user access delays. With fine-grained d...
115
Voted
APIN
2007
15 years 2 months ago
2007
In this thesis, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to sear...
157
Voted
BNCOD
2007
15 years 4 months ago
2007
Order is essential for XML query processing. Efficient XML processing with order consideration over relational storage is non-trivial, especially for complex nested XQuery expressi...
148
Voted
WSC
1998
15 years 3 months ago
1998
We have taken a NIST molecular dynamics simulation program (md3), which was configured as a single sequential process running on a CRAY C90 vector supercomputer, and parallelized ...