735 search results - page 25 / 147 » Query Optimization In Compressed Database Systems |
IDEAS
2007
IEEE
14 years 2 months ago
2007
IEEE
Historically, bitmap indexing has provided an important database capability to accelerate queries. However, only a few database systems have implemented these indexes because of t...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...
MOBIDE
2005
ACM
14 years 1 months ago
2005
ACM
This work addresses the problem of efficient maintenance of the (correct) answers to the continuous spatio-temporal range queries in Moving Objects Databases (MOD), which represen...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
PVLDB
2008
13 years 7 months ago
2008
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...