Hi,
Regrets, I was confused with bit-set. I l have Shawn's suggested
approach in system. I want to try with other ways and test performance.
How can I use join? I have 2 different solr indexes.
localhost:8080/solr_1/select?q=content:test&fl=id,name,type
localhost:8081/solr_1_1/select?q=text:t
Why do you think a bitset would help? Bitsets have
a bit set on for every document that matches
based on the _internal_ Lucene document ID, it
has nothing to do with the you have
defined. Nor does it have anything to do with the
foreign key relationship.
So either I don't understand the problem a
Hi Shawn,
This is time consuming operation. I already have this in my application .
I was pondering whether I can get bit set from both the solr indexes ,
bitset.and then retrieve only those matched? I don't know how do I
retrieve bitset. - wanted to try this and test the performance.
Regards
On 10/13/2013 8:34 AM, Michael Tyler wrote:
> Hello,
>
> I have 2 different solr indexes returning 2 different sets of
> SolrDocumentList. Doc Id is the foreign key relation.
>
> After obtaining them, I want to perform "AND" operation between them and
> then return results to user. Can you te
join query might be helpful: http://wiki.apache.org/solr/Join
join can across indexes but probably won't work in solr clound.
be aware that only "to" documents are retrievable, if you want content from
both documents, join query won't work. And in lucene join query doesn't
quite work on multiple
Hello,
I have 2 different solr indexes returning 2 different sets of
SolrDocumentList. Doc Id is the foreign key relation.
After obtaining them, I want to perform "AND" operation between them and
then return results to user. Can you tell me how do I get this? I am using
solr 4.3
SolrDocumen
How often is "frequently"? If it is 1000/second, you have a problem, but you'd
have a problem with most solutions.
Measure or estimate how many documents are affected, how often. Then set a
latency for how long you can wait before the change is visible.
With those, you can evaluate solutions. W
You could use the same approach for users as for groups - have a {!join}
filter query to select docs that a user is allowed to see, and another
to select groups they are allowed to see.
I've no idea how performant this would be for you, as it depends on how
many documents a single user is allowed
Users also have rights at the individual level (in addition to
inheritance of their group), your solution implies that I attach
potentially 1million identifier in the document? I do not know Solr
limitations, but I think I approach it?
Le 21/03/2013 10:47, Upayavira a écrit :
You could attach
You could attach the doc rights to the document itself, and then index
the group rights into a separate core, and then use pseudo-joins to
filter them. Effectively, you would say, "find me all the groups that my
user is allowed to see, then find me all documents that are in those
groups, based upon
@Jan Høydahl : do you mean "cutom filter" ?
@Walter Underwood : I also agree with you, I'd only use native functions
of Solr, but I do not know how to solve my problem ... My ACLs are
composed of thousands of groups (inheritance) that have deny / allow
user rights and who themselves have deny /
I agree. Your first step should not be trying to make Solr work they way your
think it should. Try really hard to use the existing features, they are there
because they solve a LOT of problems.
Updates are pretty fast, really.
wunder
On Mar 20, 2013, at 2:36 AM, Jan Høydahl wrote:
> Don't try
If you implement filtering on both user and group levels. So you record on the
document ACL fields which group(s) it belongs to, and when people search you
find what groups they are entitled to see and add that as a filter. So if the
rights for a group changes, then you don't need to reindex the
Actually my goal is to integrate Zend Framework ACL in Solr. My problem
mainly concerns the inheritance, if rights of a group of documents are
changed, I can not go through all the documents for the group and update
these.
Don't try to optimize something which is not a problem.
This is what "everyone" does - update documents when ACLs for those documents
change, even with multi-million documents. It works like a charm. Or do you
have a special usecase where permissions for an average document changes
several time
Hello and thank you for your answers.
I'll try to explain my problem a little better:
The goal is to manage ACLs via Solr without reindex the documents at
each change of permission. I have hundreds of thousands of documents,
users and groups and permissions (allow / denied) or each of these
gr
at problem you are
actually trying to solve.
-- Jack Krupansky
-Original Message-
From: Christopher ARZUR
Sent: Tuesday, March 19, 2013 10:43 AM
To: solr-user@lucene.apache.org
Subject: Bitwise operation
Hi,
Does solr (4.1.0) supports /bitwise/ AND or /bitwise/ OR operator so
t
Not to my knowledge. I guess the nearest might be regular expressions
but that would involve one character, rather than one bit per element,
so not nearly as efficient.
How many bits? Can you break them down into separate fields?
Upayavira
On Tue, Mar 19, 2013, at 02:30 PM, Christopher ARZUR wro
Christopher,
Would you mind if i ask you about a sample?
19.03.2013 19:31 пользователь "Christopher ARZUR" <
christopher.ar...@cognix-systems.com> написал:
> Hi,
>
> Does solr (4.1.0) supports /bitwise/ AND or /bitwise/ OR operator so that
> we can specify a field to be compared against an index
Hi,
Does solr (4.1.0) supports /bitwise/ AND or /bitwise/ OR operator so
that we can specify a field to be compared against an index using
/bitwise/ AND or OR ?
Thanks,
--
Christopher
Hi,
Does solr (4.1.0) supports /bitwise/ AND or /bitwise/ OR operator so
that we can specify a field to be compared against an index using
/bitwise/ AND or OR ?
Thanks,
Christopher
gt; Can we do something like this :
>>
>> q=status:((46&2)>0) ?
>>
>>
>> --
>> View this message in context:
>> http://www.nabble.com/Query-with-bitwise-operation-tp22956950p22956950.html
>> Sent from the Solr - User mailing list archive at Nabble.com.
>
>
--
--Noble Paul
ield in my queries
Ex :
status = 46 (in my solr document)
In want to know if the bit #1 (2¹) = 1 --> (46&2) > 0 ?
or if bit #2 and #3 (2² + 2³) = 1 (46&12) > 0 ?
Can we do something like this :
q=status:((46&2)>0) ?
--
View this message in context:
http://www.nabbl
ng like this :
q=status:((46&2)>0) ?
--
View this message in context:
http://www.nabble.com/Query-with-bitwise-operation-tp22956950p22956950.html
Sent from the Solr - User mailing list archive at Nabble.com.
24 matches
Mail list logo
