52 search results - page 3 / 11 » Improved Deletions in Dynamic Spatial Approximation Trees |
SIAMCOMP
2000
13 years 5 months ago
2000
This paper describes an efficient scheme for the dynamic maintenance of the set of maxima of a 2-d set of points. Using the fact that the maxima can be stored in a staircase struct...
GIS
2005
ACM
14 years 7 months ago
2005
ACM
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
DOLAP
2003
ACM
13 years 11 months ago
2003
ACM
Data warehouse and Online Analytical Processing(OLAP) play a key role in business intelligent systems. With the increasing amount of spatial data stored in business database, how ...
BNCOD
2004
13 years 7 months ago
2004
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
SIGMOD
1999
ACM
13 years 10 months ago
1999
ACM
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...