Abstract: A method of compressing a string array comprising strings with similarity includes selecting a string compression method from among a plurality of available compression methods based on at least which of the available compression method yields the shortest compressed string. The string is then compressed using the selected string compression method. The array of strings to be compressed comprises text characters represented by a first range of values within a word, and compressed string comprises one or more words in a second range of values dedicated to compression and not overlapping with the first range of values. This process is repeated for additional strings in the string array, such that the compression method used for each of a plurality of strings is independently selected.

Abstract: A method, computer system, and a computer program product for calculating bandwidth requirements is provided. The present invention may include receiving a recovery point objective (RPO). The present invention may also include simulating, using a virtual disk, a set of inter-site data transfers between a first data storage controller and a second data storage controller, wherein the second data storage controller is modelled by the virtual disk. The present invention may then include collecting a set of data correlating to a set of bandwidth factors, based on the simulated set of inter-site data transfers. The present invention may further include calculating, using the virtual disk, a bandwidth required for data replication for disaster recovery, based, at least in part, on the set of bandwidth factors and the RPO.

Abstract: Example storage systems and methods provide data storage management using a key data store with progress values. A key data store includes a set of key data entries that each include a key value associated with a storage operation and a timestamp corresponding to a creation time of the key data entry. Storage management processes are executed on the set of key data entries and progress values for the storage management processes are tracked using the timestamps of the key data entries to manage the relative progress of the storage management processes.

Abstract: Techniques are described to improve query evaluation in computer systems. In an embodiment, a system receives a full text query for evaluation against a collection of hierarchically marked data object sets. The query specifies token(s) and context(s) which indicate hierarchical location(s) to match within a queried hierarchical data structure. To evaluate the query, the system determines a) data object set(s) that contain the query specified token(s) using token list(s), and/or b) data object set(s) that contain the query specified context(s) using label list(s).

Abstract: The embodiments set forth techniques for performing incremental backups of a source file system volume (FSV) managed by a source computing device. According to some embodiments, the source computing device can be configured to generate a current snapshot of the source FSV, where the current snapshot complements a previous snapshot of the source FSV (e.g., established during a previous backup). In some cases, to free up storage space, the data for files belonging to the source FSV can be stripped from the previous snapshot (where metadata for the files remains intact). Next, the source computing device can generate, within a destination storage device, a second snapshot of a destination FSV (that corresponds to the source FSV). In turn, the source computing device identifies changes made to the source FSV based on the current snapshot and the previous snapshot, and reflects the changes within the second snapshot of the destination FSV.

Abstract: A database is configured to analyze user queries to dynamically partition the database according to a partition scheme. User queries can be rewritten based on the partition scheme so that, in response to queries, partitions including relevant data are read while partitions including irrelevant data can be skipped, reducing latency. Files can be named according to the partition scheme and stored on respective partitions so that low partition management can be implemented by underlying systems. Blocks within files can be sorted and statistics can be determined. The statistics can be used to find and read relevant blocks and skip irrelevant blocks.

Abstract: The system described herein can automatically match, link, or otherwise associate electronic activities with one or more record objects. For an electronic activity that is eligible or qualifies to be matched with one or more record objects, the system can identify one or more set of rules or rule sets. Using the rule sets, the system can identify candidate record objects. The system can then rank the identified candidate record objects to select one or more record objects with which to associate the electronic activity. The system can then store an association between the electronic activity and the selected one or more record objects.

Abstract: In examples, a system adaptively orders a set of regular expressions based on frequencies that respective regular expressions of the set of regular expressions match a set of messages, the adaptive ordering to produce an adaptively ordered set of regular expressions. The system determines, for a first message of the set of messages, whether a plurality of regular expressions of the adaptively ordered set of regular expressions match the first message. The system constructs a bi-directional graph representing the plurality of regular expressions that match the first message, and classifies a second message based on the adaptively ordered set of regular expressions and the bi-directional graph.

Abstract: A method is provided for preventing dark data in a data set. At a time t1, a first version of the data set is received. The first version is analyzed and its parameters are gathered in a first statistical profile. The first statistical profile is stored. At a time t2, a second version of the data set is received. The second version is analyzed and its parameters are gathered in a second statistical profile. The second statistical profile is stored. The first and second statistical profiles are compared and a similarity index is created. If the similarity index exceeds a pre-set threshold, dissimilarity is flagged and a responsive action is taken.

Abstract: Systems and methods relate to auto-tagging of data in a data lake or a data storage. Generating a statistical summary of the data lake and interactively receiving data in a selected column of an exemplar data addresses an issue of efficiently and accurately auto-tagging data in a data lake. The present disclosure automatically generates a statistical summary of the data lake using a lightweight off-line processing. A graphical user interface interactively receives an exemplar data file with a selection of a column in the exemplar data file. A list of candidate data-tagging patterns is generated based on the statistical summary and updates the list by removing candidate data-tagging patterns that under-generalize the data. The present disclosure determines a data-tagging pattern by selecting a candidate data-tagging profile from the list based on having the least number of matching columns in the data lake.

