Sun Microsystems, Inc.

Loglogic, Inc.

Oracle America, Inc.

Sap Se

Tibco Software Inc.

Mimosa Systems, Inc.

Sherif Botros

Steven Waterhouse

Boris Galitsky

Patrick G Gates

Olaf Manczak

Jeremy Matthew Werner

Sacha Christophe Arnoud

Yaroslav Faybishenko

Akhil Arora

John Beatty

Gene H Kan

Douglass R Cutting

Minjun Liu

Jian L Zhen

Bernard A Traversat

Mohamed M Abdelaziz

Rahul Kapoor

Michael J Duigou

Jean-Christophe Hugly

David Herman

Thomas J Camarda

Mohammad Shami

Sameer H Ranade

A document is received that has a plurality of lines with text. This document includes text associated with at least one topic of interest and text not associated with the at least one topic of interest. Thereafter, it is determined, for each line in the document, a length of the line and a number of off-topic indicators with the off-topic indicators characterizing portions of the document as likely being not being associated with the at least one topic of interest. Thereafter, a density for each line can be determined based on the determined line length and the determined number of off-topic indicators. The determined densities for each line are used to identify portions of the documents likely associated with the at least one topic of interest so that data characterizing the identified portions of the document can be provided. Related apparatus, systems, techniques and articles are also described.

Document text processing using edge detection

To retrieve a sequence of associated events in log data, a request expression is parsed to retrieve types of dependencies between events which are searched, and the constraints (e.g., keywords) which characterize each event. Based on the parsing results, query components can be formed, expressing the constraints for individual events and interrelations (e.g., time spans) between events. A resultant span query comprising the query components can then be run against an index of events, which encodes a mutual location of associated events in storage.

Searching for associated events in log data

A computerized searchable repository stores documents as structured metadata parts and unstructured content parts using single instancing. A full text index used for keyword searching includes a metadata index and a content index. A linking structure includes metadata-to-content (MD to CT) links and content-to-metadata (CT to MD) linking entries, with each MD to CT link linking a metadata part of a document to each content part of the document, and each CT to MD linking entry having one or more CT to MD links collectively linking a content part to the metadata parts of the documents that include the content part. Indexing includes metadata indexing a metadata part, conditionally content indexing a content part, and updating the linking structure. Content indexing is performed only if the content part does not match a content part already stored and indexed. Index entries each associate a key word or key value with corresponding metadata or content parts containing the key word or key value. Updating the linking structure includes generating new MD to CT and CT to MD links between the metadata part and either the new content part or an existing matching content part if present.

Computerized searchable document repository using separate metadata and content stores and full text indexes

Event data (e.g., log messages) are represented as sets of attribute/value pairs. An index maps each attribute/value pair or attribute/value tuple to a pointer that points to event data which contains the attribute/value pair or attribute/value tuple. An attribute co-occurrence map or matrix can be generated that includes attribute names that co-occur together. Queries and custom reports can be generated by projecting event data into one or more attributes or attribute/value pairs, and then determining statistics on other attributes using a combination of the inverted index, the attribute co-occurrence map or matrix, operations on sets and/or math and statistical functions.

Customized reporting and mining of event data

Embodiments of a distributed index mechanism for indexing and searching for presence information in peer-to-peer networks. In one embodiment, a distributed index may be used to store presence information in a decentralized manner on a plurality of peer nodes. In one embodiment, a notification service may be implemented on top of the distributed index to notify peers of other peers joining a peer-to-peer session. Participating peers may query the distributed index to detect the presence of other participating peers registered in the distributed index. One embodiment of a distributed index of presence information may be implemented in peer-to-peer networks implemented according to a peer-to-peer platform including one or more peer-to-peer platform protocols for enabling peer nodes to discover each other, communicate with each other, and cooperate with each other to form peer groups and share network resources.

Presence detection using distributed indexes in peer-to-peer networks

A method for distributively storing a data object on a data storage system includes determining a layout map ID and associating the layout map ID with the data object. The layout map ID is used in determining a layout map, and the layout map is used in determining a layout given a current configuration of the data storage system. The data object is fragmented into data fragments and parity fragments, and the data fragments and parity fragments are distributively stored on data storage system in accordance with the layout.

