Sciweavers

2841 search results - page 480 / 569
» A Call to Order
Sort
View
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
16 years 6 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng
SIGMOD
2004
ACM
147views Database» more  SIGMOD 2004»
16 years 6 months ago
Robust Query Processing through Progressive Optimization
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
Volker Markl, Vijayshankar Raman, David E. Simmen,...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
16 years 6 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
SIGMOD
2002
ACM
93views Database» more  SIGMOD 2002»
16 years 6 months ago
Implementing database operations using SIMD instructions
Modern CPUs have instructions that allow basic operations to be performed on several data elements in parallel. These instructions are called SIMD instructions, since they apply a...
Jingren Zhou, Kenneth A. Ross
PODS
2008
ACM
155views Database» more  PODS 2008»
16 years 6 months ago
The recovery of a schema mapping: bringing exchanged data back
A schema mapping is a specification that describes how data from a source schema is to be mapped to a target schema. Once the data has been transferred from the source to the targ...
Marcelo Arenas, Jorge Pérez, Cristian River...