Abstract: Hash based data processing generates an output dataset based on combining a plurality of input datasets. Input datasets may be divided into a plurality of portions using a hashing algorithm that hashes based on a data attribute of at least one of the input datasets. Pairs of the portions may then be combined through join operations that may be performed at least partly in parallel, based on the data attribute used in the hashing algorithm. The combined dataset portions resulting from the join operations may then be combined to generate an output dataset to be stored in a location that is accessible to user devices. In some cases, one or more step datasets may be generated and stored prior to the output dataset, the step dataset(s) including subset(s) of the data in the output dataset.

Abstract: Databases and methods for storing, processing and searching data in database tree structures are provided. More particularly, a method for processing data stored in database tree structures for use in data packet routing applications, and a method of searching a database containing data stored in a tree structure, using a search key, are provided. The tree structure includes a plurality of nodes. Data relating to a first node and a second node is stored in the database. The data includes a first node key and a second node key which is prefixed by the first node key. The tree structure is searched using a search key by traversing the second node and determining if the first node key has a prefix which matches the search key.

Abstract: Methods and systems for generating concept structures from signature reduced clusters (SRCs) are provided. The method includes retrieving at least one SRC including a cluster of signatures respective of a plurality of multimedia data elements (MMDEs); generating at least one metadata for each signature of the cluster of signatures; identifying a number of repetitions of a metadata of the at least one generated metadata; and determining whether the number of repetitions of the metadata exceeds a predefined repetition threshold; upon determining that the number of repetitions of the metadata exceeds the predefined repetition threshold, identifying the metadata as representative of the SRC; comparing the representative metadata to metadata that is representative of at least one previously generated SRC to determine a metadata match; and upon determining the metadata match, identifying the retrieved SRC and the matching previously generated SRC as a concept structure.

Abstract: Content items, such as e-books, audio files, video files, and the like, may be tagged as associated with a location based on observing the locations at which users access the content items. A rich set of tag data may be gathered by additionally observing such things as the date and time when users access the content items as well as allowing the users to tag the content items with comments or ratings. A fine granularity of tagging may be achieved by associating the tags with specific portions of the content items. Content recommendations based on the tags may be provided to other users when those users are in approximately the same location.

Abstract: A file synchronization method includes determining whether a terminal apparatus is capable of receiving a file in response to a synchronization request for the file, and converting the file into a format usable by the terminal apparatus, when that the terminal apparatus is capable of receiving the file is determined by the determining.

Abstract: Methods and apparatus for processing autocomplete suggestions. Some implementations are directed to methods and apparatus for generating additional suggestions for provided multiple term autocomplete suggestions and determining additional suggestion scores for the additional suggestions. Like entries among the additional suggestions and the autocomplete suggestions may be identified and each similar grouping of the like entries combined into a consolidated entry. A combined consolidated score for each consolidated entry may be determined based on one or more of the additional suggestion scores and any of the autocomplete scores of the like entries combined into the consolidated entry.

Abstract: In one embodiment, a method for writing data to a magnetic recording tape includes writing a plurality of files to a first partition of a magnetic recording tape using a tape drive, and writing an index to a second partition of the magnetic recording tape using the tape drive, the index including information about locations of data of the plurality of files in the first partition of the magnetic recording tape.

Abstract: A method of identifying metadata referenced by a quota tree. A quota tree metafile is accessed, and this quota tree metafile includes references to locations of inode grouped data structures associated with quota trees. Here, each quota tree is allocated an inode grouped data structure. A reference to a location of an inode grouped data structure that is allocated to the quota tree is identified from the quota tree metafile. The inode grouped data structure is accessed based on the reference, and this inode grouped data structure defines a set of inode identifiers associated with the quota tree. An inode grouped data structure that stores the metadata is then located using the set of inode identifiers as index.

Abstract: A disjoint partial-area taxonomy abstraction network and methods of producing same for a hierarchy, which partitions overlapping concepts into singly-rooted disjoint groups that are more manageable to work with and comprehend. This provides abstract models for summarizing overlapping concepts which permit enhanced, high-level display for users at a user interface.

Abstract: The present invention extends to methods, systems, and computer program products for recommending data sources. A request to provide recommendations of data enrichments for a database is received at a recommendation engine. The recommendation engine may perform static and dynamic analysis of data associated with the database and may further refine recommendations based on policies. The recommendation engine may then provide the recommendations, if any, of data enrichments to allow a software developer, for example, to indicate whether the data enrichments are to be used.

Abstract: Provided are techniques for receiving a record, wherein the received record has a space-time feature, selecting candidate entities using the space time feature, performing space time analysis to determine whether the received record should be conjoined with a candidate entity from the candidate entities, and, in response to determining that the received record should be conjoined with the candidate entity, making an entity resolution assertion by conjoining the received record and the candidate entity to form a newly conjoined entity.

