Sciweavers

806 search results - page 25 / 162
» An Optimal Dynamic Data Structure for Stabbing-Semigroup Que...
Sort
View
JCP
2007
118views more  JCP 2007»
13 years 7 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
Su Chen, Antonio Nucci
PLDI
2010
ACM
14 years 22 days ago
Supporting speculative parallelization in the presence of dynamic data structures
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...
Chen Tian, Min Feng, Rajiv Gupta
LCN
2006
IEEE
14 years 1 months ago
Cerco: Supporting Range Queries with a Hierarchically Structured Peer-to-Peer System
Structured Peer-to-Peer systems are designed for a highly scalable, self organizing, and efficient lookup for data. The key space of the so-called Distributed Hash Tables (DHTs) ...
Simon Rieche, Klaus Wehrle, Leo Petrak, Clemens Wr...
VLDB
1992
ACM
151views Database» more  VLDB 1992»
13 years 11 months ago
A Uniform Approach to Processing Temporal Queries
Research in temporal databases has mainly focused on defining temporal data models by extending existing models, and developing access structures for temporal data. Little has bee...
Umeshwar Dayal, Gene T. J. Wuu
DMSN
2006
ACM
14 years 1 months ago
Impact of multi-query optimization in sensor networks
In this paper, we study the problem of processing multiple queries in a wireless sensor network. We focus on multiquery optimization at the base station level to minimize the numb...
Shili Xiang, Hock-Beng Lim, Kian-Lee Tan