Google Inc.

Lucent Technologies Inc.

At&t Ipm Corp.

Sandbridge Technologies, Inc.

Sean Matthew Dorward

Sean Quinlan

Jeffrey Adgate Dean

Sanjay Ghemawat

James David Johnston

Robert C Pike

Schuyler Reynier Quackenbush

Nuggehally Sampath Jayant

Luis Castro

Nambirajan Seshadri

Michael Burrows

Walton Lin

Mayan Moudgill

Carl-Erik Wilhelm Sundberg

Erdem Hokenek

Jonathan B Allen

Walt Lin

Kenneth Lane Thompson

Mark R Sydorenko

Systems and methods for analyzing input data records are provided in which a master process initiates a plurality of concurrent first processes each of which comprises, for each data record in at least a subset of a plurality of input data records, creating a parsed representation of the data record and independently applying a procedural language query to the parsed representation to extract one or more values. A respective emit operator is applied to at least one of the extracted one or more values thereby adding corresponding information to a respective intermediate data structure. The respective emit operator implements one of a predefined set of statistical information processing functions. The master process also initiates a plurality of second processes each of which aggregates information from a corresponding subset of intermediate data structures to produce aggregated data that is, in turn, combined to produce output data.

System and method for analyzing data records

A method processes data records. The method partitions the data records into groups and assigns each group to a respective process of a first plurality of processes, which execute in parallel. For each group, the assigned process extracts information from the data records, applies a script with information processing commands applied sequentially to produce intermediate values, stores the intermediate values in a respective intermediate data structure, and updates the status of the group to indicate completion. When the predefined threshold percentage of the data records are completed, the process assigns each group to a respective second process as a backup. When each of the groups has been completed by at least one process (either the original or the backup), the method executes a second plurality of processes to aggregate intermediate values from the intermediate data structures to produce output data. The aggregation includes intermediate values only once for each group.

A method and system for analyzing data records includes allocating groups of records to respective processes of a first plurality of processes executing in parallel. In each respective process of the first plurality of processes, for each record in the group of records allocated to the respective process, a query is applied to the record so as to produce zero or more values. Zero or more emit operators are applied to each of the zero or more produced values so as to add corresponding information to an intermediate data structure. Information from a plurality of the intermediate data structures is aggregated to produce output data.

A method includes receiving a search query from a user and generating search results based on the search query. The method may also include providing the search results and information identifying at least one of a telephone number or an address associated with a first one of the search results to the user. The method may further include providing a link to a map associated with at least the first search result to the user.

Enhanced search results

In an embodiment of the present invention, the computational efficiency of decoding of block-sorted compressed data is improved by ensuring that more than one set of operations corresponding to a plurality of paths through a mapping array T are being handled by a processor. This sequence of operations, including instructions from the plurality of sets of operations, ensures that there is another operation in the pipeline if a cache miss on any given lookup operation in the mapping array results in a slower main memory access. In this way, the processor utilization is improved. While the sets of operations in the sequence of operations are independent of another other, there will be an overlap of a plurality of the main memory access operations due to the long time required for main memory access.

Decompression of block-sorted data

A multithreaded processor includes an interrupt controller for processing a cross-thread interrupt directed from a requesting thread to a destination thread. The interrupt controller in an illustrative embodiment receives a request for delivery of the cross-thread interrupt to the destination thread, determines whether the destination thread of the cross-thread interrupt is enabled for receipt of cross-thread interrupts, and utilizes a thread identifier to control delivery of the cross-thread interrupt to the destination thread if the destination thread is enabled for receipt of cross-thread interrupts. The requesting thread requests delivery of the cross-thread interrupt to the destination thread by setting a corresponding interrupt pending bit in a flag register of the multithreaded processor. The destination thread is enabled for receipt of cross-thread interrupts if a corresponding enable bit is set in an enable register of the multithreaded processor. The flag and enable registers may be implemented within the interrupt controller.

Inter-thread communications using shared interrupt register

Data storage techniques particularly well-suited for use in archival data storage are disclosed. In one aspect of the invention, a data block is processed to generate an address as a function of the contents of the data block, and the data block is then stored in the system in a memory location identified by the address. The processing operation is configured to provide write-once archival storage of the data block, in that the contents of the data block are not modifiable without also altering the address of the data block determinable in the processing operation. In an illustrative embodiment, the processing of the data block involves determining a substantially unique identifier of the data block by applying a collision-resistant hash function to the contents of the data block, and the address is subsequently determined from the substantially unique identifier by utilizing the identifier to perform a lookup of the address in an index.

Method and apparatus for archival data storage

A method and apparatus for compressing packets that enables inter-packet compression thereby achieving greater robustness and increased compression ratios without the deleterious effects, e.g., the effect of packet loss multiplying, of prior compression schemes. More particularly, a so-called acknowledgment scheme is employed in conjunction with the specific compression algorithm such that the transmitter, i.e., sender, can limit the history used by the compression algorithm to those packets that are correctly received. In particular, a vector identifying the packets used as the history is included in the compressed packet thereby enabling the receiver to reconstruct the packet history state necessary to decompress the packet. Advantageously, increased robustness and greater compression ratios are achieved independent of any particular one compression scheme.

Method and apparatus for data compression of network packets

A method and apparatus for compressing packets that enables inter-packet compression thereby achieving greater robustness and increased compression ratios. More particularly, a variable-length coding is used in conjunction with maintaining a separate hash table for each packet. Further, the per-packet hash table indexes particular byte strings in the packet but does not index data in any other packet(s). That is, a respective separate hash table for each packet is employed wherein such hash table is constructed as the particular packet is compressed. As such, the respective hash table is encoded with the particular packet. Employing a per-packet hash table in combination with variable history state inter-packet compression provides for efficient and robust overall compression of the packets.

Method and apparatus for data compression of network packets employing per-packet hash tables

An independent transport layer is used as an error correction mechanism in a method employing perceptual audio coding. The transport layer is characterized by the addition of information, via a transport header, to each of a succession of blocks of encoded program material which is independent of the information within its respective block of encoded program material. The transport header comprises information on the structure of the block. Thus, the transport header is easily separated from the digital representation of the program material and is independent of the content of the digital representation thereby providing for changing of the content of the digital representation without changing the transport layer.

Device and method for efficient utilization of allocated transmission

A method of encoding an audio signal is disclosed. The method comprises partitioning the audio signal into a first time block and a second time block. Next, a first time block first energy value and a first time block second energy value are calculated. Next, a second time block first energy value and a second time block second energy value are calculated. Next, the technique determines if an attack has occurred in the second time block by comparing the second time block first energy value and the second time block second energy value and also comparing the Erst time block and the second time block Advantageously, the method identifies attach such that the decoder can reproduce the attacks with little audible distortion and also affords the advantage of using long windows for portions of the audio signal that do not contain attacks.

Window switching based on interblock and intrablock frequency band energy

A new technique for the determination of the masking effect of an audio signal is employed to provide transparent compression of an audio signal at greatly reduced bit rates. The new technique employs the results of recent research into the psycho-physics of noise masking in the human auditory system. This research suggests that noise masking is a function of the uncertainty in loudness as perceived by the brain. Measures of loudness uncertainty are employed to form noise masking thresholds for use in the compression of audio signals. These measures are employed in an illustrative subband, analysis-by-synthesis framework. In accordance with the illustrative embodiment, provisional encodings of the audio signal are performed to determine the encoding which achieves a loudness differential, between the original and coded audio signal, which is less than (but not too far below) the loudness uncertainty.

Growing community of inventors

Martinsville, NJ, United States of America

Sean Matthew Dorward