I'm reading a paper and in a part of this paper there is a note about intersecting sets using address bus. This is the exact quote from the paper:
Fast retrieval methods often rely on intersecting sets of documents that contain a particular word or feature. Semantic hashing is no exception. Each of the binary values in the code assigned to a document represents a set containing about half the entire document collection. Intersecting such sets would be slow if they were represented by explicit lists, but all computers come with a special piece of hardware – the address bus – that can intersect sets in a single machine instruction. Semantic hashing is simply a way of mapping the set intersections required for document retrieval directly onto the available hardware.
I have some basic knowledge about cpu architecture. All I need is an abstract explanation to understand how this operation is done.
P.S. The paper is about the sets, but my question is general (any kind of data).