Abstract: A system and method for enabling an efficient data processing in a distributed network of devices includes collecting first data from at least one client device sent by at least one plant device via a first communication interface; storing the first data in a data storage; profiling the first data to obtain characteristic information of the collected first data; determining a data processing strategy upon a result of the characteristic information of the first data; processing the first data according to the data processing strategy and deciding which data of the first data need to be sent to the master device via a second communication interface.

Abstract: A method for operating a data interface circuit whereby calibration adjustments for data bit capture are made without disturbing normal system operation includes initially establishing, using a first calibration method where a data bit pattern received by the data interface circuit is predictable, an optimal sampling point for sampling data bits received by the data interface circuit, and during a normal system operation and without disturbing the normal system operation, performing a second calibration method where the data bit pattern received by the data interface circuit is unpredictable. The second calibration method determines an amount of a timing drift for received data bit edge transitions and adjusts the optimal timing point determined by the first calibration method to create a revised optimal timing point. The second calibration method samples fringe timing points associated with the transition edges of a data bit.

Abstract: Some aspects of the present disclosure relate to an apparatus for bringing up a multi-purpose communication port, the apparatus comprising interface circuitry, machine-readable instructions, and processor circuitry to execute the machine-readable instructions to determine, during a boot phase, a link type of a link to be established via the multi-purpose communication port, and perform, during the boot phase, link training on the multi-purpose communication port according to the link type, wherein, in case the link supports a first higher link rate or a first higher number of lanes, a second lower link rate or second lower number of lanes is used for link training on the multi-purpose communication port.

Abstract: An example operation includes one or more of sending data from a component on a transport to at least one other component on the transport in at least one location on a bus, comparing the data at the at least one other component to a threshold, and sending a notification, by the at least one other component, to a processor when the data is outside the threshold.

Abstract: A modular industrial electrical connector is provided having a holding frame; at least two electrical connector modules which can be inserted into the holding frame; a data diode module which is designed for communication with the at least two electrical connector modules; wherein, for at least one of the two electrical connector modules, unidirectional data transfer can be established by the data diode module. REPLY BLOCKING is carried out in that data are sent from an electrical connector module to an electrical device via the data diode module, wherein data are sent back from an electrical device to the data diode module and are blocked by the data diode module, and/or CONTROL BLOCKING is carried out in that data are transmitted from an electrical device to the data diode module and are forwarded by the data diode module to an electrical connector module, wherein data are sent back from the electrical connector module to the data diode module and are blocked by the data diode module.

Abstract: A network interface module for coupling a host device to a switched network as a network node is described. The network interface module comprises a single half-duplex port for communicatively coupling to a shared bus of the switched network, at least one frame queue sized to store one multicast read frame received via the shared bus, and logic circuitry. The logic circuitry is configured to decode a read command for the interface module included in a payload of the multicast read frame that includes multiple read commands for other network nodes of the switched network, and transmit a response frame including read data on the shared bus when detecting the shared bus is available for transmitting.

Abstract: Disclosed is a receiver of a serial interface, comprising, a first multiplexer configured to select one of a data signal and a first reference voltage in response to an enable signal, a second multiplexer configured to select one of the first reference voltage and a second reference voltage in response to the enable signal, a comparator receiving an output of the first multiplexer to a positive input terminal and an output of the second multiplexer to a negative input terminal, and a reference generator configured to generate the second reference voltage and to generate the first reference voltage from the second reference voltage using an unity gain buffer.

Abstract: Communication devices, systems and methods are disclosed. In one example, a communication device includes: a communication unit that adds identification information for identifying a data block to a set of data blocks having a serial signal group conforming to SPI transmitted from a master in synchronization with a clock, and transmits the data block to a communication partner device within one frame period of a predetermined communication protocol, or adds identification information for identifying each of the data blocks, and transmits the data block to the communication partner device in a plurality of frame periods; and a storage unit that sequentially stores a number of data blocks transmitted from the master, and then outputs a data block transmitted from the communication partner device in response to the number of data blocks, to transmit the data block to the master.

Abstract: Aspects of the present disclosure provide techniques and apparatus for transferring data, such as between power domains via a first in, first out (FIFO) queue. An example method of transferring data includes selecting, via a source multiplexer, a first memory location included in a FIFO queue and storing first data, where the source multiplexer and the FIFO queue are in a first power domain; outputting the first data to a first level shifter; calculating, in the first power domain, a first value based on the first data; outputting the first value to a second level shifter; selecting, via at least one destination multiplexer included in a second power domain, the first level shifter and the second level shifter; calculating, in the second power domain, a second value based on the first data; and comparing the first value to the second value to generate a result.

Abstract: A system and method for automated data propagation and automated data processing within an integrated circuit includes an intelligence processing integrated circuit comprising at least one intelligence processing pipeline, wherein the at least one intelligence processing pipeline includes: a main data buffer that stores input data; a plurality of distinct intelligence processing tiles, wherein each distinct intelligence processing tile includes a computing circuit and a local data buffer; a token-based governance module, the token-based governance module implementing: a first token-based control data structure; a second token-based control data structure, wherein the first token-based control data structure and the second-token based control data operate in cooperation to control an automated flow of the input data and/or an automated processing of the input data through the at least one intelligence processing pipeline.

Abstract: The present disclosure discloses a reconfigurable processor and a configuration method. The reconfigurable processor includes a reconfiguration configuration unit and a reconfigurable array. The reconfiguration configuration unit is configured to provide, according to an algorithm matched with a current application scenario, reconfiguration information used for reconfiguring a computation structure in the reconfigurable array. The reconfigurable array includes at least two stages of computational arrays, the reconfigurable array is configured to connect, according to the reconfiguration information provided by the reconfiguration configuration unit, adjacent two stages of the computational arrays to form a data path pipeline structure satisfying computation requirements of the algorithm.

Abstract: Techniques monitor storage resource objects. Such techniques involve monitoring a first number of storage resource objects that have been consumed in a storage system, the consumed storage resource objects storing a system file and/or volume and snapshots of the system file and/or snapshots of the volume. Such techniques further involve determining a second number of remaining storage resource objects based on the first number and the performance of the storage system. Such techniques further involve sending the first number and the second number to a user device to display the first number and the second number by the user device. The second number decreases as the first number increases. Such techniques can directly and intuitively provide users with the usage of storage resource objects in a storage system from the perspective of number attributes, thus providing reference for users when creating protection policies, and further improving user experience.

Abstract: Systems and methods for locking databases during database operation, such a logical mechanisms for locking a local number portability (LNP) database associated with the Number Portability Administration Center (NPAC), are described. For example, the systems and methods may utilize various logical constructs, such as parameters that identify items or records within a database (e.g., object type and value information). and lock records that include such paramters.

Abstract: An system which automatically characterizes contents of important files, and saves those important files in a way that they can be easily found later by determining context at the time when the file is requested and matching that to the contents of the files. An embodiment uses global information, so that when one person identifies an unknown file, it is automatically usable for others to identify similar unknown files.

Abstract: An interface for enabling a computer device to utilize data property-based data placement inside a nonvolatile memory device comprises: executing a software component at an operating system level in the computer device that monitors update statistics of all data item modifications into the nonvolatile memory device, including one or more of update frequencies for each data item, accumulated update and delete frequencies specific to each file type, and an origin of the data item; storing the update statistics of each of the data items and each of the data item types in a database; and intercepting all operations, including create, write, and update, of performed by applications to all the data items, and automatically assigning a data property identifier to each of the data items based on current update statistics in the database, such that the data items and assigned data property identifiers are transmitted over a memory channel.

Abstract: A computing platform is configured to: (i) obtain a plurality of data files; (ii) for each respective data file of the plurality of obtained data files, obtain contents associated with the respective data file and evaluate the contents associated with the respective data file to determine a respective data structure for the respective data file; (iii) compare the determined respective data structures and thereby identify one or more data structure differences among the determined respective data structures for the data files; (iv) based on the identified one or more data structure differences among the determined respective data structures for the data files, determine a revision history for the plurality of data files; and (v) transmit, to a client station, a communication related to the revision history and thereby cause an indication of the revision history to be presented at a user interface of the client station.

Abstract: Technologies for organizing and optimizing storage capacity of shared file platforms are disclosed. An example method includes pulling a set of events associated with a user from an event log. Each event in the set of events includes a respective parent folder identification (ID). The example method further includes analyzing, by a search engine, the set of events to determine one or more actioned parent folders corresponding to the set of events; and comparing the one or more actioned parent folders to a list of parent folders associated with the user to determine a non-actioned parent folder. The example method also includes displaying, at a user interface, the non-actioned parent folder to the user; and receiving an input from the user indicating a removal request corresponding to the non-actioned parent folder. The example method may then include removing the user from a collaborator list associated with the non-actioned parent folder.

