Sciweavers

176 search results - page 20 / 36
» Overhead analysis of query localization optimization and rou...
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 7 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
SIGMOD
2007
ACM
136views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive optimization in a shared-nothing parallel database
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache...
JSAC
2006
114views more  JSAC 2006»
13 years 7 months ago
SCAN: self-organized network-layer security in mobile ad hoc networks
Protecting the network layer from malicious attacks is an important yet challenging security issue in mobile ad hoc networks. In this paper we describe SCAN, a unified networklayer...
Hao Yang, J. Shu, Xiaoqiao Meng, Songwu Lu
DASFAA
2010
IEEE
141views Database» more  DASFAA 2010»
14 years 2 months ago
Optimizing Write Performance for Read Optimized Databases
Compression in column-oriented databases has been proven to offer both performance enhancements and reductions in storage consumption. This is especially true for read access as c...
Jens Krüger, Martin Grund, Christian Tinnefel...
SPAA
1996
ACM
13 years 11 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick