Abstract: Techniques for compiling firewall rules into byte code or assembly code that can be loaded into cache memory of a processor and executed to evaluate received data packets. Rather than representing firewall rules in mid- or high-level languages stored in main memory, the techniques described herein include compiling the firewall rules into bytecode or assembly code, and distributing the code to the data plane. A packet-processing device may load the code representing the firewall rules into instruction cache of the processor. Further, the packet-processing device receives a data packet and extracts packet context data indicating attributes of the packet, and load the packet context data into a data cache of the processor. The processor can then execute the byte code or assembly code representing the firewall rules to evaluate the packet context data without having to access main memory to determine whether allow or block the data packet.

Abstract: Techniques for compiling firewall rules into byte code or assembly code that can be loaded into cache memory of a processor and executed to evaluate received data packets. Rather than representing firewall rules in mid- or high-level languages stored in main memory, the techniques described herein include compiling the firewall rules into bytecode or assembly code, and distributing the code to the data plane. A packet-processing device may load the code representing the firewall rules into instruction cache of the processor. Further, the packet-processing device receives a data packet and extracts packet context data indicating attributes of the packet, and load the packet context data into a data cache of the processor. The processor can then execute the byte code or assembly code representing the firewall rules to evaluate the packet context data without having to access main memory to determine whether allow or block the data packet.

Abstract: Electrically-insulated utility devices and methods for using the same are described. In particular, this application discusses systems and methods for making and using electrically insulated pinch bars. Generally, each insulated pinch bar includes a pinch bar, which has a longitudinal body, a distal tip and a proximal head, and an electrically insulative material disposed circumferentially about a portion of the longitudinal body of the pinch bar. In some embodiments, the electrically insulative material also abuts the proximal head of the pinch bar. The insulated pinch bar can therefore provide safety for the pinch bar user or operator when the pinch bar is used in a variety of utility or construction applications and comes in contact with an electrical current. The insulated pinch bar can be part of a system which further includes a cover adapted to protect the electrically insulative material when the insulated pinch bar is not in use. Other embodiments are described.

Abstract: The present invention provides a method and apparatus for collecting user feedback based on search queries. The method comprises receiving a search term from a user, providing a search result to the user based on comparing at least a portion of the received search term with at least a portion of one or more entries stored in a database and providing a feedback module to the user to monitor at least one online action of the user in response to providing the search result. The method further provides for receiving, from the feedback module, information associated with the at least one monitored user action to adjust at least one entry stored in the database.

Abstract: Content addressable data storage and compression for semi-persistent computer memory for a database management system including providing a data structure that associates data identifiers and retrieval keys for memory blocks for storing in semi-persistent memory data from the database management system; searching for a segment of a chunk of data from the database management system that matches a memory block from semi-persistent memory; and if a matching segment is found: discarding the matching segment; storing in the data structure in the database management system a retrieval key for the matching segment in association with a data identifier; identifying an unmatched portion of the chunk that does not match the memory block; storing the unmatched portion semi-persistently in a free memory block from a file system; and storing in the data structure in the database management system a retrieval key for the unmatched portion in association with the data identifier.

Abstract: Methods, systems, and products of content addressable data storage and compression for computer memory are disclosed as providing a chunk of data comprising a quantity of input data; retrieving a memory block from computer memory; searching for a segment of the chunk that matches the memory block; and if a matching segment is found: discarding the matching segment and providing a retrieval key for the memory block as a retrieval key for the matching segment; identifying an unmatched portion of the chunk that does not match the memory block; and storing the unmatched portion and providing a retrieval key for the unmatched portion.

Abstract: Transparent content addressable data storage and compression for a file system including providing a data structure that associates file identifiers and retrieval keys for memory blocks for storing file contents; storing in the data structure one or more file identifiers; providing a chunk of data comprising a quantity of input data of a file; retrieving a memory block from computer memory; searching for a segment of the chunk that matches the memory block; and if a matching segment is found: discarding the matching segment; providing a retrieval key for the memory block as a retrieval key for the matching segment; identifying an unmatched portion of the chunk that does not match the memory block; storing the unmatched portion; and providing a retrieval key for the unmatched portion.

Abstract: Content addressable data storage and compression for semi-persistent computer memory including providing a chunk of data that is a quantity of input data; retrieving a memory block from semi-persistent computer memory; searching for a segment of the chunk that matches the memory block; and if a matching segment is found: discarding the matching segment; providing a retrieval key for the memory block as a retrieval key for the matching segment; identifying an unmatched portion of the chunk that does not match the memory block; identifying a free memory block of a file system; storing the unmatched portion semi-persistently in the free memory block; and providing a retrieval key for the unmatched portion.