4541 search results - page 1 / 909 » Cache-Oblivious Algorithms and Data Structures |
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
SODA
2010
ACM
13 years 3 months ago
2010
ACM
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...
CIDR
2007
13 years 7 months ago
2007
We propose a radical approach to relational query processing that aims at automatically and consistently achieving a good performance on any memory hierarchy. We believe this auto...
FOCS
2000
IEEE
13 years 10 months ago
2000
IEEE
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...