Abstract: A content provider provides a content provider and service identification to a collection controller. The collection controller retrieves content provider and service specific service provision characteristics from a user subscription database and sets these service provision characteristics as a filter in a service provision control device to be used in the provision of a service from the content provider to the user equipment. Thus, the content provider, through the retrieved content server & service related characteristics from the user subscriber database, can influence the charging and transmission policies used by service provision control device for providing the service.

Abstract: Methods and systems are provided herein that facilitate cost-effective and reliable data identification in an archival data storage system. In an embodiment, a data object stored in an archival data storage system is identified by a data object identifier which encodes storage location information that may be used to locate a data object stored in an archival data storage system that reduces the cost to store a global index. The data object identifier may also encode policy information such as access control information usable for validating subsequent access to the data object, payload validation information such as size and digest usable for verifying the integrity of the payload data, metadata validation information such as error-detection codes usable for validating integrity of the data object identifier and other information.

Abstract: A computer implemented method and system for interrelating and providing ordered access to source data files (SDFs) is provided. Each SDF contains one or more records. A parsing component compiles a configuration language (CL) and generates file descriptors usable by an interlinear sort component (ISC) and an interrelated data access component (IDAC). The CL defines adopt and order key fields, a lineage relationship between the SDFs, and one or more predetermined subprograms. The subprograms process an instance of a record from a SDF and a start point and an end point of a sequence or a subsequence of related records from the SDF. The ISC sorts each SDF into the order defined in the CL and attaches a parent position number (PPN) to each child file record. The IDAC uses the PPN to access the sorted SDFs in the order defined by the CL and execute the defined subprograms.

Abstract: Methods, systems and apparatus are described herein that include obtaining metadata within a document, where the metadata comprises a sequence of terms. Tags are assigned to terms in the sequence of terms based at least in part on grammatical relationships between the terms, thereby forming a corresponding sequence of tags. A determination is made that the sequence of terms is grammatically correct based at least in part on tags within the corresponding sequence of tags. In response to the determination, the sequence of terms is stored as a query suggestion.

Abstract: Determining sequences of queries for retrieving images of negotiable instruments such as checks. A request for a check image is received from a first computer such as an account holder computer at a second, intermediate computer that hosts an on-line banking program and is in communication with a third computer of a financial institution. A sequence program is executed to determine a first sequence of queries having respective query formats available to attempt to retrieve the requested image from an image server or data store. The first sequence is determined based on historical data of whether respective query formats were successfully used in the past to retrieve respective requested images from the data store and is dynamically updated to reflect whether queries were used to retrieve requested images. Thus, with embodiments, the order of queries to utilize is dynamic and can change as opposed to being pre-determined or static.

Abstract: A system and method for searching media storage with a knowledge database is provided. The system includes a search retrieving unit to retrieve a search request, an association retrieval unit to retrieve an association between a content item from the media storage and an identification from the knowledge database based on the search request, and an output unit to output data generated by the association retrieval unit. A method tagging a content item with a knowledge database includes determining the content item to be tagged, tagging the content item with an identification from the knowledge database, and storing the content item and the tagged identification in a tag database.

Abstract: A search query is resolved prior to being submitted to one or more search engines. The query is resolved such that the query unambiguously corresponds to a category included in a query ontology that relates search queries to query categories. The query may be resolved by supplementing the query with additional information corresponding to the category. For example, the query may be formatted into a canonical form of the query for the category. Alternatively or additionally, the query may be supplemented with one or more keywords that are associated with the category and that represent words or phrases that appear in a high percentage of search results for queries from the category. Resolving the query yields search results that more closely reflect search results desired by a user submitting the query.

Abstract: A system and method for enabling a user to use a user computer to search the user's personal content items hosted by an online content management service, the online content management service having an indexer computer configured to generate a base index of the user's content items hosted by the service, a base index server computer configured to transmit the generated base index over a network to the user computer, an index mutation generator computer configured to generate index mutations for subsequent changes to user's hosted content items, and an index mutation sever computer configured to transmit the generated index mutations over the network to the user computer. In one aspect, the system and method enable searches of the user's hosted content items and changes thereto to be conducted at the user computer using an index local to the user computer constructed based on the base index and the index mutations received by the user computer.

Abstract: Some embodiments provide a program that defines a set of data source views (DSVs) that each derives data from a subset of a set of data source objects. The program defines a set of dimensions that each derives data from a first DSV in the set of DSVs. The program defines a set of multidimensional data storage (MDDS) cubes that each derives data from a subset of the set of dimensions and a second DSV in the set of DSVs. The program generates a content pack that includes a set of DSV definitions for the set of DSVs, a set of dimension definitions for the set of dimensions, and a set of MDDS cube definitions for the set of MDDS cubes. The content pack for an MDDS system to process in order to provision the set of MDDS cubes to MDDS clients for viewing the set of MDDS cubes.