Method for distributed storage of data

In accordance with the invention, a data storage system for fixed content includes one or more peer node computer systems interconnected by a storage system network, where each peer node computer system includes a symmetric storage system application and locally attached storage. A data object is distributively stored on one or more of the one or more peer node computer systems and identified using a unique object identifier. A data object is flexibly stored on the data storage system according to external criteria. Stored data objects are accessible from any of the one or more peer node computer systems. Applications can be executed on the data storage system using data objects that are stored on, being written to, or being read from the data storage system to generate results accessible by a user.

Distributed data storage system for fixed content

In accordance with the invention, a data storage system for storing and retrieving fixed data content includes: a storage system network; one or more peer node computer systems interconnected by the storage system network; and at least one disklet stored on at least one of the one or more peer node computer systems, the disklet for execution on the data storage system using data that are stored on, being written to, or being read from the data storage system. In one embodiment, a disklet includes executable program code and a disklet interface that permits the program code of the disklet to be loaded on to the data storage system and executed on the data storage system by a user.

Method and system for remote execution of code on a distributed data storage system

A method includes determining a garbage collection list for a data storage structure of a node in a data storage system, the garbage collection list including one or more layout map identifiers (IDs) for garbage collection. A data fragment stored on the data storage structure is located at a first location and a layout map ID associated with the data fragment is determined. A determination is made whether the layout map ID associated with the data fragment matches a layout map ID for garbage collection in the garbage collection list. If the layout map ID associated with the data fragment matches a layout map ID for garbage collection in the garbage collection list, a determination is made whether the data fragment is present at a second location on the data storage system. If the data fragment is present at a second location on the data storage system, the data fragment at the first location is determined to be a garbage fragment and deleted from the data storage system.

Method of garbage collection on a data storage system

A method for recovery of data objects on a data storage system includes determining a list of layout map IDs that place data objects on a node of a data storage system. For each layout map ID, a list of object IDs associated with each of the data objects assigned the layout map ID is determined. For each object ID, a list of data object fragments associated with the object ID is determined. A determination is made whether each of the data object fragments is present on the node. If a data object fragment is not present on the node, the data object fragment is reconstructed on the data storage system. The method can be automatically implemented by each of one or more operational nodes of a distributed data storage system at configured time intervals, and/or upon the operational loss of a data storage structure of a node, or a node.

Method for recovery of data

Embodiments of a shared resource distributed index mechanism that peers in a peer-to-peer network may utilize to distribute index entries corresponding to resources to indexes of shared resources among one or more other peers. These indexes may be used to direct queries to peers where the queries are most likely to be answered. When a query is received by a rendezvous peer including one or more indexes, contents of the query may be 'looked up' in the index to find matches. The results of the lookup may include information on one or peer(s) that may hold advertisement(s) to the resource requested by the query. The query may then be forwarded to one or more peers that may hold the advertisement for the resource. Embodiments may provide 'loosely-coupled' distribution of index entries for use in querying for resources in the peer-to-peer network.

Decentralized peer-to-peer advertisement

Systems and methods for resolving search queries to information providers in a distributing search network. In a network including nodes generating search requests and nodes providing information, a node may operate as hub to route search requests from requesting nodes to provider nodes. Providers may register with a network hub. Registration information may include address information and data indicating the queries or type of queries for which that provider may have relevant data. A hub may resolve search queries against provider registrations to determine a set of providers to which to route each search query. Several systems and methods of selecting some of the providers are described, including the use of bidding, ranking, and statistical data.

System and method for resolving distributed network search queries to information providers

A system and method for distributing search requests in a network. The system and method may also route search responses. Network nodes operating as consumer or requesting nodes generate the search requests. Nodes operating as hubs are configured to route the search requests in the network. Individual nodes operating as provider nodes receive the search request and in response may generate search results according to their own procedures and return them. Communication between nodes in the network may use a common query protocol. Hub nodes may resolve the search requests to a subset of the provider nodes in the network, for example by matching search requests with registration information from nodes. Search results may be customized at various stages in the network.

Growing community of inventors

Redwood Shores, CA, United States of America

Sherif Botros