56 search results - page 1 / 12 » On Bulk Loading TPR-Tree |
IDEAS
2000
IEEE
13 years 9 months ago
2000
IEEE
This paper considers the issue of bulk loading large data sets for the UB-Tree, a multidimensional index structure. Especially in dataware housing (DW), data mining and OLAP it is...
VLDB
2001
ACM
13 years 9 months ago
2001
ACM
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...
BNCOD
2004
13 years 6 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...
VLDB
1997
ACM
13 years 8 months ago
1997
ACM
Abstract: Recently there has been an increasing interest in supporting bulk operations on multidimensional index structures. Bulk loading refers to the process of creating an initi...
MDM
2004
Springer
13 years 10 months ago
2004
Springer
TPR-tree is a practical index structure for moving object databases. Due to the uniform distribution assumption, TPR-tree’s bulk loading algorithm (TPR) is relatively inefficie...