559 search results - page 51 / 112 » Algorithms and Data Structures for External Memory |
138
Voted
MSV
2004
15 years 3 months ago
2004
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
122
click to vote
DOLAP
2000
ACM
15 years 6 months ago
2000
ACM
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
142
click to vote
ICPP
1993
IEEE
15 years 6 months ago
1993
IEEE
Scalability of parallel architectures is an interesting area of current research. Shared memory parallel programming is attractive stemming from its relative ease in transitioning...
120
click to vote
PVLDB
2010
15 years 27 days ago
2010
The performance of external sorting using merge sort is highly dependent on the length of the runs generated. One of the most commonly used run generation strategies is Replacemen...
129
click to vote
ACSC
2003
IEEE
15 years 6 months ago
2003
IEEE
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...