Main Page
About FCIT
History
Strategy
Administration>
Current Administration
Prevouis Administration
Organization Strucutre
Industrial Advisory Board
PhotoAlbum
Lab Guides
Departments
Computer Science
Information Technology
Information Systems
Academics
Bachelor Programs
Graduate Programs
Executive Programs
Academic Calendar
Admission
Bachelor Degree & Transferring
Admission from the Foundation Year
Transferring to the Faculty
Graduate Studies
Graduate Programs
Executive Programs
Scientific Research
Groups and Units
Research Groups
Research Interests
Distinguished Scientists Program
Faculty Journal
Faculty and Staff
Faculty
CS Department
IT Department
IS Department
Staff
Accreditation Integration & Management System (AIM
Development and Quality Unit
Work at FCIT
Capabilities Under the Spotlight
Code of Ethics
Students
Bachelor
ِAcademic Services
Preparatory Year Courses
Students' Guide
Academic Advising
Laboratories and Facilities
Student rights and duties
Graduate
Polices and Regulations
Students' Guide
Student's Handbook
New Student Orientation
Templates of proposals and theses for masters and
Courses
CS Program
IT Program
IS Program
Alumni Registration
Students Activities
Entrepreneurship Club
Cybersecurity Club
Data Science Club
Programming Club
Community
Industrial partnerships
Cisco Academy
Microsoft Academy
Oracle Academy
Files
Researches
Contact Us
عربي
English
About
Admission
Academic
Research and Innovations
University Life
E-Services
Search
Faculty of Computing and Information Technology
Document Details
Document Type
:
Article In Conference
Document Title
:
NOHIS-Tree: High-Dimensional Index Structure for Similarity Search
NOHIS= شجرة بُنية الفهرسة الهرمية غير المتداخلة: بُنية الفهرسة ذات الأبعاد العالية والخاصة بالبحث عن المتشابهات
Subject
:
High dimensional indexing
Document Language
:
English
Abstract
:
In Content-Based Image Retrieval systems it is important to use an efficient indexing technique in order to perform and accelerate the search in huge databases. The used indexing technique should also support the high dimensions of image features. In this paper we present the hierarchical index NOHIS-tree (Non Overlapping Hierarchical Index Structure) when we scale up to very large databases. We also present a study of the influence of clustering on search time. The performance test results show that NOHIS-tree performs better than SR-tree. Tests also show that NOHIS-tree keeps its performances in high dimensional spaces. We include the performance test that try to determine the number of clusters in NOHIS-tree to have the best search time.
Conference Name
:
International Conference on Information and Knowledge Management (ICIKM 2011)
Publishing Year
:
1432 AH
2011 AD
Article Type
:
Article
Added Date
:
Wednesday, November 23, 2011
Researchers
Researcher Name (Arabic)
Researcher Name (English)
Researcher Type
Dr Grade
Email
منيرة طيلب
Taileb, Mounira
Researcher
Doctorate
mtaileb@kau.edu.sa
سامي تواتي
TOUATI, Sami
Researcher
Doctorate
stouati@ksu.edu.sa
Files
File Name
Type
Description
31298.docx
docx
Back To Researches Page