-
as seen on SQL Blogcasts
- Search for 'SQL Blogcasts'
I will not go into a full discussion as to why you would want to convert HEAP into a Clustered table .. as there are plenty of resources out there that describe those elements and the relevant Pro's & Con's However you may just want to understand which database tables are of the HEAP variety…
>>> More
-
as seen on SQL Blog
- Search for 'SQL Blog'
If you’re not already a regular reader of Brad Schulz’s blog, you’re missing out on some great material. In his latest entry, he is tasked with optimizing a query run against tables that have no indexes at all. The problem is, predictably, that performance is not very good. The catch…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
As an exercise in Haskell, I'm trying to implement heapsort. The heap is usually implemented as an array in imperative languages, but this would be hugely inefficient in purely functional languages. So I've looked at binary heaps, but everything I found so far describes them from an imperative viewpoint…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
i have following pseudo code :
void siftup(int n)
pre condition n>0 && heap(1,n-1)
post heap(1,n)
i=n;
loop
/* invariant: heap(1,n) except perhaps
between i and its parent
if (i==1)
break;
p=i/2;
if (x[p]<=x[i])
break;
swap(p,i);
i=p;
please help me to write…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I want to be able to browse through heaps of images in the browser, fast. THe easy way (just load 2000 images and scroll) slows down the scrolling a lot, assumedly because there's too much images to be kept in memory.
I'd love to hear thoughts on strategies to be able to quickly scroll through 10000s…
>>> More