Abstract: A request to update an original data value in a first row in a database table in a database system. An updated data value is written to a second row in a staging table in the database system. The updated data value corresponds with the original data value. The first row includes a database table key, which is also included in the second row. The original data value in the database table is replaced with a corresponding replacement value, which is determined based on a value replacement update function that takes as input the updated data value. The staging table maintains a record value for reversing the update to the database table.

Abstract: Scalable implementations of exact distinct counts and multiple exact distinct counts in distributed query processing systems are implemented via systems and devices. Distinct counts and multiple exact distinct counts for identifiers/values are performed based on keys. For distinct counts, datasets including data fields are sorted by values of fields and divided into balanced partitions in distributed servers. Subsets of fields with the same value are partitioned together. Key presence is determined for subsets on each partition, and the number of instances for the key are aggregated for exact distinct counts of values. For multiple distinct counts, fields of a dataset are combined by un-pivoting field columns. Compound keys are generated for combined fields from field identifiers of the combined fields and values of another field. Totals of unique values of the combined fields are determined for values in the counted field based on the compound keys.

Abstract: A method and apparatus for a graph database instance (GDI) maintaining a secondary index, that indexes data from a sparse data map storing graph application data, within a sparse data map dedicated to the secondary index. The GDI formulates row-keys, for the secondary index map, by hashing the values of key/value pairs stored in rows of a map storing application data. The GDI stores for each formulated row-key, in the row of the secondary index that is indexed by the formulated row-key, references to rows of the map storing application data that match the key/value pair on which formulation of the row-key was based. The row-keys into the secondary index map may incorporate bucket identifiers, which, for each key/value pair, allows the GDI to spread the references to graph elements that match the key/value pair among a set number of “buckets” for the key/value pair within the secondary index map.

Abstract: A method and apparatus for interacting with a distributed database is provided. The database includes plural storage devices. Plural keys are generated and associated with a data item. Plural operations, such as storage or retrieval operations are then initiated on the distributed database. Each operation specifies a different key acting as an index for a corresponding data record. The keys can be generated using functions operating on an initial descriptor. For example, the characters of the descriptor can be reordered to produce new keys. As such, a data item can be stored in multiple different storage devices to provide redundancy.

Abstract: A method and a system for querying partitioned tables in a distributed database is disclosed. In one aspect, a method includes receiving a request to access multiple data elements, identified by record identifiers from a partitioned and distributed database table. The method further includes mapping record identifiers to partitions. The method further includes sorting the record identifiers by database node and partition. The method further includes generating, for each database node and partition, at least one statement including at least one request to access a data element stored in the corresponding partition. The method further includes responding to the request by routing the at least one statement generated for each database node and partition.

Abstract: A method, system and computer program product for determining a data standardization score for an attribute of a dataset. A data standardization score is calculated, which reflects whether data quality of attribute values would increase if a standardization rule is applied to the attribute values. Based on attribute metadata, it may be determined whether an indication to carry or not to carry out standardization is available for at least part of the attribute values of the dataset. In response to finding the indication, a respective value may be set for the data standardization score. In response to not finding the indication, a data standardization score algorithm may be run on the at least part of the attribute values of the dataset. The data standardization score value may be compared to a predefined criterion to determine whether data standardization is to be applied on the attribute.

Abstract: Examples of the present disclosure describe systems and methods for query execution across multiple graphs. In an example, a graph or isolated collection may be split into multiple subparts, such that each subpart may store information of the isolated collection. Cross-collection reference resources may be used to reference resources that are stored by other isolated collection subparts. A breadth-first search of an isolated collection subpart may be performed in order to identify matches or potential matches in an isolated collection subpart. In an example, a potential match may comprise a cross-collection reference resource, which may reference a resource in another isolated collection subpart. Once query execution has completed in the isolated collection subpart, query execution may be paused and transferred to another isolated collection subpart that comprises a resource referenced by a cross-collection resource reference.

Abstract: A method, system and computer program product for determining a data standardization score for an attribute of a dataset. A data standardization score is calculated, which reflects whether data quality of attribute values would increase if a standardization rule is applied to the attribute values. Based on attribute metadata, it may be determined whether an indication to carry or not to carry out standardization is available for at least part of the attribute values of the dataset. In response to finding the indication, a respective value may be set for the data standardization score. In response to not finding the indication, a data standardization score algorithm may be run on the at least part of the attribute values of the dataset. The data standardization score value may be compared to a predefined criterion to determine whether data standardization is to be applied on the attribute.

Abstract: A method that includes responsive to a request to access a file stored in a memory of a computing device, identifying a context in which the access to the file is being requested; identifying one or more computer files that at least partially match the context; generating, for a display, a list of stored files selectable by a user, the list of stored files including the identified one or more computer files at least partially matching the context; and generating, for the display, a list of user contacts selectable by the user, the list of user contacts including one or more user contacts identified as having communicated the user that include the identified one or more computer files at least partially matching the context.

