NDLI: Variable-depth trie index optimization: theory and experimental results

Content Provider	ACM Digital Library
Author	Babu, A. J. G. Ramesh, R. Kincaid, J. Peter
Copyright Year	1989
Abstract	We develop an efficient approach to Trie index optimization. A $\textit{Trie}$ is a data structure used to index a file having a set of attributes as record identifiers. In the proposed methodology, a file is horizontally partitioned into subsets of records using a Trie index whose depth of indexing is allowed to vary. The retrieval of a record from the file proceeds by “stepping through” the index to identify a subset of records in the file in which a binary search is performed. This paper develops a taxonomy of optimization problems underlying variable-depth Trie index construction. All these problems are solvable in polynomial time, and their characteristics are studied. Exact algorithms and heuristics for their solution are presented. The algorithms are employed in CRES-an expert system for editing written narrative material, developed for the Department of the Navy. CRES uses several large-to-very-large dictionary files for which Trie indexes are constructed using these algorithms. Computational experience with CRES shows that search and retrieval using variable-depth Trie indexes can be as much as six times faster than pure binary search. The space requirements of the Tries are reasonable. The results show that the variable-depth Tries constructed according to the proposed algorithms are viable and efficient for indexing large-to-very-large files by attributes in practical applications.
Starting Page	41
Ending Page	74
Page Count	34
File Format	PDF
ISSN	03625915
e-ISSN	15574644
DOI	10.1145/62032.77249
Volume Number	14
Issue Number	1
Journal	ACM Transactions on Database Systems (TODS)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1989-03-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Information Systems

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

Heuristics for trie index minimization

Analysis of a heuristic for full trie minimization

The Complexity of Trie Index Construction

Trie-join: a trie-based method for efficient string similarity joins

Algorithms for trie compaction

New variable depth local search for multiple depot vehicle scheduling problems

Hashing and trie algorithms for partial match retrieval

Initial Results for Glacial Variable Analysis

Breadth or depth in introductory computer courses:The experimental results

Variable-depth trie index optimization: theory and experimental results

Similar Documents

Heuristics for trie index minimization

Analysis of a heuristic for full trie minimization

The Complexity of Trie Index Construction

Trie-join: a trie-based method for efficient string similarity joins

Algorithms for trie compaction

New variable depth local search for multiple depot vehicle scheduling problems

Hashing and trie algorithms for partial match retrieval

Initial Results for Glacial Variable Analysis

Breadth or depth in introductory computer courses:The experimental results

Variable-depth trie index optimization: theory and experimental results