11213 search results - page 104 / 2243 » Low-contention data structures |
165
Voted
WDAS
2000
15 years 5 months ago
2000
Present databases, whether on centralized or parallel DBMSs, do not deal well with scalability. We present an architecture for Wintel multicomputers termed AMOS-SDDS, coupling a h...
102
click to vote
PKDD
1999
Springer
15 years 8 months ago
1999
Springer
This paper addresses the problem of learning from highly structured data. Speci cally, it describes a procedure, called decomposition, that allows a learner to access automatically...
183
Voted
SPIRE
2010
Springer
15 years 2 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...
155
Voted
PLDI
2012
ACM
13 years 6 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...
108
Voted
TLDI
2005
ACM
15 years 9 months 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....