2392 search results - page 375 / 479 » Channel-Hopping Multiple Access |
209
click to vote
POPL
2002
ACM
16 years 4 months ago
2002
ACM
Data-layout optimizations rearrange fields within objects, objects within objects, and objects within the heap, with the goal of increasing spatial locality. While the importance ...
124
click to vote
OSDI
2002
ACM
16 years 4 months ago
2002
ACM
Three experimental environments traditionally support network and distributed systems research: network emulators, network simulators, and live networks. The continued use of mult...
218
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
222
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
In recent years there has been considerable research on automated selection of physical design in database systems. In current solutions, candidate access paths are heuristically ...
131
click to vote
SIGMOD
2003
ACM
16 years 4 months ago
2003
ACM
We present an architecture and a set of challenges for peer database management systems. These systems team up to build a network of nodes (peers) that coordinate at run time most...