Abstract: A device relative to a delta indexing method for a hierarchy file storage including a from-end side file server and a back-end side file server is provided. The front-end side file server creates a file update list for accumulating a file update history in a file system therein, a search server requests the file update list to the front-end side file server, and the front-end side file server supplies path name information of a targeted file in the back-end side file server in addition to the file update list, thereby, the search accesses tot the back-end side file server to be able to acquire necessary information for a search index update.

Abstract: A content search device includes a feature quantity computing unit that computes a feature quantity of at least any one of an image feature, an acoustic feature and a semantic feature included in each piece of content data, and that stores feature quantity data. The device also includes an unknown feature quantity computing unit that computes an unknown feature quantity of each feature type not associated with a content identifier in the feature quantity data by use of the feature quantity of the feature type associated with the content identifier, and that stores the unknown feature quantity as a feature estimated value in the feature quantity data. The device further includes a distance computing unit that computes a distance indicating a similarity between each two pieces of content data based on the feature quantities and the feature estimated values stored in the feature quantity data.

Abstract: A database server determines, on an element-level of granularity, what form of VARRAY storage to map collections of elements defined by a XML schema. A collection element may be mapped to an in-line VARRAY or an out-of-line VARRAY. The determination may based on a variety of factors, including the database type mapped to the collection element, database limitations that limit the form storage for certain database types, and annotations (“mapping annotations”) embedded within that XML schema that specifying a database type for database representation of a collection element or a form of VARRAY storage.

Abstract: An information locating method and system. The method includes presenting by a computer processor, a Webpage to a user. The computer processor receives a search command for performing a search function associated with the Webpage. In response, the computer processor: analyzes source code of the Webpage; downloads and analyzes files associated with the Webpage; and analyzes viewable information of the Webpage. The computer processor locates specified information associated with the Webpage.

Abstract: One aspect of the present invention includes a configuration of a storage management system that enables the performance of deduplication activities at both the client (source) and at the server (target) locations. The location of deduplication operations can then be optimized based on system conditions or predefined policies. In one embodiment, seamless switching of deduplication activities between the client and the server is enabled by utilizing uniform deduplication process algorithms and accessing the same deduplication index (containing information on the hashed data chunks). Additionally, any data transformations on the chunks are performed subsequent to identification of the data chunks. Accordingly, with use of this storage configuration, the storage system can find and utilize matching chunks generated with either client- or server-side deduplication.

Abstract: Systems, methods and computer program products for statement categorization and normalization are described herein. An embodiment includes a statement categorizer and a statement normalizer. The statement categorizer categorizes statements to reduce or even eliminate inconsistencies that may arise between primary and replicate databases as a result of executing certain statements. Categorized statements are normalized by the statement normalizer to generate normalized statements, which are provided to a replication server. Normalized statements assist replication server to regenerate a statement to be executed on a replicate database.

Abstract: The present invention relates to the technical field of data or file synchronization. In particular, the present invention relates to a method and system for data synchronization using character string matching. Provided are a method, computer program product, and system for data synchronization between a source node and target node. An old copy and a new copy of data to be synchronized is received. A block map is generated according to the difference determined using character string matching between the old copy and the new copy. The block map, which includes the position information of unchanged blocks and the position information and contents of changed blocks, is transmitted to a target node.

Abstract: Object are created such that each of the objects stores a bit that designates eventual removal of one of the objects. Further, the objects are added to a data structure that includes a set that comprises a union of a plurality of subsets such that each subset in the plurality of subsets is stored separately according to a corresponding thread and such that an added object that is added to the set by a given thread is stored in the corresponding subset. In addition, one of the objects is logically removed, without physical removal, from the set by activating the bit. Each subset is periodically swept. All objects marked with the activated bit are physically removed.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving user input associated with a resource of a plurality of resources, storing the user input as a factor associating the resource with a user, receiving a search query, the search query identifying the user, processing data based on the search query and the factor to generate one or more search results, the one or more search results including an indicator associated with the resource, the indicator indicating that the one or more search results are associated with the user, and transmitting the one or more search results for display on a computing device.

Abstract: Embodiments of the present invention relate to displaying and navigating within photo placemarks in a geographic information system. In an embodiment, a method registers a photographic image in a geographic information system. A location of the photographic image within geographic information of the geographic information system is determined based on the geographic information and a metadata of the photographic image. The location of the photographic image is stored.

