Abstract: A method and system for social media ecosystem searching. A desired person can be searched for from public search engines and social media sites directly by name and/or by unique search keywords and search categories created and publically published by the desired person, a social media index of the desired person or a social commerce connection associated with the desired person. The search results are publically viewable. However, communication with the desired person located within the social media ecosystem is via a private system in which a searcher must provide login information to privately communicate with the desired person. The private system helps ensure that social media index values and social commerce connections are properly established, recorded and updated for the desired person and provides a layer of security and privacy. The social media searching ecosystem is provided on a cloud communications network for mobile and non-mobile devices.

Abstract: A computer-implemented method, including identifying user subscriptions that meet at least one criterion of a plurality of criteria for detecting subscriptions that are no longer active, classifying the user subscriptions into a first group and a second group, where user subscriptions in the first group have at least one context factor associated with the at least one criterion, matching the user subscriptions of the second group with data of unavailable users to produce a third group of user subscriptions, where the user subscriptions of the third group are successfully matched with some of the data of unavailable users.

Abstract: Generating a document index comprises: obtaining a document to be indexed; determining whether each monadic partition obtained from the document is a filter character and if so, forming a polynary partition with the monadic partition and at least one adjacent monadic partition and indexing the polynary partition, otherwise, indexing the monadic partition. Querying data comprising: receiving a data query, determining whether each monadic partition obtained from the data query is a filter character and if so, forming a polynary partition with the monadic partition and at least one adjacent monadic partition and using the polynary partition to obtain search results, otherwise, using the monadic partition to obtain search results; and combining search results to form a final query search result.

Abstract: A social networking system allows its users to perform a structured search that returns objects (e.g., other users and pages) in the social networking system. A searching user may remove or add objects to the search by interacting with the returned objects. Adding or removing an object generates a claim stored by the social networking system that an object has or does not have, respectively, characteristics based on the search query. Additionally, the searching user may also request presentation of the search query to other users, which may be selected by the social networking system based on their predicted expertise. A dialog between the searching user and a selected other user may be provided to allow the searching user to provide the search query to the selected other user and to receive a response.

Abstract: The present invention relates to computer implemented methods and system for creating and executing an query plan for SPARQL Protocol And Query Language (SPARQL) queries. The methods and systems are designed to accept as input a query in SPARQL syntax, convert this query to semQA2 and generate a parse tree, perform filter pushdown, generate an efficient query plan potentially using a cost function, and execute this query plan against data sources complying to or modeled as Resource Description Framework (RDF). The result of these methods and of the systems implementing these methods is a set of triples contained in the data sources that comprise a solution of the SPARQL query provided.

Abstract: This document describes tools capable of updating data-consuming entities. These tools allow a developer of an application to use data binding to update data-consuming entities without the need to write custom code.

Abstract: A machine receives a group of members of a data set. The machine identifies key symbols from the members of the group or the data set. The machine then calculates, for each key symbol, a weighted magnitude for the key symbol in the group. The machine can then sort the key symbols according to their weighted magnitudes, and filter out common key symbols. The uncommon key symbols, as sorted according to their weighted magnitudes, can form a name for the group.

Abstract: A system, method, and computer-readable medium for grouping of database object access counts per processing module in a parallel processing system. Each processing module manages an intermediate cache allocated thereto that stores database object access counts local to the respective processing module. The processing modules are configured in a hierarchical configuration. The intermediate caches managed by the processing modules at the lowest level of the configuration are forwarded to a parent processing module and merged with the intermediate cache allocated to the parent processing module. A root processing module merges the intermediate caches received from one or more parent processing modules with the root processing module's intermediate cache to generate a final cache. An objects access count data structure is then generated by the root processing module.

Abstract: A system and method determines sequential access efficiency for a database table. A number of data block changes that occur during a sequential access of a plurality of rows in a database table are determined. The sequential access efficiency is calculated based on the determined number of data block changes.

Abstract: A computer-implemented data processing system and method writes a first plurality of copies of a data set at a first plurality of hosts and reads a second plurality of copies of the data set at a second plurality of hosts. The first and second pluralities of copies may be overlapping and the first and second pluralities of hosts may be overlapping. A hashing function may be used to select the first and second pluralities of hosts. Version histories for each of the first copies of the data set may also be written at the first plurality of hosts and read at the second plurality of hosts. The version histories for the second copies of the data set may be compared and causal between the second copies of the data set may be evaluated based on the version histories for the second copies of the data set.

Abstract: Provided are, among other things, systems, methods and techniques for identifying matching objects in a computer database. In one representative technique, a set of attribute-value pairs corresponding to a query data object are input, with individual ones of the attribute-value pairs including an identified attribute and a value for the identified attribute; multiple characteristic fingerprints are assigned to individual ones of the attribute-value pairs in the set, the characteristic fingerprints having been selected from an attribute-specific field of available characteristic fingerprints based on the value for the identified attribute; a subset of at least one characteristic fingerprint is selected from across the characteristic fingerprints for the query data object, based on a selection criterion, and a database is queried using the subset of at least one characteristic fingerprint to identify any matches.

Abstract: Methods for using scenario solution-related information to generate customized user experiences are provided. Upon receiving a user query, a plurality of results is returned, each result being representative of a scenario solution which may be utilized to address a particular issue relevant to the received query. At the time of authoring, each scenario solution is organized based upon one or more keywords and/or one or more categories (i.e., namespaces). Data associated with a namespace/keyword corresponding to a returned search result may be mined to determine information beyond basic scenario solution search results that may be of interest to the user.

Abstract: A system and method hosts entity-specific photo-sharing websites for entity-specific image capture devices. The system and method provides software for the entity-specific image capture devices that causes the image capture devices to transmit entity ID information when the image capture devices transmit images over the Internet. The system and method further provide an online photosharing service capable of hosting the entity-specific photo-sharing websites for each of the entities, such that when the image capture devices connect to photo-sharing service, the photo-sharing service uses the entity ID received from the image capture devices to automatically associate the image with the photo-sharing websites of the identified entity.

Abstract: A method, system and apparatus for configuring programmatic objects for cache co-location. The method can include the steps of counting a frequency of access for individual fields in the object in a static analysis, rearranging the fields in the object based upon the counted frequency in the static analysis, and executing the object. Subsequently, a frequency of access for the individual fields in the object further can be counted in a dynamic analysis. Consequently, the fields in the object can be further rearranged based upon the counted frequency in the dynamic analysis to produce an optimal grouping for placement in cache memory. In a preferred aspect of the invention, access types for the individual fields can be identified. Subsequently, the rearranging step and the further rearranging step can be performed based both upon the counted frequency and also upon the access types.

Abstract: A method for organizing images from multiple image capture devices includes allowing the determination of an offset between image capture times recorded in a first image capture device and image capture times recorded in a second image capture device, adjusting the image capture times recorded in the second image capture device by the offset to produce adjusted image capture times by a computer processor, and sequencing images taken by the first image capture device and the second image capture device in an chronological order. The sequencing is based on the image capture times for the images captured by the first image capture device and the adjusted image capture times for the images captured by the second image capture device.

Abstract: A management method and management system for physically managing data that represents an image for eventual presentation to a user, based on the data, wherein the data is first acquired from an appropriate image source in a source representation, next, the data in source representation is selectively converted to data in destination representation, using the selective storing of managed data as an intermediate item.

Abstract: A set of ordered predicted completion strings are presented to a user as the user enters text in a text entry box (e.g., a browser or a toolbar). The predicted completion strings can be in the form of URLs or query strings. The ordering may be based on any number of factors (e.g., a query's frequency of submission from a community of users). URLs can be ranked based on an importance value of the URL. Privacy is taken into account in a number of ways, such as using a previously submitted query only when more than a certain number of unique requesters have made the query. The sets of ordered predicted completion strings is obtained by matching a fingerprint value of the user's entry string to a fingerprint to table map which contains the set of ordered predicted completion strings.

Abstract: A method is provided for managing a relational database of the SQL type for information technology and network infrastructure service information, including a method in which the following are created, in a system for managing a database of the MySQL type, a read-only data storage engine, and unmodifiable tables, for example of WORM, defined as “Write Once Read Many” type managed by the storage engine; each table includes a column of digital counting data called a “timestamp”; each table is partitioned by time intervals; partition files are grouped in subdirectories of a file system, these directories forming a tree structure, each node of which is uniquely identified from a timestamp.

Abstract: A system for detecting inappropriate content in a virtual world environment has and a corresponding method utilizes a rating unit for rating each of one or more virtual objects based upon its content. The system has and the method utilizes a tagging unit for tagging each of the one or more virtual objects with its respective rating, an object tagging database for storing ratings of the one or more virtual objects, and a policy database for storing policies associated with the ratings and the regions. Further the system has and the method utilizes an object monitor for monitoring the movement of each of the one or more virtual objects, a security scanner for scanning each of the one or more virtual objects to determine the rating of each of the one or more virtual objects, and an enforcement module to enforce the policies of the policy database based upon the rating and the respective region.

Abstract: A computer-implemented method affords multi-core and multi-level topical organization in social indexes. A corpus of articles is accessed. Each article includes online textual materials. A finite state pattern for a topic filters the articles as candidate articles, which are potentially on-topic. Similarity-based representations are formed for on-topic and off-topic core meanings of the topic. An aggregate score for each of the candidate articles is determined using the similarity-based representations to indicate whether the candidate article is sufficiently on-topic. The candidate articles are presented ordered by their aggregate scores. In a further embodiment, a hierarchy of topics is used to guide the presentation of articles from subtopics, with considerations of fairness of subtopic coverage, elimination of similarity-duplicates in articles, and article freshness.