Abstract: Systems and methods for automated data curation and presentation are disclosed herein. The system can include a memory including a structured database and a plurality of storage bins. The system can include at least one server that can receive a packetized data file generated from a data file. This packetized data file can include a first packet generated from a content file of the data file, a second packet generated from metadata of the data file, and a third packet generated from a payload of the data file. The at least one server can automatically generate at least one tag for the packetized data file, which at least one tag is automatically generated based at least one key phrase identified in at least the targeted portion of the content file.

Abstract: Embodiments of the invention provide systems and methods for managing and processing large amounts of complex and high-velocity data by capturing and extracting high-value data from low value data using big data and related technologies. Illustrative database systems described herein may collect and process data while extracting or generating high-value data. The high-value data may be handled by databases providing functions such as multi-temporality, provenance, flashback, and registered queries. In some examples, computing models and system may be implemented to combine knowledge and process management aspects with the near real-time data processing frameworks in a data-driven situation aware computing system.

Abstract: A browsing history associated with a user of a client device is received from the client device. One or more keywords associated with a target audience for a variant of a web page are received from a content provider system. A score is determined for the user based on the browsing history for the user and the one or more keywords associated with the target audience. The user is identified as part of the target audience based on the score for the user satisfying a score threshold. The variant of the web page is caused to be presented at the client device associated with the user.

Abstract: Systems, computer program products, and methods are described herein for implementing cognitive self-healing in knowledge based deep learning models. The present invention is configured to receive, via the real-time resource transmission session, one or more query strings from the user; transform the one or more query strings into one or more multi-dimensional query vectors; electronically retrieve one or more multi-dimensional resource vectors from a resource repository; determine a similarity index between the one or more multi-dimensional query vectors and one or more multi-dimensional resource vectors; determine a first multi-dimensional resource vector associated with at least one of the one or more multi-dimensional resource vectors; rasterize the first multi-dimensional resource vector into one or more grid of pixels to generate a first resource; and display, via the real-time resource transmission session, the first resource.

Abstract: A system receives a query and an information space is queried based on the query. Results of the query of the information space are received and each of the results is associated with a respective time period. Each of a plurality of pictograms representing one or more results that are associated with the respective time period is determined. The plurality of pictograms are displayed in a linear progression and in chronological order with respect to one another based on their respective time periods.

Abstract: A novel distributed data storage system is disclosed. In an example method, a first plurality of key entries is stored in a first key data store at a first location and a second plurality of key entries is stored in a second key data at a second location. A key entry in comprises a corresponding key having an object identifier, an inverse timestamp, and a source identifier. The method further replicates a set of the first key entries to the second key data store. The method further inserts each first key entry from the set of the first key entries into the second key data store based on the object identifier, the inverse timestamp, and the source identifier of the first key included in that first key entry, the first key entries and the second key entries being interwoven to form a plurality of interwoven ordered key entries.

Abstract: A method for backup across redundant removable media includes the steps of selecting a current portion of a database to add to a backup collection. The backup collection includes N units of the removable media. N is an integer greater than two. Generating a backup file of a current file in the database using a K-of-N coding process. K is an integer less than N. The backup file has N parts. The current file may be recovered from any K parts among the N parts. Determining if less than N?K+1 backups of the current file exist in the backup collection. Writing a subset of the current file to a current unit of the N units in response to the backup collection having less than the N?K+1 backups. Writing a current part among the N parts of the backup file to the current unit.

Abstract: A search engine system according to one embodiment includes a slashtag server having a hardware processor and memory storing instructions configured to cause the slashtag server to receive a search query regarding a search of an internet, detect at least one key word in the search query, search the internet based on the at least one key word, analyze results of the search query to determine relevant filter criteria in the results of the search query, generate an alternative search query based on the relevant filter criteria, and send the web server the alternative search query, where the alternative search query includes a search operator wrapped in a predetermined syntax and inserted by the slashtag server, and where a last entered key word of the at least one key word in the search query is removed such that it is not included in the alternative search query.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for modifying queries in a discourse context. In one aspect, a method includes determining whether a query received from a user device subsequent to information provided to a user device and that defines a discourse context belongs to the discourse context. If the query belongs to the discourse context, the query is modified to take into account attributes of the discourse context.

Abstract: A system for a cluster gateway to multiple filesystems comprises a cluster interface, a target filesystem, a command tailor, and a filesystem interface. The cluster interface is for receiving a filesystem command from a cluster. The target filesystem determiner is for determining a target filesystem of a set of filesystems based at least in part on the filesystem command. The command tailor is for determining a tailored command of the filesystem command for the target filesystem. The filesystem interface is for providing the tailored command to the target filesystem.

Abstract: A temporal DB that stores data having been stored in a DB of a mainframe is provided in a DB dedicated device 20. During a DB update, when an application on a mainframe issues an update SQL, a DBMS updates the DB and stores an update log, and an update-log capturing unit periodically reads out the update log. In the DB dedicated device 20, an update-log applying unit updates the temporal DB based on the update log. During DB reference, when the application on the mainframe issues an inquiry SQL with inquiry target time attached, the DBMS transfers the inquiry SQL to the inquiry processing unit. In the DB dedicated device, the inquiry processing unit inquires the temporal DB about data for the inquiry target time and returns an inquiry result to the DBMS.

