When working with LDTs above a certain size it would be cool to have an append()-operation that allows inserts to the end of list (ascending values). As far as I can see, AS currently traverses the whole B±Tree down even when an entry will be inserted to the very end. Should be easy to implement and save some Read OPs especially with very large lists. The operation should simply throw an exception if max key in tree is bigger than what you are trying to append.
Useful e.g. for time series data or where u don’t have any key (in that case, it would be cool for it to automatically assign an auto-incremented key, if possible. For now we have used 64-bit timestamps not necessarily related to the data to get around the “unique key’s only”-constraint.