Abstract: Systems and methods for making source code annotations available across software code repository commits are disclosed. An example method for creating an incremental blame structure for determining which annotations should be shown begins with receiving a commit including at least one file that has been updated with respect to a parent commit. Then, parent file revisions for the at least one file should be identified. An example method determines the differences between the at least one file and the identified parent file revisions and traces an origin of each line in the file based on the determined differences. An identifier of the line and the line's origin may be added to the incremental blame data structure of the file.

Abstract: The invention proposes a storage system having a number of M storage media, having a number of N data producers each providing a data stream and each having one or more data members, and having a storage management device for distributing the data streams from the N data producers to the M storage media, wherein a group of (A+1) of the M storage media is statically assigned to each of the N data producers, where 1<A<M.

Abstract: Systems and methods for making source code annotations available across software code repository commits are disclosed. An example method for creating an incremental blame structure for determining which annotations should be shown begins with receiving a commit including at least one file that has been updated with respect to a parent commit. Then, parent file revisions for the at least one file should be identified. An example method determines the differences between the at least one file and the identified parent file revisions and traces an origin of each line in the file based on the determined differences. An identifier of the line and the line's origin may be added to the incremental blame data structure of the file.

Abstract: Systems and methods are disclosed for searching a corpus using regular expressions. The method includes determining whether a received query has parameters that include a regular expression and creating an automaton representation of the regular expression, the automaton having a starting node, a number of termination nodes, and at least one edge between nodes. The method further includes traversing the automaton from the termination nodes to the starting node to determine a suffix array range for the starting node and using the suffix array range to identify documents in the corpus. The method may also include determining whether the query parameters match parameters for a stored high-cost recurring query and identifying documents associated with prepared results for the high-cost recurring query. The method may generate search results including the documents associated with the prepared results and at least some documents identified using the suffix array range.

Abstract: The invention proposes a storage system having a number of M storage media, having a number of N data producers each providing a data stream and each having one or more data members, and having a storage management device for distributing the data streams from the N data producers to the M storage media, wherein a group of (A+1) of the M storage media is statically assigned to each of the N data producers, where 1<A<M.

Abstract: A system is disclosed for faster processing of range queries. The system includes at least one processor and a memory storing a hybrid range query data structure in the form of a binary tree. The structure includes a root node, non-leaf nodes, and leaf nodes. The root node is a bitmap that includes one bit for each value in a first set of values. The non-leaf nodes are also bitmaps. The leaf nodes eliminate a number of lower levels of the tree and include two or more second values that map to values in the first set of values. The system may include instructions that cause the system to receive a range of first values, use the range of first values to traverse the data structure to identify second values that map to the first values, and return the identified second values in sorted order.

Abstract: The invention presents a method for editing video data (60), a method for presenting video data (60) and an arrangement for carrying out the method for editing video data (60). The method for editing video data (60) involves the video data (60) being smoothed and sampled in a CPU (50) for presenting and then transmitted to a graphics card having a graphics processor (52), in which the prescaled video data (64) are subjected to an edge sharpening operation.