Sciweavers

45 search results - page 2 / 9
» Efficient Bulk Loading of Large High-Dimensional Indexes
Sort
View
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
14 years 6 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
14 years 6 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
DASFAA
2008
IEEE
109views Database» more  DASFAA 2008»
13 years 12 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
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...
IDEAS
2000
IEEE
112views Database» more  IDEAS 2000»
13 years 10 months ago
Bulk Loading a Data Warehouse Built Upon a UB-Tree
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...
Robert Fenk, Akihiko Kawakami, Volker Markl, Rudol...