Sciweavers

8953 search results - page 31 / 1791
» Parallel Query Processing
Sort
View
PVLDB
2010
190views more  PVLDB 2010»
13 years 2 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
DEBS
2007
ACM
13 years 11 months ago
Temporal order optimizations of incremental joins for composite event detection
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
François Bry, Michael Eckert
ICDE
2010
IEEE
231views Database» more  ICDE 2010»
14 years 2 months ago
Estimating the progress of MapReduce pipelines
Abstract— In parallel query-processing environments, accurate, time-oriented progress indicators could provide much utility given that inter- and intra-query execution times can ...
Kristi Morton, Abram Friesen, Magdalena Balazinska...
DCOSS
2005
Springer
14 years 1 months ago
Multi-query Optimization for Sensor Networks
The widespread dissemination of small-scale sensor nodes has sparked interest in a powerful new database abstraction for sensor networks: Clients “program” the sensors through ...
Niki Trigoni, Yong Yao, Alan J. Demers, Johannes G...
FOCS
1998
IEEE
13 years 12 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello