11212 search results - page 257 / 2243 » Semi-persistent Data Structures |
178
click to vote
ACMMSP
2005
ACM
16 years 3 days ago
2005
ACM
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
162
click to vote
JEA
2008
15 years 6 months ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
231
click to vote
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
202
click to vote
PLDI
2012
ACM
13 years 9 months ago
2012
ACM
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...
139
click to vote
TLDI
2005
ACM
16 years 3 days ago
2005
ACM
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....