NDLI: A Node Split Algorithm Reducing Overlapped Index Spaces in M-tree Index

Content Provider	IEEE Xplore Digital Library
Author	Sang-Hyuk Lim Kyong-I Ku Kichang Kim Yoo-Sung Kim
Copyright Year	2006
Description	Author affiliation: Konan Technology Inc., Korea (Sang-Hyuk Lim)
Abstract	Even though the ideal split policy for M-tree should determine which two routing objects are promoted so that the two partitioned regions would have minimum volume and minimum overlapped space, the previously proposed split algorithms must fail to achieve the goal since they select the actual entries from overflow entries as the routing objects to be promoted. Hence, in this paper, we propose an optimal node split algorithm for M-tree which uses the virtual center points of two partitioned regions as the routing objects and which results in tighter volume and finally reduce the overlap index spaces between nodes. Also, we show that the proposed algorithm outperforms the previous ones for similarity-based query processing with respect to the average response time, although there is a slight increase in insertion time. We also discuss the implementation of a prototype of contentbased music retrieval system in which the proposed scheme is used for multidimensional indexing.
Starting Page	15
Ending Page	15
File Size	477015
Page Count	1
File Format	PDF
ISBN	0769525717
DOI	10.1109/ICDEW.2006.14
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-04-03
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Multidimensional systems Content based retrieval Query processing Space technology Euclidean distance Multimedia databases Routing Partitioning algorithms Music information retrieval Indexing
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Tunable, Efficient, Specialized Multidimensional Range Query Algorithm

Parallelizing multidimensional index structures

Multidimensional humming transcription using a statistical approach for query by humming systems

On the region proximity in metric spaces

On reinsertions in M-tree

On Reinsertions in M-tree

Multidimensional humming transcription using a statistical approach for query by humming systems

Effective dimensionality reduction in multimedia applications

HG-tree: an index structure for multimedia databases

A Node Split Algorithm Reducing Overlapped Index Spaces in M-tree Index

Similar Documents

A Tunable, Efficient, Specialized Multidimensional Range Query Algorithm

Parallelizing multidimensional index structures

Multidimensional humming transcription using a statistical approach for query by humming systems

On the region proximity in metric spaces

On reinsertions in M-tree

On Reinsertions in M-tree

Multidimensional humming transcription using a statistical approach for query by humming systems

Effective dimensionality reduction in multimedia applications

HG-tree: an index structure for multimedia databases

A Node Split Algorithm Reducing Overlapped Index Spaces in M-tree Index