A method of structuring and compressing labeled trees of arbitrary degree and shape for optimal succinctness, the method including a transform for compressing and indexing tree shaped data, using path sorting and grouping to linearize labeled tree shaped data into two coordinated arrays, one capturing the structure of the tree and the other capturing the labels of the tree. Additional navigational operations and basic searching may be performed on the transformed data.
METHOD OF STRUCTURING AND COMPRESSING LABELED TREES OF ARBITRARY DEGREE AND SHAPE
FERRAGINA, PAOLO;LUCCIO, FABRIZIO;MANZINI, Giovanni;
2007-01-01
Abstract
A method of structuring and compressing labeled trees of arbitrary degree and shape for optimal succinctness, the method including a transform for compressing and indexing tree shaped data, using path sorting and grouping to linearize labeled tree shaped data into two coordinated arrays, one capturing the structure of the tree and the other capturing the labels of the tree. Additional navigational operations and basic searching may be performed on the transformed data.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
