The software according to the invention incorporates a glossary management tool that makes it easy for each client to customize terminology to the needs of a particular business. With this tool, termed a glossary manager, a company can customize a number of feature names in the system to provide a more familiar context for their users. A system administrator can also customize the manner in which “thumbnail” or “preview” images are presented. The system performs clustering on search queries, and searches media records multi-modally, using two or more approaches such as image searching and text searching. An administrator can tune search parameters. Two or more streams of metadata may be aligned and correlated with a media file, facilitating later searching. The system evaluates itself. It folds popularity information into rankings of search results.

Method and apparatus for digital media management, retrieval, and collaboration

A method for developing traffic messages for broadcast is disclosed. Data indicating a plurality of traffic conditions on a road network are obtained. For each of the traffic conditions, the data provides a start location at which the traffic condition begins and an end location at which the traffic condition ends. For each of the traffic conditions, a road length from the start location to the end location is determined. The traffic conditions are assigned a priority based upon the road lengths. The data indicating the traffic conditions are transmitted in the assigned priority as a plurality of traffic messages.

Method and system for developing traffic messages

Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and business intelligence applications Moreover, recent work [1, 24] has shown that lightweight compression schemes significantly improve the query processing performance of these systems One such a lightweight compression scheme is to use a dictionary in order to replace long (variable-length) values of a certain domain with shorter (fixedlength) integer codes In order to further improve expensive query operations such as sorting and searching, column-stores often use order-preserving compression schemes In contrast to the existing work, in this paper we argue that orderpreserving dictionary compression does not only pay off for attributes with a small fixed domain size but also for long string attributes with a large domain size which might change over time Consequently, we introduce new data structures that efficiently support an order-preserving dictionary compression for (variablelength) string attributes with a large domain size that is likely to change over time The main idea is that we model a dictionary as a table that specifies a mapping from string-values to arbitrary integer codes (and vice versa) and we introduce a novel indexing approach that provides efficient access paths to such a dictionary while compressing the index data Our experiments show that our data structures are as fast as (or in some cases even faster than) other state-of-the-art data structures for dictionaries while being less memory intensive

/pdf/dictionary-based-order-preserving-string-compression-for-wixr49f440.pdf

Dictionary-based order-preserving string compression for main memory column stores

Generating and using a high-speed, scalable, and easily updateable data structure are described. The proposed data structure provides minimal perfect hashing functionality while intrinsically supporting low-cost set-membership queries. In other words, in some embodiments, it provides at most one match candidate in a set of known arbitrary-length bit strings that is used to match the query.

Generating a hierarchical data structure associated with a plurality of known arbitrary-length bit strings used for detecting whether an arbitrary-length bit string input matches one of a plurality of known arbitrary-length bit string

Systems and methods for providing accelerated data storage and retrieval utilizing lossless data compression and decompression. A data storage accelerator includes one or a plurality of high speed data compression encoders that are configured to simultaneously or sequentially losslessly compress data at a rate equivalent to or faster than the transmission rate of an input data stream. The compressed data is subsequently stored in a target memory or other storage device whose input data storage bandwidth is lower than the original input data stream bandwidth. Similarly, a data retrieval accelerator includes one or a plurality of high speed data decompression decoders that are configured to simultaneously or sequentially losslessly decompress data at a rate equivalent to or faster than the input data stream from the target memory or storage device. The decompressed data is then output at rate data that is greater than the output rate from the target memory or data storage device. The data storage and retrieval accelerator method and system may employed: in a disk storage adapter to reduce the time required to store and retrieve data from computer to disk; in conjunction with random access memory to reduce the time required to store and retrieve data from random access memory; in a display controller to reduce the time required to send display data to the display controller or processor; and/or in an input/output controller to reduce the time required to store, retrieve, or transmit data.

System and methods for accelerated data storage and retrieval

