Result: SC-tree : An efficient structure for high-dimensional data indexing

Title:
SC-tree : An efficient structure for high-dimensional data indexing
Authors:
BEN WANG, GAN, John Q
Source:
Flexible and efficient information handling (23rd British National Conference on Databases, BNCOD 23, Belfast, Northern Ireland, UK, July 18-20, 2006)0BNCOD 23. :164-176
Publisher Information:
Berlin; New York: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 19 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Systèmes d'information. Bases de données, Information systems. Data bases, Base donnée multidimensionnelle, Multidimensional database, Base dato multidimensional, Base donnée, Database, Base dato, Dimensionnalité, Dimensionality, Dimensionalidad, Espace métrique, Metric space, Espacio métrico, Indexation, Indexing, Indización, Interrogation base donnée, Database query, Interrogación base datos, Multimédia, Multimedia, Méthode arborescente, Tree structured method, Método arborescente, Métrique, Metric, Métrico, Raisonnement basé sur cas, Case based reasoning, Razonamiento fundado sobre caso, Recherche par contenu, Content-based retrieval, Structure arborescente, Tree structure, Estructura arborescente, Structure donnée, Data structure, Estructura datos
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, University of Essex, Colchester C04 3SQ, United Kingdom
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19131348
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19131348
Database:
PASCAL Archive

Further Information

In content-based information retrieval (CBIR) of multimedia data, high-dimensional data indexing and query is a challenging problem due to the inherent high dimensionality of multimedia data. As a data-based method, metric distance based high-dimensional data indexing has recently emerged as an attractive method because of its ability of making use of the properties of metric spaces to improve the efficiency and effectiveness of data indexing. M-tree is one of the most efficient indexing structures for searching data from metric space, and it is a paged, balanced, and dynamic tree that organizes data objects in an arbitrary metric space with fixed sizes for all its nodes. However, inherent disadvantages are veiled in the M-tree and its variants, which prevent them from further improvement of their indexing and query efficiency. To avoid these disadvantages, this paper proposes a sorted clue tree (SC-tree), which essentially modifies the nodes, entries, indexing algorithm, and query algorithm of the M-tree but reserves its advantages. Experimental results and complexity analyses have shown that the SC-tree is much more efficient than the M-tree with respect to the query time and indexing time without sacrificing its query accuracy.