Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re^5: Sorting "SuperSearch" results by votes? (implementation)

by tye (Sage)
on Jun 05, 2009 at 13:53 UTC ( #768801=note: print w/replies, xml ) Need Help??


in reply to Re^4: Sorting "SuperSearch" results by votes?
in thread Sorting "SuperSearch" results by votes?

but sorting by rep is much simpler to implement just by extending an SQL-Query

Um, if you sorted on rep using SQL with Super Search, you'd turn something specificly designed to prevent undue load into something performantly exceedingly awful. And adding an index on reputation would rather suck also, since reputation is the one thing about a node that changes an order of magnitude more often than anything else about the node.

- tye        

  • Comment on Re^5: Sorting "SuperSearch" results by votes? (implementation)

Replies are listed 'Best First'.
Re^6: Sorting "SuperSearch" results by votes? (implementation)
by LanX (Sage) on Jun 05, 2009 at 19:10 UTC
    OK, no simple SQL-Query, but surely you could cache the normal (max 100?) results of one search-run and sort them within perl???

    Anyway if it's too complicated to realize, never mind ...

    Cheers Rolf

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://768801]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (6)
As of 2021-10-21 11:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My first memorable Perl project was:







    Results (83 votes). Check out past polls.

    Notices?