Active
Project:
Buddylist2
Version:
5.x-1.x-dev
Component:
Buddy API Shortest Path
Priority:
Normal
Category:
Feature request
Assigned:
Unassigned
Reporter:
Created:
20 Feb 2008 at 16:00 UTC
Updated:
21 May 2008 at 13:09 UTC
I noticed this query in Shortest_path maodule.
SELECT uid FROM users
So looks like you load all the users in memory and then use those to find the shortest path. On a site with thousands of users won't this be a performance issue and specially when you are adding it in a block.
Comments
Comment #1
nodestroy commentedyes, you are right. its just a dev version and works for "trying out".
when i find some time (nearby to fix bugs & port to d6) i will improve the algo.
if you have ideas, please post :)
regards
Comment #2
ajayg commentedHere are some resources (and possible ideas of implementation)
More Trees & Hierarchies in SQL
http://www.sqlteam.com/article/more-trees-hierarchies-in-sql
Specially look at the lineage concept at the end. These ideas depend on data manipulation at the time of storage because if you don't do at storage, compleletely doing a lookup is not scalable for larger data sets.
also this may be reused
http://drupal.org/node/128731
Comment #3
nodestroy commentedComment #4
yngens commentedsubscribe