712 search results - page 4 / 143 » Sorting and selection on dynamic data |
CIDR
2003
13 years 6 months ago
2003
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
GVD
2009
13 years 3 months ago
2009
Database management systems comprise various algorithms for efficiently retrieving and managing data. Typically, algorithm efficiency or performance is correlated with execution s...
ISCAS
1994
IEEE
13 years 9 months ago
1994
IEEE
This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and p...
VLDB
1999
ACM
13 years 9 months ago
1999
ACM
We present a pipelining, dynamically usercontrollable reorder operator, for use in dataintensive applications. Allowing the user to reorder the data delivery on the fly increases...
CGO
2005
IEEE
13 years 11 months ago
2005
IEEE
The growing complexity of modern processors has made the generation of highly efficient code increasingly difficult. Manual code generation is very time consuming, but it is oft...