Abstract: A system comprising a computer-readable storage medium storing at least one program and a method for integrating collaborative spreadsheet data into one or more network applications is presented. Spreadsheet data and an application data schema are accessed. The spreadsheet data corresponds to a spreadsheet having one or more validation rules. The application data schema comprises a set of constraints on application data consumed by an application hosted by an application server. A notification is displayed in response to determining that the one or more validation rules exclude at least one constraint from the set of constraints. The notification includes an indication that the application data is unable to be synchronized with the spreadsheet data and specifies one or more additional validation rules to associate with the spreadsheet to trigger synchronization of the application data with the spreadsheet data.

Abstract: An electronic medical records (EMR) system that enables a user to import paper-based clinical form templates (typically Word documents) and insert data tags in the data fields on the templates. This approach allows the user to retrieve clinical data from user inputs and from hospital recordkeeping systems, such as HIS, LIS, RIS/PACS, and others to generate EMR forms. Medical personnel can then access the data to generate descriptive, predictive, or prescriptive analytics including vital sign charts, drug interaction warnings, and drug recommendations. The system also enables secure data sharing between healthcare facilities using a blockchain system or a FHIR server. Upon signing an EMR form with one or more electronic signatures, the system generates a digitized image including images of the electronic signatures. The system generates hash of the digitized image and store the hash to the blockchain system, wherein the hash is used to verify the signed EMR form.

Abstract: A graph comprising nodes and edges is stored by a distributed system as a collection of nodes and half-edges stored with their respective nodes. A message processor is associated with a node as needed to process messages passed between nodes, such that a given node has zero or one message processor assigned to it at a given time. Queries of the graph are resolved by processing a first portion of the query at a first node, and forwarding the results with the remaining portions of the query to a node linked by an edge to the present node.

Abstract: N storage nodes that are coupled via a network are selected to store a file of size |F| and redundancy of size |Fred|. A value Z<N is selected such that an attacker having access to Z storage nodes is unable to decode any partial information of the file. The file is divided into d partitions of size |PsN|, wherein |PsN| is a maximum factor of |F| subject to |PsN|?|sN|. Independent linear combinations hi's of the d partitions are created and random keys are generated and stored in the first Z of the N storage nodes. Independent linear combinations gi's of the random keys are created and combinations of the hi's and gi's are stored in the Z+1 to Nth storage nodes.

Abstract: A set of N network-coupled edge storage nodes are selected to store a file of size |F|. The N edge storage nodes have heterogeneous storage availability and are ordered from a largest storage availability at the first edge storage node to a smallest availability at the Nth edge storage node. A value Z<N is selected, such that an attacker having access to Z edge storage nodes is unable to decode any partial information of the file. The first through Z+1th edge storage nodes are assigned a same packet size. Keys are stored in the first Z edge storage nodes and independent linear combinations of the keys combined with partitions of the file are stored in the Z+1th to the Nth edge storage nodes.

Abstract: A method for ensuring compliance with data localization rules and regulations for blockchain data values in a blockchain network includes: a local node in a first country receiving a submission for a new blockchain transaction; identifying that the new blockchain transaction involves at least one entity in a foreign country; confirming the new blockchain transaction; transmitting the confirmed blockchain transaction to a foreign node located in the foreign country; generating a new block in the local node that includes the confirmed blockchain transaction; and distributing the new block to other nodes located in the same country as the local node.

Abstract: Provided herein are systems and methods for an efficient method of replicating share objects to remote deployments. For example, the method may comprise modifying a share object of a first account of a data exchange into a global object wherein the share object includes grant metadata indicating share grants to a set of objects of a database. The method may further comprise creating, in a second account of the data exchange, a local replica of the share object on the remote deployment based on the global object, wherein the second account is located in a remote deployment. The set of objects of the database may be replicated to a local database replica on the remote deployment and the share grants may be replicated to the local replica of the share object.

Abstract: A computer system processes data requests using a data delivery queue. A query received from a client is processed to generate response data, wherein the response data is held in a queue prior to transmitting to the client. The response data in the queue is iteratively divided into a plurality of blocks, wherein each block of the plurality of blocks is compressed prior to transmitting to the client, and wherein a block size of a given block is determined based on an amount of time to compress and transmit a preceding block. The plurality of blocks are transmitted to the client. Embodiments of the present invention further include a method and program product for processing data requests using a data delivery queue in substantially the same manner described above.

Abstract: Methods for automatically generating a wrapper for extracting web data and corresponding computer systems are disclosed. In one arrangement, a first wrapper is used to generate a second wrapper. The first wrapper extracts target data from one or more target web pages hosted by one or more target web servers. The second wrapper is capable of extracting the same target data from the same one or more target web pages without using a web browser engine to perform a) sending requests to the one or more target web servers, and/or b) processing replies from the one or more target web servers. The generation of the second wrapper comprises analysing one or both of the following: (i) code defining the first wrapper, (ii) interactions between the first wrapper and the one or more target web servers that occur during execution of the first wrapper.

Abstract: A webpage is received. A request to tag a webpage is received. The webpage may be parsed in response to the received request to tag the webpage. One or more critical words may be identified within the parsed webpage. A tag dictionary may be searched for the identified one or more critical words. One or more tags for selection by an end user may be displayed in response to searching the tag dictionary. The parsed webpage may be tagged with a received selection of a tag of the displayed one or more tags.

Abstract: A method, computer system, and computer program product for generating a multi-document summary is provided. The embodiment may include receiving a query statement, one or more documents, one or more summary constraints, and quality goals. The embodiment may include identifying one or more keywords within the query statement. The embodiment may include performing a sentence selection from the one or more documents based on the one or more identified keywords. The embodiment may include generating a plurality of candidate summaries of the one or more documents based on the performed sentence selection, the goals, and a cross entropy method. The embodiment may include calculating a quality score for each of the plurality of generated candidate summaries using a plurality of quality features. The embodiment may include selecting a candidate summary from the plurality of generated candidate summaries with the highest calculated quality score that also satisfies a quality score threshold.

Abstract: According to certain aspects, a secondary computing system can be configured to perform a full backup on database data, generate incremental backups comprising log files associated with modifications to the database data, and create a differential full backup copy of the database data using the full backup copy and changed blocks identified using the log files from the incremental backups.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed for efficient media indexing. An example method disclosed herein includes selecting a first hash seed value based on a first entropy value calculated for a first bucket distribution resulting from use of the first hash seed value to store data in a first hash table, selecting a second hash seed value to be used in combination with the first hash seed value based on a second entropy value calculated on a second bucket distribution resulting from use of the first hash seed value in combination with the second hash seed value, and storing data in the first hash table based on the first hash seed value and a second hash table based on the second hash seed value.

Abstract: One embodiment provides for monotonic transactions in a multi-master database with loosely coupled nodes including performing, by a processor, a read transaction protocol including: performing, by the processor, a read transaction protocol including issuing read transactions at any one of the nodes; attempting to return rows that are known to be replicated by at least a read quorum of the nodes; and for timing-out of the attempting to return rows known to be replicated by at least the read quorum of the nodes based on the special-node being non-responsive: selecting a new special-node from the nodes; and repeating attempting to return rows that are known to be replicated by at least the read quorum of the nodes.

Abstract: A system for image recovery comprises an input interface and a processor. The input interface is configured to receive a block backup volume that can be mounted. The processor is configured to determine a merged chain map by consolidating one or more incremental chain maps and to store an image using the merged chain map and a volume map.

Abstract: Databases may enforce foreign key constraints for efficient materialized view updates. A materialized view may be created for a database. Updates to the database may be received and performed according to a foreign key constraint enforced with respect to the updates. An update to the materialized view may be performed to make the materialized view consistent with the updates to the database. Performance of a join operation to update the materialized view that would return a result violating the foreign key constraint may be excluded from the update to the materialized view.

Abstract: Embodiments of the present invention provide a method, system and computer program product for single view presentation of multiple query. In an embodiment of the invention, a method for single view presentation of multiple query includes directing a query against a database along a selected dimension of multiple different elements. In response, a primary result set is received. The result set is then organized into a tabular view of cells according to the selected dimension and values for the selected dimension. Thereafter, a set of nested queries may be directed for each of the elements in the selected dimension against the result set utilizing a different dimension. In response to each directed set of nested queries, a corresponding result set is thus received. Finally, each corresponding result set is inserted into a cell associated with a common one of the elements.

Abstract: Systems, methods, and readable memory for providing recommendations. A method includes receiving data corresponding to one or more user interactions with a user interface, where the one or more user interactions indicate a research topic, searching one or more databases for references relating to the research topic, extracting names from the references, the names corresponding to potential collaborators, placing the names into a ranked list, where the names are arranged in the ranked list according to a predicted relevance to a user, and providing the ranked list via the user interface to the user.

Abstract: A method, article of manufacture, and apparatus for limited deduplication scope on a distributed file system is discussed. A write request is received from a client at the metadata server (“MDS”), where the write request comprises a data object identifier and a preferred object store identifier. The MDS determines whether a preferred object store associated with the preferred object store identifier contains a copy of a data object associated with the data object identifier. A write URL comprising the data object identifier and a object store location associated with the preferred object store is transmitted to the client when the preferred object store does not contain the copy of the data object.

Abstract: A graph data processing that loads subgraph data including a predetermined number of source vertices on the basis of a memory requirement among graph data including multiple vertices and edges stored in a storage and edge list based on the source vertices, performing a first level process to identify a first arrival vertex connected to each of the source vertices, loading the edge list on the basis of a source vertex of which the first arrival vertex is identified, performing a second level process to identify a second arrival vertex connected to the source vertex of which the first arrival vertex is identified, and processing a query on the basis of the source vertex, the first arrival vertex, and the second arrival vertex.