Abstract: A big data network or system for a process control system or plant includes a big data apparatus including a data storage area configured to store, using a common data schema, multiple types of process data and/or plant data (such as configuration and real-time data) that is used in, generated by or received by the process control system, and one or more data receiver computing devices to receive the data from multiple nodes or devices. The data may be cached and time-stamped at the nodes and streamed to the big data apparatus for storage. The process control system big data system provides services and/or data analyses to automatically or manually discover prescriptive and/or predictive knowledge, and to determine, based on the discovered knowledge, changes and/or additions to the process control system and to the set of services and/or analyses to optimize the process control system or plant.

Abstract: Systems and methods for providing a multi-language search include a query receiver that receives a search query from a search user interface that includes a search term in a first language. A search results evaluator determines whether execution of the search query will produce a sufficient number of search results. A cross-language search manager, in response to determining that the processing of the search query will not produce the sufficient number of search results, obtains a first translated version of the search term, requests that a search be executed by a search engine based on at least the search term and the first translated version of the search term, receives a set of search results from the search engine based on the search; and returns the set of search results to the search user interface.

Abstract: Methods and apparatuses are described for session-based data storage for chat-based communication sessions. A computing device connects to a data storage area associated with an active chat-based communication session, the data storage area comprising data storage slots. The computing device identifies a first data event during the chat-based communication session, the first data event comprising one of a data capture event, a data retrieval event, or a data prefill event. The computing device identifies a data storage slot in the data storage area corresponding to the first data event, the data storage slot comprising a slot name and a slot value. The computing device selects data elements associated with the chat-based communication session for insertion into the data storage slot based upon the event type of the first data event. The computing device stores the selected data elements in the data storage slot for retrieval during the chat-based communication session.

Abstract: Some embodiments of the present invention provide virtual configuration systems and methods that overcome some or all of the downfalls of typical approaches by allowing for persistent configuration of an operating system of a host device. A virtual configuration layer may be incorporated into the file system of the host device and executed to modify configuration data stored outside of the file system, without changing the file system. Once the configuration data is modified, it may be used to configure the file system and/or the operating system of the host device when it is loaded by a client device. In some embodiments, the host device may be nonvolatile storage (e.g., a flash drive) embedded into a client device (e.g., a diskless system).

Abstract: Example embodiments may flatten structured data (e.g., extensible markup language (XML)) to two tables, a lineage table and an attribute table. The lineage table describes hierarchical relationships in the structured data and values of respective elements. The attribute table contains a normalized list of attributes in the structured data. Together the lineage and attribute tables comprise data that could enable recreation of the structured data without any loss of data. In some examples, the tables may be compressed. The flattening of the structured data into two tables, and optional compression of the tables, provides for efficient access and querying of the data. Example embodiments may provide automated and/or processing of additional structured data, ongoing over time, even if the expected hierarchy of the data changes over time.

Abstract: A system for adaptively adjusting related search words are provided. The system includes an input device, a search log collection module, a threshold setting module and a process evolution module. The input device receives a search word. The search log collection module determines whether the cumulative search count of the search word is greater than a first threshold or less than a second threshold. The threshold setting module sets the first threshold and the second threshold in terms of the number of search logs. When the cumulative search count of the search word is between the first threshold and the second threshold, the process evolution module optimizes the middle search process to find out at least one related word and/or at least one historical search word most related to the attributes or content of the search word from the indexed text and the historical search log.

Abstract: Aspects of the present disclosure involve systems, methods, devices, and the like for database sharding. In one embodiment, a system and method are introduced which enable the use of dynamic IDs for use with database sharding. The dynamic ID enables the use of a hierarchical structure such that original and trailing transactional data are identically labeled. To enable the use and labeling two or more unsharded tables may be used.

Abstract: An example operation may include one or more of receiving a database storage request at a decentralized database, executing an operation of the database storage request at a database node based on chaincode to generate a simulated result without committing the database storage request to the decentralized database, determining whether the chaincode of the database node is valid via a functional testing that is performed based on an output of the execution of the database storage request, and, in response to determining the chaincode is valid, endorsing the database storage request for storage at the decentralized database and transmitting the endorsement to one or more database nodes of the decentralized database.

Abstract: A processing device and a method are disclosed in which instructions are executed to determine, from a fingerprint of television content being consumed by a user, what program the user is watching so that program information may be sent for use by a smart device streaming the content to the user. The fingerprint may be compared with a database of fingerprints to find a match. The database may include fingerprints of favorite programs or of previously watched programs. The search may be narrowed according to the user's favorite programs or according to a subset of programs most likely to be watched, e.g., from a chronological history of programs the user usually watches and/or those that viewers in general usually watch in chronological order. When narrowed searches fail to find a fingerprint match, larger subsets up to and including the entire database may be searched for a match.

Abstract: A method includes creating at least one distributed replicated volume having a plurality of sub-volumes, wherein each sub-volume of the plurality of sub-volumes includes at least one brick, creating at least one volfile content file associated with the volume, wherein the at least one volfile content file includes a description of at least one of the plurality of sub-volumes and a description of at least one brick corresponding to the at least one sub-volume, and using the volfile content file to perform an operation on at least one of the plurality of sub-volumes without performing the operation on the other sub-volumes.