Back to results
US 4,794,528 AGranted
Pattern matching method for tree structured data
AssigneeHitachi, Ltd.
InventorsTadashi Hirose, Kazuo Nakao, Kousuke Sakoda, Youichi Takeuchi
Life of this patent
Estimating the term…
Abstract
In order to highly speed up the pattern matching of tree structured data in a logic programming language, the priority order is set when the data owned by the individual nodes of a tree structure are to be transversely sought, and the tree structured data are expressed in a vector type, in which they are arranged in that priority order, so that they are compared consecutively from the head for each element of the vector.
Claims5
A pattern matching method of tree structured data, comprising the steps of:
- converting n-ary tree structured data into a vector expression by arranging, in order of priority of transverse search in a tree structure, cells corresponding to memory elements of a constant length, which are constructed of a positional field for storing positional information on a whole tree structure occupied by each composing said tree structured data and a value field for storing a value of each of said nodes to be processed in a computer system;
- and comparing said cells, which are converted into said vector expression, consecutively from a beginning position.
Dependencies are inferred from the claim text.