Abstract: Methods and apparatus related to ranking modifications of a previous query. For example, modifications of a previous query may be generated based on a current query issued subsequent to the previous query by substituting one or more n-grams of the previous query with one or more n-grams of the current query. One or more measures of each of the modifications may be identified and, based on such measures, a ranking of each of the modifications may be determined. One of the modifications may be selected as a submission query based on the rankings of the modifications. The submission query may be selected for submission in lieu of, or in addition to, the current query.

Abstract: Business, recommendation, and social relationship graph information for businesses may be received from a data source social networking website, where each business is recommended by users. The recommendation information may indicate users that recommend certain businesses. The social relationship graph information may indicate user-specific networks of social relationships on the social networking website. For a user query including business and affinity group selection criteria, business, recommendation, and social relationship graph information may be searched to select businesses that: match the business selection criteria; and are recommended by users having social relationships within a maximum degree of closeness with the querying user and being in an affinity group matching the affinity group selection criteria. The selected businesses may be ranked based on numbers of recommending users and social relationship graph information.

Abstract: Methods, systems and apparatus are described herein that include obtaining a respective ordered list of search result documents for each query in a plurality of queries. Non-overlap scores between search result documents within a first grouping in the ordered lists for a given query and remaining queries in the plurality of queries are then calculated. One or more remaining queries are then selected as candidate queries using the non-overlap scores. Overlap scores between search result documents within a second grouping in the ordered lists for the given query and the candidate queries are then calculated. One or more of the candidate queries are selected as related queries for the given query using the overlap scores. The related queries are then associated with the given query.

Abstract: In several aspects, an electronic device and method index a repository of N documents by W words, by not storing between queries, N*W numbers that are specific to each word i and each document j, normally used to compute a score of relevance to a query, of each document j. Instead, the electronic device and method generate the N*W word-specific -document-specific numbers dynamically at query time, based on a set of W numbers corresponding to the W words, and one or more sets (e.g. x sets) of N numbers corresponding to the N documents. Query-time generation of word-specific-document-specific numbers reduces memory otherwise required, e.g. to store these numbers. Hence, in certain aspects W+xN numbers are maintained between queries, and these numbers are changed incrementally when a new document is added to the set or an existing document is removed. Maintaining W+xN numbers reduces processing otherwise required, to start from scratch.

Abstract: A method of performing a query on a cube of data is provided. A cube of data is distributed onto a plurality of computing devices with each computing device of the plurality of computing devices storing a different portion of the cube of data. A perturbation rule configured for application to the cube of data and associated with a user is received. A process space associated with the user is created. The received perturbation rule is compiled in association with the created process space. A query on the portion of the cube of data stored at the computing device is received. The received query is associated with the created process space. The query is processed while applying the compiled perturbation rule to data extracted from the portion of the cube of data stored at the computing device. A result of the processed query is sent to a requesting computing device.

Abstract: A method and system for automatically summarizing fine-grained opinions in digital text are disclosed. Accordingly, a digital text is analyzed for the purpose of extracting all opinion expressions found in the text. Next, the extracted opinion expressions (referred to herein as opinion frames) are analyzed to generate opinion summaries. In forming an opinion summary, those opinion frames sharing in common an opinion source and/or opinion topic may be combined, such that an overall opinion summary indicates an aggregate opinion held by the common source toward the common topic.

Abstract: Systems and methods for displaying data in split dimension levels are disclosed. In some implementations, a method includes: at a computer, obtaining a dimensional hierarchy associated with a dataset, wherein the dimensional hierarchy includes at least one dimension and a sub-dimension of the at least one dimension; and populating information representing data included in the dataset into a visual table having a first axis and a second axis, wherein the first axis corresponds to the at least one dimension and the second axis corresponds to the sub-dimension of the at least one dimension.

Abstract: A storage system includes a distributed file system. An attribute of a particular entity in the file system relates to a snapshot. In response to an operation in the storage system, it is determined whether the snapshot attribute is to be propagated to another entity of the file system.

Abstract: A search engine provides personalized rankings of search results. A user interest profile identifies topics of interest to a user. Each topic is associated with one or more sites, and a boost value, which can be used to augment an information retrieval score of any document from the site. Search results from any search are provided to the user, with a variable control of the ranking of the results. The results can be ranked by their unboosted information retrieval score, thus reflecting no personalization, or by their fully or partially boosted information retrieval scores. This allows the user to selectively control how their interests affect the ranking of the documents.

Abstract: Some embodiments, among others, include a search for sensitive information. Once a result of the search has been obtained, a score is assigned to the obtained result in accordance with a predefined criterion.

Abstract: A server receives a search request in a third format. The third format is a search request format. A first search query in a first format is generated. The first format is a first search query format. A second search query is generated in a second format. The second format is compatible with a format used by a second search engine. The second format is a second search query format. The search request is in the third format. The first format and the second format are different from one another. First result data comprising a plurality of first result data items, and second result data comprising a plurality of second result data items are received. A search result is generated. The generating the search result includes consolidating the plurality of the first result data items and the plurality of the second result data items.