But I can't figure out what index(any other mechanism) GAE uses for query with only one ancestor filter? I want to know what is efficient for one-many relationship: store a reference to an opposite object as a simple reference property(Key object) or store one in the primary key as the parent key?
On 23 Грд, 16:30, "ss.require" <[email protected]> wrote: > I've already found the answer by myself. The answer is > here:http://www.google.com/intl/uk-UA/events/io/2009/sessions/BuildingScal.... > Just few words. For queries with multiple equality filters GAE uses > merge-join. GAE scans single indexes for every equality filter in the > query and merge results. For more details you can see very helpful > video by the link above. > > On 19 Грд, 17:53, "ss.require" <[email protected]> wrote: > > > > > Documentation says: > > > App Engine provides automatic indexes for the following forms of > > queries: queries using only equality and ancestor filters > > > For implementation of this feature GAE uses single-property indexes or > > composite indexex or something else? If composite indexexes then how > > many indexes are used (for example: all possible permutations for > > properties)? -- 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/google-appengine-java?hl=en.
