Sciweavers

6004 search results - page 235 / 1201
» Parallelizing query optimization
Sort
View
SSD
2001
Springer
94views Database» more  SSD 2001»
14 years 3 months ago
Selectivity Estimation of Complex Spatial Queries
Several studies have focused on the efficient processing of simple spatial query types such as selections and spatial joins. Little work, however, has been done towards the optimiz...
Nikos Mamoulis, Dimitris Papadias
AIPS
1998
14 years 3 days ago
Flexible and Scalable Query Planning in Distributed and Heterogeneous Environments
We present the application of the Planning by Rewriting PbR framework to query planning in distributed and heterogeneous environments. PbR is a new paradigm for e cient high-quali...
José Luis Ambite, Craig A. Knoblock
IPPS
2007
IEEE
14 years 5 months ago
Applying Ant Colony Optimization Metaheuristic to the DAG Layering Problem
— This paper1 presents the design and implementation of an Ant Colony Optimization based algorithm for solving the DAG Layering Problem. This algorithm produces compact layerings...
Radoslav Andreev, Patrick Healy, Nikola S. Nikolov
EUROPAR
2007
Springer
14 years 4 months ago
A Search Engine Accepting On-Line Updates
We describe and evaluate the performance of a parallel search engine that is able to cope efficiently with concurrent read/write operations. Read operations come in the usual form ...
Mauricio Marín, Carolina Bonacic, Veronica ...
IPPS
2000
IEEE
14 years 3 months ago
Optimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing
The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-andforward, is used. How its properties compare to meshes if distance-inse...
Petr Salinger, Pavel Tvrdík