Abstract: A key-value store and a file system are integrated together to provide improved operations. The key-value store can include a log engine, a hash engine, a sorting engine, and a garbage collection manager. The features of the key-value store can be configured to reduce the number of I/O operations involving the file system, thereby improving read efficiency, reducing write latency, and reducing write amplification issues inherent in the combined key-value store and file system.

Abstract: A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. A plurality of failure resilient address spaces are distributed across the plurality of storage devices such that each of the plurality of failure resilient address spaces spans a plurality of the storage devices. The plurality of computing devices maintains metadata that maps each failure resilient address space to one of the plurality of computing devices. The metadata is grouped into buckets. Each bucket is stored in the backend of a computing device. Access to a storage device may be managed according to an availability of the storage device. Reads from and writes to a storage device may be redirected when, for example, the storage device is over-utilized or performing garbage collection.

Abstract: The application relates to a computer-implemented method for providing data to a client. The method comprises monitoring read access operations on a file by the client. The file is provided as a network data stream by a network node. The client is configured to receive files only via a searchable file-based data stream. The method further comprises transmitting a network data stream containing the file to the client, the network data stream not being searchable, and translating the network data stream into a searchable file-based data stream on the basis of the read access operations.

Abstract: A data file generation apparatus includes circuitry. The circuitry generates a data file. The circuitry writes the data file to an external storage area that is external to the data file generation apparatus. The circuitry writes identification information of the data file to the external storage area as deletion candidate information indicating a candidate for a file to be deleted. The circuitry deletes the deletion candidate information when the data file is successfully stored in the external storage area.

Abstract: A method for electronically generating a care plan is disclosed. The method includes selecting a first data structure corresponding to a first condition of a patient. The first data structure including a set of health artifacts pertaining to the first condition. The method also including comparing a second data structure with the first data structure. The second data structure pertains to the patient and the first condition of the patient, and the second data structure comprises a subset of the set of health artifacts. The method also including selecting, based on the comparing, another subset of the set of health artifacts in the first data structure, generating the care plan comprising a third data structure that includes at least the another subset of the set of health artifacts, and causing the care plan to be presented on a computing device.

Abstract: One example method includes receiving a data event notification, retrieving data to which the data event notification pertains, analyzing the data, based on the analyzing, generating metadata pertaining to the data, and transmitting the metadata to a repository. These operations may be performed automatically in response to receipt of the data event notification. The data event notification may likewise be generated automatically in response to implementation of the data event, which may be any of a data create, read, update, or delete, operation.

Abstract: In some aspects, an apparatus includes a processor and a memory. In some embodiments, the memory includes programmed instructions that, when executed by the processor, cause the apparatus to receive a request to create a bucket. In some embodiments, the memory includes programmed instructions that, when executed by the processor, cause the apparatus to, in response to receiving the request to create the bucket, write, to a first object store, a first mapping that maps an identifier of global metadata to an identifier of a second object store where the bucket is to be created, write, to the second object store, a second mapping that maps the identifier of global metadata to local metadata, and replicate, to the second object store, the first mapping.

Abstract: Automatic file system capacity management techniques are provided using file system utilization prediction. One method comprises obtaining input data representing a utilization of a storage capacity of a file system of a given storage system; predicting a future utilization of the storage capacity of the file system based on a portion of the obtained input data; and automatically adjusting the storage capacity of the file system based at least in part on a result of a comparison of the predicted utilization of the storage capacity to a current utilization of the storage capacity. The comparison of the predicted utilization to a current utilization of the storage capacity may comprise comparing the current utilization of the storage capacity to the predicted utilization of the storage capacity for at least first and second time periods following a current time period to determine a trend of the utilization of the storage capacity.

Abstract: A computer-implemented method, system, and computer program product are provided. A processor defines and stores units of image data of a container image, where the units of image data are compressible. A processor represents the units as nodes in a dependency graph for a container image, including one or more nodes at a dependency level in the dependency graph.

