Sciweavers

6004 search results - page 199 / 1201
» Parallelizing query optimization
Sort
View
GECCO
2007
Springer
153views Optimization» more  GECCO 2007»
14 years 4 months ago
Parallel genetic algorithm: assessment of performance in multidimensional scaling
Visualization of multidimensional data by means of Multidimensional Scaling (MDS) is a popular technique of exploratory data analysis widely usable, e.g. in analysis of bio-medica...
Antanas Zilinskas, Julius Zilinskas
ICALP
1994
Springer
14 years 2 months ago
Simple Fast Parallel Hashing
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
Joseph Gil, Yossi Matias
ICEBE
2005
IEEE
96views Business» more  ICEBE 2005»
14 years 4 months ago
Adding Physical Optimization to Cost Models in Information Mediators
Optimization of execution plans in information mediators is a critical task, specially when sources are remote and semistructured, as in the case of transactional web sites. Lack ...
Justo Hidalgo, Alberto Pan, José Losada, Ma...
SIGMOD
1997
ACM
91views Database» more  SIGMOD 1997»
14 years 2 months ago
On Saying "Enough Already!" in SQL
In this paper, we study a simple SQL extension that enables query writers to explicitly limit the cardinality of a query result. We examine its impact on the query optimization an...
Michael J. Carey, Donald Kossmann
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 10 months ago
Biased Range Trees
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
Vida Dujmovic, John Howat, Pat Morin