Sciweavers

2714 search results - page 177 / 543
» Under the table interaction
Sort
View
CIKM
1994
Springer
15 years 10 months ago
TID Hash Joins
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...
Robert Marek, Erhard Rahm
DEBS
2010
ACM
15 years 10 months ago
Stochastic performance analysis and capacity planning of publish/subscribe systems
Publish/subscribe systems are used increasingly often as a communication mechanism in loosely-coupled distributed applications. With their gradual adoption in mission critical are...
Arnd Schröter, Gero Mühl, Samuel Kounev,...
FUN
2007
Springer
120views Algorithms» more  FUN 2007»
15 years 10 months ago
Drawing Borders Efficiently
A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawin...
Kazuo Iwama, Eiji Miyano, Hirotaka Ono
CCGRID
2004
IEEE
15 years 10 months ago
Adaptive congestion control for hotspot management in structured peer-to-peer systems
Distributed Hash Tables (DHTs) bring the promise of increased availability of data to wide-area systems, under the assumption of uniform request load. However, they don't int...
Anne-Marie Bosneag, Yong Xi, Xinjie Li, Monica Bro...
DSN
2004
IEEE
15 years 10 months ago
Impact of Path Diversity on Multi-homed and Overlay Networks
Multi-homed and overlay networks are two widely studied approaches aimed at leveraging the inherent redundancy of the Internet's underlying routing infrastructure to enhance ...
Junghee Han, Farnam Jahanian