Abstract: The systems and methods provide an action recognition and analytics tool for use in manufacturing, health care services, shipping, retailing, restaurants and other similar contexts. Machine learning action recognition can be utilized to determine cycles, processes, actions, sequences, objects and or the like in one or more sensor streams. The sensor streams can include, but are not limited to, one or more video sensor frames, thermal sensor frames, infrared sensor frames, and or three-dimensional depth frames. The analytics tool can provide for establishing traceability.

Abstract: Described are methods and systems for retrieving and serving the regulatory history of a property. For example, an identification of data sources for permits and approvals is stored in a computer system. Property identifiers from the data sources are stored in the computer system. The system identifies the types of permit and approval data available from each of the data sources for each of the property identifiers. A determination can be made of the completeness of the regulatory history available for each property associated with each of said property identifiers. The system receives a request for the regulatory history of at least one of the properties associated with the property identifiers. A web page may be populated with a list of the regulatory history for the property.

Abstract: The disclosed technology includes systems and methods for making visual representations actionable. This technology makes it possible to drill into data, identify records and take action directly, enhancing customized data visualization representations. The technology disclosed relates to a platform for ultra-fast, ad-hoc data exploration and faceted navigation on integrated, heterogeneous data sets. The disclosed systems and methods for adding and customizing quick actions make it possible for developers, admins, and ISVs to provide customized actionable visual data representations with direct linking for accessing data in a company's records and for linking to third party sites, without saving a new state on a server when dashboard elements are updated.

Abstract: A flattened table (FT) of a database of a database management system (DBMS) is defined. The FT logically materializes a number of columns over a number of partitions. The columns include normalized columns, denormalized columns from a plurality of source tables of the database, as well as an aggregate column defining an aggregation of a selected normalized column over a selected denormalized column. A live-aggregate projection (LAP) is defined on the FT of the database. The LAP corresponds to the aggregate column and physically materializes the aggregation of the selected denormalized column over the selected denormalized column, as defined by the aggregate column. The FT is refreshed on-demand, on a per-column, per-partition basis. Responsive to the FT being refreshed on-demand, the LAP is automatically refreshed.

Abstract: In a system in which a database process among processes of a computer is offloaded to one or more hardware circuits each having a memory, the computer divides a column store database made up of a plurality of records and a plurality of columns into a plurality of data segments. One or more columns among the plurality of columns are each one or more compression target columns. Each of the plurality of data segments includes: a column store database portion made up of one or more records among the plurality of records; and a compression dictionary which is a dictionary for decompressing one or more compression target column portions within the column store database portion. The size of the compression dictionary in each of the plurality of data segments is equal to or smaller than the size of the memory.

Abstract: The present disclosure is directed towards providing content that corresponds to physical items. In some implementations, the present disclosure includes storing multiple sets of content that each correspond to a different context and physical item in a set of physical items, receiving data that identifies a particular physical item, selecting a particular set of content that corresponds to the particular physical item, and causing the particular set of content to be output.

Abstract: The illustrative storage management system uses snapshot technologies and performs block-level analysis thereof and to synthesize full backups of a database, regardless of the database management system (DBMS) and content of the database and without involving native DBMS utilities. Synthetic full copies are created efficiently and use network transport resources sparingly. Successive snapshots of the database may be hardware snapshots and/or software snapshots. The illustrative storage management system tracks which data blocks in the database change over time after a baseline full copy is saved to secondary storage. Only the changed blocks are subsequently moved to secondary storage as incremental backups and are indexed for future reference. A synthetic full backup of the database, at a given point in time, may be created by synthesizing the original full backup with changed blocks from any number of later incremental backups.

Abstract: A system and method of use resolves the frustration of repeated manual work during schema mapping. The system utilizes a transformation graph—a collection of nodes (unified attributes) and edges (transformations) in which source attributes are mapped and transformed. The system further leverages existing mappings and transformations for the purpose of suggesting to a user the optimal paths (i.e., the lowest cost paths) for mapping new sources, which is particularly useful when new sources share similarity with previously mapped sources and require the same transformations. As such, the system also promotes an evolving schema by allowing users to select which unified attributes they want to include in a target schema at any time. The system addresses the technical challenge of finding optimal transformation paths and how to present these to the user for evaluation.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for automatic generation of news digests. One of the methods includes accessing a database storing news snapshots, each snapshot identifying a predetermined quantity of top news stories for a period of time, each of the top news stories in a particular snapshot for a particular period of time ranked according to an importance score that measures the importance of the news story relative to other news stories for the particular period of time, determining a digest time period, determining, for the digest time period, all of the snapshots with periods of time included in the digest time period, generating, from the top news stories in the determined snapshots, a digest ranking of digest news stories, and providing, to a user device, data identifying one or more of the digest news stories for presentation according to the digest ranking.

Abstract: A data analysis platform may be based on database views. A build module may receive, from a source code repository, information about a modified definition of a view. The build module may identify schema objects on which the view depends and form instructions for creating the view and the schema objects. The instructions may be executed to form the updated version of the view in a schema space separate from a production schema space. A deployment pipeline may coordinate replacing the production version of the view with the new version in response to validating the new version of the view.