Abstract: A hardware-implemented file reader includes an interface, multiple hardware-implemented column readers and a hardware-implemented record reconstructor. The interface is configured to access a file including multiple records. The records store values in accordance with a nested structure that supports optional values and repeated values. The file is stored in a columnar format having multiple columns, each column storing (i) compressed values and (ii) corresponding compressed structure information that associates the values in the column to the nested structure of the records. Each column reader is configured to be assigned to a respective selected column, and to read and decompress both the values and the structure information from at least a portion of the selected column. The record reconstructor is configured to reconstruct one or more of the records from at least portions of the columns that are read by the column readers, and to output the reconstructed records.

Abstract: A system and method for manipulation of compacted data files, utilizing a reference codebook, a random-access engine, a data deconstruction engine, and a data deconstruction engine. The system may receive a data query pertaining to a data read or data write request, wherein the data file to be read from or written to is a compacted data file. A random-access engine may facilitate data manipulation processes by accessing a reference codebook associated with the compacted data file, a frequency table used to construct the reference codebook, and data query details. A data read request is supported by random-access search capabilities that may enable the locating and decoding of the bits corresponding to data query details. A random-access engine facilitates data write processes. The random-access engine may encode the data to be written, insert the encoded data into a compacted data file, and update the codebook as needed.

Abstract: An information processing system includes one or more processors configured to: obtain one or more operation log records recorded in a collaboration service and information about one or more user attributes of corresponding users who use the collaboration service, the collaboration service supporting information sharing among multiple users; when the collaboration service identified from the content of one operation log record of the one or more operation log records involves multiple users, set an attribute condition on the basis of the information about one or more user attributes, the attribute condition indicating the scope of attributes of users who are allowed to refer to the one operation log record; and exert such control that, in response to an inquiry about reference to the one operation log record from an inquiry user who satisfies the attribute condition, the inquiry user is allowed to refer to the one operation log record.

Abstract: Techniques are provided for utilizing a log to free pages from persistent memory. A log is maintained to comprise a list of page block numbers of pages within persistent memory of a node to free. A page block number, of a page, within the log is identified for processing. A reference count, corresponding to a number of references to the page block number, is identified. In response to the reference count being greater than 1, the reference count is decremented and the page block number is removed from the log. In response to the reference count being 1, the page is freed from the persistent memory and the page block number is removed from the log.

Abstract: A method of managing file permissions in a remote file storage system includes defining permissions for the remote file storage system and controlling access to objects on the remote file storage system according to the permissions of the remote file storage system. The permissions are transferred to a client file storage system remote from the remote file storage system, and access to objects on the client file storage system is controlled according to the permissions of the remote file storage system. A remote file storage system includes a permissions file generator operative to generate a permissions file, which is transmitted to a client file storage system for enforcement at the client file storage system.

Abstract: A method comprises receiving, at a build service of a build server, an external dataset and an adaptor application module, the external dataset being in a specific format, the adaptor application module providing information relevant to a build pipeline maintained by the build service for building an output dataset based on the external dataset, the information including changes to the external dataset since a previous build of the output dataset is performed and a data schema used in the previous build, the build pipeline involving data only in one or more formats other than the specific format; incorporating the external dataset into the build pipeline without the external dataset being reformatted in accordance with requirements of the build service; receiving a request from the adaptor application module for specific information relating to a most recent data build run by the build service; providing a response to the adaptor application module.

Abstract: A data science model score database may contain electronic records, each including a data science model identifier and a set of data science model scores. A data science model score server, coupled to the data science model score database, may receive (from a remote user device) an indication of a selected data science model. The server may then retrieve, from the data science score database, information about the selected data science model. Based on the retrieved information, the server may automatically calculate a maturity score for the selected data science model in accordance with a scalable score, a service-oriented score, a validated score, and a productized score. When the server receives from the remote user device an adjustment to at least one of the scalable score, the service-oriented score, the validated score, and the productized score, it may automatically re-calculate the maturity score for the selected data science model.

Abstract: A source schema is extracted from a source database and a target schema is extracted from a target database. By comparing the source schema with the target schema, a mismatch between the source schema and the target schema is identified. Data from the source database is stored in the target database according to the target schema and the mismatch.

Abstract: An embodiment of the present invention is directed to a Metadata-Driven Data Quality Framework and Engine that enables dynamic generation of code for assessing data quality based on qualified metadata content. The Data Quality Framework may be directed to an enterprise scaled application that embodies Data Quality disciplines for good/optimal Data Governance. An embodiment of the present invention may be integrated into a Metadata Management process of an overall Data Governance Program so the data user's meaning and understanding may become part of the automated data quality process.

