Abstract: Performing optimized update operations in in-memory database systems. Update values corresponding to a source table of values stored on an in-memory database are identified by an in-memory database computer system based on information from a computer system implementing a software application. The update values are distributed across a plurality of rows, each row including a plurality of column attributes. At least some column attributes of the plurality of column attributes include values updated relative to corresponding column attributes in the source table of values. A row of the update values is identified. The row includes a plurality of column attributes, each column attribute having a respective value. Each value of each column attribute of the row of the update values is the same as a corresponding value of a corresponding attribute of a corresponding row of the source table is determined.

Abstract: Classifying an electronic document in a computer-based system is disclosed. For each classification instance in a plurality of classification instances, a confidence data indicating a degree of confidence that the electronic document is associated with that classification instance is determined. A classification, based on a first classification instance in the plurality of classification instances, is assigned without human intervention to the electronic document if the confidence data associated with the first classification instance exceeds a first threshold.

Abstract: Techniques related to a domain-specific language for dataset transformations are disclosed. A server computer may process a table definition composed in a domain-specific language. The table definition may include a sequence of one or more dataset transformations to be performed on one or more source tables to generate a target table. The sequence may include a customized transformation. A source dataset may be provided as input to an implementation of the customized transformation. An output dataset may be generated as a result of executing the implementation. An intermediate table may be generated based on performing at least one dataset transformation on a particular source table. A supplemental portion for the intermediate table may be generated based on performing the at least one dataset transformation on an appended portion of the particular source table. The target table may be generated based on combining the supplemental portion with the intermediate table.

Abstract: A story describing an activity performed by an interacting user is distributed to viewing users according to the influencer scores for the viewing users. Each influencer score can be calculated based at least in part on the influence of a viewing user on those users connected to the viewing user, and on the influencer scores for the users connected to the viewing user. Based on the determined influencer scores, at least one of the viewing users can be provided with the story describing the activity performed by the interacting user.

Abstract: In certain example embodiments, a system is configured to check consistency between a first computer-represented graphical model and a second computer-represented graphical model. The system includes a data storage device and at least one processor that is incorporated into or accessible to a server. The data storage device includes or stores model correlation information, e.g., in a mapping table form. The model correlation information is configured to define at least one relationship type between the first model and the second model. The model correlation information includes a mapping of objects of the first model to objects of the second model at creation time of the model correlation information. The processor is configured to perform a model consistency check procedure that uses the model correlation information including the relationship type to ascertain an inconsistency between extant versions of the first model and the second model.

Abstract: A method begins by receiving a delete data object request within a dispersed storage network (DSN). The method continues by determining a set of dispersed storage (DS) units within the DSN that store a set of encoded data slices associated with the data object. The method continues by determining a revision number of the set of encoded data slices. The method continues by sending a delete marker and write command to the set of DS units for deletion of the data object. The method continues by receiving at least one receive write acknowledgement from at least some DS units of the set of DS units to produce the deletion. The method continues when a write threshold is met, by sending a commit command to the DS unit storage set and receiving commit acknowledgments from the DS units and sending a finalize command to the set of DS units to delete the data object.

Abstract: Disclosed are various embodiments for increasing distributed database capacity by adding new nodes while minimizing downtime. A database is partitioned among multiple nodes in a cluster. Each node stores a respective portion of the database. The portions of the database are replicated to corresponding physical standbys. For each portion, a first portion is mapped to an existing node, while a remaining portion is mapped to a physical standby. The cluster is updated to include the physical standbys as additional nodes among which the database is partitioned.

Abstract: Systems, methods, and computer program products for efficiently storing and accessing graph-oriented information retrieved from disparate sources using an interface that effectively emulates a graph database to access a set of indexed, column-oriented tables. One embodiment is a system that includes a server and a plurality of storage nodes. The server retrieves graph-oriented social networking data for multiple users, identifies vertices, edges and associated properties within the data and stores this information in key-value lookup tables within a column-oriented database. The server can receive graph-oriented queries, convert the graph-oriented query to corresponding key-value lookup queries, and search the tables of the column-oriented database using the key-value lookup queries. The results of the lookup queries can be converted to a graph-oriented representation and presented to a user.

Abstract: Methods and system for item matching are described. In one embodiment, compatibility-based text for an item may be accessed. A compatibility identifier may be identified based on the compatibility-based text. The compatibility identifier may be associated with an item cluster. The compatibility identifier may be used to identify a plurality of matching items. A result may be provided based on identification of the plurality of matching items. Additional methods and systems are disclosed.

Abstract: An approach for identifying missing content is provided. An approach includes: receiving a search string; determining a skill rating associated with a searcher that generated the search string; and searching a database using the search string. The approach also includes: updating at least one of a first score associated with the search string and a second score associated with the database based on the skill rating; and generating an alert based on one of the first score exceeding a first threshold and the second score exceeding a second threshold.

Abstract: According to an aspect, summarizing relevance of a document to a conceptual query includes receiving the conceptual query, accessing concepts extracted from the document, and computing a degree to which the conceptual query is related to each of the extracted concepts. The computing is responsive to a metric that measures a relevance between the concepts in the conceptual query and the extracted concepts. An aspect also includes creating a summary by selecting a threshold number of the concepts having a greatest degree of relation to the conceptual query, and outputting the summary including the selected threshold number of concepts.

Abstract: An improved system and method for query processing in a distributed column chunk data store is provided. A distributed column chunk data store may be provided by multiple storage servers operably coupled to a network. A storage server provided may include a database engine for partitioning a data table into the column chunks for distributing across multiple storage servers, a storage shared memory for storing the column chunks during processing of semantic operations performed on the column chunks, and a storage services manager for striping column chunks of a partitioned data table across multiple storage servers. Query processing may be performed by storage servers or query processing servers operably coupled by a network to storage servers in the column chunk data store. To do so, a hierarchy of servers may be dynamically determined to process execution steps of a query transformed for distributed processing.

Abstract: A denormalized dataset, an associated primary key field, one or more associated secondary key fields and information identifying one or more normalized datasets associated with each secondary key field, is received. A denormalized table comprising fields and data types corresponding to said denormalized dataset, said denormalized table having a primary key field corresponding to said primary key field associated with said denormalized dataset, is created. The said information identifying the one or more normalized datasets associated with each secondary key field, creating one or more normalized tables, each of said one or more normalized tables corresponding to a respective one of said one or more normalized datasets, each of said one or more normalized tables comprising a foreign key corresponding to said associated primary key and a primary key corresponding to the secondary key field associated with said normalized dataset, is utilized. Additionally, each of said foreign keys is utilized.

Abstract: System and method embodiments are provided for improving the performance of query processing in a massively parallel processing (MPP) database system by pushing down join query processing to data nodes recursively. An embodiment method includes receiving, at a coordinator process, a join query associated with a plurality of tables of the MPP database system, generating, at the coordinator process, an execution plan tree for the join query, and processing, at each of a plurality of data nodes communicating with the coordinator process, the execution plan tree to obtain join query results. The method further includes, upon detecting a next join operator below a top join operator in the execution plan tree at each of the data nodes, forwarding to the other data nodes a sub-tree for the next join operator, and receiving, at each of the data nodes from the other data nodes, sub-tree processing results.

Abstract: In a method for generating a query plan for estimating a number of unique entry counts of an attribute in a database, a sample of entries in the database is identified, at least one of a sampling percent and a coefficient of variance of the entries in the sample is identified, and a skewness of the entries in the sample is calculated. In addition, at least one of a plurality of estimators is selected based upon the skewness of the entries and at least one of the sampling percent and the coefficient of variance of the entries in the sample. Moreover, a query plan is generated from the selected at least one of the plurality of estimators. A query optimizer for performing the method is provided.

Abstract: In one aspect, in general, a method of generating a dataflow graph representing a database query includes receiving a query plan from a plan generator, the query plan representing operations for executing a database query on at least one input representing a source of data, producing a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan, and altering one or more components of the dataflow graph based on at least one characteristic of the at least one input representing the source of data.

Abstract: The present invention is directed towards systems and methods for trust propagation. The method according to one embodiment comprises calculating a first feature vector for a first user, calculating a second feature for a second user and comparing the first feature vector with the second feature vector to calculate a similarity value. A determination is made as to whether the similarity value falls within a threshold. If the similarity value falls within the threshold, a relationship is recorded between the first user and the second user in a first user profile and a second user profile.

Abstract: Consumers often desire to compare themselves to other individuals. Disclosed herein are systems and methods of generating and displaying comparison information to users so that they can determine if they are “keeping up with the Joneses.

Abstract: An automated outlier detection system implements an unsupervised set of processes to determine feature subspaces from a dataset; determine candidate exploratory actions, where each candidate exploratory action is a specific combination of a feature subspace and a parameterized instance of an outlier detection algorithm; and identify a set of optimal exploratory actions to recommend for execution on the dataset from among the candidate exploratory actions. Outlier scores obtained as a result of execution of the set of optimal exploratory actions are processed to obtain one or more outlier views such that each outlier view represents a consistent characterization of outliers by each optimal exploratory action corresponding to that outlier view.

Abstract: A computer system receives input of a search term for a query. The search term is related to equipment. The computer system identifies a key that corresponds to the search term and dynamically obtains content that is associated with the key from data sources. The data sources include structured data that is associated with the equipment and unstructured data that is associated with the equipment. The computer system automatically populates a results page template that is associated with the key with the content from the data sources to create a results page that includes the equipment related results for the query.

Abstract: A system and method for searching content and user interface for presenting results of the search are provided, wherein visual elements representing the content are distributed in three dimensions on a display, with the various axes representing criteria that relate to a central starting point of the search and the proximity to the central point indicating the degree of relevance. The outer bounds of the display contain a large amount of varied material of various types to allow a user to select content of a different type, with the content at the periphery of the display being essentially random and representing little or no link to the starting point of the search. Any displayed element may be selected, as a source for a next level search, in which case content relationships will be re-drawn, with the selected content used as the center point for a next level search.

Abstract: A recipe presentation system which presents an integrated recipe for a plurality of dishes includes: a recipe storage unit storing recipes for dishes including preparation elements arranged in a hierarchy according to closeness to completion of preparation of the respective dishes; a recipe selection unit which allows a user to select a first recipe and a second recipe from among the recipes; an overlapping preparation element identification unit which identifies common preparation elements between the first recipe and the second recipe; a recipe integration unit which generates the integrated recipe by arranging, in order of preparation, the preparation elements included in the first recipe and the preparation elements included in the second recipe, in a manner such that the user recognizes, as a single preparation element, the common preparation elements; and a recipe output unit which outputs the integrated recipe.

Abstract: An apparatus, method, and computer program product are provided for creating and displaying an integrated search and web browser history to a user. In particular, the apparatus includes a processor and a memory including computer program code, and the memory and computer program code are configured to, with the processor, cause the apparatus to receive search data provided to a website and navigational data relating to a webpage. The apparatus may determine a relationship between the search data and the navigational data and may further provide for a graphical representation of the search data, the navigational data, and the relationship between the search and navigational data to be displayed to the user. Thus, the user can have not only a record of the webpages accessed or search terms used in the previous search, but also a meaningful organization and contextual representation of the search.

Abstract: Techniques are disclosed to determine data quality issues in data processing jobs. The data processing job is received, the data processing job specifying one or more processing steps designed based on one or more data schemas and further specifies one or more desired quality metrics to measure at the one or more processing steps. One or more state machines are provided, that are generated based on the quality metrics and on the data schemas. Input data to the data process job are processed using the one or more state machines, in order to generate output data and a set of data quality records characterizing a set of data quality issues identified during the execution of the data processing job.

Abstract: Techniques are disclosed to determine data quality issues in data processing jobs. The data processing job is received, the data processing job specifying one or more processing steps designed based on one or more data schemas and further specifies one or more desired quality metrics to measure at the one or more processing steps. One or more state machines are provided, that are generated based on the quality metrics and on the data schemas. Input data to the data process job are processed using the one or more state machines, in order to generate output data and a set of data quality records characterizing a set of data quality issues identified during the execution of the data processing job.

Abstract: A distributed database management system may comprise a plurality of computing nodes. A request to update an item maintained by the system may be acknowledged as durable and committed once an entry corresponding to the request has been written to a log file and quorum among the computing nodes has been achieved. Improved consistency may be achieved by maintaining snapshots of committed item states within queryable in-memory snapshot data structures. Range queries may be performed by merging a secondary index with the snapshots and applying filters. Projections may be completed by retrieving additional data from an item collection maintain on one or more storage devices.

Abstract: Example resource provisioning systems and methods are described. In one implementation, an execution platform accesses multiple remote storage devices. The execution platform includes multiple virtual warehouses, each of which includes a cache to store data retrieved from the remote storage devices and a processor that is independent of the remote storage devices. A resource manager is coupled to the execution platform and monitors received data processing requests and resource utilization. The resource manager also determines whether additional virtual warehouses are needed based on the data processing requests and the resource utilization. If additional virtual warehouses are needed, the resource manager provisions a new virtual warehouse.

Abstract: A computing system includes at least one source data center that generates data and a plurality of recovery groups, coupled to the at least one source data center, where each of the recovery groups includes a synchronous data center that receives synchronous data from the at least one source data center and includes an asynchronous data center that receives asynchronous data from the at least one source data center. Cycle switching for asynchronous data transfer is coordinated by the at least one source data center for a first subset of recovery groups containing at least two of the recovery groups. The computing system may also include a second subset of the recovery groups, different from the first subset, where cycle switching for asynchronous data transfer is coordinated by the at least one source data center for the second subset.

Abstract: The present invention relates to the field of database technology, and to the automatic generation of search queries. The present invention provides a method of generating a database query, the method comprising: receiving a user selection of one of a number of predetermined generic database queries from a user; automatically identifying user specific data from user profile data corresponding to the user by applying the user profile data to a number of predetermined query statements associated with the selected generic query; automatically applying the user specific data to a number of user specific generator query statements in order to generate one or more user specific queries.

Abstract: A system and method are disclosed for categorizing search terms. The system accesses search history for the search terms. The system also categorizes each of the search terms based on the number of times that the respective search term appears in the search history. If the number of times the search term appears in the search history exceeds a first threshold, a search result of the search term is determined and the search term is categorized as a type that is provided for registration to a user with recognized association with the search term or a type that is excluded from registration, where the categorizing based on a ratio of a number of times the search result was selected subsequent to receiving the search term to the number of times that the search term appears in the search history.

Abstract: A computer program product for managing and rendering one or more information nodes relative to a current focus. The computer program product receives one or more principal topics from an analysis of the information nodes. The computer program product determines a topic vector from a similarity of a first information node to each of the principal topics and a map from the topic vector to a storage location of the first information node. The computer program product determines one or more current topics from a second information node that has been recently accessed by a user and a current focus vector from a similarity of the one or more current topics to the one or more principal topics. The computer program product renders the current focus vector and the first information node according to a rendering algorithm that is applied to the current focus vector and the first information node.

Abstract: A Common Information Model (CIM) agent is registered to a management agent in a computing environment by a processor device. The management agent is discovered by the CIM agent in a management domain in response to an insertion of the CIM agent into the management domain. At least one of information of the CIM agent and the discovered management agent is registered by the CIM agent. The management agent is compliant with the CIM agent. The management agent converts a CIM schema of the CIM agent into a schema at the management agent identifiable by the management agent according to a mapping specification corresponding to a management model of the management domain in response to a determination of no schema at the management agent corresponding to the CIM schema to be converted in the management agent that is compliant with the CIM agent.

Abstract: Users of a social networking system post questions for other users to answer. Questions are automatically tagged based on keywords extracted from text within the posted questions as well as user-selected tags. Answers may be voted on and sorted by social information related to the browsing user. Affinities for tags are recorded based on users' interactions with the question and answer service. Affinities for tags may also be used to target questions to other users and sort answers.

Abstract: A method, non-transitory computer readable medium and data management computing apparatus comprising searching across a plurality of different heterogeneous data indexes based on portions of one or more search keywords in response to a received request. A result set for each of the plurality of different heterogeneous data indexes is obtained based on the searching. Further, one or more facets to each of the obtained results sets are added. Furthermore, a plurality of visualization techniques are automatically identified for each of the obtained results sets based on the facets in each of the obtained result sets and a model entity type associated with each of the plurality of different heterogeneous data indexes. Finally, each of the obtained results sets with the added facets and the identified one of the plurality of visualization techniques is provided.

Abstract: A computer implemented method is for generating a media playlist including a plurality of tracks to be played on a listener's mobile or stationary client device with Internet radio capabilities, the client device intended to be connected to the Internet.

Abstract: Offline functionality-based co-ranking and clustering is carried out on a knowledge base that characterizes a heterogeneous information technology services network including a plurality of services, a plurality of providers, and a plurality of attributes. Results of the functionality-based co-ranking and clustering are stored as annotations of the services and the providers in the knowledge base, to obtain an annotated knowledge base. A service requirement is obtained from a customer requiring information technology services. The annotated knowledge base is queried, based on the service requirement; and an ordered list of at least given ones of the services, based on the querying, is returned to the customer.

Abstract: Computer storage media, computerized methods, and systems for semantically navigating between content using zoom operations, as well as other user-initiated operations, are provided. The zoom operations include an open-pinch gesture (zoom in) and a closed-pinch gesture (zoom out) physically applied to a touch-screen display of a client device, where the touch-screen display presents a document with original content. When one or more of the zoom operations have been detected as being performed upon a targeted portion of the original content, new content that is relevant to the targeted content is retrieved, as opposed to simply expanding or contracting the original content within a display area of the touch-screen display. The document is transitioned to a view with representations of the new content organized according to a format, where the format is dictated by a type of the one or more zoom operations being performed.

Abstract: Techniques for generating a playlist include: receiving acoustic information, obtaining seed information based on the acoustic information, identifying audio tracks in an audio library based on the seed information, and generating the playlist using at least some of the identified audio tracks.

Abstract: Various embodiments relate to a system and related method for scanning active instances of an application within a system. Unique identifiers in the form of fingerprints, tags, or metadata can be associated with a target application. A manager can then scan the process tables and file system directories of the servers within the system to find active processes and stored files that include the unique identifier. In some embodiments, the manager scans the active processes while they are running to search for the unique ID within the process' command line structure. In some embodiments, the manager also finds processes or files that do not have the unique identifier, but were previously associated with the unique identifier. The manager can then report the server and application information to user. Such information can include which of the one or more servers has the target application as an active process.

Abstract: Methods and systems for dynamically training a web crawler. The web crawler maintains one or more categories each comprising a set of words. The method includes selecting at least one hyperlink in response to a query received from a user. The method further includes determining a hyperlink score for the at least one hyperlink based on a category score associated with each of one or more categories. The category score associated with each of the one or more categories is updated based at least in part on the hyperlink score. The updated category score is compared with the hyperlink score to select a category from the one or more categories. The set of words associated with the category is updated based on content of a web page pointed by the at least one hyperlink.

Abstract: A method and system for ranking an object that contains one or more keywords is disclosed. All linking objects are retrieved that contain a keyword of interest. Each linking object links to the object to be ranked. The locations of each link in each linking object are determined relative to the keywords in the linking objects. A drop off rate is computed for the keyword in each of the linking objects. A perceived importance of the keyword in the each of the linking objects is computed. A partial link rating for each of the linking objects is computed. A total link rating is computed for the at least one keyword across all linking objects. The link ratings each keyword is stored in the object to be ranked.

Abstract: A search method is disclosed. In the method, a data rewriting system obtains, from a database, one or more search term candidates that are relevant to a present search term. The data rewriting system retrieves properties of the present search term and the one or more search term candidates, where the properties describe respective matching results of the present search term and the one or more search term candidates. Based on the matching results, the data rewriting system determines whether the present search term needs to be rewritten, and rewrites the present search term based on the matching results to provide a rewritten present search term in response to determining that the present search term needs to be rewritten. A search engine performs a search based on the rewritten present search term.

Abstract: Techniques are provided for including collection items in the ranked set of search results that are returned to a user in response to a search query. Collection scoring techniques are also provided for generating relevance scores for collection items in a different manner than relevance scores are generated for base items that are not collections. The collection scoring techniques may be applied to non-base collection items, base collection items, or both. Items that match the search query, including base items and collection items, are ranked in a unified ranking based on their respective relevance scores, thereby allowing searches to readily determine the relevance ranking of matching collection items relative to matching base items.

Abstract: Systems and methods are disclosed for identifying a new set of media items in response to an input set (or “query set”) of media items and knowledge base metrics. The system uses a knowledge base consisting of a collection of mediasets. Various metrics among media items are considered by analyzing how the media items are grouped to form the mediasets in the knowledge base. Such association or “similarity” metrics are preferably stored in a matrix form that allows the system to efficiently identify a new set of media items that complements the input set of media items.

Abstract: The present invention relates to systems, methods, and user interfaces for browsing a collection of content items saved by a user or by one or more buddies associated with a given user. The method of the present invention comprises saving one or more content items and one or more associated keywords as specified by a user. An interface is generated that displays the one or more saved content items and the one or more associated keywords, as well as the one or more buddies associated with a given user. A user indication of the selection of a given keyword or the selection of a given buddy by the user is received. The one or more displayed content items are filtered according to the selected keyword, buddy, or combination of selected keyword and buddy.

Abstract: An online system matches a user with a user of a third party system by comparing user identifying information maintained by the online system with user identifying information maintained by the third party system. To determine how accurately different types of user identifying information identify an online system user, types of user identifying information maintained by the online system are compared to types of user identifying information maintained by the third party system. A score is associated with various online system users based on the number of types of user identifying information associated with the user by the online system matching types of user identifying information associated with a third party system user. Based on the scores associated with different users, a measure of accuracy in identifying an online system user is determined for each type of user identifying information.

Abstract: To provide a human relationships registering system, a method and a server for registering human relationships, a program for registering human relationships, and a medium storing human relationships registering program and readable by a computer, all of which are used to establish wide and close relationships with members having a variety of occupations or engaged in various technical fields and to obtain expert knowledge or information. The human relationships registering system comprises first data processing units 2 and 3 including sections for receiving personal data of a new member, and a second data processing unit including a section for storing the received personal data. The second data processing unit stores the personal data of the new member in correlation to an existing member when the existing member confirms the new member.

Abstract: This application is directed to an indexing system for graph data. In particular implementations, the indexing system uses a database index infrastructure that provides for flexible search capability to data objects and associations between data objects. Particular embodiments relate to an indexing system for storing and serving information modeled as a graph that includes nodes and edges that define associations or relationships between nodes that the edges connect in the graph.

Abstract: An arithmetic operation unit receives a request to update a first data group during restoration using first history information and generates second history information indicating a history of updates. The arithmetic operation unit predicts a time taken until completion of restoration using the second history information on the basis of an amount of the second history information. The arithmetic operation unit compares the predicted time with a threshold and limits at least part of updates of the first data group during the restoration using the second history information on the basis of the comparison result.

Abstract: Systems and methods are disclosed for management of resource objects (“resources”) within a computing environment. Resources may be stored in a number of resource spaces, each including service endpoints configured to facilitate access to resources. On creation of a resource, an identifier may be assigned to the resource. Thereafter, the identifier may be used to determine an appropriate service endpoint for accessing the resource. For example, each resource space may submit a set of resolution rules to a resolution server. Each set of resolution rules may be used to identify an appropriate endpoint for accessing a resource. Thereafter, a request for a resource may first retrieve the set of resolution rules, and use such rules to determine an appropriate service endpoint. Illustratively, utilization of resource resolution rules may enable the service endpoint to be modified without requiring modification of client devices.