question

active

question:whether-the-mechanisms-described-in-this-paper-can-be-efficiently-supported-by-a-relational-database-engine

whether the mechanisms described in this paper can be efficiently supported by a relational database engine

Question raised about the feasibility of using a relational backend, answered by the Sqlite experiment.

Source paper

extracted_from

An association-based model of dynamic behaviour

(2011) · Piumarta, Ian

Neighborhood — ranked by edge-count

Findings (1)

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.
answered_bygates
Empirical observation that a relational engine is too slow for associative lookup, motivating specialized implementation.

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.

Relational Database Enginesconcept0.797
Piumarta experiments with SQLite for implementing associative primitive; finds several orders of magnitude slowdown, suggesting dedicated hardware/runtime implementation preferable.
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.claim0.740
Claim that the model has value as a semantic analysis tool even without performance gains.
"We may never see hardware support for the primitive operators described here, but an efficient software implementation (capable of scaling to billions of entries) would make a great doctoral thesis."concept0.739
Acknowledges practical barriers to realizing the framework while identifying the central implementation challenge: efficient scaling in software.
Many apparently different object-oriented, functional, and relational mechanisms are closely related as variations within a general parameterizable n-way associative memory.claim0.736
What Mechanisms Enable Memories To Transfer Between Organismsquestion0.735
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.734
Claim that hardware-supported associative lookup would enable high-performance dynamic language runtimes.
What is the coordination mechanism that enables this cross-level integrated information processing?question0.732
Key mechanistic question answered by developmental bioelectricity.
What Mechanisms Allow Biology To Exhibit Robustness Andquestion0.731