Sciweavers

2514 search results - page 329 / 503
» On the Computation of Approximations of Database Queries
Sort
View
ICCV
2007
IEEE
16 years 8 months ago
Interactive Search for Image Categories by Mental Matching
Traditional image retrieval methods require a "query image" to initiate a search for members of an image category. However, when the image database is unstructured, and ...
Marin Ferecatu, Donald Geman
IPPS
2002
IEEE
15 years 11 months ago
Improving Performance of Multiple Sequence Alignment Analysis in Multi-Client Environments
This paper is concerned with the efficient execution of multiplesequence alignmentmethodsin a multipleclientenvironment. Multiple sequence alignment (MSA) is a computationally ex...
Ümit V. Çatalyürek, Eric Stahlber...
ICDE
2005
IEEE
113views Database» more  ICDE 2005»
16 years 8 months ago
On the Optimal Ordering of Maps and Selections under Factorization
The query optimizer of a database system is confronted with two aspects when handling user-defined functions (UDFs) in query predicates: the vast differences in evaluation costs b...
Thomas Neumann, Sven Helmer, Guido Moerkotte
DAMON
2007
Springer
16 years 1 months ago
Vectorized data processing on the cell broadband engine
In this work, we research the suitability of the Cell Broadband Engine for database processing. We start by outlining the main architectural features of Cell and use microbenchmar...
Sándor Héman, Niels Nes, Marcin Zuko...
SSDBM
2000
IEEE
86views Database» more  SSDBM 2000»
15 years 11 months ago
Serving Datacube Tuples from Main Memory
Existing datacube precompuatation schemes materialize selected datacube tuples on disk, choosing the most beneficial cuboids (i.e., combinations of dimensions) to materialize giv...
Kenneth A. Ross, Kazi A. Zaman