Abstract: A method for loading data into an alternate evaluator for evaluating directory service operations includes loading data into a list of entries. Loading data into a list of normalized values and associated pointers. Loading data into a list of indexes and associated pointers.

Abstract: Methods for organizing and retrieving data values in a persistent data structure are provided. Data values are grouped into data blocks and pointers are obtained for each data block. In addition, one or more summaries, related to a properties of the data block, are created and associated with the data block's pointer. The summaries allow for a more efficient retrieval of data values from the data structure by preventing unnecessary retrieval calls to persistent storage when the summaries do not match query criteria.

Abstract: A system and method for configuring a storage network utilizing one or more storage appliances to utilize the multi-block based protocol nature of the storage appliances. By configuring the storage network, data served by the storage appliance may be accessed by a plurality of protocols simultaneously. Illustratively, a virtual disk (vdisk) may be access by clients using the FCP protocol over a FC network while other clients access the vdisk using the iSCSI protocol over a TCP/IP network.

Abstract: Techniques, an apparatus and an article of manufacture for distributed scalable clustering and community detection. A method includes generating a label for each node in a graph, wherein said label identifies a community in which a node participates, propagating each label locally within two or more segments of the graph based on a participation percentage of each node in at least one identified community within the graph, and deriving at least one cluster of nodes in the graph that corresponds to the at least one identified community based on said propagating.

Abstract: Disclosed are various embodiments for a catalog mapping tool application. The application is executable in at least one computing device and comprises logic that identifies a first attribute-value pair of an item within a user catalog of items, wherein the first attribute-value pair corresponds to a first value format. Additionally, the application comprises logic that suggests one of a plurality of metadata maps for translating the first value format into a second value format. Furthermore, the application comprises logic that generates a second attribute-value pair encoded in the second format using a selected one of the metadata maps.

Abstract: A computer is programmed to compress data of a database in response to database modification language (DML) statements generated by on-line transaction processing (OLTP) systems. In several embodiments, data that is initially added to a database block is left uncompressed until a predetermined condition is satisfied, which happens infrequently (relative to OLTP transactions on the block). When satisfied, the computer automatically compresses all uncompressed data in the block, which increases the amount of unused space in the block. New data is thereafter added uncompressed to the partially compressed block, until satisfaction of a predetermined condition whereby the partially compressed block is again compressed, i.e. re-compressed. Adding of new data to a partially compressed block and its compression are repeated unless another predetermined condition is met, in response to which the block is not further re-compressed, thereby to recognize a limit on the benefit from compression.

Abstract: Profiles associated with two applications are received. Each profile identifies a set of data fields identified by a corresponding full path name. Associations between data fields of the profiles are identified based on mapping pairs included in a full path mapping database, mapping pairs included in a shortest unique path mapping database, and mapping pairs included in a leaf mapping database. A prioritized list of mapping suggestions is provided based on the identified associations. A mapping suggestion can include a data manipulation operation according to information associated with a corresponding mapping pair.

Abstract: A system and method for data deduplication is presented. Data received from one or more computing systems is deduplicated, and the results of the deduplication process stored in a reference table. A representative subset of the reference table is shared among a plurality of systems that utilize the data deduplication repository. This representative subset of the reference table can be used by the computing systems to deduplicate data locally before it is sent to the repository for storage. Likewise, it can be used to allow deduplicated data to be returned from the repository to the computing systems. In some cases, the representative subset can be a proper subset wherein a portion of the referenced table is identified shared among the computing systems to reduce bandwidth requirements for reference-table synchronization.

Abstract: A method of operation of a navigation system includes: detecting a search string; determining a forward-element using a forward-boundary within the search string in a forward direction; determining a backward-element in a backward direction up to the forward-boundary using a backward-boundary within the search string; and determining a matching result for the search string using the forward-element and the backward-element for displaying on a device.

Abstract: One embodiment is a method that stores metadata about files separately from directories for the files in storage devices and represents the directories as a tree structure in which entries refer to separate storage blocks that include the metadata with each of the separate storage blocks storing metadata for only a single file.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for scheduling resource crawls. In one aspect, a framework is provided for scheduling resource crawls such that a crawl scheduler determines the health of a document, i.e., whether it can be crawled, the popularity of the document, and the frequency of “interesting,” i.e., substantive, content changes, and based on this information, estimates an appropriate crawl interval for each web resource to improve crawl resource utilization.

