Abstract: A system for the support and management of search for documents is presented. The system includes knowledge-database, query interface and communication to a database of documents to be searched. Information generated during a search session is collected by the system and is added to the knowledge-database. The information is ranked automatically according to the usage of that information by the user. During successive search session, or during search made by other users, the system uses the knowledge-database to support the users with keywords, queries and reference to documents.

Abstract: Scheduling of backup jobs is optimized in accordance with a characteristic of the backup jobs. The characteristic of the backup jobs can take into account a number of the backup jobs that are stale. A stale backup job is a backup job in which no backed up data changed during a most recent performance of the backup job.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for clustering videos and using video clusters to present content. One method includes generating target video-specific clusters of co-watched videos for target videos, according to keywords for each target video, and storing data associating the target video with its clusters. The clusters can then be used in various applications, including identifying related videos, augmenting video search results, re-ordering video search results, and identifying content for a target video.

Abstract: Embodiments provide an approach for efficiently searching a temporal key index as well as enforcing key distinctiveness property in a database table corresponding to the index. For example, by addressing time range overlaps in an index having a sort order for temporal keys, a database management tool of a server system may efficiently process client requests while enforcing a temporal key property in the database table.

Abstract: A method for data sharing between conditionally independent filters is provided. The method comprises initializing a plurality of conditionally independent filters operating in parallel, processing data measurements in each of the conditionally independent filters, sharing conditioning node estimates among the conditionally independent filters, merging the shared conditioning node estimates in each of the conditionally independent filters, and performing a conditional update in each of the conditionally independent filters.

Abstract: For enabling a fast reverse lookup of parent directories storing records of hard links to a specified regular file, a file system manager maintains a hard link database (HLDB) storing information for addressing hard links to the regular files having multiple hard links. The HLDB contains a corresponding HLDB file for each regular file having multiple hard links. In a preferred implementation, the inode of each regular file stores the addressing information for one hard link to the regular file, a corresponding HLDB file stores the addressing information for other hard links to the regular file, each HLDB file is a directory accessed by invoking file system manager directory access routines, and the HLDB has a directory tree providing a multi-level hash index for searching the HLDB given the inode number of a regular file.

Abstract: A virtual regulator implemented to provide closed-loop system management (CLSM) functionality to a database system and without a need to substantially adapt a given CLSM technology to account for specific nuances and requirements of an operating system. For example, the regulator may be implemented with either or both of process model operating systems and thread model operating systems. Common examples of these include UNIX, LINUX, MP-RAS, MS WINDOWS or WINDOWS NT.

Abstract: Embodiments of articles, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed herein including, for example, an apparatus that includes a computing platform to transform between a tree and a condensed array of numerals.

Abstract: A method and system for controlling disclosure of trace data related to moving object. The method includes the steps of: receiving, for at least one moving object in a first region, a first record aggregate; receiving, for at least one moving object in a second region, a second record aggregate; calculating trace data from at least one attribute value of a first identifier that is in received first and second record aggregates in response to data search request; calculating to satisfy a condition of the moving object passing through at least one region and to satisfy another condition of at least two of the moving objects being present in each of the region; and returning calculated trace data as a search result if the moving object moves in calculated ranges and if the moving object has the first identifier that is in both the received first and second record aggregates.

Abstract: Disclosed herein are embodiments of a system and method for the dynamic provisioning of static content. In one embodiment, information presented on a content delivery system can be refreshed based on information published on a content management system. One embodiment can interface the content delivery system and the content management system at the page level. More specifically, content dependencies across pages employing the same content or portion(s) thereof can be tracked in a timely, accurate manner. Upon receiving a notification of a change to the content or a portion thereof from the content management system, a content generation system may operate to determine, based on the dependencies, what pages are affected by the change and, based on the determination, dynamically regenerate any and all affected pages. The regenerated pages may then be stored and/or pushed to the web tier for delivery to end users.

Abstract: A directed graph of data includes nodes 10, properties 22 attached to nodes and resources 34. The nodes 10, properties 22 and resources 34 are classified as indexable or non indexable. At least one property 30 links a pair of nodes, one node being a parent and one being a child. An indexing algorithm indexes each indexable property pointing to a resource as related to any respective indexable nodes linked to the node to which the indexable property is attached through a chain of indexable links from child to parent through intermediate nodes, all of which are non-indexable.

Abstract: A query may be rewritten to leverage information stored in a structured XML index. An operator in the query may be analyzed to determine an input source database object for the operator by traversing an operator tree rooted at the operator. The path expressions associated with the operator tree may be fused together to form an effective path expression for the operator. If the effective path expression directly matches a path expression derived from the index, the query may be rewritten using references to the index. Operators in a query that have effective paths that refer to data in the same index table may be grouped together. A single subquery may be written for a group of operators. Also, a structured XML index may be used as an implied schema for indexed XML data. This implied schema may be used to optimize queries that refer to the indexed XML data.

Abstract: A system includes an active node and a standby node and zero or more replica nodes. Each of the nodes includes a database system, such as an in-memory database system. Client updates applied to the active node are written through to the standby node, and the standby node writes the updates through to a primary database and updates the replica nodes. Commit ticket numbers tag entries in transaction logs and are used to facilitate recovery if either of the active node or the standby node fails. Updates applied to the primary database are autorefreshed to the active node and written through by the active node to the standby node which propagates the updates to the replica nodes. Bookmarks are used to track updated records of the primary database and are used to facilitate recovery if either of the active node or the standby node fails.

Abstract: A method of playing a rich content stream that includes a media stream and a descriptive stream. The method may include the steps of receiving the rich content stream at a media player, where the descriptive stream is generated from a rich content file executed separately from a source for the media stream, and where the media stream and the descriptive stream are received as separate streams at the media player. The method may also include synchronizing the media stream and the descriptive stream at the media player so that information in the descriptive stream is temporally synchronized with media content playing from the media stream. In addition the method may include activating the playing of the descriptive stream while the media stream is playing on the media player, where descriptive content from the descriptive stream is not played on the media player until being activated by a user.

Abstract: An elastic parallel database system where metadata is specified out-of-band during database operations via a set of augmentation rules. The rules are used to augment or modify commands received, and indicate whether they are to be used for specific connections on which they are received, for all client connections, or some other scope.

Abstract: The present invention generally relates to data processing and, more particularly, to managing operation of user-defined functions on a partitioned database. One embodiment provides a computer-implemented method for managing execution of a query against a partitioned database having a plurality of data partitions. The method comprises, for each of the plurality of data partitions, examining data of the data partition, and on the basis of examined data, implementing a modified form of a user-defined function on the data partition. The method further comprises executing the query referring to the user-defined function against the plurality of data partitions, wherein execution of the query on each data partition invokes execution of the respective modified form of the user-defined function against the data of the respective data partition.