Suppose I have N Boolean arrays of size M. I simply want to intersect between pairs of these Boolean arrays efficiently (in optimized time). In my problem in hand, N is at least equal to 4500 and M is always equal to 6040. How can I make my intersection operator as fast as possible (an algorithmic idea)? Also any idea how can I manage such big arrays in memory?
My current implementation is in PHP, but its possible to migrate to Java in case of benefit.