Time complexity of page filling algorithms in Materialized Aggregate List (MAL) and MAL/TRIGG materialization cost
Marcin Gorawski (2009)
Control and Cybernetics
Similarity:
Marcin Gorawski (2009)
Control and Cybernetics
Similarity:
Nuno Oliveira, Maria João Varanda Pereira, Pedro Rangel Henriques, Daniela da Cruz, Bastian Cramer (2010)
Computer Science and Information Systems
Similarity:
Székely, Laszlo A., Erdős, Péter L., Steel, M.A. (1992)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Jan Janoušek, Bořivoj Melichar, Martin Poliak (2012)
Kybernetika
Similarity:
A new kind of a deterministic pushdown automaton, called a Tree Compression Automaton, is presented. The tree compression automaton represents a complete compressed index of a set of trees for subtrees and accepts all subtrees of given trees. The algorithm for constructing our pushdown automaton is incremental. For a single tree with nodes, the automaton has at most states, its transition function cardinality is at most and there are pushdown store symbols. If hashing is used...
Jerzy Grzymala-Busse, Witold Grzymala-Busse, Zdzisław Hippe, Wojciech Rząsa (2010)
Control and Cybernetics
Similarity:
Jozef Kratica, Tijana Kostić, Dušan Tošić, Djordje Dugošija, Vladimir Filipović (2012)
Computer Science and Information Systems
Similarity:
Kuba, Markus (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: