I've been reading a lot lately about signature trees, or S-Trees. For example, this paper. The literature speaks very highly of them, and evidence is provided for considerable performance gains over, for example, inverted files or B-Trees, for some applications.
Now, why is it that I don't see S-Trees used very much? Do you know of any prominent instances of such a data structure in a popular application? Are there DBMS implementations that offer signature-tree indexes?
Now, why is it that I don't see
S-Trees
used very much?
Including a new indexing or join method into a database is a very complex task.
MySQL
, for instance, doesn't yet impement MERGE JOIN
and HASH JOIN
that were invented by, like, ancient Romans or Archimedes or around that time.
And the paper you referenced is dated 2006
and this method isn't even mentioned in Wikipedia
.
This means that it's either yet unknown to developers or isn't worth using it in an RDBMS
(or both).
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With