:-) performance is data dependent.
Here is convoluted explanation of performance: Sx = set of entities where list = :x smallest_set = min(S1.size(), S2.size(), ...) It works best when the intersection(S1, S2, S3,...) is large compared to the smallest_set. The pathological case is intersection(S1, S2, S3, ...) = 0 and smallest_set = |all data| / 2 On Fri, Jul 15, 2011 at 12:26 PM, Matija <matija.jerko...@gmail.com> wrote: > OMG... finally... zigzag merge join... > > Any info on query performance > > SELECT * > FROM Model > WHERE > list = :1 AND > list = :2 AND > list = :3 > ORDER BY date DESC > > with index > - kind: Model > properties: > - name: list > - name: date > > or is it highly dependent on data distribution? > > Matija > > -- > You received this message because you are subscribed to the Google Groups > "google-appengine-python" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/google-appengine-python/-/w_WoWIWmEncJ. > To post to this group, send email to > google-appengine-pyt...@googlegroups.com. > To unsubscribe from this group, send email to > google-appengine-python+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/google-appengine-python?hl=en. > -- You received this message because you are subscribed to the Google Groups "Google App Engine for Java" group. To post to this group, send email to google-appengine-java@googlegroups.com. To unsubscribe from this group, send email to google-appengine-java+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/google-appengine-java?hl=en.
