11219 search results - page 99 / 2244 » Retroactive data structures |
121
Voted
DKE
1998
15 years 2 months ago
1998
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
99
Voted
SLIP
2009
ACM
15 years 9 months ago
2009
ACM
New technologies such as 3D integration are becoming a new force that is keeping Moore’s law in effect in today’s nano era. By adding a third dimension in current 2D circuits...
112
click to vote
ISCA
1993
IEEE
15 years 6 months ago
1993
IEEE
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be pr...
110
click to vote
FECS
2006
15 years 3 months ago
2006
This paper describes some of our efforts in infusing the critical thinking skill of comparing and contrasting into a course on data structures. Comparing and contrasting is the pr...
150
click to vote
ITA
2007
15 years 2 months ago
2007
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...