Skip to content
This repository has been archived by the owner on Jan 12, 2022. It is now read-only.

The Quest for Performance: smart Rete layouts #326

Closed
bergmanngabor opened this issue Oct 8, 2012 · 2 comments
Closed

The Quest for Performance: smart Rete layouts #326

bergmanngabor opened this issue Oct 8, 2012 · 2 comments
Milestone

Comments

@bergmanngabor
Copy link
Member

Implement various ideas for building a more clever Rete structure:

  • ASAP trimming of variables not used later
  • Clever node reuse
    • Find if a stub join also happens to join alternate stubs with the same underlying Rete node, and then consider the "free accidental" stub in further joins.
  • Suggested order of join preference:
    • trivial joins (stub a = stub b)
    • high selectivity filters
    • supressed by joincandidate if already checked on other side
    • apply first to narrower stubs
    • aggregator quasijoins, let-expressions (?)
    • true joins
    • except cartesians
    • TBD: ranking based on what constraints the join will enable
    • low-selectivity filters (injectivity)
    • cartesian joins
@ghost ghost assigned bergmanngabor Oct 8, 2012
@bergmanngabor
Copy link
Member Author

Added the task of clever node reuse after the discussions at the latest meeting. Potential source of good test case: the thesis about GPU vs. EIQ performance supervised by @abelhegedus.

@bergmanngabor
Copy link
Member Author

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant