Abstract: Aspects of the subject technology relate to a system that analyzes customers' AMI load curves, identifies evening peak users as defined by their load curves, and provides Energy Efficiency (EE) advice related to their periods of high use. For example, identified high evening users can be sent an email with normative comparisons on evening load use, along with tips to reduce energy usage. Other aspects relate to the additional targets/communications. Aspects of the subject technology relate to categorizing a user's energy consumption tendencies based on a user's load curve and providing customized content based on the user's category. By taking into consideration the user's actual energy consumption patterns, the system may be able to provide more relevant content to the user.

Abstract: A data store may implement dynamic query predicates for processing queries. Query predicate indexes may be maintained for individual storage locations in a data store. The query predicate indexes may indicate data values not stored in the storage location that satisfy a query predicate in the query predicate index. The query predicate index may be populated when queries are received at the data store which include new query predicates. When queries are received that include query predicates that correspond to query predicates in the query predicate index, the index values for each of the storage locations may be evaluated. Based, at least in part, on the evaluation, particular storage locations may be identified to read for servicing the queries.

Abstract: A record management system retrieves relevance information through an information retrieval model that models relevance between users, queries, and records based on user interaction data with records. Relevance information between different elements of the record management system are determined through a set of learned transformations in the information retrieval model. The record management system can quickly retrieve relevance information between different elements of the record management system given the set of learned transformations in the information retrieval model, without the need to construct separate systems for different types of relevance information. Moreover, even without access to contents of records, the record management system can determine relevant records for a given query based on user interaction data and the determined relationships between users, queries, and records learned through the information retrieval model.

Abstract: Systems and methods are described for determining data usage behavior in a database system. The systems and methods can include receiving, from one or more applications, a plurality of SQL queries, storing the received SQL queries, receiving one or more characteristics, each characteristic relating to one or more respective fields, determining one or more data usage categories, wherein a data usage category has one or more characteristics values corresponding to one or more stored field values of the one or more respective fields, comparing the data selection condition of at least one stored SQL query with the determined one or more data usage categories, and incrementing a data usage counter associated with a identified data usage category if the data selection condition of the at least one stored SQL query indicates at least one query access to stored data including field values in accordance with the identified data usage category.

Abstract: A batch data query method and apparatus are provided. According to the method, multiple logical query plan trees corresponding to multiple query statements are obtained. The multiple logical query plan trees are divided into multiple query groups according to operators of each logical query plan tree. Logical query plan trees in each query group have the following relationship: an inter-query write-read dependency relationship, an operator overlap relationship, or an operand overlap relationship. Then, inter-query optimization is performed on the logical query plan trees in each query group, and multiple corresponding physical query plan trees are generated according to the multiple optimized logical query plan trees. Finally, physical queries are executed according to the multiple physical query plan trees, to obtain query results of the multiple query statements.

Abstract: Methods and apparatus are provided for automatically transcoding media files. An exemplary method comprises obtaining an input media file having an input file format and encoded with a codec of a first type; automatically determining output media file formats for transcoding the input media file based on statistics of previously transcoded files and statistics of trending media formats for previously downloaded files; and transcoding the input media file into transcoded output media files using a codec of a second type to obtain the determined output media file formats. The output media file formats can be automatically determined using a weighting scheme. Transcoding algorithms are optionally automatically selected based on transcoding algorithms previously used to transcode proximally similar files as the input media file.

Abstract: Embodiments of the present systems and methods may provide a fundamentally different approach to process the ‘search key words’ from users. For example, the process may progress through a series of steps that will understand ‘WHY’ a user is looking for the information instead of just ‘WHAT’ the user is searching. This will give the present techniques a very different way to look for the information and generate the search outputs. For example, a method may provide search results to a user of a computing device, the method may comprise receiving at least one search term from the user via the computing device, collecting information relating to the user other than the at least one search term, and providing search results to the user via the computing device based on the search term and on the collected information relating to the user.

Abstract: Techniques herein are for query editing with semantic analysis of a query based on information extracted from a tuple graph. In an embodiment, a computerized method involves processing a dataset to extract an extracted schema that describes types and relationships that occur within the dataset. The dataset is not associated with a schema that is not contained in the dataset. The dataset has a graph of tuples. During an incremental parse, an abstract syntax tree (AST) that represents a query is modified. The extracted schema and the dataset are used to perform semantic analysis on the AST. In an embodiment, the tuples are resource description framework (RDF) triples. In an embodiment, the RDF triples include RDF schema statements. Extracting an extracted schema involves processing RDF schema statements. In an embodiment, the query is a SPARQL query and semantic analysis includes error alerting and code completion.

Abstract: Systems and methods are disclosed for distributed file collection and processing. According to certain embodiments, a producer system may detect a producer configuration file that specifies a file type, identify at least one file of the specified file type, and send the at least one identified file to a collector system. A conductor system may receive a request from a consumer system and allocate the at least one identified file to the consumer system based on the request. The collector system may receive the at least one identified file from the producer system. The consumer system may send the request to the conductor system and pull the at least one identified file from the collector system.

Abstract: Example implementations relate to records based on bit-shifting. For example, a computing device may include at least one processor to receive a query, create a normalized query, and generate a mapping of the normalized query for each record in a set of records in a database using a state array, the mapping being based on bit-shifting of bits associated with similarities between each character in the normalized query and each character in a field of the respective record in the set of records, each successive level of the state array indicating a stronger match between the query and the respective record than an immediately prior level in the state array. The processor may calculate a score associated with each record based on the respective mapping and may provide a subset of the set of records in response to the query based on the score associated with each record.

