Sciweavers

1007 search results - page 21 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
GIS
2006
ACM
16 years 21 days ago
Representation of periodic moving objects in databases
In the real world, lots of objects with changing position can be found. Some of them repeat the same movement several times, called periodic movements. Examples include airplanes,...
Ralf Hartmut Güting, Thomas Behr, Victor Teix...
DCOSS
2005
Springer
15 years 5 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
CONCURRENCY
2006
148views more  CONCURRENCY 2006»
14 years 11 months ago
An adaptive parallel query processing middleware for the Grid
vices provide an important abstract layer on top of heterogeneous components (hardware and software) that take part into a grid environment. In this scenario, applications, like sc...
Vinícius F. V. da Silva, Márcio L. D...
DPD
2006
114views more  DPD 2006»
14 years 11 months ago
A novel approach to resource scheduling for parallel query processing on computational grids
Advances in network technologies and the emergence of Grid computing have both increased the need and provided the infrastructure for computation and data intensive applications to...
Anastasios Gounaris, Rizos Sakellariou, Norman W. ...
ADBIS
2004
Springer
133views Database» more  ADBIS 2004»
15 years 5 months ago
Evaluation of the Mine-Merge Method for Data Mining Query Processing
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...
Marek Wojciechowski, Maciej Zakrzewicz