Yahoo! Inc.

Hewlett-packard Development Company, L.p.

Digital Equipment Corporation

Compaq Computer Corporation, Inc.

Excalibur Ip, LLC

Alta Vista Company

Raymond Paul Stata

Patrick David Hunt

Thiruvalluvan Mg

Michael Burrows

Mark David Lillibridge

Martin Abadi

Andrew William Stack

Maram Nagendra Prasad

Tarak Goradia

Sanjay Ghemawat

Jeffrey Clifford Mogul

Swee Boon Lim

Chandramohan Amyangot Thekkath

Rohit Chandra

Edward Pearce Wobber

Andrew David Birrell

Thomas Lee Rodeheffer

Janet Lynn Wiener

Andrew Feng

Darrell Anderson

Evgeniy Makeev

Scott Banachowski

Keith H Randall

K Rustan M Leino

James Benjamin Saxe

Cormac A Flanagan

Glenn Trewitt

Jeffrey Budzinski

K Rustan Leino

Ashok Jhunjhunwala

Rajiv G Wickremesinghe

Edward M Gould

David R Jefferson

A search-based email client may incorporate a number of useful features. A search function can default to a search of all email contexts, thereby eliminating user cogitation over which context an email message may be stored in. Furthermore, the search function can automatically search for related personal content and/or related information on the internet or other computer network, and present this useful information to the user in addition to the returned emails. The search function can be integrated into a user interface to allow for one-click searches on any likely search field. The search function can search the body of email messages by default, thereby widening the scope of default searches and eliminating potentially missed information and user need to proactively widen their search. A search function can search attachments, which also provides a wider search scope.

Systems and methods for a search-based email client

Methods and apparatus for executing an application are disclosed. In accordance with one embodiment, a request is received. One or more of a plurality of module types are instantiated such that a plurality of module objects are generated. A query plan linking the plurality of module objects is executed such that a response to the request is generated. The response is then returned.

Composition model for cloud-hosted serving applications

Systems and methods for query processing and indexing of documents in connection with a content store in a computing system are provided. In various embodiments, an indexing model is provided that is optimized for fast, efficient and scalable retrieval of documents satisfying a query, including the mixed use of forward and inverted indexing representations, including algorithms for achieving a balance between the two representations. When processing queries, fast and efficient generation of reverse chronologically ordered posting lists is enabled for efficient execution of logical operators on query result sets. A term expand index is also provided wherein the overall terms included in the term expand index are decomposed into a plurality of lexicon files, which are combined when convenient for fast, scalable efficiency when performing queries of the content in the content store.

Systems and methods for indexing content for fast and scalable retrieval

Systems and methods for automatically updating queries on a data store, such as a personal content database (PCDB), are provided. A query engine runs queries against two indexes: a first index that represents a previous state of documents and a second index that represents a current state of documents. The query is run twice and a delta analysis is performed, i.e., a determination is made as to which documents have changed in some respect from the previous state to the current state, and a view or a count associated with at least one query changes in accordance with the delta analysis. Transactions may be batched dynamically by a transaction manager until an optimal number of documents have changed or a certain amount of time has passed prior to re-running the query and performing the delta analysis.

Systems and methods for updating query results based on query deltas

Systems and methods for selecting a time/date, or a range of times/dates are provided. In one aspect, systems and methods having non-linear timeline UI mechanism(s) for selecting a date, or selecting a date range, are provided. In recognition that user interaction with and recall of time varies depending upon how far away the time period of interest is from the present time, the non-linear timeline provides UI mechanism(s) for selecting a time having different granularities of time in different portions of the timeline. Additionally, in recognition that user interaction with dates and times is not always in terms of numbers, but rather in terms of events, etc., occurring at or around a particular time period of interest, systems and methods having date relation UI techniques are provided.

Systems and methods for relating events to a date or date range selection

Undesirable behavior patterns of computers on a network impact network performance. A system and method are provided for limiting the impact of undesirable behavior of computers on the network. The network, through which packets of data are interchanged between the computers, includes one or more forwarding devices that are controlled or instructed by one or more packet traffic monitors. Each of the packet traffic monitors is configured for monitoring the packets; for determining if the information about the pattern of behavior from any of the computers is trustworthy; for determining, upon discovering that one or more of the patterns of behavior is undesirable, a type of the undesirable pattern behavior; and for determining a proper action for mitigating that type of undesirable behavior. The proper action is performed by mitigation means controlling the one or more forwarding devices.

Method and system for limiting the impact of undesirable behavior of computers on a shared data network

Systems and methods for selecting a time/date, or a range of times/dates are provided. In one aspect, systems and methods having non-linear timeline UI mechanism(s) for selecting a date, or selecting a date range, are provided. In recognition that user interaction with and recall of time varies depending upon how far away the time period of interest is from the present time, the non-linear timeline provides UI mechanism(s) for selecting a time having different granularities of time in different portions of the timeline. Additionally, in recognition that user interaction with dates and times is not always in terms of numbers, but rather in terms of events, etc., occurring at or around a particular time period of interest, systems and method having date relation UI techniques are provided.

Systems and methods for selecting a date or range of dates

A web crawler system includes a central processing unit for performing computations in accordance with stored procedures and a network interface for accessing remotely located computers via a network. A web crawler module downloads pages from remotely located servers via the network interface. A first link processing module obtains page link information from the downloaded page; the page link information includes for each downloaded page a row of page identifiers of other pages. A second link processing module encodes the rows of page identifies in a space efficient manner. It arranges the rows of page identifiers in a particular order. For each respective row it identifies a prior row, if any, that best matches the respective row in accordance with predefined row match criteria, determines a set of deletes representing page identifiers in the identified prior row not in the respective row, and determines a set of adds representing page identifiers in the respective row not in the identifier prior row. The second link processing module delta encodes the set of deletes and delta encodes the set of adds for each respective row, and then Huffman codes the delta encoded set of deletes and delta encoded set of adds for each respective row.

System and method for storing connectivity information in a web database

Managing end stations locations in a bridged network includes providing a smart bridge, and performing communications operations using a network flood active port connections table, a network flood reaching table, a best path forwarding table and a best path sourcing table. An end station locations revision manages a host location (HLOC) table. End stations locations revision is invoked upon detection of changes in any end station location. The end stations locations revision exchanges location revision grandparent (LRG), a location revision child (LRC) table and a location revision wavefront distribution protocol. The locations revision passes the location revision request from the smart bridge over a topology of the bridged network. A location revision wavefront starts at the root and, spreads a location revision request for revising the HLOC of the other smart bridges. The wavefront spreads by wavefront protocol.

Bridged network stations location revision

A connectivity server for a collecting, arranging and representing data defining the interconnection of pages on the World Wide Web (Web). A URL Database stores URLs and associates a fingerprint and CS_id with each URL. The URL Database interface is operable to translate between any two of a URL, a fingerprint, and a Host_id. A Host Database associates a Host_id with each distinct hostname in the URL Database. The Host Database interface is operable to accept a Host_id and return a number equal to the number of URLs on the respective host and to return the CS_ids of those URLs. A Link Database stores links between source URLs and destination URLs. The Link Database interface is operable to retrieve, for a given CS_id, the number of inlinks to and outlinks from the URL corresponding to the CS_id. In an embodiment characterized by a single processor, with access to all databases stored in RAM links and URL information may be retrieved sufficiently rapidly so that applications that touch every link, even multiple times, may execute in real time, in a few minutes or hours. Representative applications enabled by the connectivity server include static ranking of pages (eigenranks), query precomputation, mirror-site detection, and related-page identification.

Web page connectivity server

When a source program containing annotations is processed by a user-selected tool, the annotations in the source program are detected by a lexer and passed to an annotation processor corresponding to the selected tool. The system contains a number of annotation processors and a number of program processing tools, and the annotation processor to which the annotations are passed is selected based upon the user-selected tool. The selected annotation processor converts annotations compatible with the user-selected tool into annotation tokens and returns the annotation tokens to the lexer. The lexer generates tokens based upon the programming-language statements in the source program, and passes both the tokens and annotation tokens to a parser. The parser, in turn, assembles the tokens and annotation tokens into an abstract syntax tree, which is then passed to the user-selected tool for further processing.

System and method for lexing and parsing program annotations

A method and apparatus annotates a computer program to facilitate subsequent processing of the program. Code representing the program is generated at a first computer system. Annotations are generated for the code that provide information about the code. At a second computer, the code is processed according to the information provided by the annotations. The annotations, for example, can indicate a control flow graph representing a flow of execution of the code. Also, the information provided by the annotations can be a register allocation that maps data structures of the code to registers of the second computer system. The second computer system can use such information to guide the interpreting of the code or to transform the code into a more optimized form. Other exemplary annotations can indicate that running the executable form of the code would perform an unauthorized operation at the second computer system. The second computer system could then reject the code instead of performing subsequent processing on the code. When the source of the annotations is untrusted by the second computer system, the second computer system can use a checker to verify the integrity of the annotations.

Method and apparatus for annotating a computer program to facilitate subsequent processing of the program

A computerized method enables an audience to synchronously interact with a broadcast program in realtime. A broadcast clock of a broadcast system is synchronized to a standard time. A server clock of a server computer is synchronized to the standard time using a network timing protocol. A client computer clock of a client computer is synchronized to the server clock. The program is broadcast synchronously to the broadcast clock. Web pages are provided by the server computer to the client computer. Responses generated by the client computer are time-stamped according to the synchronized time of the client computer so that the responses can be time-correlated to segments of the program.

Method and apparatus for correlating real-time audience feedback with

Growing community of inventors

Palo Alto, CA, United States of America

Raymond Paul Stata