Title: A data tree structure for a hierarchical structure processing
Abstract: In this electronic age, the manufacturing sector has been searching for a unique data structure scheme which can easily represent different data types relating to design, process and inventory management. In this paper, an efficient way of representing the hierarchically significant data, especially in manufacturing, is investigated. Unlike the contemporary tree structure representation using pointers, this approach adopts a unique arithmetic encoding scheme to represent individual paths. The encoded nodes will have the capability to regenerate the entire paths (of a tree) using simple arithmetic procedures. The most significantly benefits of this approach are increased data processing efficiency and ease of navigation of data paths in hierarchical data structures. The preliminary testing of this approach on a simulated factory data have indicated significant improvement on data representation and processing efficiency. This structure promises application in Computer Aided Design, Manufacturing Resources Planning, and Hypermedia Data Structure.
Publication Year: 1994
Publication Date: 1994-07-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 3
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot