Sciweavers

13 search results - page 1 / 3
» A Generic Approach to Bulk Loading Multidimensional Index St...
Sort
View
VLDB
1997
ACM
104views Database» more  VLDB 1997»
13 years 9 months ago
A Generic Approach to Bulk Loading Multidimensional Index Structures
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...
Jochen Van den Bercken, Bernhard Seeger, Peter Wid...
DAWAK
1999
Springer
13 years 9 months ago
Efficient Bulk Loading of Large High-Dimensional Indexes
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
Christian Böhm, Hans-Peter Kriegel
DASFAA
2008
IEEE
109views Database» more  DASFAA 2008»
13 years 11 months ago
Bulk-Loading the ND-Tree in Non-ordered Discrete Data Spaces
Applications demanding multidimensional index structures for performing efficient similarity queries often involve a large amount of data. The conventional tuple-loading approach t...
Hyun-Jeong Seok, Gang Qian, Qiang Zhu, Alexander R...
VLDB
2001
ACM
66views Database» more  VLDB 2001»
13 years 9 months ago
An Evaluation of Generic Bulk Loading Techniques
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...
Jochen Van den Bercken, Bernhard Seeger
DEXA
2008
Springer
117views Database» more  DEXA 2008»
13 years 6 months ago
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
Gang Qian, Hyun-Jeong Seok, Qiang Zhu, Sakti Prama...