Abstract: Methods, systems, and computer program products for contrasting document-embedded structured data and generating summaries thereof are provided herein. A computer-implemented method includes extracting two or more tables from two or more input documents, wherein each of the two or more input documents comprises structured data and unstructured data; normalizing the two or more extracted tables using one or more alignment techniques; determining at least one of (i) one or more differences and (ii) one or more similarities across the two or more extracted tables by performing a comparison of the two or more normalized tables; deriving one or more insights from the comparison by applying at least one analytical model to the at least one of the one or more determined differences and one or more determined similarities; and outputting at least a portion of the one or more insights to at least one user.

Abstract: A method includes receiving an initial pipeline including a sequence of commands for execution on a computing system, and obtaining, for each command in the sequence of commands, semantic information. The sequence of commands includes a command with incomplete semantic information. The method further includes generating an abstract semantic tree (AST) with the semantic information and a placeholder for the incomplete semantic information, and manipulating the AST to generate a revised AST. The revised AST corresponds to a revised pipeline that reduces an execution time on the computing system. The method further includes executing the revised pipeline.

Abstract: A resource search method and a related product. The method comprises: receiving a search request sent by a mobile terminal, the search request including a target search word; searching in a preset application library based on a first search algorithm and the target search word to obtain a first search result set; when a conversion rate of the target search result set is less than a first preset threshold, searching in the preset application library based on a second search algorithm and the target search word to obtain a second search result set; performing merge according to the first search result set and the second search result set to obtain a third search result set; and pushing the third search result set to the mobile terminal and instructing the mobile terminal to display the third search result set.

Abstract: A system may include a computational instance disposed within a remote network management platform and associated with a managed network, where the computational instance contains a configuration management database. The system may also include a software application disposed on a server device of the managed network and configured to perform operations comprising: obtaining, from the configuration management database, a list of directories, a list of file types, and a list of file names; remotely accessing a computing device of the managed network; for each respective directory in the list of directories, obtaining, from the computing device, information respectively related to discovered files that are: (i) disposed within the respective directory on the computing device, and (ii) specified by the list of file types or specified in the list of file names; and transmitting, to the configuration management database, the information related to the discovered files.

Abstract: Disclosed are examples of systems, apparatus, methods, and computer program products for accessing and displaying shared data. In some implementations, a shared cache can be maintained. A first component and a second component can be identified. A shared record can be identified as associated with the first component and the second component. It can be determined that the shared record is valid. Shared record data from the shared record can be displayed through the first component and the second component in a user interface.

Abstract: Embodiments of the present disclosure provide techniques for using an inverted index in a pipelined search query. A field searchable data store is provided that comprises a plurality of event records, each event record comprising a time-stamped portion of raw machine data. Responsive to the receipt of an incoming search query, the search engine accesses an inverted index, wherein each entry in the inverted index comprises at least one field name, a corresponding at least one field value and a reference value associated with each field name and value pair that identifies a location in the data store where an associated event record is stored. Once the inverted index is accessed, it can be used to identify and search a subset of the plurality of event records, wherein the subset comprises one or more event records with corresponding reference values in the inverted index.

Abstract: User information categorization using consent-based class rules is described. Consent from a user is received regarding at least one functional area where user information is shareable is received. Based on the consent, at least one data class that is permitted to be shared is determined. A user information designation is associated with the at least one data class and class rules are applied to user information associated with the user information designation based on the association between the user information designation and the at least one data class.

Abstract: Embodiments of the present disclosure provide techniques for performing searches of event records by leveraging reference values in an inverted index. A method of searching comprises accessing a query associated with a first set of event records in a field searchable data store, each event record comprising a time-stamped portion of raw machine data. The method further comprises evaluating the query and generating results for the query by accessing an inverted index, wherein each entry in the inverted index comprises at least one field, a corresponding at least one field value and a reference value that identifies a location in the field searchable data store where an associated event record is stored. The method further comprises performing a search to filter out a second set of event records and retrieving the second set of event records from the field searchable data store using reference values in the inverted index.

Abstract: Systems, methods, and computer-readable media are provided for pairing users for electronic communications over a network. In accordance with one implementation, a method is provided for pairing users that request a chat encounter or other form of electronic communication. The operations of the method include receiving a request from a first user and calculating a plurality of pairing scores, each pairing score based on a collaborative filtering score. The method further includes selecting a second user based on the plurality of pairing scores and pairing the first user with the second user to enable electronic communications.

