RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
The partitioned exponential file for database storage management
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
Large, spatial databases may be required to prosses both intense query and intense update loads. For example, a data warehouse which contains spatial data may be required to answer difficult, analytical queries at the same time as it accepts massive amounts of new data, and any downtime to merge new data into existing data organizations may be unacceptable. Traditional, incremental spatial access methods (like the popular R-tree and its variants) may be unacceptable for use in such an environment since they support relatively slow update rates, and may lead to a relatively poor global data organization resulting in slow query evaluation. In this paper, we present the details T2SM, which is an instantiation of the linear file template, for use with spatial data. in T2SM, data are organized as a set of ongoing, external memory sorts based on the STR algorithm. T2SM exhibits query performance similar to (and sometimes superior to) a bulk-loaded R-Tree, but at the same time is truly incremental and can maintain exceptional update rates.