2514 search results - page 155 / 503 » On the Computation of Approximations of Database Queries |
177
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Generic database replication algorithms do not scale linearly in throughput as all update, deletion and insertion (UDI) queries must be applied to every database replica. The thro...
194
click to vote
BTW
2007
Springer
16 years 21 days ago
2007
Springer
: Distributed top-k query processing is increasingly becoming an essential functionality in a large number of emerging application classes. This paper addresses the efficient alge...
171
click to vote
EUROPAR
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processi...
196
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
The Semantic Web and its technologies become increasingly important. As more and more Semantic Web applications are being used, developing more stable Semantic Web applications be...
168
click to vote
SISAP
2008
IEEE
16 years 27 days ago
2008
IEEE
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...