Abstract: Systems and methods are provided for persisting a data structure. One method may comprise, at a front-end node in a computing system: generating a data structure operation record for a data structure operation directed to a data structure persisted in a non-volatile memory (NVM) in a back-end node of the computing system, appending the data structure operation record in an operation log, generating a transaction record for a transaction that includes a plurality of memory operations that collectively accomplishing the data structure operation, appending the transaction record in a transaction log, flushing the transaction log to the back-end node after flushing the operation log; and at the back-end node of the computing system: persisting received operation log and received transaction log in the NVM, and accomplishing the data structure operation by performing the plurality of the memory operation records with the data structure operation record as a commit signal.

Abstract: A computer determines the file system that contains a first partition, a second partition and a third partition. The first partition contains metadata comprising metadata associated with a WORM-specified file, and metadata associated with a rewritable file. The second partition contains a file body of a file and a copy of the metadata. The third partition contains metadata associated with the WORM-specified file. The computer receives a request to set a file setting of a target file to a WORM setting. The computer stores metadata associated with the target file in the first partition, the second partition, and the third partition.

Abstract: A system receives a user selection of a data object, and outputs the data object to a user device. The system receives a user selection of a data service, and outputs a data service object associated with the data service to the user device. The system receives a user selection of a data field associated with the data object and the data service field, and stores metadata that maps between the data field and the data service field. The system receives a user input, and creates a transformation object that transforms a value associated with the data service field into a value associated with the data field. The system updates an instance of the data object by using the metadata to send request data to the data service, using the metadata to receive response data from the data service, and applying the transformation object.

Abstract: The present application provides a computer system which allows a user to make available a dataset for analysis by others whilst hiding the contents of the dataset.

Abstract: The disclosure relates to an information resource collection method, device and computer-readable storage medium. The method includes receiving a broadcast message sent by an application program of a plurality of application programs through a system interface that is configured to direct each of the plurality of application programs to report an occurrence of collection events to an operating system; analyzing the broadcast message to obtain key information of an information resource; obtaining the key information of the information resource; and storing the key information of the information resource in a unified favorite folder that is configured to store and display key information of a plurality of collected information resources that has been collected via the system interface from at least one of the plurality of application programs.

Abstract: A method includes displaying and capturing image data containing an object and accessing a plurality of records related to objects, selecting a record related to the captured object, obtaining an identifier of a vendor of the object of the selected data record, combining the selected data record and the vendor identifier to form a search record, displaying, based on the search record, an augmented reality interface to receive a first interactive action for saving the search record, receiving the first interactive action, saving, in response to receiving the first interactive action, the search record into a searchable data structure, receiving a second interactive action, retrieving, in response to receiving the second interactive action, the search record from the searchable data structure, updating the vendor identifier based on the retrieved search record, and displaying information related to the search record.

Abstract: A distributed file system may store a plurality of entity attributes. A node linking system may classify links between the nodes. The node linking system may calculate a network effect of an action with a link. The node linking system may modify parameters of the action based on the network effect.

Abstract: Legal document processing (review/summarization/analysis) is a complex and intellectually intensive process. The quality process required for accomplishing this task needs to ensure acceptable levels of accuracy to the customer along with speed and efficiency. Defining of Error Codes, measurement of Error Codes and the related analysis, calibration of results and the analysis of deviations and similarities and the sampling strategy associated with unit selection are critical in ensuring a high acceptable quality level. A system and method of searching through documents in order to find documents relevant to a defined inquiry, whereby the number of irrelevant documents produced and number of relevant documents overlooked is minimized. A system and method of using scoring and quality evaluations for a given search project are described.

Abstract: Single-click delta analysis is disclosed. A user query of status information collected from one or more monitored devices is received from a user. In response to receiving an indication from the user to determine a variance between different portions of the collected status information, a target query and a baseline query are generated using the user query. The generated target query and the generated baseline query are performed, respectively, against data in a data store including the status information collected from the one or more monitored devices. A target set of status information results and a baseline set of status information results are obtained in response to performing, respectively, the generated target query and the generated baseline query. The obtained target and baseline sets of results are combined. Output indicative of a variance between the target and baseline sets of status information results is provided based at least in part on the combining.

Abstract: A system, method and apparatus in which a client computer initiates and communicates a distributed ledger transaction either to an individual node in a network of distributed ledger nodes or to the network itself, which transaction is labeled with a nanosecond scale timestamp, encrypted using quantum event generated random binary data and then securely transmitted to other ledger nodes in the network at substantially the same time. Networks may consist of traditional wireline and wireless networks, cloud networks and 5G wireless networks in any combination and configuration. Using the invention, distributed ledger networks may take the forms of blockchains, transactionally integrated multiple distributed ledgers, decentralized exchanges, or immutable distributed databases. After the transaction is transmitted, additional messages necessary to the completion of the transaction are communicated between ledger nodes in the network using the same or similar system, method and apparatus.

Abstract: The present disclosure describes systems and methods for identifying products that are implicitly published in an image, e.g., where there is no identifying text or comments that identify the brand of the product. A product entity may be identified based on comments posted in response to the posting of the image. An analysis of the image may be performed based on the identified product entity to find items or products of a type of the identified product entity in the image. A product detected in the image may be compared to a database of products of the type of product entity to determine which product was posted in the image.