Sciweavers

9414 search results - page 438 / 1883
» Adaptive Query Processing
Sort
View
178
Voted
DPD
2010
153views more  DPD 2010»
15 years 2 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
ICB
2009
Springer
184views Biometrics» more  ICB 2009»
15 years 11 months ago
Challenges and Research Directions for Adaptive Biometric Recognition Systems
Biometric authentication using mobile devices is becoming a convenient and important means to secure access to remote services such as telebanking and electronic transactions. Such...
Norman Poh, Rita Wong, Josef Kittler, Fabio Roli
FSS
2008
78views more  FSS 2008»
15 years 5 months ago
On the granularity of summative kernels
In this paper, we propose granularity as a new index to characterize the nonspecificity of a summative kernel. This index is intended to reflect the behavior of a kernel in the us...
Kevin Loquin, Olivier Strauss
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
16 years 5 months ago
B-tree indexes for high update rates
ct In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering usi...
Goetz Graefe
126
Voted
SSDBM
2008
IEEE
115views Database» more  SSDBM 2008»
15 years 11 months ago
Breaking the Curse of Cardinality on Bitmap Indexes
Bitmap indexes are known to be efficient for ad-hoc range queries that are common in data warehousing and scientific applications. However, they suffer from the curse of cardina...
Kesheng Wu, Kurt Stockinger, Arie Shoshani