Sciweavers

213 search results - page 15 / 43
» Parallel Evaluation of Multi-Join Queries
Sort
View
FOCS
1998
IEEE
13 years 11 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
DMG
2005
Springer
14 years 1 months ago
Adapting to Changing Resource Performance in Grid Query Processing
The Grid provides facilities that support the coordinated use of diverse resources, and consequently, provides new opportunities for wide-area query processing. However, Grid resou...
Anastasios Gounaris, Jim Smith, Norman W. Paton, R...
IPPS
2007
IEEE
14 years 1 months ago
Implementing OLAP Query Fragment Aggregation and Recombination for the OLAP Enabled Grid
In this paper we propose a new query processing method for the OLAP Enabled Grid, which blends sophisticated cache extraction techniques and data grid scheduling to efficiently s...
Michael Lawrence, Frank K. H. A. Dehne, Andrew Rau...
IPPS
2002
IEEE
14 years 13 days ago
Scheduling Multiple Data Visualization Query Workloads on a Shared Memory Machine
Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimi...
Henrique Andrade, Tahsin M. Kurç, Alan Suss...
MIDDLEWARE
2004
Springer
14 years 26 days ago
A Content Model for Evaluating Peer-to-Peer Searching Techniques
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
Brian F. Cooper