3652 search results - page 290 / 731 » A study of query length |
272
click to vote
PODS
2009
ACM
16 years 7 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
282
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
195
click to vote
COMPSAC
2008
IEEE
16 years 1 months ago
2008
IEEE
2. Previous studies on end-user computing The development of Web applications should be supported by business professionals themselves since Web applications must be modified frequ...
210
click to vote
PARLE
1993
15 years 11 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...
222
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
Abstract— Previous work has introduced probability distributions as first-class components in uncertain stream database systems. A lacking element is the fact of how accurate the...