Abstract: Techniques described herein relate to a method for managing user device users. The method includes, in response to obtaining a subuser account creation request: obtaining subuser arguments from a user of a user device specifying: a folder of a user file system, and a subuser; generating a subuser account for the subuser and setting subuser permissions based on the subuser arguments; generating a snapshot of the folder; updating a version control directory in the folder with the snapshot; removing the version control directory from the folder; associating user configuration files to the subuser account; and initiating subuser access of the folder based on the subuser permissions and the user configuration files, wherein the subuser is allowed to make modifications to at least one file included in the folder using the subuser account.

Abstract: The disclosure relates to systems and methods of translating event data to generate a scalable data structure to identify or predict an event of interest such as a clinical diagnosis. The scalable data structure is expandable to accommodate various types of event data each having different types of timing indications on a timeline. The system may translate the event data in a way that event data can inherit event data values from other event data in a single time series of events. The scalable data structure may be used to generate unified visualizations of all translated events as well as for forecasting and predicting events of interest. The scalable data structure may be implemented in various contexts such as for clinical diagnostics in which clinical trial data or medical health data from various sources are translated to generate the scalable data structure.

Abstract: Custom resource schema modification is described herein. One example method includes providing an interface for modifying a schema of a custom resource in a virtualized environment. The interface can include a first portion configured to receive modifications to summary information corresponding to the custom resource and a second portion configured to receive modifications to properties corresponding to the schema of the custom resource. The method can include validating the modified schema, and saving the modified schema of the custom resource responsive to the validation being successful.

Abstract: An information processing system includes a processor configured to: in a two-dimensional table in which an attribute value of a first attribute given to a file is used as a header of each row and an attribute value of a second attribute given to the file is used as a header of each column, display statistical information of the file corresponding to the attribute value of the first attribute and the attribute value of the second attribute; receive a row or a column of the two-dimensional table selected by a user and a movement destination of the row or the column; reflect statistical information of a file corresponding to the received row or column of the two-dimensional table in the movement destination and delete the received row or column of the two-dimensional table from the two-dimensional table; and change an attribute value of the file corresponding to the received row or column of the two-dimensional table to an attribute value of the movement destination.

Abstract: A space-efficient change journal for a storage system is provided. The storage system includes a memory having computer readable instructions stored therein. The system further includes a processor configured to access a log structure merge (LSM) tree-based metadata index having metadata for the storage system. The LSM tree-based metadata index includes indices placed in a plurality of indexing layers and one or more indices are merged within the indexing layers in response to updates to metadata, or as a background task. The processor is configured to identify one or more indices of the LSM tree-based metadata index as entries of a change journal of the storage system. The processor is further configured to maintain the change journal of the storage system based upon the identified entries.

Abstract: A method and system for managing execution of database transactions are provided. The method includes receiving at least one statement that is a part of a transaction, wherein the transaction is initiated by a client to be executed on a database system; executing tasks included in each of the at least one received statement in an optimistic manner, wherein the received at least one statement is not a commit statement; and returning the client an acknowledgement that the transaction is committed, wherein the acknowledgement is returned upon validation of the transaction, wherein the transaction is validated in a pessimistic manner, and wherein the at least one received statement is a commit statement.

Abstract: A database system implementing a concurrency control protocol is provided. The database system includes a node connected through a network to a client; the node comprises: a storage for storing a plurality of data cells; one or more processors; and a memory, the memory containing instructions that, when executed by the one or more processors, configure the node to: receive at least one non-commit statement that is part of a transaction; execute locally tasks included in each of the at least one received statement in an optimistic manner allowing statements of other transactions to independently access same data cells in the database system being modified by tasks of the at least one received statement; and return the client an acknowledgment that the transaction is committed, the acknowledgment is returned upon validation of the transaction, wherein the transaction is validated in a pessimistic manner.

Abstract: Techniques a provided for performing multi-system operations in which changes are asynchronously committed in multiple systems. Metadata about the multi-system operation is injected into the commit logs of one system involved in a multi-system operation. An event stream is generated based on the commit logs of the one system, and is used to drive the operations that one or more other systems need to perform as part of the multi-system operation. A reconciliation system reads the logs of all systems involved in the multi-system operation and determines whether the multi-system operation completed successfully. Techniques are also provided for using machine learning to generate models of normal execution of different types of operations, detect anomalies, pre-emptively send expectation messages, and automatically suggest and/or apply fixes.

