Abstract: Aggregated log index-based log record identification is provided by maintaining log files of a database system on a plurality log storage devices, the log files including log records of changes to database objects, indexing the log files to obtain a collection of log indexes, where the indexing includes, for each log storage device, indexing log records stored on the log storage device to obtain a respective log index, then based on a request, identifying log storage devices that store log records for servicing the request, the log storage devices storing log indexes, of the collection of log indexes, that index an aggregate set of log records on the log storage devices, obtaining the log indexes from the log storage devices, and aggregating the log indexes to provide an aggregated log index that provides an index of the aggregate set of log records on the log storage devices.

Abstract: The preferred embodiment of the invention encompasses a method used to (a) create computer applications, or (b) create database-backed forms/documents for a customizable user interface within an existing computer program, that (c) can then be stored, queried and analyzed using map-reduce techniques; using nothing but the front-end user-interface design performed on the device and without the use of any computer coding or database management or setup of any kind. The preferred embodiment invention permits both simple documents (also known as forms), documents-within-documents, and business processes that link documents together, to be defined and converted into a working application on a smart phone, tablet or computer system by end users without the use of code or database management by the end user.

Abstract: A client device can identify user data pertaining to use of the client device by a user. The client device can determine at least one persona trait of the user based on the user data pertaining to the use of the client device by the user. The client device can receive persona categorization data, the persona categorization data specifying a plurality of persona categories and, for each persona category, a plurality of persona traits. Based on the at least one determined persona trait, the client device can assign the user to a persona category selected from the plurality of persona categories. Based on the persona category to which the user is assigned, the client device can identify information to present to users who are assigned to the persona category to which the user is assigned. The client device can present to the user the identified information.

Abstract: An example operation may include one or more of generating a hashed summary including hashes of one or more of a validation data set and hashes of data points chosen in previous iterations from producer nodes, and exposing the hashed summary to a plurality of producer nodes, receiving, iteratively, a plurality of requests from the plurality of producer nodes, respectively, where each request identifies a marginal value provided by a hash of a data sample available to a producer node, selecting a request received from a producer node based on a marginal value associated with the request, retrieving hashed data of the producer node associated with the selected request, and aggregating the hashed data of the producer node with the summary of hashes generated at one or more previous iterations to produce an updated summary, and storing the updated summary via a data block of a distributed ledger.

Abstract: Embodiments for enabling granular migration of data with high efficiency. A defined metadata element, a tag, is assigned to each file, and then tag filtering is used to direct the data to the proper location. Files with different tags can be selected for transfer, and such a group of tags is referred to as a tag set. Embodiments can be used with a defined backup system file migration process, such as present in the Data Domain File System. By using snapshots, incoming new data (ingested file) is allowed to continue while the migration is in process and maintaining data consistency at the same time. This is achieved by performing operations on B+ Tree snapshots in conjunction with tag filtering on keys present in the leaf pages of these structures. This method is efficient became it makes a single pass walk of a B+ Tree in contrast with previous methods that look up files one-by-one via their pathname.

Abstract: Methods, apparatus, systems, computing devices, computing entities, and/or the like for a hybrid question-answering (QA) application are provided. The hybrid QA application includes both a retrieval QA application and a deep QA application, and uses feedback from the retrieval QA application to improve the deep QA application.

Abstract: Mechanisms for the systematic iterative analysis of unstructured data files are disclosed. A first handler is initiated to analyze a plurality of files. Information about each respective file of the plurality of files analyzed by the first handler is stored in a data structure. The information includes a file identifier that identifies the respective file, a handler identifier that identifies the first handler, and results or a reference to results of an analysis of the respective file by the first handler.

Abstract: Techniques for generating a schema for a data input file are described herein. In an embodiment, a server computer receives a data input file. The server computer system selects a sample excerpt from the data input which comprises a subset of the data input file. The server computer system analyzes the sample excerpt to determine a row delimiter for the data input file, a column delimiter for the data input file, and a plurality of data format types. Using the column delimiter, row delimiter, and plurality of data format types, the server computer system generates a candidate schema for the data input file.

Abstract: Systems, apparatuses, and methods for providing content using notifications with content-specific keywords are provided. In one example embodiment, a method includes identifying, by one or more computing devices, a media content item for a user of a user device. The method includes generating, by the one or more computing devices, a keyword for the user of the user device based at least in part on data associated with the media content item. The keyword is indicative of the media content item. The method includes providing, by the one or more computing devices to the user device, for display a notification indicating that the media content is available for the user. The notification includes the keyword and the keyword is viewable by the user.

Abstract: A parallel data access method for massive remote-sensing images includes: 1) segmenting a remote-sensing image to be processed using a set grid system, data in each grid corresponding to a data block; 2) collecting a data access log of an underlying distributed object storage system Ceph in a past period of time, and measuring a load index of each Ceph cluster and a load index of each pool; 3) selecting a pool with a minimum load in a Ceph cluster with a minimum current load to serve as a storage position of a current data block, and writing each data block into a corresponding pool; 4) returning a data identifier dataid and a data access path of the remote-sensing image; and 5) storing metadata of each data block in a metadata database. The method can support rapid and high-concurrency read and write of large-area data of a grid data block.

Abstract: A first numerical value is obtained based on a first data source. The first numerical value is stored in a tree structure according to a precision by storing an exponent for the first numerical value in an exponential node of the tree structure and storing respective significant figure digits of the first numerical value in respective regular nodes of the tree structure. Information is computed for nodes in the tree structure. The information includes one or more of statistics, metrics, or histogram information. The computed information is employed to respond to a query related to the data source.

