indexes::arbology Namespace Reference

Data Structures
class	CompressedBitParallelTreeIndex
	Compressed bit parallel tree index. Stores a bit vector for each symbol of the alphabet. The bit vector of symbol a contains true on index i if symbol a is on i-th position in the indexed string. The class does not check whether the bit vectors actually represent valid index. The bit vectors are compressed with run length encoding packing runs of false values. Additionally the index contains a subtree jump table representing positions after a jump over a subtree. More...
class	FullAndLinearIndex
	Full and linear tree index. The index serves as a adaptor of string index so that searching for tree patterns is possible. The representation of the index stores a string index and a subtree jump table. The implementation since parametrized with the string index represents a family of indexes. More...
class	NonlinearCompressedBitParallelTreeIndex
	Compressed bit parallel nonlinear tree index. Stores a bit vector for each symbol of the alphabet. The bit vector of symbol a contains true on index i if symbol a is on i-th position in the indexed string. The class does not check whether the bit vectors actually represent valid index. The bit vectors are compressed with run length encoding packing runs of false values. Additionally the index contains a subtree jump table representing positions after a jump over a subtree. The index is supposed to be able to provide data to search for nonlinear tree patterns. Therefore it also contains representation of subtree repeats. More...
class	NonlinearFullAndLinearIndex
	Full and linear tree index. The index serves as a adaptor of string index so that searching for tree patterns is possible. The representation of the index stores a string index and a subtree jump table. The implementation since parametrized with the string index represents a family of indexes. The index is supposed to be able to provide data to search for nonlinear tree patterns. Therefore it also contains representation of subtree repeats. More...