Abstract: Aspects of the present invention provide a tool for hash-based indexing. In an embodiment, a ranked dataset having a plurality of data items is obtained. Every data item in the ranked dataset has a ranking with respect to every other data item in the ranked dataset. A ranking triplet matrix is created based on the ranked dataset. The ranking triplet matrix has a set of ranking triplets, each of which indicates the relative ranking for a pair of the data items in the ranked dataset. This ranking triplet can be merged with a hash table obtained using a standard hash function and the data items can be indexed based on the results.

Abstract: A method and system for automatically and transparently managing a directory in a database system to preferentially use of objects in an in-memory database instead of copies of the objects in disk-based databases, in order to speed up application response times. The methods and systems selectively add or update LDAP entries to leverage advantage of the database objects in the in-memory database, so that the LDAP entries point to the in-memory database instead of disk-based databases.

Abstract: Aspects of the present invention provide a tool for hash-based indexing. In an embodiment, a ranked dataset having a plurality of data items is obtained. Every data item in the ranked dataset has a ranking with respect to every other data item in the ranked dataset. A ranking triplet matrix is created based on the ranked dataset. The ranking triplet matrix has a set of ranking triplets, each of which indicates the relative ranking for a pair of the data items in the ranked dataset. This ranking triplet can be merged with a hash table obtained using a standard hash function and the data items can be indexed based on the results.

Abstract: A method and system are presented for configuring a search algorithm for solving a combinatorial optimization problem. The search algorithm has a number of procedural components. Each procedural component is configured using a respective data structure. The data structure has a tree structure, including traversal split nodes, each of which represents a choice to be made when configuring the procedural component of the search algorithm. Configuring the procedural component corresponds to traversing the tree structure, and the traversal is performed automatically. At each of the traversal split nodes, the choice of which direction to take through the tree structure is made randomly, using a respective probabilistic function. Thus, a population of candidate algorithms is generated. These are evaluated, and the probabilistic functions modified.

Abstract: A distributed search system can include a group of nodes assigned to different partitions. Each partition can store indexes for a group of documents. Nodes in the same partition can independently processing document-based records to construct the indexes. One of the nodes can process a stored checkpoint to produce a repartitioned checkpoint. The group of nodes can respond to search requests during the construction of the repartitioned checkpoint. The repartitioned checkpoint can be loaded into the group of nodes to repartition the group of nodes.

Abstract: Method and apparatus for recording associations with logs are described. In one embodiment, the method comprises obtaining a first media identifier corresponding to a first media; accessing a log that contains one or more entries that associate two or more media identifiers with each other; and determining that the first media is related to a second media based on the log indicating that a second media identifier is associated with, but different from, the first media identifier.

Abstract: A user who is browsing the web may use a web site verification service to ascertain whether a web site that appears to be associated with a trusted entity is actually associated with that entity. The web site verification service retains the URL of an unauthenticated web site. The user types a text string naming the entity that the user believes should be associated with the web site into a text box. A database such as an internet search engine database or a database containing a list of trusted entities and their URLs may be queried using the user-supplied text string. The retained URL may be compared to the resulting list of URLs. If the retained URL does not match one of the URLs in the query results, the user may be warned that the web site does not appear to be associated with the trusted entity.

Abstract: Systems, methods, and apparatuses, including computer program products, are provided for machine translation using information retrieval techniques. In general, in one implementation, a method is provided. The method includes providing a received input segment as a query to a search engine, the search engine searching an index of one or more collections of documents, receiving one or more candidate segments in response to the query, determining a similarity of each candidate segment to the received input segment, and for one or more candidate segments having a determined similarity that exceeds a threshold similarity, providing a translated target segment corresponding to the respective candidate segment.

Abstract: A method and apparatus for performing a reverse name lookup in a file system is described. A file system driver executing on the computing system agent may receive a reverse name lookup request for an inode number. The file system driver retrieves a disk inode, corresponding to the inode number, a first block number of a first directory entry (dentry), the first dentry identifying directory data blocks where the inode number and a file name are stored. The file system driver searches the first dentry for the inode number to find the corresponding file name, and retrieves the file name from the first dentry.

Abstract: In a database system having processing units, a request is received to calculate aggregates of multiple combinations of a given set of columns. The processing units are divided into multiple groups, where each of the multiple groups includes a corresponding subset of the processing units. Within each of the groups, data of each processing unit in the group is replicated to other one or more processing units in the group. Within each of the groups, aggregates of at least some of the multiple combinations of the given set of columns are calculated by the processing units in the group using the replicated data.