scispace - formally typeset
Patent

System and method for performing longest common prefix strings searches

Reads0
Chats0
TLDR
In this article, a method and system for compressing and searching a plurality of strings is presented, which is based on the idea of prefix-preserving compressed string search (PPSS).
Abstract
A method and system a method for compressing and searching a plurality of strings. The method includes inputting a plurality of strings into a compression engine. The method also includes converting each of the plurality of strings into a new, prefix-preserving compressed string, using the compression engine. For every string P that is a strict prefix of a string S, P's resulting compressed string is a strict prefix of S's resulting compressed string.

read more

Citations
More filters
Patent

Method and system for controlling a user receiving device using voice commands

TL;DR: In this paper, a system and method includes a language processing module converting an electrical signal corresponding to an audible signal into a textual signal, and a command generation module converting the textual signal into user receiving device control signal.
Patent

System and method for identifying network applications based on packet content signatures

TL;DR: In this article, the authors propose a framework for traffic classification that bridges the gap between the packet content inspection and the flow-based behavioral analysis techniques, where IP packets and/or IP flows are used as an input, network nodes are associated to specific network applications by leveraging information gathered from the web, and packet content signatures are extracted in an off-line fashion using clustering and signature extraction algorithms.
Patent

Method and system for append-only storage and retrieval of information

TL;DR: In this paper, a method, a system, and a computer program product for storing and retrieving information are provided, and the system organizes the information for optimal storage and retrieval based on qualities of a storage medium.
Patent

Hardware data compressor using dynamic hash algorithm based on input block type

TL;DR: In this paper, a hardware data compressor that compresses an input block of characters by replacing strings of characters in the input block with back pointers to matching strings earlier in a previous input block is described.
Patent

Hardware data compressor that directly huffman encodes output tokens from lz77 engine

TL;DR: In this paper, a hardware data compressor is used to generate tokens, the tokens are either literal characters of the input block or a back pointer to replaced strings of characters of an input block.
References
More filters
Patent

Method and apparatus for redirection of server external hyper-link references

TL;DR: In this paper, a message is provided to a tracking server system in response to a client system referencing a predetermined resource locator that corresponds to a resource external to the tracking server.
Patent

Information Infrastructure Management Tools with Extractor, Secure Storage, Content Analysis and Classification and Method Therefor

TL;DR: In this paper, the authors present a method of organizing and processing data in a distributed computing system, which is also implemented as a computer program on a computer medium and as a distributed computer system.
Patent

Hash file system and method for use in a commonality factoring system

TL;DR: In this paper, the hash file system of the present invention utilizes hash values for computer files or file pieces which may be produced by a checksum generating program, engine or algorithm such as industry standard MD4, MD5, SHA or SHA-1 algorithms.
Patent

A lempel-ziv data compression technique utilizing a dictionary pre-filled with frequent letter combinations, words and/or phrases

TL;DR: In this paper, the adaptive compression technique improves the Lempel-Ziv (LZ) technique because it reduces the required storage space (18) and transmission time with transferring data (22).
Patent

Method and apparatus for encoding, decoding and transmitting data in compressed form

Alan Clark
TL;DR: In this article, the Ziv-Lempel algorithm is simplified by using a tree structure for the dictionary in which alternative symbols at a given position in a symbol sequence (a,b,c) are linked by linking pointers R of a first type and successive symbols (ab,bc,ca,aba,abb,abc,abc), in conjunction with a parent pointer P which identifies its parent.