Multi-attribute lexicon generation hyperlinked embedded access structure

Authors:
Wen-Jann Yang;Ramalingam Sridhar;Paul Palumbo
Affiliations:
Center of Excellence for Document Analysis and Recognition, State University of New York at Buffalo, Buffalo, NY;Department of Electrical and Computer Engineering, State University of New York at Buffalo, Buffalo, NY;Center of Excellence for Document Analysis and Recognition, State University of New York at Buffalo, Buffalo, NY
Venue:
IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
Year:
1997

Citing 4
Cited 0

Data structure of Huffman codes and its application to efficient encoding and decoding

IEEE Transactions on Information Theory
An average-case analysis of MAT and inverted file

Theoretical Computer Science
Design of Database Structures

Design of Database Structures
Analysis of the Multiple-Attribute-Tree Data-Base Organization

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Providing lexicon for all possible postal addresses can support the decision making of interpreting handwritten addresses. The possibility of uncertainty can be reduced by choosing the highest confident record in the provided lexicon as the target postal address. For a large database with multi-attribute records, traditional access methods are not efficient enough to generate the lexicon. This paper proposes a hyperlinked embedded access structure (HEAS) which combines the features of inverted file structure and doubly-chained tree structure with unique data compression schemes. The raw United State Postal Service (USPS) database is organized according to the proposed access structure, and the organized database serves as a knowledge base for interpreting hand-written addresses. The organization cost, storage requirement, and query cost are analyzed and compared to conventional inverted file and doubly-chained tree structure.