NDLI: On Reinsertions in M-tree

Content Provider	IEEE Xplore Digital Library
Author	Lokoc, J. Skopal, T.
Copyright Year	2008
Description	Author affiliation: Charles Univ. in Prague, Prague (Lokoc, J.)
Abstract	In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions. In case a leaf is about to split, some distant objects are removed from the leaf (reducing the covering radius), and then again inserted into the M-tree in a usual way. A regular leaf split is performed only after a series of unsuccessful reinsertion attempts. We expect the forced reinsertions will result in more compact M- tree hierarchies (i.e., more efficient query processing), while the index construction costs should be kept as low as possible. Considering both low construction costs and low querying costs, we examine several combinations of construction policies with reinsertions. The experiments show that forced reinsertions could significantly decrease the number of distance computations, thus speeding up indexing as well as querying.
Starting Page	121
Ending Page	128
File Size	553635
Page Count	8
File Format	PDF
ISBN	0769531016
DOI	10.1109/SISAP.2008.10
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-04-11
Publisher Place	UK
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Biometrics Costs forced reinsertions Query processing Multimedia databases Routing Data structures Information retrieval M-tree Application software Indexing Software engineering
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

On reinsertions in M-tree

Top-k query processing with multidimensional range search

Benchmarking access structures for the similarity retrieval of high-dimensional multimedia data

On hierarchical multimedia information retrieval

Reachability Indexes for Relational Keyword Search

A dynamic content-based indexing method for multimedia databases: hierarchical cellular tree

Spatial query processing for sketch-based query using heuristics

Effective Use of Space for Pivot-Based Metric Indexing Structures

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

On Reinsertions in M-tree

Similar Documents

On reinsertions in M-tree

Top-k query processing with multidimensional range search

Benchmarking access structures for the similarity retrieval of high-dimensional multimedia data

On hierarchical multimedia information retrieval

Reachability Indexes for Relational Keyword Search

A dynamic content-based indexing method for multimedia databases: hierarchical cellular tree

Spatial query processing for sketch-based query using heuristics

Effective Use of Space for Pivot-Based Metric Indexing Structures

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

On Reinsertions in M-tree