Skip to main navigation Skip to search Skip to main content

Parallel high-dimensional index structure for content-based information retrieval

  • Jaewoo Chang*
  • , Ahreum Lee
  • *Corresponding author for this work

    Research output: Contribution to conferenceConference paperpeer-review

    Abstract

    To solve 'dimensional curse'problem, the cell-based filtering scheme has been proposed, but it shows a linear decrease in performance as the dimensionality is increased. In this paper, we propose a parallel high-dimensional index structure for content-based information retrieval so as to cope with the linear decrease in retrieval performance. In addition, we devise data insertion, range query and k-NN query processing algorithms which are suitable for a clusterbased parallel architecture. Finally, we show that our parallel index structure achieves good retrieval performance in proportion to the number of servers in the cluster-based architecture and it outperforms a parallel version of the VA-File when the dimensionality is over 10.

    Original languageEnglish
    Title of host publicationProceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008
    Pages101-106
    Number of pages6
    DOIs
    StatePublished - 2008
    Event2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008 - Sydney, NSW, Australia
    Duration: 2008.07.82008.07.11

    Publication series

    NameProceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008

    Conference

    Conference2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008
    Country/TerritoryAustralia
    CitySydney, NSW
    Period08.07.808.07.11

    Quacquarelli Symonds(QS) Subject Topics

    • Computer Science & Information Systems
    • Data Science

    Fingerprint

    Dive into the research topics of 'Parallel high-dimensional index structure for content-based information retrieval'. Together they form a unique fingerprint.

    Cite this