Abstract: A record including an original document and a modification to the original document is created. Metadata associated with the modification to the original document is generated. The modification in stored in a data store. Creation and registration of a decentralized identifier (DID) document for the modification is requested based on the generated metadata. Modified document metadata is generated which includes a document hash and the created DID document for the modification. Recordation of the modification in a blockchain transaction, creation and registration of a DID document for the modified document, and generation of verifiable credentials for the modification are requested. The generated verifiable credentials for the modification are stored and a quick response (QR) code for the DID document for the modification is generated. A visual representation of the modification and the QR code for the modification are added to the original document, generating a sealed document.

Abstract: The efficiency of segment cleaning for a log-structured file system (LFS) is enhanced at least by storing additional information in a segment usage table (SUT). Live blocks (representing portions of stored objects) in an LFS are determined based at least on the SUT. Chunk identifiers associated with the live blocks are read. The live blocks are coalesced at least by writing at least a portion of the live blocks into at least one new segment. A blind update of at least a portion of the chunk identifiers in a chunk map is performed to indicate the new segment. The blind update includes writing to the chunk map without reading from the chunk map. In some examples, the objects comprise virtual machine disks (VMDKs) and the SUT changes between a list format and a bitmap format, to minimize size.

Abstract: From among physical storage devices (PSDs) of a storage system, a set of two or more of the PSDs that are eligible for scrubbing may be determined; and from among the set, a relative eligibility of the PSDs may be determined. Conformance prediction analysis may be applied to determine the set and the relative eligibility of PSDs of the set. The conformance prediction analysis may determine a scrubbing eligibility classification (e.g., label), and a confidence value for the classification, which may serve as the relative eligibility of the PSD. The eligible PSDs may be ranked in an order according to determined confidence values, and may be further classified according to such order. The future workload of the storage system may be forecasted, and the scrubbing of PSDs may be scheduled based on the forecasted workload of the system and the relative eligibilities of the set of PSDs.

Abstract: Representations of sets of descriptors of reference objects are stored in a repository, with individual descriptors including information about entities identified in the reference objects. In response to a request to extract content from a particular data object, a reference object which satisfies a similarity criterion with respect to the particular data object is identified from the repository using the descriptors. A structural comparison of the particular data object and the reference object is performed to determine an entity related to another entity identified in the particular data object.

Abstract: An apparatus, method and computer program product facilitate selective searching of at least a portion of a database. With respect to a method, a query is received that has a query context. In response to the query, the method reviews one or more data source tables including a first data source table that defines each of a plurality of data sources of data stored by the database. In reviewing the one or more data source tables, the method identifies one or more data sources that are accessible in response to the query. The method also searches the database for responsive data that: (i) was provided by the one or more data sources that were identified to be accessible in response to the query and (ii) is responsive to the query. Further, the method responds to the query with a representation of the responsive data.

Abstract: A query request for data associated with a plurality of services executed by a plurality of host systems is received. A type of query associated with the query request is identified. A subset of the plurality of services comprising data associated with the type of query is identified using a query routing data structure, wherein the query routing data structure is received from a gateway system that generates the query routing data structure in view of receiving corresponding service schemas from the plurality of services. The query request is transmitted to the subset of the plurality of services identified using the query routing data structure.

Abstract: A computer-implemented method for generating quote-based search summaries from a plurality of documents includes receiving information identifying a meaning taxonomy, the meaning taxonomy including a normalized term and at least one syntactic structure that identifies an entity; locating, within at least one document of the plurality of documents, a statement attributable to the entity; receiving a search query comprising the normalized term; and displaying a summary of the at least one document, the summary including the statement.

Abstract: Apparatus, systems and methods for augmenting a group of media content items by forming a graph including a plurality of nodes and a plurality of edges, where each node represents a segue option at a position in the graph and each edge represents a connection between a first node in the graph at a first position and a second node in the graph at a second position and finding a path in the graph.

Abstract: A method for reverse range lookup in an ordered data structure of keys, wherein each key comprises a logical block address (LBA) and a snapshot identifier (ID) of one of one or more snapshots in a snapshot hierarchy, is provided. The keys in the ordered data structure are in an order from smallest to largest LBA, wherein in the order, keys having a same LBA are ordered from smallest to largest snapshot ID. The method includes determining a range of LBAs and traversing the ordered data structure in reverse order until a key is found that: has an LBA and a snapshot ID that is less than or equal to the last LBA and the largest snapshot ID, respectively. The method further includes adding an extent corresponding to the located key to an extent result list if the snapshot ID of the located key is not within a deny list.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, that identify and issue search queries expected to be issued in the future. A set of search queries that have been issued by multiple user devices can be obtained. For each query instance, contextual data can be obtained. A first query and its contextual data can be input to a model that outputs the query's likelihood of being issued in the future. The model can be trained using contextual data for training queries and a corresponding labels for the training queries. The learning model outputs the first query's likelihood of being issued in future, and this query is stored as a repeatable query if the likelihood satisfying a repeatability threshold. Subsequently, a stored repeatable query is issued upon a selection of a user selectable interface component and the search engine provides search results for the query.

