Abstract: Disclosed is a method for sharing a content by an electronic device using a cloud service. The method may include: accessing a cloud server through a specified account; displaying a user interface including a list of contents based on a content application being executed; determining at least one shared content to be shared on the cloud server in response to receiving a first input through the user interface; determining an account group on the cloud server accessible to the shared content in response to receiving a second input through the user interface; and transmitting the shared content and information related to the determined account group to the cloud server in response to receiving a third input through the user interface.

Abstract: An information management security health monitoring system is provided herein that can monitor the security health of one or more information management systems, identify any security issues that are occurring within an information management system, and automatically, or in response to a user input, transmit an instruction to the information management system to execute a workflow to resolve the security issue(s). For example, the information management cell health monitoring system receives security data and security policies, and/or similar data from an information management cell(s) via a network. The information management security health monitoring system analyzes the received information to identify any issues. If an issue is detected, the information management security health monitoring system retrieves workflows and determines whether any of the workflows can be used to resolve the detected issue.

Abstract: Methods, apparatus, and processor-readable storage media for automated stateful counter aggregation of device data are provided herein. An example computer-implemented method includes obtaining historical aggregate counter data and historical individual member counter data associated with a variable set of device members and a given temporal period; computing one or more stateful aggregate counter data values attributed to at least a portion of the variable set of device members for a given temporal value by applying at least one stateful counter aggregation algorithm to the obtained data; and performing one or more automated actions based at least in part on the one or more computed stateful aggregate counter data values.

Abstract: A method includes encoding, by an encoding engine, consecutive sections of a received data stream that includes a stream of values. The encoding includes identifying a minimum value in a section of the stream. The encoding includes determining, for each value in the section of the stream, respective differences with the minimum value. An encoded version of the section includes the minimum value and a mask value. The mask value is combined with respective portions of the respective differences to generate the respective differences of each value in the section. The encoded version of the section further includes the respective portions of the respective differences.

Abstract: A method for collecting dark web information is provided. The method for collecting dark web information is performed by a computing device and comprises obtaining a list of onion addresses of a plurality of target dark web sites, accessing at least one of the plurality of target dark web sites, collecting web page information of the accessed dark web site, storing information on the accessed dark web site by analyzing the collected web page information and providing an analysis result of the accessed dark web site by using the stored information on the accessed dark web site.

Abstract: The disclosed technology generally describes efficient garbage collection operations based on chunk filters (e.g., Bloom filters) maintained in association with object table partitions (e.g., trees). When an object update impacts a chunk, a corresponding chunk filter is updated, using the chunk's identifier as a chunk filter key by hashing the chunk identifier into chunk filter locations and setting bits at those locations. When garbage collection occurs, a garbage collection candidate chunk's identifier is similarly hashed to read the bit values at those locations in the chunk filters for the partitions. If any bit is zero, the chunk is definitely not in use in a partition; if no chunk filter for any partition indicates the candidate chunk is possibly in use, the chunk is garbage collected without tree scanning. If tree scanning is needed, only the partition(s) with an associated chunk filter that indicates “possibly in use” need to be scanned.

Abstract: A database-management system (DBMS) archives a record of a database table by updating the record's unique “Archived” field. This indicates that the record should be considered to have been archived despite the fact that the record has not been physically moved to a distinct archival storage area. When a query requests access to the table, the DBMS determines whether the query requests access to only archived data, only active data, or both. If both, the DBMS searches the entire table. Otherwise, the DBMS scans each record's Archived field to consider only those records that satisfy the query's requirement for either archived or active data. If the DBMS incorporates Multi-Version Concurrency Control (MVCC) technology, the DBMS combines this procedure with MVCC's time-based version-selection mechanism.

Abstract: Methods, systems and computer program products are described herein that enable data workload optimization through “what-if” modeling of indexes and index recommendation. In an example aspect, a system is configured to accept a workload comprising a plurality of queries directed at data having a first physical data layout, generate a set of candidate indexes based on the plurality of queries, enumerate index configurations based of the set of candidate indexes, each index configuration comprising a subset on the set of candidate indexes, generate a hierarchical graph of the index configurations, search the hierarchical graph for a recommended index configuration comprising an index configuration with the lowest estimated cost while pruning index configurations not considered from the graph of index configurations to generate a pruned graph, execute a graph query against the pruned graph generating a graph query result and perform an optimization operation based on the graph query result.

Abstract: A non-transitory computer-readable memory medium may store a first table comprising rows, wherein each row comprises a first data set identification (ID) field which stores a measurement data set identifier value identifying a measurement data set, and one or more fields for storing measurement data metadata associated with the identified data set. The medium may also store a second table comprising rows, wherein each row comprises a second data set identification (ID) field which stores a measurement data set identifier value present in the first data set ID field. The second table may also store a datapoints field for storing individual data set datapoints and a data set index field corresponding to an ordering of the individual data set datapoints. At least a portion of each of the fields of both the first and second tables may be stored in a columnar format in contiguous memory.

Abstract: Methods, systems and computer program products are described herein that enable data workload optimization through “what-if” modeling of indexes and index recommendation. In an example aspect, a system is configured to accept a workload in the form of a plurality of data queries, extract indexable columns from the queries, generate candidate indexes from the indexable columns, select and then build the best candidate indexes. Furthermore, the system may receive a query, generate a query plan for the query configured to use one or more of the built candidate indexes, and execute the query plan to generate a query result.