Abstract: The subject technology receives a query plan, the query plan comprising a set of query operations, the set of query operations including at least one aggregation and a join operation, the join operation including a build side and a probe side. The subject technology inserts an aggregation operator below the probe side of the join operation. The subject technology causes the build side of the join operation to generate a hash table. The subject technology causes the build side of the join operation to generate a bloom filter based at least in part on the hash table and provide information, corresponding to properties of the build side, to a bloom filter. Based at least in part on the information, the subject technology determines at least one property of the join operation to determine whether to switch the aggregation operator to a pass through mode.

Abstract: A system, method and computer program product for retrieving trajectory data from huge datasets. In the method, there is received, at a processor device, a user query including a request for displaying trajectory data at a user device. From the user query, a query type and a current map visualization scale setting (mapscale) for visualizing the trajectory data on the user device display is determined. Then, responsive to a user query type and the determined mapscale setting, a corresponding reference level is selected. Based on the selected reference level, there is accessed from a memory storage device a data set of compressed trajectory data. This compressed trajectory data set is communicated to the user device, for presentation on the user device display. In one aspect, the system and method is adaptive, enabling storage and retrieval of trajectory data according to various degrees of visualization or granularity.

Abstract: A computer-implemented method and a system parse and aggregate unstructured data objects. The method includes obtaining the unstructured data objects from description fields of records in a database comprising client tickets that are created for application maintenance, transforming the obtained unstructured data objects to create transformed data objects, identifying a number of criteria attributes of the client tickets, where the number of criteria attributes are determined according to at least part of the transformed data objects, word importance, word sentiment, a user input, or client ticket priorities, or any combinations, and generating a plurality of ticket reports by aggregating the client tickets according to ranking orders of numbers of tickets for the client tickets and the identified criteria attributes.

Abstract: Disclosed herein are methods, systems, and processes to optimize migration of databases in high availability and disaster recovery (HADR) computing environments. An endpoint associated with a new primary database server is modified to be compatible with a first encryption mechanism and a second encryption mechanism. Database mirroring between an old primary database server and an old secondary database server is disabled, and database mirroring is configured between the old primary database server and the new primary database server. A failover operation is performed by migrating one or more databases from the old primary database to the new primary database, and database mirroring between the old primary database server and the new primary database server is disabled.

Abstract: Data storage for unstructured data such as JSON data stored as collections of documents transforms the JSON data into a columnar form of storing unstructured data by grouping similar fields together for facilitating retrieval of the individual fields from a range of documents. Groups of fields are stored in individual files for each field. Compound data such as arrays and subdocuments are also broken down into files for each atomic field. In other words, a compound document structure that defines a hierarchy or “tree” of fields is flattened such that each “leaf” of the tree is stored in a separate file.

Abstract: A method for maintaining data integrity and referential data integrity within an enterprise data registry is provided. The method may use a JSON API to structure incoming data such that the incoming data is only accepted at a central repository when the incoming data normalized and properly referenced. Ensuring the proper relationships within a JSON API may require the use of bridge tables and/or mapping schemes to correctly identify many to many relationships between entities and attributes within metadata elements.

Abstract: The current document is directed to a query-as-a-service system (“QAAS system”) that collects enormous volumes of data from network-connected entities, referred to as “Things” in the phrase “Internet of Things,” persistently stores the collected data and provides a distributed-query-execution engine that allows remote clients to continuously execute queries against the collected data. In a described implementation, both the raw data and query results are persistently stored in the QAAS system, with the raw data stored for significantly longer periods of time. Query results generated by the query-processing engine are securely transmitted to QAAS remote clients for distribution to file systems, storage appliances, applications, and other data sinks within client systems.

Abstract: The systems and methods described here can reduce the storage space required (memory and/or disk) to store certain types of data, provide efficient (fast) creation, modification and retrieval of such data, and support such data within the framework of a multi-version database. In some embodiments, the systems and methods can store each field of a set of records as a vector of values, e.g., a data vector. A set of records can be represented using a vector id vector, or “vid” vector, wherein each element of the vid vector contains a reference to the memory location of a data vector. A header table can store associations between labels and “vid” vectors that pertain to those labels. Identical data vectors can be re-used between different record sets or vid vectors needing that vector, thus saving space.

Abstract: Records received from one or more sources in a network are processed. For each of multiple intervals of time, a matching procedure is attempted on sets of one or more records, including comparing identifiers associated with different records to generate the sets and determining whether or not a completeness criterion is satisfied for one or more of the sets. The processing also includes, for at least some of the intervals of time, processing at least one complete set, consisting of one or more of the received records on which the matching procedure is first attempted during the interval of time and one or more records stored in a data store before the interval of time, and for at least some of the intervals of time, processing at least one incomplete set, consisting of one or more records stored in the data store before the interval of time.