Dynamic binding operations on relational database engines (SQLite) are several orders of magnitude slower than dedicated runtime implementations.

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

• Simple experiments with an in-memory Sqlite database suggest dynamic binding operations take several orders of magnitude longer than a dedicated language runtime support library.finding0.898
  Empirical observation that a relational engine is too slow for associative lookup, motivating specialized implementation.
• Late binding increases the significance of temporal forces on the system's functionality and its corresponding ability to change its functionality at runtime.claim0.738
  Claim linking late-binding to enhanced runtime adaptability.
• For DNA database search, it is usually more efficient to run many sequential searches in parallel than to parallelize individual searches.claim0.716
  Observation from practical experience with DNA sequence comparison.
• whether the mechanisms described in this paper can be efficiently supported by a relational database enginequestion0.714
  Question raised about the feasibility of using a relational backend, answered by the Sqlite experiment.
• Dynamic programming languages seem to spend much of their time looking up behaviour associatively.claim0.712
  An observation motivating the associative model as a unifying primitive.
• Single-process, non-interruptible task switching at command boundaries is sufficient for responsive single-user systems; avoids complexity of multiprocess synchronization.hypothesis0.699
  Design hypothesis that coarse-grained task switching (at commands only) eliminates need for protection mechanisms while maintaining usability.
• whether many (maybe even all) useful organisations of information and behaviour in a dynamic language might be constructed from a single primitive operation: n-way associative lookupquestion0.698
  The central research question explored, by way of examples, throughout the paper.
• A fast implementation of this primitive, possibly in hardware, could be the basis of efficient and compact implementations of a diverse range of programming language semantics and data structures.claim0.697
  Claim that hardware-supported associative lookup would enable high-performance dynamic language runtimes.