Abstract: In one embodiment, a software system automatically generates a fully functional user interface (UI) based upon any underlying schema within a relational database management system (RDBMS). The UI derives from an automated interrogation of the schema, and comprises all mode displays (e.g., browse, search, edit, add) for all tables, along with integrated mechanisms for representing, navigating and managing relationships across tables. It utilizes a hierarchical “context stack” for suspending the working state of a particular table while “drilling down” to work with related-table information and (potentially) return relevant changes to the base table. The UI presentation resolves cross-table relationships so as to supplant internal key fields from the primary table with corresponding descriptive fields derived from the related tables.

Abstract: An improved method of facilitating contact between mutually interested people takes advantage of existing contact lists such as those on social networking sites, instant messaging programs, or cell phones. A program is integrated into one or more of those technologies, allowing the user to characterize each contact on the basis of the user's level of interest in that contact as a date. The program keeps these rankings secret until two users indicate an interest in each other that surpasses a certain threshold. The users are then notified of the mutual interest. Ads and dating advice are sent along with the notification.

Abstract: A data storage management approach is disclosed that performs backup operations flexibly, based on a dynamic scheme of monitoring block changes occurring in production data. The illustrative system monitors block changes based on certain block-change thresholds and triggers block-level backups of the changed blocks when a threshold is passed. Block changes may be monitored in reference to particular files based on a reverse lookup mechanism. The illustrative system also collects and stores historical information on block changes, which may be used for reporting and predictive analysis.

Abstract: An event-related media management system contextualizes media content. The event-related media management system associates media content with contextual event-related data to associate the media content with the events and information about the events. The contextual event-related data can then be used to provide access to the media content, such as through relevant search results or by presenting the media content in organized displays for contextual browsing and navigation. In some embodiments the event-related media management system generates contextualized media content for contextual search, discovery, and advertising.

Abstract: User attribute data associated with a user may be used to resolve unresolved entities in connection with the performance of computer-based actions, e.g., actions resulting from action queries generated based at least in part on content being accessed on a computing device.

Abstract: Systems and techniques for indexing and/or querying a database are described herein. Discrete sections and/or segments from documents may be determined by a concept indexing system. The segments may be indexed by concept and/or higher-level category of interest to a user. A user may query the segments by one or more concepts. The segments may be analyzed to rank the segments by statistical accuracy and/or relatedness to one or more particular concepts. The rankings may be used for presentation of search results in a user interface. Furthermore, segments and/or documents may be ranked based on recency decay functions that distinguish between segments that maintain their relevance over time in contrast with temporal segments whose relevance decays quicker over time, for example.

Abstract: Generation of a schema of a NoSQL type database, where a set of entry(ies) of a NoSQL type database can be determined, and the record schema is a treelike relationship between key hierarchies with a key as a node in the entry, wherein the key corresponds to an attribute name. For at least one record schema, a node in which there is an attribute name variation is determined based on a similarity of sub-nodes in the treelike relationship, and the record schema is updated according to the determined result. The schema of the NoSQL type database is generated based on the updated record schema.

Abstract: Techniques for cross-ACL multi-master replication are provided. The techniques allow a replication site in a multi-master replication system implementing an asynchronous replication protocol and an access control policy to appropriately apply received data change updates to data maintained at the site even where a data change update is missing information because of the implemented access control policy.

Abstract: Release and re-acquisition of each of a first shared lock on an outer database ownership table and a second shared lock on an inner database ownership table is alternated by a messaging engine processor that executes a messaging engine to permit database maintenance operations to be performed while maintaining the ownership of the database. At least one period of inactivity of both the outer database ownership table and the inner database ownership table is provided that allows at least one database tool to execute to perform at least one database maintenance task during the execution of the messaging engine.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for a distributed parallel processing database system that persists table data in memory to a distributed file system. A distributed parallel processing database system persists table data in memory to a distributed file system. A parameter of creating a database table specifies that data records in the database table and history of changes to the data records can be stored in memory as well as in the distributed file system. When the database table is populated or otherwise modified, data records and the history in memory are evicted to the distributed file system as log files and removed from memory. The log files can be designated as write-only, where the data records, once written, cannot be read by structured query language (SQL) queries, or as read-write, where the data records, once written, can be read by SQL queries.

Abstract: A method is provided for generating a classification model configured to select an optimal execution combination for query processing. The method includes providing training queries and different execution combinations for executing the training queries. Each different execution combination involves a respective different query engine and a respective different runtime. The method includes extracting, using Cost-Based Optimizers (CBOs), a set of feature vectors for each training query. The method includes merging the set of feature vectors for the each of the training queries into a respective merged feature vector to obtain a set of merged feature vectors. The method includes adding, to each of the merged feature vectors, a respective label indicative of the optimal execution combination based on actual respective execution times of the different execution combinations, to obtain a set of labels. The method includes training the classification model by learning the merged feature vectors with the labels.

