Abstract: The application discloses a method, apparatus, electronic device and storage medium for data aggregation. The method includes: obtaining an aggregation basis dimension and an aggregation calculation dimension, wherein the aggregation basis dimension and the aggregation calculation dimension are respectively fields in a data source table to be aggregated; obtaining an aggregation result by aggregating field values corresponding to the aggregation calculation dimension of at least one target row, wherein field values of the aggregation basis dimension of the at least one target row are the same; and recording a correspondence relationship between a target aggregation path and the corresponding aggregation result, wherein the target aggregation path is determined according to field values of the aggregation basis dimension of the target row.

Abstract: One example method includes generating in a shared protection namespace a first point-in-time copy of a first working frozen copy of an active namespace that includes first files associated with the active namespace that are stacked in a first horizontal file. A retention lock is applied to the first horizontal file. A second point-in-time copy of a second working frozen copy of the active namespace that includes second files associated with the active namespace that are stacked in a second horizontal is generated. A retention lock is applied to the second horizontal file. The second horizontal file is generated by copying files from the first horizontal file into the second horizontal file and copying files from the second working frozen copy of the active namespace into the second horizontal file.

Abstract: A blockchain system is enabled to participate in distributed transactions that uses a two-phase commit protocol (“2PC”). In a 2PC, a computer system, such as a DBMS or blockchain system, commits a transaction that changes data (e.g. database, world state) using two phases. To participate in a distributed transaction using 2PC, a blockchain system executes a “staged transaction”. A staged transaction transitions through the 2PC phases. In the prepare phase, the new values for world state records are staged in staging records as staged values. In the second phase, if the distributed transaction is to be committed, the world staging records are set to the staged values.

Abstract: Columnar storage provides many performance and space saving benefits for analytic workloads, but previous mechanisms for handling single row update transactions in column stores suffer from poor performance. A columnar data layout facilitates both low-latency random access capabilities together with high-throughput analytical access capabilities, simplifying Hadoop architectures for use cases involving real-time data. In disclosed embodiments, systems may perform read and scan features through which users may have consistent reads of the columnar storage at any given point in time. These scans (e.g., snapshots) allow for analytics to be performed on the data, consistent backups of the data, for incremental backups, perform cross-cluster synchronization, and/or for offline audit analysis.

Abstract: Edge functions at an edge location of a content delivery network (CDN) may use APIs of a datastore engine in order to read/write or create/delete local tables at the edge location. Data may be accumulated in the local tables and the new data may be used to enhance decision at the edge. Some of the local tables may be initially populated from a back-end database. This allows the functions to modify the data from the back-end database, without affecting the actual source data at the back-end database (modifications to local tables remain local to the edge location).

Abstract: In some examples, in response to a join query to join a plurality of tables, a first processing engine retrieves tuples of a first table from a subset of objects of a data store, and adds content of the retrieved tuples to an in-memory table, where the objects are range partitioned across a plurality of processing engines based on respective ranges of values of at least one join attribute in the join query. The first processing engine retrieves, from the data store, tuples of a second table of the plurality of tables based on a range of values of the at least one join attribute in the retrieved tuples of the first table. The first processing engine performs an in-memory join of the plurality of tables based on the retrieved tuples of the second table and the in-memory table.

Abstract: A method for providing data blocking to facilitate distributed entity resolution is disclosed. The method includes receiving data sets from a source, the data sets including records that correspond to an entity; grouping each of the records into a block based on a shared characteristic, the block including a blocking key; converting the block into a data file, the data file corresponding to a predetermined file format; partitioning the data file based on the corresponding blocking key; determining, via a worker node, a potential record pair by using the partitioned data file; and persisting the potential record pair.

Abstract: Example embodiments facilitate efficient comparison operations of tree structures, resulting in comparison metrics (e.g., similarity or distance metrics or scores) used enhance software systems, such as search algorithms, code optimization software, enterprise database applications, and so on. Trees to be compared are converted into sets, i.e., serialized using a novel enumeration method. Metric functions can then be efficiently applied to the sets to facilitate the comparison operations. In an illustrative embodiment, subtrees of larger trees can be compared individually, pairwise, where the comparison results of the subtree comparisons can be selectively weighted and summed to yield an aggregated comparison metric that is tailored for a specific application or comparison priority.

Abstract: A method, non-transitory computer readable medium and storage server computing device that stores an identifier for a file system block evicted from a buffer cache in an entry in a table. The file system block is inserted into a victim cache hosted by an ephemeral block-level storage device by invoking a function provided by an application programming interface (API). The API exposes the ephemeral block-level storage device to a virtual storage appliance via an operating system of the storage server computing device. The entry in the table is updated to include location(s) on the ephemeral block-level storage device at which one or more portions of the file system block are stored, the location(s) returned in response to the function invocation. By this technology, performance of the virtual storage appliance is significantly improved, resulting in lower latency for client devices requesting data in a cloud storage environment.

Abstract: Columnar storage provides many performance and space saving benefits for analytic workloads, but previous mechanisms for handling single row update transactions in column stores suffer from poor performance. A columnar data layout facilitates both low-latency random access capabilities together with high-throughput analytical access capabilities, simplifying Hadoop architectures for use cases involving real-time data. In disclosed embodiments, mutations within a single row are executed atomically across columns and do not necessarily include the entirety of a row. This allows for faster updates without the overhead of reading or rewriting larger columns.

