NDLI: Parallel Dynamic Batch Loading in the M-tree

Please wait, while we are loading the content...

Cover Art

Title Page i

Title Page iii

Foreword

Preface

External Reviewers

Analyzing Metric Space Indexes: What For?

Combinatorial Framework for Similarity Search

Structural Entropic Difference: A Bounded Distance Metric for Unordered Trees

Curse of Dimensionality in Pivot Based Indexes

CoPhIR Image Collection under the Microscope

EGNAT: A Fully Dynamic Metric Access Method for Secondary Memory

Metric Index: An Efficient and Scalable Solution for Similarity Search

Optimal Pivots to Minimize the Index Size for Metric Access Methods

Dynamic Spatial Approximation Trees for Massive Data

Approximate Direct and Reverse Nearest Neighbor Queries, and the k-nearest Neighbor Graph

Principles of Information Filtering in Metric Spaces

Speeding Up Permutation Based Indexing with Indexing

Parallel Dynamic Batch Loading in the M-tree

Dynamic P2P Indexing and Search Based on Compact Clustering

Query Routing Mechanisms in Self-Organizing Search Systems

OBSearch: A High Performance Similarity Search Engine for Java

MiPai: Using the PP-Index to Build an Efficient and Scalable Similarity Search System

Img(Rummager): An Interactive Content Based Image Retrieval System

img(Anaktisi): A Web Content Based Image Retrieval System

Text-Based and Content-Based Image Retrieval on Flickr: DEMO

MUFIN: A Multi-feature Indexing Network

Using Tuneable Fuzzy Similarity in Non-metric Search

On the Effectiveness of Distances Measuring Protein Structure Similarity

Author Index

Publisher's Information

Parallel Dynamic Batch Loading in the M-tree

Content Provider	ACM Digital Library
Author	Lokoc, Jakub
Abstract	Although metric access methods (MAMs) proved their capabilities when performing efficient similarity search, their further performance improvement is needed due to extreme growth of data volumes. Since multi core processors become widely available, it is justified to exploit parallelism. However, taking into account the Gustafson’s law, it is necessary to find tasks suitable for parallelization. Such a task could be M-tree construction. Unfortunately, parallelism during an object insertion in hierarchical index structures is limited by a node capacity. It is much less restrictive to run several independent insertions in parallel. However, synchronization problems occur whenever a node is about to split. In this paper we present our new technique of M-tree construction. The technique postpones splitting of overfull nodes and thus allows simple parallelization of M-tree construction. We also utilize an adaptation of recently introduced re-inserting technique in the M-tree. Our experiments confirm the new technique guarantees significant speed up of M-tree construction and also improves the quality of the index.
Starting Page	117
Ending Page	123
Page Count	7
File Format	PDF
ISBN	9780769537658
DOI	10.1109/SISAP.2009.27
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2009-08-29
Access Restriction	Subscribed
Subject Keyword	M-tree construction parallelism
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

Parallel Dynamic Batch Loading in the M-tree

Parallel dynamic batch loading in the m-tree.

A Parallel Bulk Loading Algorithm for M-tree on Multi-core CPUs

GPU-based Parallel R-tree Construction and Querying

Parallel Batch B+-tree Insertion on Multi-core Architectures

Parallelism in dynamic well-spaced point sets

Parallel M-tree Based on Declustering Metric Objects using K-medoids Clustering

Exploiting Parallelism in Decision Tree Induction. In Parallel and Distributed computing for Machine Learning (2003)

Parallel SAH k-D Tree Construction for Fast Dynamic Scene Ray Tracing

Parallel Dynamic Batch Loading in the M-tree

Similar Documents

Parallel Dynamic Batch Loading in the M-tree

Parallel dynamic batch loading in the m-tree.

A Parallel Bulk Loading Algorithm for M-tree on Multi-core CPUs

GPU-based Parallel R-tree Construction and Querying

Parallel Batch B+-tree Insertion on Multi-core Architectures

Parallelism in dynamic well-spaced point sets

Parallel M-tree Based on Declustering Metric Objects using K-medoids Clustering

Exploiting Parallelism in Decision Tree Induction. In Parallel and Distributed computing for Machine Learning (2003)

Parallel SAH k-D Tree Construction for Fast Dynamic Scene Ray Tracing

Parallel Dynamic Batch Loading in the M-tree