Earlier this week I experimented, once again, with using temporary hash tables to speed up intermediate processing. Temp tables can be very useful for creating “optimizer fences” that serve to simplify queries to the point where the optimizer will consistently (more or less) come up with a good plan if not a great one. Temp heaps seem well suited to this purpose, when used simply as low-overhead FIFO structures.
Update: I have much more to report about the project, but I have to make choices between writing about it and developing, and right now the development work is taking precedence. Look for a new post soon. I hope. If this work sounds like something you might want to contribute to financially in a small way, please let me know that you are interested.
I am developing a proof-of-concept for a genealogical database intended to support querying for various proximities including Generational relationships (traditional family tree) Proximity of events in time and space (geolocation) Genetic proximity (DNA matching via SNPs)Continue reading →
119 SQL Code Smells.Continue reading →
Locating business logic in applications – Simple-Talk. One of the most pernicious and pervasive myths in business-application development is that all business logic must be kept from the relational database and contained in a separate ‘business layer’.Continue reading →
The Curse of the Excluded Middle – ACM Queue.Continue reading →
What is DevOps really?.Continue reading →
Branching and Merging: Ten Pretty-Good Practices.Continue reading →
…for the sake of the argument, can we agree that stress and insanity are bad things? Awesome. Welcome to programming. via Programming Sucks.Continue reading →