Replies: 1 comment 1 reply
-
In souffle based on the access patterns we derive a minimal set of indexes
(b-trees with unique ordering). So the way you declare a relation does not
have any effect, but the accesses to a relation will be used to compute
b-tree orders. This generally has a price in terms of memory (due to
replication).
For more details see: http://www.vldb.org/pvldb/vol12/p141-subotic.pdf
Note: that the indexing and literal ordering problems cannot be fully
decoupled and the literal orders in a rule affect the indexing problem. We
have some work for offline literal orders that take into account indexing.
For more details see: https://psubotic.github.io/papers/lopstr2022.pdf
…On Mon, Nov 28, 2022 at 3:13 PM Yuri de Wit ***@***.***> wrote:
Does the order of relation fields affect indexing/performance like it does
in relation databases?
I am assuming yes, but since I am new to Souffle and to Datalog it seemed
worth asking.
—
Reply to this email directly, view it on GitHub
<#2362>, or unsubscribe
<https://github.com/notifications/unsubscribe-auth/AAC3OOLVXCNZPOVBM2DWTYTWKS42DANCNFSM6AAAAAASNMEFGM>
.
You are receiving this because you are subscribed to this thread.Message
ID: ***@***.***>
|
Beta Was this translation helpful? Give feedback.
1 reply
Answer selected by
ydewit
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Does the order of relation fields affect indexing/performance like it does in relation databases?
I am assuming yes, but since I am new to Souffle and to Datalog it seemed worth asking.
Beta Was this translation helpful? Give feedback.
All reactions