Sciweavers

25 search results - page 1 / 5
» Bulk Loading the M-Tree to Enhance Query Performance
Sort
View
BNCOD
2004
184views Database» more  BNCOD 2004»
13 years 6 months ago
Bulk Loading the M-Tree to Enhance Query Performance
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...
Alan P. Sexton, Richard Swinbank
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
EDBT
1998
ACM
155views Database» more  EDBT 1998»
13 years 9 months ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
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...
GIS
1999
ACM
13 years 9 months ago
Improved Bulk-Loading Algorithms for Quadtrees
Spatial indexes, such as the PMR quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involv...
Gísli R. Hjaltason, Hanan Samet