Abstract: A computer-implemented method includes receiving a query referencing entities, and determining non-polar questions (NPQs) for the query. Each of the NPQs omits a respective target entity (TE) of the entities. The method includes determining, for each of the NPQs, whether the NPQ is a non-matching NPQ by determining whether a top ranked answer for the NPQ matches the TE of the NPQ. The method includes proceeding to determine an updated input statement (UIS) for a non-matching NPQ by replacing the TE of the non-matching NPQs with the top ranked answer for the non-matching NPQ, determine an updated NPQ for the UIS, and determine whether the top ranked answer for the updated NPQ matches the TE of the updated NPQ, in an iterative or recursive manner. The method includes outputting a UIS as a substitute statement for the query.

Abstract: The present invention provides systems and methods for automatically identifying name-like-strings in digital resources, matching these name-like-string against a set of names held in an expertly curated database, and for those name-like-strings found in said database, enhancing the content by associating additional matter with the name, wherein said matter includes information about the names that is held within said database and pointers to other digital resources which include the same name and it synonyms.

Abstract: A versioned file storage system (VFS) and method for operating and using the same is disclosed. In an aspect, a mechanism is provided wherein a first VFS interface unit coupling the VFS to a local data storage system is replaced with a second VFS interface unit in a coordinated procedure for taking the first unit offline, making a reliable snapshot of its data and cache structure in the VFS, and loading the same data and cache structure into the second VFS interface brought online. The first and second VFS interfaces transfer the necessary data to achieve the switch through respective side-loading daemons running in each interface. Clients in the local data storage system experience minimal interruption of services in the VFS.

Abstract: Computer-implemented methods for accessing a particular element of a plurality of elements stored in an N-way linked list in a computer memory provide for adding or removing elements at locations within the list. The methods may be employed with LIFO or FIFO N-way linked lists. The methods may include traversing the N sub-lists in parallel as well as the use of single instruction multiple data operations.

Abstract: An electronic media distribution/play system includes a service facility that has a communications network interface and maintains a data file catalog. The catalog is sent over the network to requesting users, and the system processes payments from customers in establishing file access authorizations. Encrypted user-selected files and a player program are transmitted to each customer for metered access to received data files as limited by the authorization, and customers can make additional selections and play the encrypted files freely while the authorization remains established. The system can transmit the data files from local storage, and also provide links to encrypted files that are stored at remote vendor facilities. Authorizations can be for selected portions or class levels of the catalog, and for terms measured as calendar time, play time, and collective number of plays. Also disclosed is a method for facilitating the distribution and accessing of electronic files.

Abstract: A method for making a zoomable user interface for a television (TV) comprises the steps of: assigning a plurality of tags to a video title; collecting tags of a plurality of video titles of a video group; building a tag-relationship map based on a relationship of the tags, wherein the tag-relationship map represents a hierarchical structure of the tags in the video group; building a plurality of tag trees based on the hierarchical structure of the tags; calculating each total distance of each of the plurality of tag trees, wherein the total distance of the tag tree is a sum of distances from a root node to all nodes in the tag tree; and displaying the zoomable user interface having a minimum value of the total distance of the tag tree.

Abstract: The present invention relates to a management system, a search method, and a browsing method of a unified data object using a tag object. A unified data object management system and method may efficiently access and manage the data object by storing and managing the unified data objects including a file, non-file data, or dynamic data on the basis of the tag object and then providing a search result based on the tag object when a search command is entered by a user.

Abstract: A frame represents a concept with a set of roles and a set of linguistic rules. If a linguistic rule is satisfied, by a unit of natural language discourse (UNLD), the frame is invoked and a frame instance produced. A frame instance specifies how the UNLD, with particular values drawn from the UNLD, fulfills the roles of the frame. A frame-based search, of target content, is accomplished in response to a frame-based user query. The search result is comprised of records, where each record is a result of a match, of the frame-based query, at a location in the target content. If the frame-based query is implicit, a match requires only that the location of the target content invokes the appropriate frame. If the frame-based query is role-specific, in addition to invoking the appropriate frame, a query search term needs to be found in the value for a role of the frame instance produced.

Abstract: Methods and systems for querying application metadata objects are provided. The method may comprise receiving a query identifying an application; executing the query against a metadata model for the application to obtain a result, the result identifying a first metadata object satisfying the query, wherein the metadata model identifies a plurality of metadata objects and hierarchical relationships between the plurality of metadata objects, and wherein the metadata model comprises information about structure and semantics of data used by the application; determining, from the plurality of metadata objects, a second metadata object referenced by the first metadata object; determining, from the plurality of metadata objects, a third metadata object that is a parent object of the first metadata object; building a directed graph including the first metadata object, the second metadata object, and the third metadata object; and providing a response including the directed graph to the query.