Abstract: This application relates to a technique that enables efficient indexing and querying of a set of documents stored at a computing device. The technique assigns a rank to each term of a set of terms based on a historical occurrence of each term to produce a set of ranked terms. The technique also creates subsets that include terms from the set of ranked terms to produce ranked term subsets that are encoded in accordance with an allocated bit size. The technique generates an index for each document of the set of documents through: (1) the identification of the ranked term subsets within the document, (2) the generation of arrays to store each ranked term subset identified within the document, and (3) the embedding of metadata within the document. The metadata includes: (i) one or more arrays and (ii) one or more counts corresponding to each array.

Abstract: A query into a database is processed by receiving an instruction to partition data in the database into respective data partitions for the query. In response to the instruction, a query execution plan is generated that specifies the data from the database for the respective data partitions according to at least one data characteristic. The query execution plan is executed to compel reading the data of the data partitions from the database in respective data streams independently one from another.

Abstract: Systems, methods, and devices for tracking changes to database data. A method includes determining a change to be executed on a micro-partition of a table of a database and executing the change on the table by generating a new micro-partition that embodies the change. The method includes updating a table history that includes a log of changes made to the table, wherein each change in the log of changes includes a timestamp, and wherein updating the table history includes inserting the change into the log of changes.

Abstract: Examples disclosed herein are relevant to garbage collection for data structures, such as hash tables. The data structure can store garbage collection values for use during a garbage collection process. The garbage collection values can have a value indicating the occurrence of a poisoned status. Disclosed configurations can be suited for use in high-performance computing applications.

Abstract: A computer-implemented method for sharing access to a database of records relating to clinical trial investigators amongst a number of users is disclosed. Each record includes a number of data fields associated with a clinical trial investigator and has associated metadata indicating a record owner. The method comprises: a) receiving a database query from a first user; b) resolving the query using a first subset of the records in the database including only those records for which the associated metadata indicates that the record owner is the first user and those records for which the associated metadata indicates that the record owner is another user which has registered a sharing rule in respect of the first user, whereby the first user is granted permission to access its records; and c) generating a result set including only those records used to resolve the query that satisfy the query.

Abstract: Embodiments of the present disclosure are directed to an interactive development environment (IDE) interface that provides historical visualization of queries and query result information iteratively and intuitively. According to an embodiment of the present disclosure, a process is provided to generate visualizations of queries and processed query result information in a single, persistent, integrated display. Each query and resultant search data information is presented iteratively in chronological order, and maintain a persistent, viewable history of a search data exploration session.

Abstract: Provided are a computer program product, system, and method for determining available remote storages in a network to use to replicate a file based on a geographical requirement with respect the file. A determination is made as whether available remote storages satisfy constraints associated with a document class of the file. The constraints include a geographical location at which to replicate the file and a minimum number of replications to create for the file. At least one remote storage of the available remote storages is selected that satisfies the constraints to store at least one copy of the file. The file is replicated to the selected at least one remote storage.

Abstract: A system for validating data purportedly generated in a medical procedure is disclosed. The system includes a medical hub, at least one remote server communicatively coupled to the medical hub, and a medical instrument communicatively coupled to the medical hub. The system is configured to access the data, validate the data to determine if the data is validly generated by the medical procedure, determine that the data contains at least one flaw or error, and improve data integrity by preventing the at least one flaw or error from being integrated into a larger dataset associated with the at least one remote server.

Abstract: The invention discloses a retrieval method and device for judgment documents and relates to the technical field of data retrieval, mainly aiming to mark existing judgment documents with information codes and perform vertical and horizontal retrieval according to the association relation among the information codes during retrieval so as to provide more comprehensive retrieval results.

Abstract: A computer system compares databases, where each data record includes values for a plurality of fields, by applying database operations on database tables of the data records to reduce computations being performed. For each data record in a reference set, candidate matches are identified from among the data records in a target set by performing a join operation on the sets on one or more selected, normalized fields from the sets. This significantly reduced set of candidate matches can be further analyzed to determine how similar they are to the data record from the reference set.

Abstract: A keycode data structure includes a device type byte, a set of keycodes, system code information, a system data byte, a protocol pointer that points to a protocol table and a number of flagbytes that are used to index a particular key among the keycodes. The keycode data structure also contains a plurality of keycode data structure pointers (KDSPs). Keycode data structures are linked together using KDSPs. A special value in the keycode data structure is used to indicate that the keycode data structure contains multiple KDSPs. The number of pointers is stored in a particular location of the keycode data structure.