Abstract: A community discovery method is provided. The community discover method includes partitioning nodes in a social network into community nodes partitioned into n first communities, each of the n first communities being associated with a corresponding community label, the corresponding label of each of the community nodes initially indicating a first community from among the n first communities to which the community node belongs, and n being an integer greater than or equal to 2; updating the corresponding label of each community node comprised in the n first communities; and partitioning the community nodes into m second communities, each of the community nodes in each of the m second communities having a same label, and m being a positive integer less than n.

Abstract: A method is described for processing keyed data items that are each associated with a value of a key, the keyed data items being from a plurality of distinct data streams, the processing including collecting the keyed data items, determining, based on contents of at least one of the keyed data items, satisfaction of one or more specified conditions for execution of one or more actions and causing execution of at least one of the one or more actions responsive to the determining.

Abstract: The present application discloses a method and device for exhibition process of network data. The method comprises: acquiring codes of a data list frame of a corresponding page and index identifiers of various pieces of data, after receiving a page exhibition request for network data; exhibiting the data list frame on a current page according to the codes of the data list frame; sending respectively query requests to a background data unit in an asynchronous mode, according to the index identifiers of the various pieces of data, in order to query respectively detailed data corresponding to each of the index identifiers, and exhibiting respectively the queried detailed data in positions of a data list corresponding to the index identifiers. By means of the present invention, hardware cost can be reduced, and the data response speed is improved.

Abstract: Systems and methods are provided that list application programming interfaces (APIs). A categorization tag for each API in the list is generated. The categorization tag identifies functions provided by the API. A user profile associated with the user is determined. A plurality of categories of the APIs is displayed such that each category is based on a common element of each categorization tag, and aspects of the user profile. In response to a selection of one selected category in the plurality of categories, the list of APIs matching the selected category is displayed. The list is ordered such that APIs having a greater relevance score are presented at a top of the list.

Abstract: This specification describes technologies relating to generating transforms based on rule sets. In general, one aspect described in this specification can be embodied in methods that include receiving a rule set including execution cases, where at least one execution case in the rule set includes one or more trigger conditions and a specification of an output that is to be generated when the one or more trigger conditions are all satisfied. The methods may further include generating a control structure including a sequence of rows corresponding to one or more execution cases in the rule set. Each row may include a sequence of one or more trigger conditions and information specifying the output for a corresponding execution case. For at least one of the trigger conditions, when the trigger condition is failed, the control structure may direct processing to skip at least one row in the sequence of rows.

Abstract: One embodiment provides a method, including: receiving, at an information handling device, a user input to play media files associated with a media file type from a playlist comprising a plurality of media files; analyzing, using a processor, the plurality of media files to identify at least one media file not associated with the media file type; disregarding, at least temporarily, based on the analyzing, the at least one media file; and providing, based on the disregarding, output of a media file from the playlist other than the at least temporarily disregarded at least one media file. Other aspects are described and claimed.

Abstract: An indexing system uses a cascade of hash structures to process data entries upon ingest for indexing. The indexing system may be used for enhancing database privacy, anonymization, or data compression. A hash structure, for example, a bloom filter or hash table, passes a representation of the data entries to a subsequent hash structure in the cascade responsive to determining that the hash structure previously filtered an instance of the same representation. The indexing system can generate the representations of the data entries using one or more hash functions. A terminal hash structure of the cascade may index the data entries responsive to determining that the data entries satisfy a criteria for anonymization. For instance, the indexing system determines that there exists a threshold number of data entries describing a population of subjects having the same combination of data elements.

Abstract: Example implementations relate to processing a query of a database and a data stream. For example, a computing device may include a processor. The processor may receive a query associated with at least one of a database and a buffer storing streamed data from a data stream. The database may store database data previously stored in the buffer. The processor may identify a range associated with the query and generate a set of sub-queries including at least one of a buffer sub-query if the range is associated with the streamed data in the buffer and a database sub-query if the range is associated with the database data in the database. The processor may process the set of sub-queries and provide a query result of the query, where the query result is a combination of sub-query results of the set of sub-queries.

Abstract: A method for presenting interactive multimedia programs includes selecting a multimedia program having a plurality of segments, classifying the multimedia program and the plurality of segments according to content, and generating a plurality of additional content items based on the classification, each of which is associated with at least one of the plurality of segments. The method further includes generating a plurality of pre-defined queries for each of the plurality of segments based on a content of the segment and at least one speech recognition grammar based on the plurality of pre-defined queries. The plurality of additional content items are retrievable responsive to the plurality of pre-defined queries. The method further includes generating a data stream including the at least one speech recognition grammar and all of the plurality of additional content items and the plurality of pre-defined queries arranged according to an order of the plurality of segments.

Abstract: Innovations in performing sort operations for dictionary-compressed values of columns in a column-store database using value identifiers (“IDs”) are described. For example, a database system includes a data store and an execution engine. The data store stores values at positions of a column A dictionary maps distinct values to corresponding value IDs. An inverted index stores, for each of the corresponding value IDs, a list of those of the positions that contain the associated distinct value. The execution engine processes a request to sort values at an input set of the positions and identify an output set of the positions for sorted values. In particular, the execution engine iterates through positions stored in the lists of the inverted index. For a given position, the execution engine checks if the given position is one of the input set and, if so, adds the given position to the output set.