Abstract: A media item recommendation rating system and method are provided. A recommendation rating for media items is established and dynamically updated in response to media items being recommended to other users. A recommendation server or other device receives a report of a media item recommendation and updates a recommendation rating in response. The recommendation rating may also be updated based on how often a recommended media item is used or played. Thus, a media item's recommendation rating is affected by events relating to its recommendation, as opposed simple play-based ratings that are updated on any play action regardless of whether related to a recommendation or not. Simple play-based ratings do not distinguish between ordinary usages or plays and those resulting from recommendations.

Abstract: A content distribution system allows authors to freely syndicate their content to content distributors in a way that ensures that the author receives appropriate credit for the impact of the content upon readers. The system provides an embeddable control that publishers can embed in a web site or other distribution channel. Authors provide the content displayed within the embeddable control and can include advertisements as well as any content restrictions. For advertisers, the system allows them to advertise with the content instead of the publisher, and allows them to do so in all of the venues that host the content. This places control of monetization of content back in the hands of the author, and incentivizes the author to maximize the distribution of his content to reach the widest possible audience rather than to hoard content at his own site.

Abstract: Methods, systems, and apparatus for identifying and using unambiguous terms are described. In one implementation, a method for identifying unambiguous terms includes accessing textual content that is included in one or more electronic documents, and extracting one or more terms from the textual content by identifying single words or groups of words in the textual content that relate to a common concept. The method includes analyzing the extracted terms, using a computing system, to determine whether the extracted terms are ambiguous, where a term is determined to be ambiguous when the term has different meanings depending on a context in which the term is used. The method also includes identifying a set of one or more unambiguous terms from the extracted terms. In some implementations, the method may also include using the set of identified unambiguous terms to identify supplemental content to deliver to a user of a computing device.

Abstract: Methods, systems and computer-readable medium for replicating the data fields used by relational join operations in transient or persistent data structures with explicit support for named relationships that may have 1:1, 1:many, many:1 or many:many cardinality. An algorithm is applied to predetermine the optional search path for finding relationships between any two rows of any of one or more tables, including relationships defined between other tables. The schema of a target relational database, either derived or input, is converted into an object-oriented schema that explicitly defines relationships between columns in the tables of the relational database and represents the tables as object classes. The schema is analyzed and optimal search paths are derived and stored for subsequent use. A query engine accesses the predefined search paths in order to execute the specific types of query listed above and incrementally populates instances of the transient or persistent structures.

Abstract: One object of the present invention is a method for access to subscription data stored in a database entity of a mobile communication network referred to as first database entity, storing subscription data referred to as first subscription data for support to network entities of the mobile communication network entities referred to as first network entities, the method comprising a step wherein a database entity of the mobile communication network referred to as second database entity, storing subscription data referred to as second subscription data for support to network entities of the mobile communication network referred to as second network entities, communicates with the first database entity to have access to at least part of the first subscription data, a step wherein an Application Server communicates with the second database entity, to have access to the at least part of first subscription data via the second database entity.

Abstract: A computer-implemented method and system for creating data sources for a variable data publishing (VDP) marketing campaign pattern. The method and system can be utilized to generate a data source from external sources, such as Encyclopedic knowledge-bases, when desired data is not locally available. A user can specify a conceptual identity, and the method and system automatically map the conceptual identity to an appropriate database, generate semantic queries, and query the database to develop the data source for use in the campaign.

Abstract: A system and method for routing and managing documents based on document content comprises obtain a document, determine a classification for the document based on the document content, determine a storage location for the document based on the document classification, determine whether the document is stored in the determined storage location, when the document is stored in the determined storage location, update the document in the determined storage location, when the document is not stored in the determined storage location, determine whether the document is stored in another storage location, when the document is stored in another storage location, add the document in the determined storage location and delete the document from the other storage location, and when the document is not stored in the other storage location, add the document to the determined storage location.

Abstract: A tree structure of plurality of information records arranged is recursively grown by splitting at least a portion of the records and by generating at least one predictive model. Related apparatus, systems, methods and computer program products are also described.

Abstract: In general, one aspect described can be embodied in a method for providing input to a document ranking process for ranking a plurality of documents, the document ranking process taking as input a quality of result statistic for a query and an individual document. The method can include, for a first document identified as a search result of a query, receiving information regarding an anchor contained within the first document, where the anchor provides a link to a second document; deriving a quality of result statistic for the second document from at least a portion of first data associated with the first document and the query, the first data being indicative of user behavior relative to the first document as a search result for the query; and providing the first quality of result statistic as input to the document ranking process for the second document and the query.