Abstract: The disclosed embodiments relate to a mechanism for allowing concurrent access, e.g. write operations, to a data structure, e.g. a file, which may have limited capacity, by multiple processes or threads and, in particular, for allowing concurrent, or otherwise substantially simultaneously, appending of data to the file thereby. Each process/thread requests the amount of space it needs to append its data. Upon request, the disclosed mechanism allocates and reserves the requested amount of space and allows the requesting process/thread to commence its append operation. Subsequent to the commencement of the append operation, another thread is then free to request space for its needs and commence its append operation concurrently, or otherwise substantially simultaneously, with the previous append operation, i.e. before the prior append operation is completed.

Abstract: Systems and methods provide custom synchronization procedures in file synchronization. A primary agent is used to monitor for changes, create synchronization plans to synchronized changes, and execute the synchronization plan. The primary agent, however, interacts with one or more separate custom agents to customize the synchronization plans. One exemplary technique involves monitoring for local changes to a first copy of a file tree and updates from another computing device regarding remote changes to a second copy of the file tree. When a change to either copy is identified, a synchronization plan for the change is created based on a default synchronization procedure. The synchronization plan is sent to a custom agent for customization. The custom agent creates the custom synchronization plan by modifying the synchronization plan and sends the custom synchronization plan to the primary agent. The custom synchronization plan is then executed by the primary agent.

Abstract: A computer-implemented method for managing access to data stored in a database is provided. The method includes storing in the database a switch parameter having a first value, storing in the database at least two instances of a data object wherein each of the instances includes a unique identifier, receiving a client query from a requestor, determining by the computing device an active instance from the at least two instances based at least in part on comparing the first value of the switch parameter to the unique identifier of each instance, modifying by the computing device the client query at least in part based on the determined active instance to create a resultant query, executing the resultant query against the active instance to generate a resultant data, and providing the resultant data to the requestor.

Abstract: A data analysis system uses metadata stored in association with database records to render mirror the data collection user interfaces utilized by the data collection systems to create the data records in the database. To enable this data analysis system functionality, the data collection system stores metadata defining the data collection user interface used to create a particular data record in association with that particular data record in the database. The data analysis system can then access the metadata to render a mirror of the data collection user interface on the fly, so that an operator of the data analysis system can create a new database record or edit a preexisting data record using the same user interface that was utilized to originally create the data record. The metadata typically defines the visual aspects, data parameters, and functional aspects of the data collection user interface.

Abstract: Point-of-Interest (POI) data is stored according to a first, POI library as a flat file in a database. An engine is positioned between the POI library and an interface. The interface is configured to interact with data structured in a hierarchical manner and stored according to a second library (e.g., a modeling interface utilizing folders). The engine functions to wrap a POI object taken from a table of the POI library, into an augmented object recognized and handled by the second library of the (hierarchical) interface. To accomplish this, the engine augments the POI table with an additional column that is to be indexed by the second library. In this manner, embodiments may impart additional, hierarchy-based functionality to existing POI handling schemes. Particular embodiments may impart enhanced security (e.g., permissions at the data object-level) to existing POI schemes that implement permissions only at the POI-level and/or at the application-level.

Abstract: The present disclosure describes a system, method, and computer program for automatically creating a parser for a log group. A parser-creation system groups logs that do not satisfy conditions for an existing parser, enables a user to select a log group for parser creation, and automatically creates a parser for the selected log group. In creating a parser, the system extracts values and keys value pairs from the log group and identifies the corresponding normalized output fields and regular expressions for the values and key-value pairs. To identify normalized fields corresponding to values and key-value pairs, the system compares the values and key-value pairs to one or more knowledgebases that include: (1) regular expressions from existing parsers, (2) regular expressions for value types associated with normalized fields, and (3) a list of keys in key-value pairs associated with normalized fields.

Abstract: A method and a multi-directional attribute matching system (MAMS) determining a degree of match between item profiles with respective attributes possessed (AP) and respective attributes needed (AN) of varying credibility and varying importance are provided. The MAMS receives an attributes possessed list including the AP and an attributes needed list including the AN, from a predefined attribute list database. The AP and the AN have parent attributes or hierarchical sub-attributes. The MAMS merges multiple occurrences of AP and inputs to the attributes possessed list. The MAMS generates a matched attribute list for a side by matching the AP in an item profile with the AN in an item profile of another item by matching the AP with the AN. The MAMS computes a raw score and an attribute match score for each side using match formulae and computes a final score of the multi-directional match between the item profiles.

Abstract: Provided is a technique for matching different user representations of a person in a plurality of computer systems may be provided. The technique includes collecting information sets about user representations from a plurality of computer systems; normalizing the information sets to a unified format; grouping the information sets in the unified format into indexing buckets based on a user name using a non-phonetic algorithm; determining a similarity score for each pair of information sets in each of the indexing buckets; classifying each information set pair into a set of classes based on the similarity scores, wherein the set of classes comprise at least matches and non-matches; and using a data structure for merging information of information set pairs classified as matches.

Abstract: A global filter allows data filtering using attributes across multiple Analysis Tools (ATs), by broadcasting semantic filter context objects. Upon selecting object attribute values, the filter context object is created with attribute names and values. A processing engine resolves the filter context object to a data object, and then subsequently to target data. A lateral filter finds related entities in a relational database, without having to maintain and/or duplicate all of the data into a graph database. The processing engine resolves lateral filters using an entity graph path calculation conducted in conjunction with the generation of a bootstrapped graph structure. That graph structure is constructed (bootstrapped) utilizing available database schematic information—e.g., pre-calculated (key) relations and metadata read from the relational database. From that information, relationships in the bootstrapped graph structure are determined.