Abstract: The example embodiments are directed to systems and methods which can generate process insights in a manner that is significantly faster than process mining. In one example, a method may include loading a schema of a data system into memory, identifying a plurality of events that occur within a process supported by data from the data system and a plurality of blockers that prevent the plurality of events from completing, defining a query that comprises instructions for extracting data of the plurality of blockers from the data system and for analyzing the process based on the extracted data and the plurality of blockers, and generating a script for executing the defined query based on the schema of the data system and transmit the script to a software application.

Abstract: Systems and methods for self-service data structure discovery are disclosed. In one embodiment, a method may include: (1) retrieving, by a data crawler, data from one or more data sources; (2) storing, by the data crawler, the data to a data catalog; (3) receiving, at a search dashboard, a query from a user, the query comprising a search field; (4) submitting, by the search dashboard and using a query tool, the query to a data catalog, wherein the query tool searches the search field by data structure, datatype, field journey, primary key details, and/or multi-value column detail across layers, data lineage controls in the data catalog; (5) receiving, at the search dashboard, a result of the query from the data catalog; and (6) presenting, by the search dashboard, the results.

Abstract: Obtaining artificial data analysis request data includes obtaining triggering event data including at least one primary data source identifier, obtaining large language model input data for obtaining the artificial data analysis request, obtaining large language model generated data output by a large language model in response to the large language model input data, wherein the large language model generated data includes at least one candidate artificial data analysis request tuple, and validating the large language model generated data, wherein validating the large language model generated data includes validating the at least one candidate artificial data analysis request tuple in accordance with a defined data-analytics grammar implemented by the data access and analysis system.

Abstract: This disclosure presents a system and method for representing, transforming, and answering, database queries based on formalisms for k-relations and operations on them, wherein all the operations are derived from the two basic ones: natural join and natural union, so their algebraic properties are also derived. The disclosure suggests implementations of these formalisms in the embodiments of the invention. In particular, the examples presented in this disclosure encompass the translation of the full spectrum of features and functionality of the relational database queries (SQL examples) as well as the essential functionality of the object-relational and graph database queries (Starcounter QL examples). The algebraic expressions resulting from the said translation can be further rewritten using the transformation rules, and eventually mapped to an executable form for any given embodiment.

Abstract: In some implementations, a data aggregator may receive an indication associated with a data record. The data aggregator may apply a model to the indication to generate a prediction regarding when new information associated with the data record will be available. Based on the prediction, the data aggregator may refrain from requesting new information and may schedule a pull for new information associated with the data record for a later time. Additionally, or alternatively, the data aggregator may receive an indication associated with a plurality of data pulls that are associated with a plurality of data records and may receive an indication of a rate limit associated with a host for the plurality of data records. The data aggregator may apply rules to generate a ranking of the plurality of data pulls and may schedule the plurality of data pulls based on the ranking and the rate limit.

Abstract: Embodiments of the present disclosure may provide a dynamic query execution model with fault tolerance and failure recovery techniques. Embodiments of the present disclosure may utilize checkpoints to map processed output files to their corresponding input files. Therefore, if an error occurs in processing one or more files, the system may only need to reschedule processing of selected file(s).

Abstract: The scanning range of an inner table can be limited in the join processing irrespective of the existence of search conditions or a partition key, and the performance of the join processing can be improved. There is a column range index representing a range of values stored in a table. When a join result of a current stage is an outer table related to a join of a next stage in a join of each stage of the join processing, a database management apparatus identifies whether there is a possibility that an inner table related to a join of a next stage includes a hit record in an inner table related to a join of a current stage based on a column range index corresponding to a join column of a current stage and a column range index corresponding to a join column of a next stage.

Abstract: A set of queries from an application executing on a client computing device is obtained. A first database based on the set of queries is searched to select a set of event types. A set of predicted parameters associated with the set of event types is sent to the application. The application includes instructions to obtain a first parameter and the set of predicted parameters via a user interface of the application and generate a message comprising the first parameter and an indicator identifying the set of predicted parameters. The first parameter and the indicator are obtained via the second message. A combined query including the first parameter and the set of predicted parameters is generated in response to obtaining the indicator. A vehicle record from the vehicle database is obtained based on the combined query. Values of the vehicle record are sent to the client computing device.