Abstract: Disclosed herein is a method, system, or non-transitory computer readable medium for evaluating a query on a columnar dataset comprising one or more dictionaries associated with columns in the dataset. The method includes receiving a request to perform a query comprising at least an operator for a columnar dataset on cloud storage. At least one column in the dataset is based on a dictionary, and the dictionary maps one or more values for a column to one or more respective identifiers. The method evaluates the operator on one or more values of the dictionary to generate an updated dictionary comprising updated values. The method may decode the updated dictionary into an updated column comprising updated data values.

Abstract: A method, a system, and a computer program product for performing on-demand feature extraction from a raw image of an object for analysis. A query is executed to retrieve an image of an object. Using one or more parameters of the query, a raw image of the object is compressed to generate a compressed image of the object. One or more features associated with the object are extracted from the compressed image of the object. Based on the compressed image of the object, the image of the object is generated using the extracted one or more features of the object.

Abstract: An enhanced multidimensional data management system significantly reduces the resources required to convert a spreadsheet into an enterprise collaborative system. A spreadsheet may be imported as is without modifications. Additional information that cannot be automatically inferred about the data model used in the spreadsheet is obtained. Dimensions, timescale, and measure data are clearly defined and located. The spreadsheet is kept in the system in the form of both a spreadsheet and as a multidimensional data structure such as an online analytical processing (OLAP) cube or structure. This duality allows the spreadsheet to be manipulated as if it was an OLAP cube, modifying iterations within the dimensions, and the OLAP cube to be computed as if it was a spreadsheet.

Abstract: A distributed data processing system for a database composed of data records organized into tables for responding to a request to split an index in a consistent and concurrent fashion. A request to split an index atom at any given node is processed by a designated “chairman” for that index atom. The chairman splits its index by maintaining a lower portion thereof and by moving the contents of an upper portion to a newly created index atom as the right sibling. Each other node takes appropriate steps to assure orderly transfer of this information from the chairman consistently and concurrently across the distributed database processing system.

Abstract: Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: running an application on one or more computing node, the application providing user access to a database; receiving by the application registration data from a user for registering the user into a service; in response to the receiving the registration data from the user, generating a user schema that defines access rights of the user to the database, wherein the generated user schema includes a set of shared data structure objects instantiated in a storage system associated to the application, and a set of private data structure objects.

Abstract: Embodiments of the present disclosure are directed to a method for processing computer readable electronic files in an investigation in a computer system including a processor coupled to a display and an electronic storage device coupled to the processor. The method includes the processor accessing the electronic files and related data from a data source. The accessed files and related data are culled by the processor based on predetermined filter criteria. The processor stores the remaining files and related data in a third-party data repository and maps a set of electronic files and related data stored in the third-party data repository into a predetermined database schema. The mapped files and related data are analyzed by the processor, which applies a status decision on them. The analyzed electronic files and related data are submitted to a third-party e-discovery processing application based on the applied status decision.

Abstract: A method includes receiving, by a first computing entity of a database system, a query request that is formatted in accordance with a generic query format. The method further includes generating, by the first computing entity, an initial query plan based on the query request and a query instruction set. The method further includes determining, by the first computing entity, storage parameters. The method further includes determining, by the first computing entity, processing resources for processing the query request based on the storage parameters. The method further includes generating, by the first computing entity, an optimized query plan from the initial query plan based on the storage parameters, the processing resources, and optimization tools. The method further includes sending, by the first computing entity, the optimized query plan to a second computing entity for distribution and execution of the optimized query plan.

Abstract: Various embodiments of a system and method for capturing changes in trade information that impact trade authorization and for updating a chain state on a distributed chain database that is used to authorize trades are disclosed herein. In some embodiments, the system comprises: a trade controller configured to obtain a current state from a local database; a rules engine configured to be invoked by the trade controller to apply a ruleset to data extracted from the local database to generate an updated state; an operation auto detector configured to generate a plan to update a chain state on the distributed chain database based at least in part on the updated state; and an execution engine configured to execute the plan and to generate an updated chain state that is used to authorize trades.

Abstract: A computer-implemented method comprises creating and storing a plurality of different access group identifiers each associated with one or more user account identifiers, and a plurality of different classification markings each representing a different access restriction for an electronic document, and associating each of the user account identifiers with one or more of the classification markings; indexing each particular electronic document among a plurality of different electronic documents in association with values of one or more of the access group identifiers and with an inverse list of values of the classification markings that apply to the particular electronic document in a classification index; receiving a search query that specifies one or more attributes of electronic documents; obtaining one or more first classification markings, among the plurality of classification markings, which are associated with a particular user account identifier that is associated with the search query; executing a sea

Abstract: Cloud storage systems and methods are described for providing event-based user state synchronization among the various cloud elements. A global user directory is maintained on a remote cloud storage system. The global user directory includes a plurality of global user definitions associated with a plurality of user accounts, where each of the user accounts has access to at least one of a remote file system hosted by the remote cloud storage system and a local file system hosted by a local cloud storage system. As global user definition are altered on the remote cloud storage system, user events are generated and communicated to the local cloud storage system, where they are applied to synchronize the local user definitions with the global user definitions. The invention facilitates centralized control of user definitions, near real-time event delivery to local cloud storage systems, and separation of authentication processes from customers' active directory services.