Patent application number | Description | Published |
20090037456 | Providing an index for a data store - Chunks are stored in a data store, where respective collections of chunks form respective files. An index that maps digests of chunks to pages containing information to recreate the chunks is provided, where the index is stored in persistent storage. | 02-05-2009 |
20090037500 | Storing nodes representing respective chunks of files in a data store - To provide a data store, nodes representing respective chunks of files are stored in a predefined structure that defines relationships among the nodes, where the files are divided into the chunks. The nodes are collected into plural groups stored in persistent storage, where some of the nodes are collected into a particular one of the groups according to a locality relationship of the some of the nodes. | 02-05-2009 |
20100082865 | Access Grants - Provided are, among other things, systems, methods, apparatuses and techniques for storing access grants. In one implementation, a blinding factor and access information for accessing a restricted object are obtained; blinded access information is generated for the restricted object based on the access information and the blinding factor; and an anchor node is stored into a data store, with the anchor node being accessible by submission of an identifier, the anchor node at least one of containing or referring to sufficient information to obtain access to the blinding factor and the blinded access information, and the identifier for the anchor node being independent of the blinding factor. | 04-01-2010 |
20100083004 | Managing Associations Between Keys And Values - Provided are, among other things, systems, methods and techniques for managing associations between keys and values within a computer processing system. In one exemplary implementation, requests to store associations between keys and data values corresponding to the keys are input, and the associations are stored in entry nodes within a data structure represented as a hash-based directed acyclic graph (HDAG). Upon receipt of a data value request and accompanying request key, together with satisfaction of any additional access criterion, a return data value corresponding to the request key automatically is provided, the return data value having been generated based on at least one of the associations that involve the request key. | 04-01-2010 |
20100098256 | Decryption Key Management - Provided are, among other things, systems, methods and techniques for decryption key management. In one implementation, a decryption key is managed within a computer processing system by (a) creating within the computer system an association between an access token and retrieval information, the access token being a specified function of an identifier for a data object, and the retrieval information including (1) a first entry that corresponds to a value generated by encrypting a decryption key for the data object using a symmetric encryption/decryption key, and (2) a second entry that corresponds to a value generated by encrypting the symmetric encryption/decryption key using an asymmetric public key; and (b) repeating step (a) for a number of different data objects, keeping the symmetric encryption/decryption key identical across repetitions. | 04-22-2010 |
20100106537 | Detecting Potentially Unauthorized Objects Within An Enterprise - One embodiment is a method that observes a first object within an enterprise and then determines that use of the first object by an enterprise is potentially unauthorized. The method then alters a computer model based on the first object and determines based on the model that a second object within the enterprise is potentially unauthorized. | 04-29-2010 |
20100199350 | Federated Scanning of Multiple Computers - A data processing apparatus and associated computer-executed method are adapted for federated scanning of multiple computers. The data processing apparatus comprises a logic that controls scanning among a plurality of data objects distributed among a plurality of distributed electronic data storage systems. The logic maintains a data set of paired location identifiers and intrinsic references corresponding to individual data objects of the plurality of data objects and controls scanning so that redundant scanning of duplicate data objects with matching intrinsic references occurring in multiple locations is avoided. | 08-05-2010 |
20110035376 | STORING NODES REPRESENTING RESPECTIVE CHUNKS OF FILES IN A DATA STORE - To provide a data store, nodes representing respective chunks of files are stored in a predefined structure that defines relationships among the nodes, where the files are divided into the chunks. The nodes are collected into plural groups stored in persistent storage, where some of the nodes are collected into a particular one of the groups according to a locality relationship of the some of the nodes. | 02-10-2011 |
20110060716 | SYSTEMS AND METHODS FOR IMPROVING WEB SITE USER EXPERIENCE - Methods, systems, and computer program products are provided for personalizing web sites. A model based on mining web usage data is accessed. The model defines associations between web sites. Interest associations extracted from web interactions are stored. The interest associations comprise interest indications and web sites associated with the interest indications. An interest indication from the interest associations is selected. The interest indication is associated with an associated web site. The associated web site has an association with a target web site as defined by the model. The interest indication is sent to the target web site. | 03-10-2011 |
20110060717 | SYSTEMS AND METHODS FOR IMPROVING WEB SITE USER EXPERIENCE - Methods, systems, and computer program products are provided for personalizing web sites. A model based on mining web usage data is accessed. The model defines associations between web sites. Interest associations extracted from web interactions are stored. The interest associations comprise interest indications and web sites associated with the interest indications. An interest indication from the interest associations is selected. The interest indication is associated with an associated web site. The associated web site has an association with a target web site as defined by the model. The interest indication is sent to the target web site. | 03-10-2011 |
20110078152 | METHOD AND SYSTEM FOR PROCESSING TEXT - An exemplary embodiment of the present invention provides a method of processing an electronic text document. The method includes obtaining a character from the document. The method also includes obtaining a hash input code from a character map, the hash input code corresponding to the character. The method also includes modifying a hash value based on the hash input code if the hash input code indicates that the character is part of a token, or asserting the hash value if the hash input code indicates that character is not part of a token. | 03-31-2011 |
20110116514 | COMMUNICATION SYSTEM WITH NESTABLE DELIMITED STREAMS - A communication system is adapted for communicating data in nestable delimited streams with support for abort and overlays. The communication system comprises a communication channel that communicates a data stream in multiple delimited streams. The individual delimited streams are delimited by a prefix formed of a delimiter which is generated specific to the data segment and a postfix formed of the generated delimiter followed by a CLOSED indicator. The communication channel nests a second delimited stream within a first delimited stream of the multiple data segments. | 05-19-2011 |
20110119208 | METHOD AND SYSTEM FOR DEVELOPING A CLASSIFICATION TOOL - An exemplary embodiment of the present invention provides a computer implemented method of developing a classifier. The method includes receiving input for a case, the case comprising a plurality of instances and an example, the example comprising a plurality of data fields each corresponding to one of the plurality of instances, wherein the input indicates which, if any, of the instances includes a data field belonging to a target class. The method also includes training the classifier based, at least in part, on the input from the trainer. | 05-19-2011 |
20110119209 | METHOD AND SYSTEM FOR DEVELOPING A CLASSIFICATION TOOL - An exemplary embodiment of the present invention provides a computer implemented method of developing a classifier. The method includes obtaining a set of training data comprising labeled cases. The method also includes training a classifier based, at least in part, on the training data. The method also includes applying the classifier to a plurality of unlabeled cases to generate classification scores for each of the unlabeled cases, wherein each classification score corresponds with an instance of a corresponding case. Furthermore, the classification score corresponding to a first instance in a case is computed based, at least in part, on a value of a case-centric feature corresponding to the first instance, wherein the value of the case-centric feature is based, at least in part, on characteristics of the first instance and a second instance in the case. | 05-19-2011 |
20110119267 | METHOD AND SYSTEM FOR PROCESSING WEB ACTIVITY DATA - The present disclosure provides a computer-implemented method of processing Web activity data. The method includes obtaining a collection of Web activity data generated by a plurality of users at a plurality of Webpages, wherein the Webpages are from a plurality of unaffiliated Websites. The method also includes extracting a plurality of search terms from the Web activity data and associating each of the plurality of search terms with a corresponding Webpage. The method also includes generating statistical data from the Web activity data based, at least in part, on the search terms, the statistical data corresponding to the online activity at one or more Webpages. | 05-19-2011 |
20110119268 | METHOD AND SYSTEM FOR SEGMENTING QUERY URLS - A computer implemented method of grouping query URLs is provided. The method includes obtaining a plurality of query URLs generated at a plurality of Websites. The method also includes analyzing the query URLs to identify similarities between the URLs. The method also includes grouping the query URLs into cases based, at least in part, on the similarities, wherein each case comprises a plurality of instances, and each instance comprises a plurality of data field values corresponding to data fields with a same data field name. | 05-19-2011 |
20110126122 | SYSTEMS AND METHODS FOR GENERATING PROFILES FOR USE IN CUSTOMIZING A WEBSITE - Systems and methods are disclosed for constructing a profile that obtain text associated with web content. Logic instructions are provided by a party that is unaffiliated with a party that provides the web content to allow a profile associated with a user to include information from two or more web sites that are unaffiliated with one another. A match between the text and a target in a target set is detected. The profile associated with the user is modified based on the match. | 05-26-2011 |
20110131184 | FOCUSED BACKUP SCANNING - Methods, systems, and computer program products are provided for performing data backup of a file system. A monitoring process is configured to include a file system representation (FSR) representing the file system, the FSR comprising a plurality of nodes, each node corresponding to a respective one of a plurality of elements of the file system. A monitoring process includes a file system representation (FSR) of a file system. The FSR comprises a plurality of nodes corresponding to a respective one of a plurality of elements of the file system. The monitoring process receives a notification of a change to a first element of the file system, caches information associated with a second element of the file system to provide cached information, and processes the FSR in response to the change. | 06-02-2011 |
20110131185 | HDAG BACKUP SYSTEM WITH VARIABLE RETENTION - A storage system efficiently allocates storage space for data backup. An illustrative storage system comprises a storage and backup logic that manages data backup in the storage and converts a file to a hash-based directed acyclic graph (HDAG) so that a hierarchy of nodes of the HDAGs contain a hash of child nodes. The backup logic creates multiple HDAGs for one or more of a plurality of retention policies and represents directories by a first node containing a payload of metadata and weak references to roots of child nodes, and a second node containing references to the first node and to any HDAGs corresponding to files and/or directories governed by an active policy of the plurality of retention policies. | 06-02-2011 |
20120023127 | METHOD AND SYSTEM FOR PROCESSING A UNIFORM RESOURCE LOCATOR - The present disclosure provides a computer-implemented method of processing a Uniform Resource Locator (URL). The method includes generating a plurality of lattice nodes based on a URL, wherein each of the plurality of lattice nodes includes a host component corresponding to a portion of the URL and a path component corresponding to a portion of the URL. The method also includes identifying one of the plurality of lattice nodes as a search node. The method also includes searching a pattern table database using the search node to find a matching pattern table entry, the pattern table database comprising a plurality of pattern table entries corresponding to known lattice nodes associated with previously encountered URLs. The method also includes processing the URL based on whether the matching pattern table entry was found in the pattern table database. | 01-26-2012 |
20120047180 | METHOD AND SYSTEM FOR PROCESSING A GROUP OF RESOURCE IDENTIFIERS - The present disclosure provides a computer-implemented method of processing a group of resource identifiers. The method includes generating a node candidate based on a resource identifier, wherein the node candidate includes a component corresponding to a portion of the resource identifier according to a dimension of specificity. The method also includes adding the lattice node candidate to a corpus lattice based on whether a matching corpus node corresponding to the node candidate is already included in the corpus lattice. The corpus lattice includes corpus nodes corresponding to a plurality of resource identifiers. The method also includes generating a pruned corpus lattice by a process that includes determining that a child node in the corpus lattice is compatible with a parent node of the child node and removing the child node from the corpus lattice. The method also includes generating an output file corresponding to the pruned URL lattice. | 02-23-2012 |
20130103609 | ESTIMATING A USER'S INTEREST IN AN ITEM - For users in a set of users, corresponding measures of inferred interest in an item are determined. For a particular user, a particular measure of inferred interest in the item is determined. The particular measure of inferred interest and the measures of inferred interest corresponding to the users in the set of users are used to determine an estimate of the particular user's interest in the item. | 04-25-2013 |
20130110839 | CONSTRUCTING AN ANALYSIS OF A DOCUMENT | 05-02-2013 |