Abstract: A method for providing an integrated data quality capability for distributed data repositories is disclosed. The method includes identifying, from a data stream, an indication that a job corresponding to a source data set has been started, the job relating to a data ingestion job and a data transformation job; triggering a data reconciliation action based on the identified indication; persisting, in a repository, a first result of the data reconciliation action; initiating a data quality action based on the first result; persisting, in the repository, a second result of the data quality action; initiating a scan action based on the second result; persisting, in the repository, a third result of the scan action; and generating a graphical element and a report based on an analysis of the first result, the second result, and the third result, the graphical element is displayable via a graphical user interface.

Abstract: Disclosed are techniques for deduplicating files to be ingested by a database. A bloom filter may be built for each of a first set of files to be ingested into a data exchange to generate a set of bloom filters, wherein each of the set of bloom filters is built with a number of hash functions that is based on a desired false positive rate. The set of bloom filters may be stored in the metadata storage of the data exchange. In response to receiving a set of candidate files to be ingested, identifying using the set of bloom filters, candidate files from the set of candidate files that are duplicative of a file in the first set of files and pruning from the set of candidate files, each candidate file identified as being duplicative of a file in the first set of files using the set of bloom filters.

Abstract: Systems, apparatus, and methods of managing the lifecycle of a digital token are described. In an example, while the digital token is being generated, the digital token or the underlying digital asset can be compared to other digital tokens and/or digital assets to determine similarity thereto. Based on the similarity, a program code interface (e.g., smart contract, an application programming interface—API, RPC, etc.) can be determined and an API call can be made to execute a program code. The execution can indicate whether the digital token creation process can be completed. If so, the digital token is recorded. Thereafter, its use or the use of the underlying digital asset can be monitored, whereby this monitoring can apply similarity processing. If a use thereof is determined or if a use of a similar digital token or similar digital asset is determined, notifications can be generated and sent.

Abstract: Example embodiments involve a system and methods for identifying valuable view item pages for search engine optimization. The system and methods provide an improvement over existing systems, which do nothing to identify or select valuable view item pages for use in driving traffic from display sites. The system and methods described herein improve the earlier system by predicting the probability of future traffic for a given product based on a number of product level factors as input variables, and identifying a selection of view item pages corresponding to the products with the probability of the highest future traffic in order to maximize the driving natural search traffic to a linked site of the corresponding view item page.

Abstract: Systems, apparatus, and methods of managing the lifecycle of a digital token are described. In an example, while the digital token is being generated, the digital token or the underlying digital asset can be compared to other digital tokens and/or digital assets to determine similarity thereto. Based on the similarity, a program code interface (e.g., smart contract, an application programming interface—API, RPC, etc.) can be determined and an API call can be made to execute a program code. The execution can indicate whether the digital token creation process can be completed. If so, the digital token is recorded. Thereafter, its use or the use of the underlying digital asset can be monitored, whereby this monitoring can apply similarity processing. If a use thereof is determined or if a use of a similar digital token or similar digital asset is determined, notifications can be generated and sent.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed for efficient media indexing. An example method disclosed herein includes means for initiating a list of hash seeds, the list of hash seeds including at least a first hash seed value and a second hash seed value among other hash seed values, means for generating to generate a first bucket distribution based on the first hash seed value and a first hash function and generate a second bucket distribution based on the second hash seed value used in combination with the first hash seed value, means for determining to determine a first entropy value of the first bucket distribution, wherein data associated with the first bucket distribution is stored in a first hash table and determine a second entropy value of the second bucket distribution.

Abstract: The present disclosure provides more efficient techniques for removing a host from a multi-host database system. An instruction to remove a host system may be received. In response, a determination of whether the first host system does or does not store any source tables is made based on a host-type identifier for the host system. This determination may not require obtaining landscape information for each of the hosts in the database system. If the host system stores replica tables and does not store source tables, those replica tables may be dropped based on the determination that the first host system does not store any source tables. As such, in cases where table redistribution is not needed the landscape information is not obtained, thereby making the host removal process more efficient.

