Sciweavers

496 search results - page 39 / 100
» Machine models and lower bounds for query processing
Sort
View
GIS
2007
ACM
14 years 8 months ago
Proximity queries in large traffic networks
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
SPAA
1990
ACM
13 years 11 months ago
Low Overhead Parallel Schedules for Task Graphs
d Abstract) Richard J. Anderson Paul Beame Walter L. Ruzzo Department of Computer Science and Engineering University of Washingtoni We introduce a task scheduling model which is u...
Richard J. Anderson, Paul Beame, Walter L. Ruzzo
PODC
2009
ACM
14 years 8 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
ICDE
2007
IEEE
120views Database» more  ICDE 2007»
14 years 2 months ago
Optimizing State-Intensive Non-Blocking Queries Using Run-time Adaptation
Main memory is a critical resource when processing non-blocking queries with state intensive operators that require real-time responses. While partitioned parallel processing can ...
Bin Liu, Mariana Jbantova, Elke A. Rundensteiner
EDBT
2006
ACM
255views Database» more  EDBT 2006»
14 years 7 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald