Abstract: A data processing system, and an article of manufacturing, join rows associated with a source table column with rows associated with a target table column. A source node and a target node contain the source and target tables, respectively. A reduced representation of selected rows associated with the source table column is generated, as is a representation of the target table column. A filtering module filters the generated reduced representation of selected rows associated with the source table column through the generated representation of the target table column, the filtered generated reduced representation of selected rows identifying source table rows that do not have to be joined with the target table. The rows associated with the source table column minus the filtered generated reduced representation of selected rows are joined to the rows associated with the target table column.

Abstract: A database system includes a query planner with instructions executed by a processor to generate a logical plan tree. Each node of the logical plan tree is a distributed relational algebra operator. Each child node of the logical plan tree produces results processed by a parent node. The logical plan tree includes a distributed relational operator that reparations tuples of results that are at least 1 GB on a dimension and regroups the tuples on the dimension to avoid broadcasting the tuples between machines and thereby avoid consumption of network bandwidth associated with broadcasting the tuples. The logical plan tree is modified according to algebraic transformation rules. The logical plan tree is mapped to distributed query execution primitives. The distributed query execution primitives are processed on machines storing partitions of a distributed database table.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving a series of queries provided from a user device, the series of queries including two or more queries, obtaining a query pattern of the series of queries based on one or more entities and one or more aspects associated with the two or more queries, and determining, at least partially based on the query pattern, that a teachable moment interface is to be displayed with search results, and in response, transmitting content to be displayed in the teachable moment interface on a computing device.

Abstract: Systems and methods are disclosed for resource management in a distributed computing environment. In some embodiments, a resource manager for a large distributed cluster needs to be able to provide resource responses very quickly. But each query may also not be accurate in initial resource request and will often have to come back to the resource manager multiple times. An artifact may provide low latency query responses by using resource request caching that can handle re-requests of resources. According to some embodiments, a queuing mechanism may take into account resources currently expended and any resource requirement estimates available in order to make queuing decisions that meet policies set by an administrator. In some embodiments, scheduling decisions are distribute across a cluster of computing systems while still maintaining approximate compliance with resource management policies set by an administrator.

Abstract: A probabilistic counting structure such as a hyperloglog may be formed during a table scan for each of a selected set of columns. The columns may be selected based on an initial estimate of relatedness, which may be based on data types of the respective columns. An estimated cardinality of an intersection or union of columns may be formed based on an intersection of the probabilistic data structures. A join path may be determined based on the estimated cardinality of an intersection or union of the columns.

Abstract: A method for joining records from database tables is proposed. Join attributes are ordered into a sequence S0, and a scope C is initialized to empty. Tables including a join attribute A that is first in S0 are identified. A new sequence S? omits A from S0. Iteration through each identified table proceeds in join attribute A order. The iteration utilizes a tree index structure for each identified table where the index key includes all join attributes in the identified table in S0 order. For each matched value v of the join attribute located during the iterating, a new scope Cv is created by appending “A=v” to the scope C. If S? is empty, a tuple corresponding to the scope Cv is output. Otherwise, S0 is set to S? and for each scope Cv, C is set to Cv and the steps beginning with the identifying step are recursively invoked.

Abstract: Some event ordering requirements can be determined based on continuous event processing queries. Other event ordering requirements can be determined based on distribution flow types being used to distribute events from event streams to node executing the queries. Events from event streams can be ordered according to ordering semantics that are based on a combination of all of these event ordering requirements. Additionally, virtual computing nodes can be associated with constraints, and computing processors can be associated with capabilities. Virtual computing nodes for processing event streams can be assigned to execute on various computing processors based on both these constraints and capabilities. Additionally, for each of several events in an event stream, a ratio between a total latency and a communication latency can be for determined. Based on an average of these ratios, a quantity of reducing nodes that will be involved in a map-reduce operation can be selected.

