65 search results - page 8 / 13 » Online B-tree Merging |
CIDR
2003
13 years 11 months ago
2003
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
FTTCS
2006
13 years 9 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
ICANN
2003
Springer
14 years 2 months ago
2003
Springer
The concept of semantic and context aware intelligent systems provides a vision for the Information Society where the emphasis lays on computing applications that can sense context...
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
Data-intensive, interactive applications are an important class of metacomputing (Grid) applications. They are characterized by large, time-varying data flows between data provid...
RT
1997
Springer
14 years 1 months ago
1997
Springer
Abstract: An object space algorithm for computing shadows in dynamic scenes illuminated by area light sources is presented. A mesh with the shadow boundaries as well as other disco...