Abstract: Techniques are disclosed relating to constructing a delta transition table for a database trigger. A computer system may store trigger information identifying a database trigger having a set of routines to be executed after an update operation has been performed on the database table. The computer system may perform a particular update operation that includes updating one or more rows of the database table. As part of performing the particular update operation, the computer system may construct a delta transition table that includes an original version of the one or more rows prior to the particular update operation and an updated version of the one or more rows resulting from the particular update operation. Subsequent to performing the particular update operation, the computer system may make the delta transition table available to the database trigger to facilitate an execution of the set of routines.

Abstract: Systems and methods for generating tables are provided. The systems and methods perform operations comprising accessing a text document comprising a plurality of strings; processing the text document by a machine learning model to generate a table comprising a plurality of entries that organizes the plurality of strings into rows and columns over a plurality of iterations; and at each of the plurality of iterations, estimating by the machine learning model a first value of a first entry of the plurality of entries based on a second value of a second entry of the plurality of entries that has been determined in a prior iteration.

Abstract: The present disclosure provides a method for spreadsheet importing, a device, an apparatus and a medium. An image processing method includes: receiving a spreadsheet to be imported; displaying, in response to that a spreadsheet object in the spreadsheet includes a picture, the picture in a target table cell of a database table. The target table cell is determined based on a cell position of a target cell; the target cell is a cell to which the picture belongs in the spreadsheet; and the cell position is determined based on a data area of the spreadsheet.

Abstract: Aspects of the disclosure relate to providing and maintaining efficient and effective processing of sets of work items in enterprise computing environments by optimizing distributed and parallelized batch data processing. A computing platform may initialize a monitoring process configured to monitor a pending workload in a work queue database. Subsequently, the computing platform may cause the monitoring process to query the work queue database and create one or more historical records indicative of a workload processing status associated with one or more processing workers. Then, the computing platform may identify one or more new parameter values for one or more processing parameters associated with the one or more processing workers based on the one or more historical records. Thereafter, the computing platform may configure the one or more processing workers based on the one or more new parameter values identified for the one or more processing parameters.

Abstract: Systems and methods for inspection and repair of VSAN object metadata. A user-space indirection layer is maintained to map logical addresses of VSAN objects to physical memory addresses of their metadata. Commands may then be sent from the user space to distributed object manager (DOM) clients, with the physical addresses of metadata of objects to be inspected. DOM owners thus may bypass their own indirection layers to retrieve object metadata directly from received user commands. Retrieved information is then used to reconstruct and repair object metadata. Repaired metadata may be written back to the VSAN by transmitting a write request containing the physical address at which the repaired metadata is to be written. DOM owners may be placed in a specified mode in which received I/O instructions are ignored unless they are designated as being for metadata repair purposes, such as by including a physical address.

Abstract: Systems and methods include reception of an instruction to perform a consistency check on compressed column data. In response to the instruction, a compression algorithm applied to uncompressed column data to generate the compressed column data is determined, one or more consistency checks associated with the compression algorithm are determined, wherein a first one or more consistency checks associated with a first compression algorithm are different from a second one or more consistency checks associated with a second compression algorithm, the one or more consistency checks are executed on the compressed column data, and, if the one or more consistency checks are not satisfied, a notification is transmitted to a user.

Abstract: A cluster number setting device includes a memory, and a processor configured to: input time series data representing a state of a system and configured by data of a dimension of the number of devices constituting the system, a dimension of the number of items representing the number of devices×states of the devices, or a dimension of the number of devices×the number of items×a predetermined time window length; repeatedly cluster data constituting the time series data while counting up the number of clusters from 1 or 2; calculate a predetermined index by using a result of the clustering; determine whether the index is less than a preset threshold; and output the current number-1 of clusters as the number of clusters to be set for unsteady fluctuation detection processing that uses clustering processing, when the index is determined to be less than the threshold.

