1007 search results - page 28 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
FGCS
2000
15 years 2 months ago
2000
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
199
click to vote
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
Recent data stream systems such as TelegraphCQ have employed the well-known property of duality between data and queries. In these systems, query processing methods are classified...
128
click to vote
OTM
2007
Springer
15 years 8 months ago
2007
Springer
Practical scalability of Description Logic (DL) reasoning is an important premise for the adoption of OWL in a real-world setting. Many highly efficient optimizations for the DL ta...
115
click to vote
SIGCOMM
2009
ACM
15 years 8 months ago
2009
ACM
The routing architecture of the original 4.4BSD [3] kernel has been deployed successfully without major design modification for over 15 years. In the unified routing architectur...
126
Voted
PODC
2010
ACM
15 years 6 months ago
2010
ACM
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...