Abstract: Message transformation rules for integration platforms are represented in a computing system using transformation rule trees of objects in map object models. The transformation rule tree is an intermediate representation of the transformation rule. The objects in the tree are instantiated from classes of one or more message transformation class hierarchies. Some example classes include iterator statement, conditional statement, and expression classes. Some example expression classes include constant, variable, function, and selector classes. In a message transformation architecture, transformation rules map incoming message schemas to outgoing message schemas. Transformation engines transform incoming messages to outgoing messages by applying the map object models to select data fragments of an incoming message and construct an outgoing message, from the fragments and from computational results of routines invoked on the fragments.

Abstract: A method of determining scores specific to a system is provided.

Abstract: Example embodiments of the present disclosure provide for an example method including obtaining component data associated with a plurality of components. The example method includes generating an index of the component data and obtaining user input data indicative of a request. The example method includes processing the user input data to determine an intent associated with the request and obtaining, based on the intent, data indicative of one or more components from the index. The example method includes determining a rank for at least one respective component of the one or more components. The example method includes updating a user interface to display the one or more components, wherein the components are displayed based at least in part on the rank of the respective component. The example method can include generating modular spaces composed of a plurality of components to generate composite application interfaces which can include cross-application functionalities.

Abstract: In some implementations, a data aggregator may receive an indication associated with a data record. The data aggregator may apply a model to the indication to generate a prediction regarding when new information associated with the data record will be available. Based on the prediction, the data aggregator may refrain from requesting new information and may schedule a pull for new information associated with the data record for a later time. Additionally, or alternatively, the data aggregator may receive an indication associated with a plurality of data pulls that are associated with a plurality of data records and may receive an indication of a rate limit associated with a host for the plurality of data records. The data aggregator may apply rules to generate a ranking of the plurality of data pulls and may schedule the plurality of data pulls based on the ranking and the rate limit.

Abstract: The invention is notably directed to a method of enabling a user (2) to interact with a database associating items with features. The method first comprises accessing the database to obtain an association of the items and the features as a static dataset. Both the static dataset and initial values of a dynamic dataset are loaded in the main memory of a computerized system. The dynamic dataset is meant to capture essential outcomes of the user interaction during her/his search journey. Next, several computational cycles are performed at the computerized system. Such cycles are preferably performed without querying the database. Each of the cycles comprises the following steps. First, upon receiving (S31) an input of the user in respect of one or more of the features, the dynamic dataset is updated (S32) according to the received input. As a result, updated dynamic dataset values are stored in the main memory. The updated dynamic dataset values represent current valuations of the features of the items.

Abstract: The industrial geographical information system relates to the field of industrial production intelligent management and control and comprises a device acquisition control end, a spatio-temporal big data processing end and an industrial geographical information system platform end. Based on a spatial data unified management and analysis framework of the geographic information system, various sensors, monitoring devices and mobile devices in an industrial production environment are acquired to perceive real-time data, and the real-time data are cleaned, denoised, cached, distributed, stored and processed permanently.

Abstract: A data processing system includes: a processor; a memory containing programming instructions for execution by the processor; and a network interface for communicating with an Artificial Intelligence (AI) engine. The programming instructions include an application for generating written content, the application having a function to generate and submit a structured query regarding the written content to the AI engine to generate feedback on an assessed quality of the written content, the structured query structured to prompt for feedback in a variety of specified categories for the written content. The application further includes a user interface to display the feedback on the written content and provide an option to a user to implement the feedback to revise the written content.

Abstract: Systems, methods, and non-transitory computer-readable media for forming an extensible data warehouse. A data ingestor application receiving raw data having a first structure. Forming a data lake in the third memory using the raw data. Continuously receive additional raw data having a plurality of structures. The plurality of structures including the first structure and one or more different structures. The additional raw data supplementing the raw data. Determining each structure of the plurality of structures. Generating a dataset based on the additional raw data and the plurality of structures that are determined. Extracting metadata associated with the additional raw data from the dataset. Creating a catalog of the dataset based on the metadata that is extracted. Modifying the data lake in the third memory to include the additional raw data based on the dataset and the catalog.

Abstract: Example methods and systems are directed to automatically toggling between replication and federation for access for data received from remote sources. The system may initially use a fully federated strategy, so that results for any query can be generated. Based on one or more of predefined criteria, analysis of the queries being performed, network performance data, and other factors, data sets that would benefit from replication are identified. The identified data sets are accessed from the remote source and replicated in local storage. Future queries for replicated data are satisfied by accessing the replicated data. Other queries continue to be served using federation. After replication has begun, analysis of the benefits of replication may continue. When replication is no longer a net benefit, the local data may be deleted and further access of the data provided through federation.