Abstract: The disclosure deals with a system and method for improved representation and retrieval of recipes or workflows. Recipes or workflows such as for preparing food or assembling furniture or performing other complex activities exist as textual or image documents, which makes it difficult for machines to read, reason, and handle ambiguity. The present disclosure provides a Rich Recipe Representation (“R3”), which is enhanced with additional knowledge such as outcomes like allergen information, possible failures, and solutions for each atomic step (such as a cooking step). The disclosed R3 is used in a web-based decision support system that helps users perform constrained queries using multiple modalities while also monitoring execution of an agent cooking or otherwise acting based on it.

Abstract: Methods for enhancing compatibility of a document of an entity with an organization's database on a computer server to facilitate detection of a fraudulent submission. Methods may include receiving a populated document in a first format from the entity, using a processor to digitize the document into a digital format, such as bytes, and further into a second format, where the first format may not be compatible with the database and the second format may be compatible with the database. Methods may include using the processor, optionally running a statistical model, to determine an entity identifier, a predicted value of a data field in the document, and whether there is a difference between the value in the predicted data field and a corresponding value in the populated document. Methods may include implementing a corrective action, such as raising a fraud alert at the organization, when there is a difference.

Abstract: Aspects of the present disclosure involve a system comprising a computer-readable storage medium storing a program and a method for performing operations comprising: receiving a plurality of records associated with a first geographical area; identifying a plurality of corrections to a first attribute in the first geographical area in the plurality of records for a particular time period; based on identifying the plurality of corrections to the first attribute, computing a first metric representing a quantity of the plurality of corrections to the first attribute per effort during the particular time period; accumulating a first value representing a total number of errors across a plurality of time periods up to and including the particular time period based on the identified plurality of corrections; and generating a first model that predicts accuracy of the first attribute in the first geographical area based on the metric and the accumulated first value.

Abstract: Systems, methods, and devices for retrying a query. A method includes receiving a query directed to database data and assigning execution of the query to one or more execution nodes of an execution platform, the one or more execution nodes configured to execute the query on a first version of a database platform. The method includes determining that execution of the query was unsuccessful. The method includes assigning a first retry execution of the query to the one or more execution nodes of the execution platform and determining whether a regression or an intermittent fault caused the execution of the query to be unsuccessful based at least in part on whether the first retry execution of the query was successful or unsuccessful.

Abstract: Systems, methods, and computer-readable media are provided for performing a well completion. Specifically, a distributed ledger associated with a supply chain for a well completion is accessed. The distributed ledger can include a first entry associated with a first entity in the supply chain that is indicative of an identification of the first entity and characteristics of a material implemented in the well completion. The ledger can also include a second entry associated with a second entity in the supply chain that is indicative of the second entity and the characteristics of the material at the second entity. Integration of the material in the well completion can be controlled based on the first entry and the second entry.

Abstract: One or more non-transitory computer readable media containing program instructions that, when executed by one or more processors, cause the one or more processors to perform operations: generating a database of interconnected smart entities, the smart entities including object entities representing each of the plurality of physical devices and data entities representing data generated by the devices, the smart entities being interconnected by relational objects indicating relationships between the object entities and the data entities; receiving data from a first device of the plurality of physical devices; determining a second device from a relational object for the first device based on the received data; and modifying a data entity connected to an object entity of the second device within the database of smart entities based on the received data for the first device.

Abstract: Described herein is a computer implemented method. The method comprises receiving a content item record in respect of a content item generated at a collaboration system and processing the received content item record to determine if the content item record includes any designated content. In response to determining that the received content item record includes designated content the method further comprises generating a designated content record in respect of the identified designated content and saving the designated content record to a data store.

Abstract: Structured data comprising primary data is transformed into object-based data comprising the primary data and at least one search function. The object-based data when loaded into memory provides the search function as executable instructions for an object instance. When an application calls the object instance with search terms as input, the search terms are located within the primary data (which is loaded into memory) by the search function, and the object instance returns corresponding field values from the primary data associated with the search terms to the application.

Abstract: A website is navigated automatically in a sequential manner, for example by performing a series of specific network requests in a specified order, without necessarily using a browser, and without necessarily rendering each web page in the sequence. Interactions with a website are automatically recorded, stored, and analyzed. Requests and responses can be associated with particular input/output operations. Based on the analysis, the system can determine what data is expected by web servers, so that it can effectively simulate browser operations in connection with those web servers, and extract useful information from the data received in response to those operations. Thus, data extraction and/or other operations can be performed more efficiently and more quickly, while reducing the computing resources needed.

