An Efficient Approach for Super and Nested Term Indexing and Retrieval

This paper describes a new approach, called Terminological Bucket Indexing (TBI), for efficient indexing and retrieval of both nested and super terms using a single method. We propose a hybrid data structure for facilitating faster indexing building. An evaluation of our approach with respect to widely used existing approaches on several publicly available dataset is provided. Compared to Trie based approaches, TBI provides comparable performance on nested term retrieval and far superior performance on super term retrieval. Compared to traditional hash table, TBI needs 80% less time for indexing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/24/2020

Learning Term Discrimination

Document indexing is a key component for efficient information retrieval...
research
03/25/2023

Toward DNN of LUTs: Learning Efficient Image Restoration with Multiple Look-Up Tables

The widespread usage of high-definition screens on edge devices stimulat...
research
07/07/2021

Partial 3D Object Retrieval using Local Binary QUICCI Descriptors and Dissimilarity Tree Indexing

A complete pipeline is presented for accurate and efficient partial 3D o...
research
12/07/2013

Region and Location Based Indexing and Retrieval of MR-T2 Brain Tumor Images

In this paper, region based and location based retrieval systems have be...
research
11/07/2011

New Method for 3D Shape Retrieval

The recent technological progress in acquisition, modeling and processin...
research
12/14/2014

Tools for Terminology Processing

Automatic terminology processing appeared 10 years ago when electronic c...
research
10/30/2019

Use of R-trees to improve reconstruction time in pixel trackers

Computing time is becoming a key issue for tracking algorithms both onli...

Please sign up or login with your details

Forgot password? Click here to reset