9683 search results - page 126 / 1937 » Query performance prediction |
DASFAA
2007
IEEE
14 years 4 months ago
2007
IEEE
With the increasing in demand on location-based aware services and RFIDs, efficient processing of continuous queries over moving object streams becomes important. In this paper, w...
ICDE
1998
IEEE
14 years 11 months ago
1998
IEEE
?Past R-tree studies have focused on the number of nodes visited as a metric of query performance. Since database systems usually include a buffering mechanism, we propose that the...
EDBT
2000
ACM
14 years 1 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
IDEAS
1999
IEEE
14 years 1 months ago
1999
IEEE
Data-warehousing applications cope with enormous data sets in the range of Gigabytes and Terabytes. Queries usually either select a very small set of this data or perform aggregat...
PARLE
1993
14 years 1 months ago
1993
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...