G06F16/282

Tree-based format for data storage

A tree-based format may be implemented for data stored in a data store. A table may be maintained across one or multiple storage nodes in storage slabs. Storage slabs may be mapped to different nodes of a tree. Each node of the tree may be assigned a different range of distribution scheme values which identify what portions of the table are stored in the storage slab. Storage slabs mapped to child nodes in the tree may be assigned portions of the range of distribution scheme values assigned to a parent. Storage nodes may be added or removed for storing the table. Storage slabs may be moved from one storage node to another in order to accommodate the addition or removal of storage nodes.

Method and apparatus for aligning interactions of users in a green technology project

A computer system for controlling exchange of data between users sharing data of a green technology project on a digital platform may include a platform device, which may store profiles of the users in a platform structure that may include layers to which the user profiles may be assigned depending on a user type. The platform device may be configured to receive project data, project criteria and basic criteria of a user having a user profile assigned to a first layer from a first terminal device, transmit the received project criteria to terminal devices, receive, from a second terminal device, a request of another user to access the project data and permit said user to access the project data if a set of project criteria and basic criteria of said user match with a set of project criteria and basic criteria of the user assigned to the first layer.

Connected Accounting System and User Interfaces
20230022438 · 2023-01-26 ·

A method and system for determining a set of accounting data structure (ADS) chains including a first ADS chain, a second ADS chain, a third ADS chain, and a fourth ADS chain; determining a first connection data structure (CDS); determining a second CDS; determining a set of mutually exclusive partitions including a first partition and a second partition, wherein the first partition and second partition are mutually exclusive in that no CDS links an ODS in an ADS chain associated with the first partition to an ODS in an ADS chain associated with the second partition; assigning the first partition to a first set of computational resources; and assigning the second partition to a second set of computational resources are described.

Resource dependency system and graphical user interface

A resource dependency system displays two dynamically interactive interfaces in a resource dependency user interface, a hierarchical resource repository and a dependency graph user interface. User interactions on each interface can dynamically update either interface. For example, a selection of a particular resource in the dependency graph user interface causes the system to update the dependency graph user interface to indicate the selection and also updates the hierarchical resource repository to navigate to the appropriate folder corresponding to the stored location of the selected resource. In another example, a selection of a particular resource in the hierarchical resource repository causes the system to update the hierarchical resource repository to indicate the selection and also updates the dependency graph user interface to display an updated graph, indicate the selection and, in some embodiments, focus on the selected resource by zooming into a portion of the graph.

EXECUTING HIERARCHICAL DATA SPACE OPERATIONS
20230229673 · 2023-07-20 · ·

Methods and apparatus for executing a data operation are described herein. The methods and systems may include determining at least one subdivision of at least one logical hierarchical data space. The at least one logical hierarchical data space may have a plurality of subdivisions. The method may further include determining at least one file corresponding to the at least one subdivision of the at least one logical hierarchical data space. The method may further include reading at least one tuple from the at least one file.

System and method for slowly changing dimension and metadata versioning in a multidimensional database environment
11704294 · 2023-07-18 · ·

In accordance with an embodiment, described herein are systems and methods for supporting slowly changing dimensions and metadata versioning in a multidimensional database, comprising. A system can comprise a computer that includes one or more microprocessors, and a multidimensional database server executing on the computer, wherein the multidimensional database server supports at least one hierarchical structure of data dimensions. A data dimension can slowly change over time. When such changes occur, metadata associated with the data dimension can be updated. Advantageously, a current snapshot of the data structure can allow searching of previous changes to the slowly changing dimension based upon the metadata.

TECHNIQUES FOR MANAGING A COLLABORATIVE DATA MANAGEMENT AND DELIVERY PLATFORM
20230016793 · 2023-01-19 ·

Techniques for managing a collaborative data management and deployment platform and generating customizable blueprints for a data deployment program are disclosed. Techniques include receiving one or more parameters for generating the blueprint for the program, receiving a selection of one or more blueprint components satisfying the one or more parameters, and generating the blueprint template as a function of the selected components. In addition, one or more data sets for use in a program are obtained. A selection of the blueprint template is received. Objects of the selected blueprint are mapped to the one or more data sets. The selected blueprint is mapped to one or more third-party data channels.

TRANSFORMING RELATIONAL STATEMENTS INTO HIERACHICAL DATA SPACE OPERATIONS
20230008502 · 2023-01-12 · ·

A method for transforming a statement into at least one hierarchical data space operation may include analyzing the statement to produce at least one transformed statement. The method may further include selecting at least one element of the transformed statement. The method may further include determining at least one column for the at least one element. The method may further include generating at least one hierarchical data space operation for the at least one element. The method may further include extracting at least one value from the at least one element for the at least one column. The method may further include determining at least one first logical hierarchical data space for the at least one hierarchical data space operation. The method may further include generating at least one first hierarchical path identifier for the at least one value that preserves the hierarchy of its first hierarchical data space, wherein each value corresponds to at least one subdivision of its first hierarchical data space. The method may further include associating the at least one first hierarchical path identifier with the at least one hierarchical data space operation.

SYSTEMS AND METHODS FOR CLIENT INTAKE AND MANAGEMENT USING HIERARCHAL CONFLICT ANALYSIS

Systems and methods for client intake and management are disclosed herein. In an embodiment, a method for client intake and management by a first party includes receiving initial client data regarding a second party from at least one user terminal, the initial client data including a name of the second party and at least one selection, determining a conflict rating using hierarchical searching on a matter database using the initial client data and the at least one selection, and causing an adjustment to a user interface on a user terminal based on the conflict rating.

Systems and methods of generating data marks in data visualizations

An example method of displaying a data visualization includes displaying a plurality of selectable fields and receiving user selections of two different fields from the plurality of selectable fields. The method also includes generating, in accordance with the received user selections, data marks to be displayed in a data visualization, each data mark corresponding to a respective retrieved tuple of data from a multidimensional database, where (i) each data mark has an x-position defined according to data for a first field in the respective tuple and (ii) each data mark has a y-position defined according to data for a second field in the respective tuple. The method also includes displaying the data visualization that includes the generated data marks.