Abstract: A computer-implemented method includes: generating, by the computing device, a plurality of data blocks for a received block size; sharing, by the computing device, a time based universally unique identifier (UUID) for a first data block of the data blocks and an incremental time interval between each data block of the data blocks; finding, by the computing device, a time based UUID which corresponds with the requested data block; and sending, by the computing device, the time based UUID to a cloud site, the time based UUID corresponding with the requested data block.

Abstract: A computer system enables instances of properties (e.g., of resources such as files in a file system) to be selectively synchronized with each other. Each instance of a property may have a plurality of versions. A primary version of the property is shared (and synchronized) among all property instances. Each property instance may also have its own secondary version of the property. Each property instance has its own effective version handle, which points to either the property's primary version or the property instance's secondary version of the property. A comparison is performed between a version state of the property's primary version and a version state of the secondary version of a first instance of the property to produce comparison result output. An instance state is exposed to indicate: (1) the version pointed to by the first instance's effective version handle; and (2) the comparison result output.

Abstract: Techniques for database replication include a method performed by at least one hardware processor of a resource management node. The method includes detecting a request that a database instance of a database stored at a first network deployment is available at a second network deployment. Responsive to the request, the second network deployment is provisioned with a plurality of data objects. A first data object of the plurality of data objects includes a database shell. The database shell is reconfigured as the database instance of the database based on pushing data of the database into the database shell. Access to the database instance at the second network deployment is authorized based on at least a second data object of the plurality of data objects.

Abstract: In accordance with an embodiment, described herein is a system and method for capturing workloads in a multidimensional database environment. Workloads in the multidimensional database environment can be captured over a period of time as an archive file, which can be replayed using a standalone player against the same multidimensional database environment, or a different multidimensional database environment. The standalone player can selectively replay any portion of the archive file. Results from the replay can be compared to original base results in the recorded archive; and any difference between the results can be displayed. The player can filter out noise and expected differences, and display unexpected differences, including paths for potential issues, for use in troubleshooting, and environment and patching validation.

Abstract: In an approach to incremental clustering of continuous flow data streams to preserve data continuity, one or more computer processors receive a definition of a first major cluster period and a definition of a first minor cluster period. One or more computer processors receive a continuous stream of data. One or more computer processors cluster the continuous stream of data, based on the definition of the first major cluster period and on the definition of the first minor cluster period. One or more computer processors determine a similarity between a first data cluster and a second data cluster, wherein the second data cluster occurs after the first minor cluster period. One or more computer processors determine whether the similarity meets a pre-defined minimum threshold of similarity. One or more computer processors increase the first minor cluster period to a second minor cluster period.

Abstract: In various embodiments a computer-implemented method for communicating sets of entities in a content catalog is disclosed. The method includes loading an entity index into memory at a microservice, where the entity index comprises entity identifiers corresponding to titles in a catalog, and where each identifier in the entity index is mapped to an ordinal number. The method also includes composing a message including a bitset to identify titles from the catalog, where a bit in the bitset is set if a position of the bit in the bitset corresponds to a respective ordinal number in the entity index associated with the one or more titles. Additionally, the method includes transmitting the message to a different microservice where a memory for the recipient microservice comprises a copy of the entity index, and where the bitset comprised within the message is decoded into entity identifiers using the entity index.

Abstract: Method includes obtaining sample records from dataset associated with user and including records associated with identifiers customers of user; executing first clustering using sample records, to obtain first set of clusters for first identifiers associated with sample records, first clustering using features associated with first identifiers; providing visualization of first set of clusters; determining whether user input for optimizing first set of clusters provided in visualization is received; when user input for optimizing first set of clusters is not received, determining first information related to first set of clusters as final result information; when user input for optimizing first set of clusters is received: executing second clustering using sample records, to obtain second set of clusters for first identifiers, second clustering using features associated with first identifiers, and determining second information related to second set of clusters as final result information; and clustering entire

Abstract: A method and system for generating data indicative of a relationship representation in a digital environment operating on a user device using a system. A controller receives a request for relationship data associated with given data item in a plurality of data items and obtains at least one other data item of the plurality of data items based on the relationship data associated with the given data item. The controller generates data indicative of the relationship representation, the data indicative of the relationship representation having variable dimensions on a display of the user device. The data includes data representing a first portion comprising a representation of at least the given data item, a second portion comprising a representation of the at least one other data item of the plurality of data items, and an indication of the relationship between the given data item and the at least one other data item of the plurality of data items.