Abstract: A computer-implemented method and a system for implementation the method are provided. The method includes receiving user activity data for a first set of users of a streaming media system, in which the first set of users having access to a first catalog. Additional user activity data for a second set of users is received. The second set of users has access to a second catalog, which includes media items also present in the first catalog. The second catalog further includes an exclusive media item that is not included in the first catalog. A probability that a user of the first set of users would play the exclusive media item if presented by the streaming media system with the exclusive media item is determined. Information is provided to a user of the second set of users as a recommendation to play the exclusive media item based on the probability.

Abstract: The present disclosure relates to methods, systems, and storage media for updating field-value pairs of record objects using electronic activities linked to the record objects. The method can maintain a plurality of node profiles corresponding to a plurality of unique entities; access a plurality of electronic activities transmitted or received via electronic accounts associated with one or more data source providers; identify a record object of a plurality of record objects of one or more systems of record; match electronic activity of the plurality of electronic activities to the record object based on content of the electronic activity and the object field-value pairs of the record object; identify a node profile matched with the electronic activity of the plurality of electronic activities; determine a weighting factor for the electronic activity; and update a stage field of the record object to a second stage value indicating a second proximity to the completion of the event.

Abstract: A computer-implemented method and system for publishing an aggregate rating indicator based on a plurality of discrete rating indicators associated with a rated entity. The method includes searching a plurality of repositories containing the plurality of discrete rating indicators associated with the rated entity. The method may include retrieving a first rating indicator, a second rating indicator, and a third rating indicator. At least one of the first rating indicator, the second rating indicator, and the third rating indicator may be a fraudulent rating indicator. The method may include filtering out the fraudulent rating indicator from among the first, second, and third rating indicators, wherein the fraudulent rating indicator is determined based on a combination of parameters. The method may include aggregating the first, second, and third rating indicators after filtering out the fraudulent rating indicator such that the aggregation results in an aggregate rating indicator.

Abstract: In some embodiments, a method can comprise receiving a search query and performing a search based at least in part on the search query. In many embodiments, the search can return a plurality of search results, the plurality of search results can comprise a plurality of attributes. In some embodiments, the method can further comprise selecting at least two of the plurality of search results and sorting an order of the at least two of the plurality of search results by a ranking of the plurality of attributes of the at least two of the plurality of search results, the ranking of the at least two of the plurality of attributes of the plurality of search results based at least in part on a context of the search query. In many embodiments, the method can comprise facilitating display of the at least two of the plurality of search results. Other embodiments of related methods and systems are also provided.

Abstract: An extraction device according to the present application includes an acquisition unit and a notification unit. The acquisition unit makes a web search engine execute extraction processing based on an arbitrary query received from an information user and acquires, as an extraction result, the number of users corresponding to the arbitrary query from behavior histories of users to be processed. The notification unit notifies the number of users acquired by the acquisition unit to the information user who posts the arbitrary query. More specifically, based on a query related to setting of a condition about behavior or an attribution of the user, the acquisition unit acquires the number of users corresponding to the query.

Abstract: Aspects of the subject technology relate to a system that analyzes customers' AMI load curves, identifies evening peak users as defined by their load curves, and provides Energy Efficiency (EE) advice related to their periods of high use. For example, identified high evening users can be sent an email with normative comparisons on evening load use, along with tips to reduce energy usage. Other aspects relate to additional targets/communications. Aspects of the subject technology relate to categorizing a user's energy consumption tendencies based on a user's load curve and providing customized content based on the user's category. By taking into consideration the user's actual energy consumption patterns, the system may be able to provide more relevant content to the user.

Abstract: Techniques for generating and transferring bulk messages from one computing device to another computing device in a cluster are provided. Each computing device in a cluster is assigned a different set of nodes of a graph. A first computing device may be assigned a particular node that is neighbors with multiple other nodes that are assigned to one or more other computing devices in the cluster. When processing graph-related code at the first computing device, information about the neighbors may be required. The first computing device receives a bulk message from one of the other computing devices. The bulk message contains information about at least a subset of the neighbors. Therefore, the first computing device is not required to send multiple messages for information about the subset of neighbors. In fact, the first computing device is not required to send any message for the information.

Abstract: Approaches for indexing and comparing charts are described. A system can receive one or more charts, which may include depictions of signals, and index portions of a chart using a sliding window algorithm. Subsequently, a system can receive a query that can be compared to the indexed portions of one or more charts. After a comparison, the most similar portions of the compared charts are provided based on a nearest neighbor search.

Abstract: Query conditions are received in a cache from a query optimizer of a Database Management System (DBMS). Dynamic statistics for the query conditions are maintained in the cache. Actual statistics are received in the cache after the query conditions are executed in the DBMS. Entropy-based estimated selectivity values for executing the query conditions are provided to the query optimizer to develop a query plan for executing queries having the query conditions. The entropy-based estimated selectivity values based, at least in part, on the dynamic statistics and the actual statistics.

Abstract: A method, computing system, and computer-readable medium for assigning global edge IDs for evolving graphs are described herein. The method includes selecting a block size for an evolving graph and, as new vertices are added to the evolving graph, calculating block IDs for the evolving graph. Calculating the block IDs includes creating a table representing the evolving graph and, as new vertices are added to the evolving graph, calculating block IDs for cells in a new column of the table before calculating block IDs for cells in a new row of the table. The method also includes calculating global edge IDs for the evolving graph based on the source vertex ID, the target vertex ID, and the block ID for the block at which each edge is located. The method may also include calculating incremental Page Rank for the evolving graph.