Login / Signup
Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates.
Sajal K. Das
Maria Cristina Pinotti
Published in:
J. Parallel Distributed Comput. (2000)
Keyphrases
</>
conflict free
decision trees
random access
tree structure
functional dependencies
special case
leaf nodes
optimal path
level parallelism
artificial intelligence
tree mining
tree nodes
database schemes
shared memory
user defined
shortest path
dynamic programming
relational databases