A dictionary based data compression and decompression system where, in the compressor, when a partial string W and a character C are matched in the dictionary, a new string is entered into the dictionary with C as an extension character on the string PW where P is the string corresponding to the last output compressed code signal. An update string is entered into the compression dictionary for each input character that is read and matched. The updating is immediate and interleaved with the character-by-character matching of the current string. The update process continues until the longest match is found in the dictionary. The code of the longest matched string is output in a string matching cycle. If a single character or multi-character string "A" exists in the dictionary, the string AAA . . . A is encoded in two compressed code signals regardless of the string length. This encoding results in an unrecognized code signal at the decompressor. The decompressor, in response to an unrecognized code signal, enters update strings into the decompressor dictionary in accordance with the recovered string corresponding to the previously received code signal, the unrecognized code signal, the extant code of the decompressor and the number of characters in the previously recovered string.

Data compression and decompression system with immediate dictionary updating interleaved with string search

Using LZW data compression/decompression processing techniques, textual input data is compressed by parsing consecutive words of the text into phrases and storing the phrases in a dictionary with compressed phrase codes associated therewith. The textual input data is searched by determining the longest match with the stored phrases in the dictionary and the compressed phrase code associated with the longest match is output to a compressed text database and stored at a location thereof. A list of references is maintained associated with each stored phrase to the locations in the compressed text database at which the compressed phrase code for the phrase is stored. Lists of word-to-phrase references are also created providing references for each distinct word encountered in the text to the stored phrases containing the word. Textual queries applied against the compressed text database utilize the dictionary and reference lists to access compressed database references and to decompress text in both directions from a referenced compressed text database location in order to provide information relative to the query.

Textual database management, storage and retrieval system utilizing word-oriented, dictionary-based data compression/decompression

An LZW compressor implementation architecture utilizes a plurality of limited length character tables corresponding to the respective characters of the alphabet. A string is stored by storing the code associated with the string in the character table corresponding to the extension character of the string at a character table location corresponding to the code of the string prefix. A character table is created when the character corresponding thereto is first encountered in the input. The input data character stream is searched by comparing the input stream to the stored strings to determine longest matches therewith. The codes associated with the longest matched strings are outputted so as to provide an output stream of compressed codes. The respective lengths of the character tables are limited in accordance with the frequency of occurrence of the characters of the alphabet. If a character table is limited in length to a number of strings less than a predetermined threshold, the character table is excluded from creation. The stored strings are updated by inserting extended strings into the character tables, terminating storage into a character table when the table is full. Additionally, an extended string is excluded from storage when the appropriate character table therefor is excluded from creation. The code counter assigning the string codes is not incremented when an extended string is not stored.

Data compression method and apparatus implemented with limited length character tables and compact string code utilization

The data compressor utilizes a plurality of character tables arranged in levels for storing strings of data characters, the character tables corresponding to respective characters of the alphabet. A string is stored by storing the string code associated with the string in a character table corresponding to the extension character of the string in a location of the character table corresponding to the code of the string prefix. The character tables at the first level store 2-character strings and the character tables at a subsequent level store strings that are one character longer than the strings stored in the character tables at the level prior thereto.

Data compression method and apparatus utilizing cascaded character tables

In an LZW data compressor, the occurrence of a character run in the input character stream is determined and the run count is added to the existing code in the compressor code counter to generate a compressor code output representative of the run count. The LZW data decompressor subtracts the existing code in the decompressor code counter from the received compressed code to recover the run count. In accordance with a further feature, large length runs are processed by reducing the run count to less than the system maximum code by subtracting a selected predetermined constant from the run count. The reduced run count is outputted by the compressor preceded by a reserved code representative of the selected predetermined constant. In response to the received reserved code and the reduced count that follows, the decompressor adds the selected predetermined constant corresponding to the received reserved code to the received reduced count to recover the original run count.

Albert B. Cooper

Papers

Data compression and decompression system with immediate dictionary updating interleaved with string search

Textual database management, storage and retrieval system utilizing word-oriented, dictionary-based data compression/decompression

Data compression method and apparatus implemented with limited length character tables and compact string code utilization

Data compression method and apparatus utilizing cascaded character tables

LZW data compression/decompression apparatus and method with embedded run-length encoding/decoding