Time complexity of page filling algorithms in Materialized Aggregate List (MAL) and MAL/TRIGG materialization cost
Control and Cybernetics, Tome 38 (2009) no. 1, pp. 153-172
Cet article a éte moissonné depuis la source The Polish Digital Mathematics Library
@article{CC_2009_38_1_a8,
author = {Gorawski, Marcin},
title = {Time complexity of page filling algorithms in {Materialized} {Aggregate} {List} {(MAL)} and {MAL/TRIGG} materialization cost},
journal = {Control and Cybernetics},
pages = {153--172},
year = {2009},
volume = {38},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CC_2009_38_1_a8/}
}
TY - JOUR AU - Gorawski, Marcin TI - Time complexity of page filling algorithms in Materialized Aggregate List (MAL) and MAL/TRIGG materialization cost JO - Control and Cybernetics PY - 2009 SP - 153 EP - 172 VL - 38 IS - 1 UR - http://geodesic.mathdoc.fr/item/CC_2009_38_1_a8/ LA - en ID - CC_2009_38_1_a8 ER -
Gorawski, Marcin. Time complexity of page filling algorithms in Materialized Aggregate List (MAL) and MAL/TRIGG materialization cost. Control and Cybernetics, Tome 38 (2009) no. 1, pp. 153-172. http://geodesic.mathdoc.fr/item/CC_2009_38_1_a8/