Sciweavers

1325 search results - page 80 / 265
» Quasirandom Load Balancing
Sort
View
BNCOD
2004
184views Database» more  BNCOD 2004»
13 years 9 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank
DEXA
2005
Springer
77views Database» more  DEXA 2005»
14 years 1 months ago
An Optimal Skew-insensitive Join and Multi-join Algorithm for Distributed Architectures
Abstract. The development of scalable parallel database systems requires the design of efficient algorithms for the join operation which is the most frequent and expensive operatio...
Mostafa Bamha
JCST
2000
89views more  JCST 2000»
13 years 7 months ago
LinuxDirector: A Connection Director for Scalable Internet Services
LinuxDirector is a connection director that supports load balancing among multiple Internet servers, which can be used to build scalable Internet services based on clusters of ser...
Zhang Wensong, Shiyao Jin, Quanyuan Wu
SIGCOMM
2004
ACM
14 years 1 months ago
Mercury: supporting scalable multi-attribute range queries
This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute rangebased searches. Mercury differs from previous range-based query systems in that...
Ashwin R. Bharambe, Mukesh Agrawal, Srinivasan Ses...
CCGRID
2003
IEEE
14 years 1 months ago
Leveraging Non-Uniform Resources for Parallel Query Processing
Clusters are now composed of non-uniform nodes with different CPUs, disks or network cards so that customers can adapt the cluster configuration to the changing technologies and t...
Tobias Mayr, Philippe Bonnet, Johannes Gehrke, Pra...