Hi Otis, That's essentially the answer I was looking for: each shard (are we talking master + replicas?) has the plug-in custom query handler. I need to build it to find out.
What I mean is that there is a taxonomy, say one with a single root for sake of illustration, which grows all the classes, subclasses, and instances. If I have an object that is somewhere in that taxonomy, then it has a zigzag chain of parents up that tree (I've seen that called a "transitive closure". If class B is way up that tree from M, no telling how many queries it will take to find it. Hmmm... recursive ascent, I suppose. Many thanks Jack On Wed, Mar 27, 2013 at 6:52 PM, Otis Gospodnetic <otis.gospodne...@gmail.com> wrote: > Hi Jack, > > I don't fully understand the exact taxonomy structure and your needs, > but in terms of reducing the number of HTTP round trips, you can do it > by writing a custom SearchComponent that, upon getting the initial > request, does everything "locally", meaning that it talks to the > local/specified shard before returning to the caller. In SolrCloud > setup with N shards, each of these N shards could be queried in such a > way in parallel, running query/queries on their local shards. > > Otis > -- > Solr & ElasticSearch Support > http://sematext.com/ > > > > > > On Wed, Mar 27, 2013 at 3:11 PM, Jack Park <jackp...@topicquests.org> wrote: >> Hi Otis, >> >> I fully expect to grow to SolrCloud -- many shards. For now, it's >> solo. But, my thinking relates to cloud. I look for ways to reduce the >> number of HTTP round trips through SolrJ. Maybe you have some ideas? >> >> Thanks >> Jack >> >> On Wed, Mar 27, 2013 at 10:04 AM, Otis Gospodnetic >> <otis.gospodne...@gmail.com> wrote: >>> Hi Jack, >>> >>> Is this really about HTTP and Solr vs. SolrCloud or more whether >>> Solr(Cloud) is the right tool for the job and if so how to structure >>> the schema and queries to make such lookups efficient? >>> >>> Otis >>> -- >>> Solr & ElasticSearch Support >>> http://sematext.com/ >>> >>> >>> >>> >>> >>> On Wed, Mar 27, 2013 at 12:53 PM, Jack Park <jackp...@topicquests.org> >>> wrote: >>>> This is a question about "isA?" >>>> >>>> We want to know if M isA B isA?(M,B) >>>> >>>> For some M, one might be able to look into M to see its type or which >>>> class(es) for which it is a subClass. We're talking taxonomic queries >>>> now. >>>> But, for some M, one might need to ripple up the "transitive closure", >>>> looking at all the super classes, etc, recursively. >>>> >>>> It seems unreasonable to do that over HTTP; it seems more reasonable >>>> to grab a core and write a custom isA query handler. But, how do you >>>> do that in a SolrCloud? >>>> >>>> Really curious... >>>> >>>> Many thanks in advance for ideas. >>>> Jack