Abstract: Methods and systems are provided for copying one database to another, such as where a database is upgraded from an earlier version to a later version. Database catalog files are used to copy the database table definitions, with appropriate changes made as needed between the first and second databases or database versions.

Abstract: Systems and methods for implementing sequenced filter templates to intelligently reduce a dataset to find useful patterns and source data are disclosed. An expert investigative user may configure a filter template comprising a series of filters organized in a sequence desired by the expert user. The filter template can be customized by an end user to reduce a dataset and perform guide investigation of the reduced dataset.

Abstract: System and methods for an agent tool that identifies high value targets within a particular area, based on an individual's social media activity are disclosed. A computing device displays a user interface generated by an analysis module, and receives an agent's search criteria. Then, the analysis module scans a plurality of social media sites and selects the profile of individuals according to the search criteria. Next, the analysis module identifies the profile of members who are associated to the profile of each previously selected individual, and compares them with the profile of pleased customers. If both profiles match, then the analysis module has identified a high value target. The system also provides the full profile of each high value target found, when needed. The agent tool identifies high value targets in a simpler, less time-consuming and inexpensive way, while increasing the company's revenue.

Abstract: Embodiments utilize trained query performance machine learning (QP-ML) models to predict an optimal compute node cluster size for a given in-memory workload. The QP-ML models include models that predict query task runtimes at various compute node cardinalities, and models that predict network communication time between nodes of the cluster. Embodiments also utilize an analytical model to predict overlap between predicted task runtimes and predicted network communication times. Based on this data, an optimal cluster size is selected for the workload. Embodiments further utilize trained data capacity machine learning (DC-ML) models to predict a minimum number of compute nodes needed to run a workload. The DC-ML models include models that predict the size of the workload dataset in a target data encoding, models that predict the amount of memory needed to run the queries in the workload, and models that predict the memory needed to accommodate changes to the dataset.

Abstract: The disclosed architecture leverages realtime continuous event processing (CEP) to address using a general input interface framework to import a dynamic set of event types (e.g., assets), and using a declarative, expressive query model to implement monitoring and management tasks on an asset level. This is in contrast to looking separately at single values from static databases and/or realtime streams as is common conventionally. The architecture uses the CEP data model to model assets as realtime event types. Thus, queries can be formulated per asset and not just per single stream. The architecture uses the query capabilities of CEP to formulate asset management and monitoring tasks as standing, declarative queries, and uses the input interface of a CEP platform to correlate data from different data sources with different dynamic properties.

Abstract: Disclosed is a method, apparatus, and system for processing a data update message in a multi-agent system comprising a plurality of agents, the operations comprising: receiving, at a second agent, the data update message comprising data for a node in a shared data tree and a first node context map from a first agent, the first node context map comprising last known contexts of all the agents for the node according to knowledge of the first agent; determining, at the second agent, whether any of three conditions relating to the first node context map and a second node context map is true, the second node context map comprising last known contexts of all the agents for the node according to knowledge of the second agent; and in response to determining that none of the three conditions relating to the first node context map and the second node context map is true, updating, at the second agent, the node based on the data update message from the first agent.

Abstract: A method and system for processing signals from a plurality of groups of sensors are described. Each group includes a first sensor and at least one additional sensor. A first sensor identifier and first sensor data are received from the first sensor. At least one additional sensor identifier and additional sensor data are also received from the additional sensor(s). The first sensor and the additional sensor(s) of each group are co-located. The first sensor identifier is associated with the additional sensor identifier(s) for each group. Calibration information for the first sensor is obtained based on the first sensor identifier and the additional sensor identifier(s). The calibration information is specific to the first sensor having the first sensor identifier. Corrected first sensor data for each of the groups is provided based on the first sensor data, the additional sensor data and the calibration information.

Abstract: Example search quality improvement systems and methods are described. In one implementation, a search implementation engine receives a request for an item that includes a first color. The search implementation engine identifies a color representation associated with the first color and determines a second color perceptually similar to the first color based on the color representation. The search implementation engine then identifies an instance of the item having a second color and communicates data associated with the instance of the item to a source of the request.

Abstract: A method, computer system, and computer program product for interactively locating information. Pages of organization information are identified from a number of company portals, websites, and online systems. The pages of organization information are indexed based on structural attributes of the pages and company relevant parameters. A search query is received from a natural language interface. The search query is received within a data context of the user in the organization. The search query is interpreted according to the data context of the user within the organization. A page of organization information is identified according to the interpreted search query. Responsive to identifying the page of information, the pages of organization information are re-indexed based on the search query, the data context, and feedback from the user regarding search results.

Abstract: At least one unique collection of storage artifacts can be specified to indicate that the storage artifact is a member of the unique collection. Each storage artifact can be a discrete object comprising digitally encoded content that is stored as a node within a tree structure of a tangible storage medium. The collection can be referenced by a set of different storage artifacts to form a collection of related storage artifacts. Each storage artifact can correspond to different collections, wherein membership within a collection is independent of a storage path within the tree structure. A file management action relating to the storage artifact can be performed. The file management action can be dependent upon the storage artifact being a member of the unique collection.