Abstract: A computer-implemented method for archiving information includes: executing a first application in a first process; determining that the first application is an archiving application configured to archive information stored in a transactional system; assigning, based on the determination, an archiving mode to the first process; receiving, from the first process and after assigning the archiving mode, a request to delete information; and processing the request to delete information according to the archiving mode.

Abstract: The invention enables a correlated or multi-row subquery (CSQ) to be performed on distributed MPP and shared-nothing databases by broadcasting intermediate results, prior to a correlation operation, from subquery execution on one segment to all other segments in the distributed database so that the respective CSQs of each segment will have access to the necessary results to permit correct execution of the CSQ. Additionally, the intermediate results are saved to disk to avoid the necessity of replicating the same intermediate results multiple times during execution of a subquery plan.

Abstract: A client device is configured to generate checksums for attributes of product records to be transmitted to a marketplace operator system that provides an e-commerce marketplace. On subsequent transmissions of the product records, the client device can utilize the checksums to determine if the attributes of the product records have been modified since a previous transmission. If the attributes have not been modified, the client device does not re-transmit the unchanged attributes to the e-commerce marketplace. The client device may also be configured to retrieve a checksum configuration file from the marketplace operator system that includes data defining the manner in which the client device should compute the checksums.

Abstract: A computer-implemented method for selecting a portion of a content repository for replication including receiving an input describing one or more desired relationship patterns for replication, generating a query for the desired relationship patterns, identifying content items of a content repository matching the desired relationship patterns, and selecting the identified content items of the content repository. The input is received at a graphical user interface (GUI). The GUI operates on a computer. The relationship patterns are associated with an ontology describing relationships between content items in a content repository. The content repository includes a plurality of content items.

Abstract: A computer-implemented method for selecting a portion of a content repository for replication including monitoring a usage pattern of a content repository, determining one or more preferred relationship patterns for replication in response to the usage pattern, identifying content items of the content repository matching the preferred relationship patterns, and selecting the identified content items of the content repository. Monitoring the usage pattern is performed by a pattern recognition engine operating on a computer. The content repository includes two or more content items. The relationship patterns are associated with an ontology describing relationships between content items in the content repository.

Abstract: A client accepts 20 an input query, rewrites 22 the query and forwards 24 the query to a database server, which returns 26 results which are then rewritten 28. The database includes classes arranged hierarchically as superclasses and subclasses, and/or properties also arranged hierarchically as superproperties and subproperties. In embodiments, the query is rewritten 22 to replace each instance of each class and each property in the input query with the transitive closure of the respective class or property. The client allows inferencing whether or not this is supported by the database server.

Abstract: Selecting and providing context information relevant to a user at a particular time and location. Input parameters such as a location and time are selected. Context information is obtained for the selected location and time based on the input parameters. Exemplary input parameters include a user activity history, user content such as calendar appointments, social networking data, and a state of a computing device of the user (e.g., as collected by sensors of the computing device). The computing device of the user presents the obtained context information to the user at the selected location and time.

Abstract: Embodiments of the present invention relate to systems, methods, and computer-storage media for affinitizing datasets based on efficient query processing. In one embodiment, a plurality of datasets within a data stream is received. The data stream is partitioned based on efficient query processing. Once the data stream is partitioned, an affinity identifier is assigned to datasets based on the partitioning of the dataset. Further, when datasets are broken into extents, the affinity identifier of the parent dataset is retained in the resulting extent. The affinity identifier of each extent is then referenced to preferentially store extents having common affinity identifiers within close proximity of one other across a data center.

Abstract: Enhanced browser caching is provided through a file identifier attribute employed at a front end server level for deterministic marking A front end server may use an attribute of a file identifier such as an attached parameter, a pattern, a directory associated with the file, or similar attributes to change the links it emits into other content in order to prompt the browsers to request new files. The attribute may be changed (e.g. incremented) based on a web change associated with the content being served.