Patents by Inventor Patrick J. McKenna
Patrick J. McKenna has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 10885008Abstract: Indexing objects in a datastore, where the objects are characterized by a set of object properties. For objects from a datastore: a Bloom filter for the object properties, based on a predetermined Bloom filter configuration, is created; the Hamming value of the Bloom filter is determined; a binary logarithm of the Bloom filter is calculated; and the Bloom filter, the Hamming value, the binary logarithm, and a representation of the object is stored in the datastore.Type: GrantFiled: September 11, 2018Date of Patent: January 5, 2021Assignee: International Business Machines CorporationInventors: Patrick J. McKenna, David P. O'Connor, Claude N. Warren, Jr.
-
Patent number: 10282438Abstract: Identifying objects in a datastore with specified object properties, where each object is characterized by a Bloom filter, a Hamming value of the Bloom filter, and a binary logarithm of the Bloom filter. A set of object properties is received. A search Bloom filter is created from the object properties. A Hamming value of the search Bloom filter is determined. A binary logarithm of the search Bloom filter is calculated. Objects in the datastore which have respective Hamming values greater than or equal to the Hamming value of the search Bloom filter and respective binary logarithms that are greater than or equal to the binary logarithm of the search Bloom filter are identified.Type: GrantFiled: February 12, 2016Date of Patent: May 7, 2019Assignee: International Business Machines CorporationInventors: Patrick J. McKenna, David P. O'Connor, Claude N. Warren, Jr.
-
Patent number: 10210195Abstract: Indexing objects in a datastore, where the objects are characterized by a set of object properties. For objects from a datastore: a Bloom filter for the object properties, based on a predetermined Bloom filter configuration, is created; the Hamming value of the Bloom filter is determined; a binary logarithm of the Bloom filter is calculated; and the Bloom filter, the Hamming value, the binary logarithm, and a representation of the object is stored in the datastore.Type: GrantFiled: February 12, 2016Date of Patent: February 19, 2019Assignee: International Business Machines CorporationInventors: Patrick J. McKenna, David P. O'Connor, Claude N. Warren, Jr.
-
Publication number: 20190005041Abstract: Indexing objects in a datastore, where the objects are characterized by a set of object properties. For objects from a datastore: a Bloom filter for the object properties, based on a predetermined Bloom filter configuration, is created; the Hamming value of the Bloom filter is determined; a binary logarithm of the Bloom filter is calculated; and the Bloom filter, the Hamming value, the binary logarithm, and a representation of the object is stored in the datastore.Type: ApplicationFiled: September 11, 2018Publication date: January 3, 2019Inventors: Patrick J. McKenna, David P. O'Connor, Claude N. Warren, JR.
-
Patent number: 9842132Abstract: 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.Type: GrantFiled: October 23, 2015Date of Patent: December 12, 2017Assignee: International Business Machines CorporationInventors: Patrick J. McKenna, David P. O'Connor, Claude N. Warren, Jr.
-
Publication number: 20170235775Abstract: Indexing objects in a datastore, where the objects are characterized by a set of object properties. For objects from a datastore: a Bloom filter for the object properties, based on a predetermined Bloom filter configuration, is created; the Hamming value of the Bloom filter is determined; a binary logarithm of the Bloom filter is calculated; and the Bloom filter, the Hamming value, the binary logarithm, and a representation of the object is stored in the datastore.Type: ApplicationFiled: February 12, 2016Publication date: August 17, 2017Inventors: Patrick J. McKenna, David P. O'Connor, Claude N. Warren, JR.
-
Publication number: 20170235811Abstract: Identifying objects in a datastore with specified object properties, where each object is characterized by a Bloom filter, a Hamming value of the Bloom filter, and a binary logarithm of the Bloom filter. A set of object properties is received. A search Bloom filter is created from the object properties. A Hamming value of the search Bloom filter is determined. A binary logarithm of the search Bloom filter is calculated. Objects in the datastore which have respective Hamming values greater than or equal to the Hamming value of the search Bloom filter and respective binary logarithms that are greater than or equal to the binary logarithm of the search Bloom filter are identified.Type: ApplicationFiled: February 12, 2016Publication date: August 17, 2017Inventors: Patrick J. McKenna, David P. O'Connor, Claude N. Warren, JR.
-
Patent number: 9641398Abstract: 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.Type: GrantFiled: September 27, 2016Date of Patent: May 2, 2017Assignee: International Business Machines CorporationInventors: Patrick J. McKenna, David P. O'Connor, Claude N. Warren, Jr.
-
Publication number: 20170118085Abstract: 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.Type: ApplicationFiled: September 27, 2016Publication date: April 27, 2017Inventors: Patrick J. McKenna, David P. O'Connor, Claude N. Warren, JR.
-
Publication number: 20170118086Abstract: 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.Type: ApplicationFiled: September 29, 2016Publication date: April 27, 2017Inventors: Patrick J. McKenna, David P. O'Connor, Claude N. Warren, JR.
-
Publication number: 20170116244Abstract: 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.Type: ApplicationFiled: October 23, 2015Publication date: April 27, 2017Inventors: Patrick J. McKenna, David P. O'Connor, Claude N. Warren, JR.
-
Patent number: 9634902Abstract: 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.Type: GrantFiled: September 29, 2016Date of Patent: April 25, 2017Assignee: International Business Machines CorporationInventors: Patrick J. McKenna, David P. O'Connor, Claude N. Warren, Jr.
-
Patent number: 9553771Abstract: 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.Type: GrantFiled: March 3, 2016Date of Patent: January 24, 2017Assignee: International Business Machines CorporationInventors: Patrick J. McKenna, David P. O'Connor, Claude N. Warren, Jr.
-
Patent number: 4064658Abstract: A brush roundator comprises an endless conveyor for conveying brushes along a straight path in one direction. The brushes are mounted to the conveyor with their bristles extending outwardly away from the conveyor. A plurality of abrasion disc series, or groups, each including a plurality of abrasion discs arranged side-by-side in a line are positioned parallel to the conveyor and in the paths of the outer tips of the bristles. Each of the disc series is mounted on a frame whose position can be adjusted independently of the frames of the other series, both angularly and/or linearly. Each disc series includes a motor mounted on the frame to drive a first abrasion disc of the series and that disc has a gear thereon which meshes with a gear of an adjacent abrasion disc to rotate it in the opposite direction. This gear is linked to a gear of a next adjacent abrasion disc in a similar manner to rotate it in an opposite direction and so on.Type: GrantFiled: September 9, 1976Date of Patent: December 27, 1977Assignee: Blair Tool and Machine CorporationInventors: John E. Bergman, William T. Keeler, Patrick J. McKenna