finding

active

finding: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

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.

Empirical observation that a relational engine is too slow for associative lookup, motivating specialized implementation.

Source paper

extracted_from

An association-based model of dynamic behaviour

(2011) · Piumarta, Ian

Neighborhood — ranked by edge-count

Claims (1)

claim

Independently of any possibility for hardware support, the association primitive is useful to understand the semantics and complexity of a particular application mechanism and to compare and contrast different mechanisms.
supports
Claim that the model has value as a semantic analysis tool even without performance gains.

Questions (1)

question

whether the mechanisms described in this paper can be efficiently supported by a relational database engine
answered_bygates
Question raised about the feasibility of using a relational backend, answered by the Sqlite experiment.

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

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

Dynamic binding operations on relational database engines (SQLite) are several orders of magnitude slower than dedicated runtime implementations.finding0.898
Dynamic programming languages seem to spend much of their time looking up behaviour associatively.claim0.751
An observation motivating the associative model as a unifying primitive.
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.745
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.742
Claim that hardware-supported associative lookup would enable high-performance dynamic language runtimes.
For DNA database search, it is usually more efficient to run many sequential searches in parallel than to parallelize individual searches.claim0.742
Observation from practical experience with DNA sequence comparison.
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.
We hope that programs using performatives will be easier to write, understand, debug, modify and (above all) verify.hypothesis0.735
Hope expressed about the benefits of Elephant-style programs.
When a problem has a simple solution, a useful system will give programmers access to the simple solution; Parlog forces complex solutions to simple problems.claim0.733
Critique that Parlog's abstraction level is too high and restrictive.