Efficient k-nearest neighbor searches for parallel multidimensional index structures

Authors:
Kyoung Soo Bok;Seok Il Song;Jae Soo Yoo
Affiliations:
Department of Computer Science, Korea Advanced Institute of Science and Technology, Korea;Department of Computer Engineering, Chungju National University, Korea;Department of Computer and Communication Engineering, Chungbuk National University, Korea
Venue:
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Year:
2006

Citing 10
Cited 2

Parallel R-trees

SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
The PML-tree: an efficient parallel spatial index structure for spatial databases

CSC '96 Proceedings of the 1996 ACM 24th annual conference on Computer science
Multidimensional access methods

ACM Computing Surveys (CSUR)
Declustering Spatial Databases on a Multi-Computer Architecture

EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Parallel R-Tree Search Algorithm on DSVM

DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
M+-tree: a new dynamical multidimensional index for metric spaces

ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Master-Client R-Trees: A New Parallel R-Tree Architecture

SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management
Global parallel index for multi-processors database systems

Information Sciences: an International Journal
The PN-tree: a parallel and distributed multidimensional index

Distributed and Parallel Databases
A new indexing method for high dimensional dataset

DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications

Efficient Processing of Nearest Neighbor Queries in Parallel Multimedia Databases

DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
A data allocation method for efficient content-based retrieval in parallel multimedia databases

ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a parallel multidimensional index structure and range search and k-NN search methods for the index structures. The proposed index structure is nP(processor)-n×mD(disk) architecture which is the hybrid type of nP-nD and 1P-nD. Its node structure increases fan-out and reduces the height of an index tree. Also, the proposed range search methods are designed to maximize I/O parallelism of the index structure. Finally, we present a new method to transform k-NN queries to range search queries. Through various experiments, it is shown that the proposed method outperforms other parallel index structures.