Abstract: Implementing a Bloom filter index as a hierarchical data structure. Bloom filters are received and their bit vectors are decomposed into successive bit sequences. For each bit sequence except the last one, memory for at least storing a pointer to a memory location on the next level is allocated on the level corresponding to the bit sequence. The pointer storage is labeled by the value of the next bit sequence. A pointer to the allocated memory is stored in the pointer storage on the previous level that was labeled by the binary value of the current bit sequence. For the last bit sequence, memory for storing Bloom filters is allocated on the last level. A pointer to the allocated memory is stored in the pointer storage on the second-to-last level that was labeled by the value of the last bit sequence. The Bloom filter is stored in the allocated memory.

Abstract: Identifying network devices having specified traits using a multi-level hierarchical data structure. Bloom filters representing traits of network devices are received and their bit vectors are decomposed into successive bytes. For each byte except the last one, memory for storing a pointer to memory on the next level is allocated on the level corresponding to the byte. The pointer storage is labeled by the value of the next byte. A pointer to the allocated memory is stored in the pointer storage on the previous level that was labeled by the value of the current byte. For the last byte, memory for storing references to network devices is allocated on the last level. A pointer to the allocated memory is stored in the pointer storage on the second-to-last level that was labeled by the value of the last byte. A reference to the network device is stored in the allocated memory.

Abstract: Identifying network devices having specified traits using a multi-level hierarchical data structure. Bloom filters representing traits of network devices are received and their bit vectors are decomposed into successive bytes. For each byte except the last one, memory for storing a pointer to memory on the next level is allocated on the level corresponding to the byte. The pointer storage is labeled by the value of the next byte. A pointer to the allocated memory is stored in the pointer storage on the previous level that was labeled by the value of the current byte. For the last byte, memory for storing references to network devices is allocated on the last level. A pointer to the allocated memory is stored in the pointer storage on the second-to-last level that was labeled by the value of the last byte. A reference to the network device is stored in the allocated memory.

Abstract: Identifying network devices having specified traits using a multi-level hierarchical data structure. Bloom filters representing traits of network devices are received and their bit vectors are decomposed into successive bytes. For each byte except the last one, memory for storing a pointer to memory on the next level is allocated on the level corresponding to the byte. The pointer storage is labeled by the value of the next byte. A pointer to the allocated memory is stored in the pointer storage on the previous level that was labeled by the value of the current byte. For the last byte, memory for storing references to network devices is allocated on the last level. A pointer to the allocated memory is stored in the pointer storage on the second-to-last level that was labeled by the value of the last byte. A reference to the network device is stored in the allocated memory.

Abstract: Implementing a Bloom filter index as a hierarchical data structure. Bloom filters are received and their bit vectors are decomposed into successive bit sequences. For each bit sequence except the last one, memory for at least storing a pointer to a memory location on the next level is allocated on the level corresponding to the bit sequence. The pointer storage is labeled by the value of the next bit sequence. A pointer to the allocated memory is stored in the pointer storage on the previous level that was labeled by the binary value of the current bit sequence. For the last bit sequence, memory for storing Bloom filters is allocated on the last level. A pointer to the allocated memory is stored in the pointer storage on the second-to-last level that was labeled by the value of the last bit sequence. The Bloom filter is stored in the allocated memory.

Abstract: A computer-implemented method, apparatus, and computer usable program code for cross-silo query and data retrieval. A request to access a data object in a trusted database is received, wherein the request includes an enterprise-wide unique identifier of a data object or one or more metadata attribute value pairs. If the request comprises one or more metadata attribute value pairs, one or more enterprise-wide unique identifiers associated with the metadata attribute value pairs are identified. Using the enterprise-wide unique identifiers, metadata about the data object stored in one or more enterprise-level data stores or the trusted database is retrieved. The metadata about the data object is queried to identify related data objects in disparate trusted databases in the enterprise system. The data object and the related data objects are provided to the application.

Abstract: A computer-implemented method, apparatus, and computer usable program code for cross-silo query and data retrieval. A request to access a data object in a trusted database is received, wherein the request includes an enterprise-wide unique identifier of a data object or one or more metadata attribute value pairs. If the request comprises one or more metadata attribute value pairs, one or more enterprise-wide unique identifiers associated with the metadata attribute value pairs are identified. Using the enterprise-wide unique identifiers, metadata about the data object stored in one or more enterprise-level data stores or the trusted database is retrieved. The metadata about the data object is queried to identify related data objects in disparate trusted databases in the enterprise system. The data object and the related data objects are provided to the application.