3 search results - page 1 / 1 » Efficient Bulk Operations on Dynamic R-Trees |
ALGORITHMICA
2002
13 years 4 months ago
2002
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
PPOPP
2010
ACM
14 years 2 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
FAST
2004
13 years 6 months ago
2004
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...