I think there has been, and I think there will be a good design summit session for this.
http://icehousedesignsummit.sched.org/event/cde73dadfd67eaae5bf98b90ba7de07 3#.UnPwKiRQ3mw I think what u have suggested could be a way to do it, as all databases do is set intersections and unions in the end anyway ;) And set unions and intersections is nearly synonymous for filtering ;) Some of the filters though likely would fall into stored procedure land. On 11/1/13 11:10 AM, "Chris Friesen" <chris.frie...@windriver.com> wrote: >On 11/01/2013 11:42 AM, Jiang, Yunhong wrote: >> Shawn, yes, there is 56 VM access every second, and for each VM >> access, the scheduler will invoke filter for each host, that means, >> for each VM access, the filter function will be invoked 10k times. So >> 56 * 10k = 560k, yes, half of 1M, but still big number. > > >I'm fairly new to openstack so I may have missed earlier discussions, >but has anyone looked at building a scheduler filter that would use >database queries over sets of hosts rather rather than looping over each >host and doing the logic in python? Seems like that would be a lot more >efficient... > >Chris > > >_______________________________________________ >OpenStack-dev mailing list >OpenStack-dev@lists.openstack.org >http://lists.openstack.org/cgi-bin/mailman/listinfo/openstack-dev _______________________________________________ OpenStack-dev mailing list OpenStack-dev@lists.openstack.org http://lists.openstack.org/cgi-bin/mailman/listinfo/openstack-dev
