Since you're working with data that is presumably in entities, your fields such as long or date at any given time aren't continuous, so the algorithm to group by features should work. 'Any given time' here is the time that you actually start to write your entities that are to be your HilbertIndex entities, for example. Pre-preparing finer grained search result "Indexes" in this way would be a service that you write. The HilbertIndex entities could contain either keys to the entities in that range or fields derived from them.
On Jul 4, 6:44 am, Max <thebb...@gmail.com> wrote: > Hi all, > > Would like to know if there are any of you guys ever tried to use space > filling curve like Hilbert curve to build index for multiple inequality > filters. > > Seems like for any continuous field like long or date, the number of ranges > (to be merged) to perform a accurate query is increasing rapidly, which > makes this approach not scale. > > Any thought? or shall I build / model like this > sample<http://code.google.com/appengine/articles/geosearch.html> app? > Query by partitions of all data and do an in-memory merge? -- 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.