Abstract: A recommendation engine for works of literature uses patterns of flow and element similarities for scoring a first user-rated work of literature against one or more recommendation candidate works of literature. Cluster models are created using meta-data modeling the works of literature, the meta-data having literary element categories and instances within each category. Each instance is described by an index value (position in the literature) and significance value (e.g. weight or significance). Cluster finding process(es) invoked for each instance in each category find Similarity Concept clusters and Consistency Trend clusters, which are recorded into the cluster models representing each work of literature. The cluster model can be printed or displayed so that a user can visually understand the ebb and flow of each literary element in the literature, and may be digitally compared to other cluster models of other works of literature for potential recommendation to a user.

Abstract: In one embodiment, a method includes accessing a social graph by a social-networking system. The social graph includes a plurality of nodes and a plurality of edges connecting the nodes. The social-networking system may receive a trigger action from a first user. In response to the trigger action, the social-networking system may generate reaction-cards based at least in part on the trigger action where each reaction-card is associated with a structured query referencing nodes and edges of the social graph. The social-networking system may calculate a reaction-card score for each reaction-card, where the reaction-card score is based on a relevance of the structured query associated with the reaction-card to the trigger action and user-engagement factors. The social-networking system may then send each reaction-card having a reaction-card score greater than a threshold reaction-card score to the first user for display on a page currently accessed by the first user.

Abstract: Methods to perform an operation comprising: identifying a first attribute of a source code in a deep question answering system, computing an influence score for the first attribute based on a rule in the source code used to compute a confidence score for each of a plurality of candidate answers generated by the deep question answering system, computing an importance score for the first attribute based at least in part on the computed influence score, and upon determining that the importance score exceeds a predefined threshold, storing an indication that the first attribute is an important attribute relative to other attributes specified in the source code.

Abstract: A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query.

Abstract: A method and system for supply chain data analysis. The method includes storing supply chain data including test data, genealogy data, repair data, some factors and some items, in one or more databases and selecting a portion of the factors from the stored data, and a time range for analysis. The method then selects one or more criterion for analysis; extracts a portion of the stored data; analyzes the extracted portion of the stored data to detect a plurality of faulty combination of factors and items that results in an unexpected change in a key performance index, according to said extracted portion of the plurality of combinations. The method then performs correlation analysis on said plurality of faulty combinations to determine a root cause for the detected combination of factors; and generates a subset of said plurality of faulty combinations, according to said root causes of said plurality of faulty combinations.

Abstract: Techniques for remotely managed data extraction are disclosed whereby a client data extractor (CDE) is installed on a customer computer system to extract data from the customer computer system for transmission to a destination. Soft configuration techniques can be employed where the configuration data for governing the data extraction are provided to the customer computer system from a service provider computer system on an as-needed basis. Moreover, during extraction, data translation from a source format to a destination format can be performed at the query level to improve efficiency.

Abstract: Improved integrated search techniques. A request for performance of a search for objects is received within a multi-tenant database environment having a plurality of tenants each having individual tenant information. A query is generated in response to the request. The query is specialized based on tenant information corresponding to a tenant from which the request originates. The tenant information is retrieved from the multi-tenant database environment. The query is performed on information stored in the multi-tenant database environment. Results of the query are presented to a user in a graphical user interface.

Abstract: Methods and system are disclosed that provision contextual information associated with business data. In one aspect, a framework middleware receives a request via an application to establish connection. Upon processing the request, the application may establish connection with multiple databases associated with multiple business management systems via an adapter framework associated with the framework middleware. Based on the established connection, the business data from the multiple databases maybe retrieved via a real-time provisioning adapter framework associated with the framework middleware. Multiple routines in the framework middleware may be executed to trigger a system landscape transformation model to transform the retrieved business data. Based on parameters associated with the transformed business data, associated contextual information maybe determined. The determined contextual information may be provisioned by rendering the contextual information on a user interface.

Abstract: The present invention relates to data cleansing, and in particular performing the semantic standardization process within a database before the transform portion of the extract-transform-load (ETL) process. Provided are a method, system and computer program product for standardizing data within a database engine, configuring the standardization function to determine at least one standardized value for at least one data value by applying the standardization table in a context of at least one data value, receiving a database query identifying the standardization function, at least one database value and the context of the data, and invoking the standardization function.

Abstract: The present disclosure relates generally to a data integration system that integrate an object based data integration tool, such a GUI-based data integration tools, with version control systems using a relational database repository for persistence. Examples of distributed version control systems include Git, Mercurial, and Bazaar, and examples of centralized version control systems include Subversion, CVS etc. in centralized or distributed environments.

Abstract: Provided are techniques for distributed balanced optimization for an Extract, Transform, and Load (ETL) job across distributed systems of participating ETL servers using a data flow graph with links and stages for an ETL job to be executed by participating ETL servers is received. A distributed job execution plan is generated that breaks the data flow graph into job segments. The job segments each include a subset of the links and stages and map to one participating ETL server from the distributed systems to meet an optimization criteria across the distributed systems. The job segments are distributed to the participating ETL servers based on the mappings for parallel execution. Also, the distributed job execution plan utilizes statistics to reduce data movement and redundancies and to balance workloads across the distributed systems.

Abstract: A system and method for the automated monitoring of inmate telephone calls as well as multi-modal search, retrieval and playback capabilities for said calls. A general term for such capabilities is multi-modal audio mining. The invention is designed to provide an efficient means for organizations such as correctional facilities to identify and monitor the contents of telephone conversations and to provide evidence of possible inappropriate conduct and/or criminal activity of inmates by analyzing monitored telephone conversations for events, including, but not limited to, the addition of third parties, the discussion of particular topics, and the mention of certain entities.

Abstract: A processing request is received. The processing request includes information about a first location where a set of data is stored and information about a second location where the set of data is to be transferred. The size of the set of data is determined. The size of the available portion of the second location is determined. If the size of the set of data is smaller than the size of the available portion of the second location is determined. Responsive to determining the size of the set of data is larger than the size of the available portion of the second location, the size of the available portion is requested to be increased. The size of the available portion of the second location is increased to a size larger than the determined size of the set of data.

Abstract: A system, method, and computer-readable storage medium configured to facilitate the parallel transfer of Structured Query Language (SQL) data to a software framework.

Abstract: A method for communicating data includes customizing content transformation agents for different source data repositories, and providing the content transformation agents to the different source data repositories. First-stage data feeds from the different source data repositories are constructed in a neutral format by dynamically selecting and transforming source data in the different source data repositories into the neutral format. The first-stage data feeds are sent to an aggregation agent which generates, based on criteria specified by a user, a second stage data feed as a composite of selected source data from the first-stage data feeds.

Abstract: Resources for data lineage discovery, data lineage analysis, role-based security, notification. The resources may include or involve machine readable memory that is configured to store a technical data element (“TDE”); a receiver that is configured to receive a query for data lineage information corresponding to a business element identifier; and a processor configured to: register a logical association between the business element identifier and the TDE; and formulate the data lineage information of the TDE associated with the business element identifier. The receiver may be configured to receive a criterion that is required to access one or more technical data elements (“TDEs”) associated with the business element identifier. The receiver may be configured to receive an election to receive a notification of a change of data lineage. The processor may be configured to toggle between a first data lineage graph and a second data lineage graph.

Abstract: A data storage system with quorum-based commits sometimes experiences replica failure, due to unavailability of a replica-hosting node, for example. Described herein are methods and systems for improving data persistence and availability in a distributed data store where data is stored in a plurality of shards and a given shard is replicated across a plurality of nodes so as to create a plurality of replicas, and a quorum of replicas is needed for access to the given shard. Among other things, the methods and systems generally involve determining whether to quarantine or delete unavailable replicas in a given shard, and how to handle purge requests related to the shard when there are quarantined replicas.

Abstract: A computer implemented method for reading signatures corresponding to a portion of data on a virtual machine disk on a production site, wherein reading the signature includes mapping the virtual machine disk offset into a physical storage offset, and reading the signature from the physical storage; sending the signature of the portion of data to a replication site; obtaining a mapping from a virtual disk to a physical disk at the replica site; issuing a command to write a portion of data corresponding to the signature to a the physical storage based on the mapping of the replica of the virtual machine disk on the replication site; determining if the command was successful; and based on a determination that the command was not successful, marking the locations corresponding to the signature for synchronization in a synchronization structure.

Abstract: A device may receive information for an attribute to include in a shared attribute library. The information may include an attribute identifier, data variables needed to compute a value of the attribute, and source code for computing the value of the attribute. The source code may be written in a first programming language. The device may receive a first request to compute the value of the attribute based on a first set of data variables from a first type of data application and a second request to compute the value of the attribute based on a second set of data variables from a second type of data application that is different than the first type of data application. The device may select a computing server, which may execute the first programming language, to compute the value of the attribute based on the first and second sets of data variables.

Abstract: Dynamically generating a model for a report includes presenting a user with source data by a source application, wherein the source data is available for producing a report. Selections are received from the user indicating portions of the source data to potentially include in the report. In response to receiving the user selections, a computer system builder module generates an analytic processing model for the user selected portions of the source data.

Abstract: The current document is directed to methods and systems for processing, classifying, and efficiently storing large volumes of event messages generated in modern computing systems. In a disclosed implementation, received event messages are assigned to event-message clusters based on non-parameter tokens identified within the event messages. A parsing function is generated for each cluster that is used to extract data from incoming event messages and to prepare event records from event messages that more efficiently and accessible store event information. The parsing functions also provide an alternative basis for assignment of event massages to clusters.

Abstract: An item categorization service is described that automatically categorizes items of interest to a user. The user may possess an item that they wish to offer for sale using a network-based service. The user may submit item information to the item categorization service to categorize the item of interest. Upon receipt, the categorization service may assess the relevance of the item information to hierarchically organized categories maintained by the network-based service. Categories having the highest relevance may be identified as first category candidates. The deepest common ancestor of the first category candidates may be identified the first category. One or more categories, representing sub-categories of the first category, may be identified as and subjected to relevance assessment. Those sub-categories having the highest relevance may be identified as second category candidates. The deepest common ancestor of the second category candidates may be identified as a second category for the item of interest.

Abstract: Entity mappings that produce matching entities for a first data asset having attributes and a second data asset having attributes are generated by: generating entity mappings that produce matching entities for a first data asset having attributes with attribute values and a second data asset having attributes with attribute values by: matching the attribute values of the attributes of the first data asset with the attribute values of the attributes of the second data asset, using the matching attribute values to generate matching attribute pairs, and using the matching attribute pairs to identify entity mappings; computing an entity mapping score for each of the entity mappings based on a combination of factors; ranking the entity mappings based on each entity mapping score; and using some of the ranked entity mappings to determine whether a same real-world entity is described by the first data asset and the second data asset.

Abstract: In embodiments of the disclosed technology, indexes, such as inverted indexes, are updated only as necessary to guarantee answer precision within predefined thresholds which are determined with little cost in comparison to the updates of the indexes themselves. With the present technology, a batch of daily updates can be processed in a matter of minutes, rather than a few hours for rebuilding an index, and a query may be answered with assurances that the results are accurate or within a threshold of accuracy.

Abstract: The collection of social data from social networking services for moderation purposes is improved by analyzing social mentions captured using an initial set of capture rules. The text and/or metadata of social mentions previously captured using an initial rule set of capture rules may be analyzed to identify common text and/or common metadata amongst those social mentions. A new rule set may be generated with capture rules having criteria selected based on the identified common text and/or common metadata. The new rule set may then be applied to capture new social data.

Abstract: Described herein is a method and system of geometrically encoding data including partitioning data into a plurality of semantic classes based on a dissimilarity metric, generating a subspace formed by first and second data elements, the first and second data elements being included in first and second numbers of partitioned semantic classes, encoding the first data element with respect to the second data element such that the generated subspace formed by the first data element and the second data element is orthogonal, computing a weight distribution of the first data element with respect to the second data element, the weight distribution being performed for each of the first number of semantic classes and the second number of semantic classes, and determining a dominant semantic class corresponding to an ordered sequence of the first data element and the second data element, the dominant semantic class having a maximum weight distribution.

Abstract: A method includes receiving, from an audio streaming system, a probe audio sample and identifying sufficiently matching reference audio samples based on a first comparison of a first portion of the probe audio sample to reference audio samples. The method also includes, in response to determining that the sufficiently matching reference audio samples do not meet a predetermined score threshold, retaining the sufficiently matching reference audio samples, identifying additional matching reference audio samples based on a second comparison a second portion of the probe audio sample to the reference audio samples, and outputting at least one of the reference audio samples based on the first comparison and the second comparison.

Abstract: A method operates an infotainment system in order to provide an overview of audio data records detected by a music output device. An evaluation device arranges the detected audio data records into an audio data record group according to a selection criterion, e.g. the artist. The evaluation device determines a value of a predetermined user-relevant evaluation variable for each audio data record. On the basis of the respective values, the evaluation device then determines a ranking list of the audio data records in each audio data record group. The evaluation device generates a digital image for each audio data record and assigns the images of those audio data records that are combined into an audio data record group to an image group. The position of the images in an image group depends on the position of the respective associated audio data record in the ranking list.

Abstract: Providing a search engine with system configuration information. The system configuration information pertains to a system having a web server that provides content. For example, the content may be web pages associated with a web site, and the system may include hardware and software used to provide the content of the web site to end users. More particularly, the system can include one or more computer systems, web server software, application server software, and application programs that facilitate providing content. A search engine requests system configuration information from the web server. In response to the request, the web server provides system configuration information to the search engine. The search engine can use the system configuration information to reference portions of the content in an index. The index can be used to respond to a search query that involves content served by the web server.

Abstract: A method and a system for filtering a plurality of search results in a web page and a computer program product therefor are provided. The method includes, receiving search results corresponding to a search request, and classify the plurality of search results to a plurality of group according to contents of the plurality of search results, wherein the plurality of search results having the same content are classified to the same group. The method also includes generating and storing an identification value corresponding to each of the groups. The method further includes displaying the plurality of search results and marking search results belonging to the same group according to the identification value, and executing a shield operation on at least one search results among the plurality of search results.

Abstract: Systems and methods for automating the retrieval of partitionable search results from a database and reducing the latency of delivering the partitionable search results are disclosed. A query for searching a database is constructed. Multiple processing tasks are assigned and executed to retrieve partitioned search results from a database in parallel. Each partition of search results is returned to the user as response messages. Response messages may be continuously received until all search results responsive to the query have been retrieved from the database. When multiple processing tasks are used to retrieve and deliver partitioned search results in parallel, server, internet and client resources are optimized, and the throughput of search results and metadata are increased, and the process of narrowing or filtering search results is an interactive and informed process for the user.

Abstract: Concepts and technologies are disclosed herein for detecting and using mood-condition affinities. A processor that executes an affinity service or affinity application can obtain collected data associated with a user device. The collected data can include sensor readings collected by the user device. The processor can determine a condition at the user device and a mood associated with the condition. The processor can generate an affinity that defines a relationship between the condition and the mood and store the affinity at a data storage device.

Abstract: In various example embodiments, systems and methods to provide content recommendations are provided. Search parameters are received from a user. An attribute associated with the user is derived. Using the search parameters and the attribute, content from a database that is within a predetermined margin of difference of the derived attribute are determined. A list of the content is caused to be presented in a user interface of the user.

Abstract: Techniques are disclosed for allowing users to access data libraries associated with multiple, isolated runtime environments (RTEs). A web query application receives a query and determines an RTE to execute the query against. The web query application determines whether a current RTE matches the determined RTE. If the web query application determines that the current RTE does not match the determined RTE, the web query application configures a server computing system to access the determined RTE and execute the query against data libraries associated with the determined RTE. If the web query application determines that the current RTE matches the determined RTE, the web query application executes the query against the data libraries associated with the current RTE.

Abstract: Resource links also known as Unified Resource Links (URL's), bookmarks, hyperlinks etc. located in a category hierarchy. The resource links are used to navigate on the world wide web, on a local machine, on the internet, or on an intranet. A method of assessing a users competence in a category in the category structure comprising the steps of analysing the users interaction with the resource links placed in the hierarchy table for that category and extracting a competence level for the user in that category.

Abstract: A preference-information gathering system is capable of gathering information on every commodity and/or every service, which are each of interest to a user, as user's preference information. The preference-information gathering system includes a user portable terminal capable of storing a user identifier uniquely identifying the user, an information searching apparatus and a preference-information management apparatus for managing the information on preferences with the user. The information searching apparatus has a search-information inputting unit for requesting a user to enter search information to be used in a process to search for information desired by the user and a user-identifier acquisition unit for acquiring a user identifier.

Abstract: In response to a first request for query received from a user device over a network, a search identifier (ID) identifying a search transaction is generated. A search engine performs a search within a content database based on one or more keywords, generating a set of content items. For at least one of the content items, an encoder encodes the search ID and a content ID identifying the content item into a machine-readable code and attaches the machine-readable code to the content item. A search result page is generated by incorporating the set of content items, where at least one of the content items in the search result includes a machine-readable code having the search ID and its content ID encoded therein. The search result page is transmitted to the user device over the network.

Abstract: A social networking system builds a quality controlled and desired population-representative pool of human raters to provide ratings on content items to improve a feed ranking model used for providing its users with more relevant content. The system identifies a pool of candidate human raters for providing ratings on a feed of content items. For each candidate human rater of the pool of candidate human raters, the system presents a feed of content items based on a feed ranking model, obtains ratings on the feed of content items, and determines a score representing the consistency of the obtained ratings, the representativeness of the pool of human raters, or the relevance of the content provided by the ranking model. The system uses the computed scores to modify the ranking model used to present content to its users for improving the relevance of the presented content.

Abstract: Users may engage with content that may invoke various emotions. For example, a user may find an image as inspirational, a social network post as funny, etc. Accordingly, content may be labeled with user emotion labels, specified by users that engaged with the content, to create labeled content (e.g., the image may be labeled as inspirational). Emotional transition triggers may be defined for users (e.g., 30 minutes of a user writing a school report using a word processing application). Responsive to a triggering of an emotional transition trigger, labeled content may be provided to a user (e.g., the image may be provided to the user as an inspirational break from writing the school report). In this way, content may be labeled based upon emotions that the content invokes in users, and such labeled content may be provided to users in a contextually relevant manner (e.g., a study break).

Abstract: Embodiments of the invention relate to file sharing, and more specifically to sharing image files based on a social networking relationship. A digital image and associated file are created with geotag data that defines an image capture. Data associated with the image capture is stored as image metadata associated with the image file. A hyperlink to a preferred viewing URL is created and established based on a match produced from a comparison of the image file image capture data with at least one physical location identified in an index of cached data. The hyperlink is associated with the image file and directs a viewer to the physical and/or virtual location where the image was captured.

Abstract: Systems and methods for providing notifications based on geofencing search results are provided. In particular, in response to a search query from a user, a plurality of search results can be determined. One or more physical search results having an associated geographic location can be determined from the plurality of search results. A geofencing search result can be generated for at least one of the physical search results. The geofencing search result can include data for establishing a geofence proximate to the geographic location by a user device associated with the user. Upon selection of the geofencing search result by the user, the geofence can be established by the user device. Upon detecting entry into the established geofence, the user device can provide one or more notifications associated with the geofence and/or the search query to the user.

Abstract: Methods, including computer programs encoded on a computer storage medium, for indexing native application data. In one aspect, a method includes: receiving, by a search engine and from a mobile device, a set of data that is generated by a native application on the mobile device, the set of data including (i) data that identifies the native application, (ii) a representation of viewed content, (iii) a link to the viewed content that, when selected, launches the viewed content in the native application; storing, by the search engine, (i) the data that identifies the native application, and (ii) the link to the viewed content in association with the viewed content; and using the stored set of data in generating a search result that (i) references the viewed content, and (ii) includes the link to the viewed content that, when selected, launches the viewed content in the native application.

Abstract: Systems and methods for providing access to a collection of related binary files via a collection of machine-recognizable codes provided on a device or consumer item.