Breadcrumb

 
 

Multiple query points parallel search algorithm (Comb Algorithm) for multimedia database systems

Title:

Multiple query points parallel search algorithm (Comb Algorithm) for multimedia database systems

Staicu, Laurian (2001) Multiple query points parallel search algorithm (Comb Algorithm) for multimedia database systems. Other thesis, Concordia University.

[img]
Preview
PDF
2788Kb

Abstract

In this project, we introduce and present a new search method for fast nearest-neighbor search in high-dimensional feature space, which is called Comb algorithm . Most similarity search techniques map the data objects into high-dimensional feature space. The similarity search corresponds to a nearest-neighbor search in the feature space. Fagin and Threshold algorithms are two known methods that perform for nearest-neighbor search with one query point. On the other hand, the method we present works on parallel systems that are identical. We provide an alternative solution with several query points searching in parallel identical systems in as many copies as query points are defined. The algorithm is a trade-off between space storage (multiple copies of the multidimensional system), computation resources, and query execution time.

Divisions:Concordia University > Faculty of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Other)
Authors:Staicu, Laurian
Pagination:59 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:Major reports (M.Comp.Sc.)
Program:Computer Science and Software Engineering
Date:2001
Thesis Supervisor(s):Grahne, Gosta
ID Code:1405
Deposited By:Concordia University Libraries
Deposited On:27 Aug 2009 13:19
Last Modified:08 Dec 2010 10:20
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Document Downloads

More statistics for this item...

Concordia University - Footer