Abstract: An in-memory computing system for conducting on-line transaction processing and on-line analytical processing includes system tables in main memory to store runtime information. A statistics service can access the runtime information using script procedures stored in the main memory to collect monitoring data, generate historical data, and other system performance metrics while maintaining the runtime data and generated data in the main memory.

Abstract: Bid values submitted for various keywords can take into account the recovery propensity between paid search and organic search. When submitting a bid to a search engine provider for a keyword, an entity may get a certain level of performance in return. If not submitting a bid, however, the entity will likely still get some level of performance, although likely less than for paid search. In order to optimize for a parameter such as impressions, purchases, or profit, the recovery propensity can be taken into account in order to adjust the bid price, taking into account the relative performance of paid and organic search and then optimizing for the determined goal. Organic search data in some embodiments can be obtained through testing or modeling, or a combination thereof.

Abstract: Methods for page split detection and affinity in query processing pushdowns are performed by systems and devices. Page servers perform pushdown operations based on specific, and specifically formatted or generated, information, instructions, and data provided thereto from a compute node. Page servers also determine that page splits have occurred during reading of data pages maintained by page servers during pushdown operations, and also during fulfillment of compute node data requests. To detect a data page has split, page servers utilize information from a compute node of an expected next data page which is compared to a next data page in the page server page index. A mismatch in the comparison by page servers indicates data page was split. Compute nodes and page servers store and maintain off-row data generated during data operations via page affinity considerations where the off-row data is stored at the same page server as the data.

Abstract: A centralized database management system performs data synchronization with lower bandwidth consumption and higher efficiency. The system manages data synchronization and data reconciliation across multiple databases managed by multiple DBMS across different client servers. The system generates and sends instructions that encode each data table into an invertible bloom filter and identifies differences between the two databases by performing a subtraction operation on the two invertible bloom filters. The system may generate a third invertible bloom filter comprising information associated with differences between the two data tables. The system may send instructions to the source and the destination databases, where a first and a second invertible bloom filters are encoded for the source and the destination databases, respectively. The system may decode the third invertible bloom filter, identify the different elements, and generate instructions to the source and/or the destination database.

Abstract: One embodiment provides a method, including: receiving a query from a user; providing the query to data owners, wherein each of the data owners has a local machine learning model and wherein the plurality of data owners train a meta-model; secret sharing model output from the data owners between the other data owners, wherein the model output comprises an output responsive to the query computed using the local machine learning model; receiving, from each of the plurality of data owners, a set of meta-features corresponding to the query; and generating a response to the query, wherein the generating comprises determining, by evaluating the meta-model using the set of meta-features received from each of the plurality of data owners, weights for outputs from the local machine learning models and aggregating the outputs in view of the weights.

Abstract: A request to send a file is received. A file type for the file is identified. For example, the file type may a Joint Photographic Experts Group (JPEG) file or a Portable Document Format (PDF) file. In response to receiving the request to send the file and identifying the file type for the file, a format of the file is reordered. Reordering the format of the file is based on an application and/or an application type that will be receiving the file. For example, the application may be an Adobe Acrobat® reader that is receiving a PDF file that has been reordered for more efficient reading.

Abstract: Apparatus and methods are provided for multiple smart glasses to enter in a distributed ledger network such as a blockchain to concurrently modify documents. These networked smart glasses may store the document and any changes made to the document in a distributed ledger, communicate the changes to the other smart glasses and request approval or disapproval of the changes. Each smart glass or user may approve or disapprove the changes suggested by other users. The document may only be finalized when all suggested changes are approved or disapproved.

Abstract: Systems and methods for providing automated data governance are disclosed. The system may include a plurality of data environments, a metadata repository storing data attributes and classification requirements, a policy repository, one or more processors, and a memory in communication with the one or more processors storing instructions to execute steps of a method. The system may receive a first dataset from a first data environment having a first dataset ID. The system may transmit the dataset ID to the metadata repository and the metadata repository may return an indication that the first dataset includes at least one data attribute and at least one associated classification requirement. The system may transmit the classification requirement to the policy repository and receive classification code associated with the classification requirement. The system may modify the first dataset by transmitting instructions to the first data environment to execute the classification code.

Abstract: A method to dynamically switch between catalog sharing protocols includes monitoring, over a period of time, access to a catalog used to index data sets. Using information gathered during this monitoring period, the method divides the period of time into intervals based on which of a plurality of sharing protocols, used to access the catalog, would provide the best performance during the respective interval. The method schedules the sharing protocols to operate during their respective intervals going forward, and switches between the sharing protocols in accordance with the schedule. In certain embodiments, switching between the sharing protocols includes temporarily operating in a hybrid mode in which multiple sharing protocols operate simultaneously. When using this hybrid mode, the switch may occur when one sharing protocol begins to perform better than the other. A corresponding system and computer program product are also disclosed.

Abstract: A method and system for engramic indexing of information technology (IT) infrastructure. Specifically, the method and system disclosed herein enable the efficient access, search, and/or management of enterprise-scale IT infrastructure and topologies using semantic context and natural language processing. That is, query context may be optimized using mapped semantics based on organizational constructs and machine learning, thereby reducing query overhead, increasing response performance, and improving contextual display capabilities in mass-scale environments.