Abstract: An accelerator is disclosed. The accelerator may include an on-chip memory to store a data from a database. The on-chip memory may include a first memory bank and a second memory bank. The first memory bank may store the data, which may include a first value and a second value. A computational engine may execute, in parallel, a command on the first value in the data and the command on the second value in the data in the on-chip memory. The on-chip memory may be configured to load a second data from the database into the second memory bank in parallel with the computation engine executing the command on the first value in the data and executing the command on the second value in the data.

Abstract: A computer implemented method can receive a parameterized query written in a declarative language. The parameterized query comprises a parameter which can be assigned different values. The method can perform a first compilation session of the parameterized query in which the parameter has no assigned value. Performing the first compilation session can generate an intermediate representation of the parameterized query. The intermediate representation describes a relational algebra expression to implement the parameterized query. The method can perform a second compilation session of the parameterized query in which parameter has an assigned value. Performing the second compilation session reuses the intermediate representation of the parameterized query.

Abstract: Examples described herein provide a computer-implemented method that includes training a machine learning model. The model is trained by generating a set of training queries using at least one of a query workload and relationships between tables in a database, building a query graph for each of the set of training queries, computing, for each training query of the set of training queries, a selectivity based at least in part on the query graph, and building, based at least in part on the set of training queries, an initial join result distribution as a collection of query graphs.

Abstract: A computer-implemented method for enhancing and utilizing user data derived from digital interactions includes receiving user submission data comprising records generated by input into a client side application interface by a first user on a first computing device and transmitted from the first computing device to the aggregation point via at least one of a data transmission service and a data transmission provider. The method includes generating a first dataset associated with the first user, generating a data model based on data in the first dataset and one or more correlations based on attributes in the first dataset, and generating a modeled dataset based on the data model.

Abstract: A method may include receiving a definition of a table user-defined function (TUDF) in a graph query language. The table user-defined function may be created based on the definition. For example, the creation of the table user-defined function may include checking and compiling the definition to generate executable code associated with the table user-defined function. Upon receiving a query including a relational query language statement invoking the table user-defined function, such as a structured query language select statement, the query may be executed on at least a portion of a graph data stored in a database. The executing of the query may include calling the executable code to execute the table user-defined function included in the relational query language statement. Related systems and computer program products are also provided.

Abstract: A database system that, after receiving the query request, adopts a pre-trained deep learning model to predict probing cardinality corresponding to the query request based on the query vector in the query request, the number of vectors of the query result, and the vector corresponding to the distances between the query vector and the center vector of a plurality of data partitions stored in the storage device. The system then determines the target data partitions according to the probing cardinality, and obtains the query result from the target data partitions. Since the probing cardinality is dynamically determined based on the query request, decreases to both the query efficiency due to a larger setting of the probing cardinality, and the query recall due to a smaller setting of the probing cardinality are avoided, which is beneficial in reducing the average number of target data partitions and improving query efficiency.

Abstract: Some embodiments provide techniques of enforcing valid data assignments in a data processing system in which data can be dynamically updated by user devices and/or computerized processes. The techniques identify, using a validation rule associated with a data entity, one or more valid values for assignment to an attribute of an instance of the data entity. The techniques identify the valid value(s) by generating a query for the one or more valid values using one or more condition(s) on the attribute in the validation rule, and executing the generated query to obtain the one or more valid values for the first attribute. The attribute may then be assigned one or more of the identified valid value(s).

Abstract: A system and a method facilitating access to and use of contextual identity information during law enforcement encounters for minimizing confrontational tensions are disclosed. A user updates information corresponding to a user, his/her associates, and a vehicle on a government server and an insurance server. A law enforcement official uses a law enforcement device to access the government server, the insurance server, and a law enforcement server. The law enforcement official accesses the government server, the law enforcement server, and the insurance server to verify the identification of the user and the vehicle. The system allows the law enforcement official to have required information on the law enforcement device to verify the identification of the user and the vehicle. The law enforcement official verifies the identification at ease thereby reducing potential hostile situations with the user.

Abstract: Computer-implemented improved real estate search methods, systems, and computer-readable media are described.