We present a simulation of the behavior of these heuristics under a variety of conditions, varying graph structure and access pattern. We argue that history mechanisms which track user access patterns can be used to improve performance. We further show that graph structure and access pattern determine the factor of improvement which is possible. The performance enhancements we describe can be applied to minimize query response time in visual dataflow languages.
|Bending the Rules: Steps toward Semantically enriched Graphical Rewrite Rules||Creating Database Queries by Demonstration||Index of Talks||Proceedings - 11th Intl. Symposium on Visual Languages|