Abstract: A computer-implemented method, system, and computer program product for managing history metadata of a file. The method may include accessing a first file with delta information. The method may also include determining a portion of the first file to be moved. The method may also include reviewing the delta information of the first file for changes to the portion in the delta information. The method may also include, in response to reviewing the delta information, generating a portion delta history for the portion. The method may also include inserting the portion in a position in a second file, where the portion is inserted with the portion delta history. The method may also include generating new delta information for the second file, where the new delta information includes the portion delta history of the inserted portion.

Abstract: A file access request is received from an application. One or more file types for the file access request are identified, and one or more file hosts supporting files of the identified one or more file types are also identified. A user interface is displayed, the user interface including a hosted area. Within the hosted area, at least one of the one or more file hosts displays a portion of the user interface identifying one or more files of at least one file host that can be selected for retrieval, or one or more locations that can be selected to which the one or more files are saved.

Abstract: Described herein are systems and methods archive file check-in/out in an enterprise content management system. The systems and methods described can allow user of ECM systems to check-in an archive file and, upon check-in, have the ECM application automatically explode the content(s) of the archive file to represent the contents in a hierarchical structure with folder(s) and file(s). As well, in legacy ECM systems, the systems and methods can explode already uploaded archive files to represent them in a hierarchical structure with folder(s) and file(s) within the application itself. In addition, the systems and methods can provide for checkout of an archive file from an ECM system. Upon checkout, the ECM system can extract the content item(s) inside a pre-selected destination directory on a client machine.

Abstract: Information source agent systems and methods for distributed content storage and management using content signatures that use file identicality properties are provided. A data management system is provided that includes a content engine for managing the storage of file content, a content signature generator that generates a unique content signature for a file processed by the content engine, a content signature comparator that compares content signatures and a content signature repository that stores content signatures. Information source agents are provided that include content signature generators and content signature comparators. Methods are provided for the efficient management of files using content signatures that take advantage of file identicality properties. Content signature application modules and registries exist within information source clients and centralized servers to support the content signature methods.

Abstract: In an embodiment, a UE detects a request to capture a screenshot of image data being output on a display screen, obtains application-specific metadata that is configured to facilitate recreation of characteristics of a session state of an application that is contributing at least a portion of the image data being output on the display screen when the request is detected. The UE selectively captures the screenshot of the image data being output on the display screen in response to the request, and stores the obtained application-specific metadata. The same or different UE may obtain some or all of the application-specific metadata (and optionally the screenshot, if captured), and recreates some or all of the characteristics using the same or different application.

Abstract: A method, computer system, and computer program product for collaborative document relations modeling are provided. The embodiment may include parsing, by a processor, a document corpus utilizing topic modeling and distance analysis techniques. The embodiment may also include deriving a collaborative document relational model to combine the results of the parsing into a matrix. The embodiment may further include grouping content of the parsed document corpus through document clustering utilizing the generated collaborative document relational model.

Abstract: Disclosed are systems, apparatuses and techniques for replicating data between different cloud computing platforms. Examples include storage replicator components operable in different cloud computing platforms. The first storage replicator component may identify the second cloud computing platform as a location to copy a data file in response to an event related to the data file stored in a first cloud computing platform. The first storage replicator component may request a copy of the data file via an application programming interface of the first cloud computing platform. The attributes of the copy of the data file which involve modification to conform to data management conventions of the second cloud computing platform may be determined and modified to comply with conventions of the second cloud computing platform. The modified copy of the data file may be forwarded to the second cloud computing platform for storage.

Abstract: A method for data storage includes assigning multiple different portions of a given object, which is stored in non-volatile storage, for access by multiple respective software modules running on one or more processors. Storage operations are performed by the software modules in the portions of the given object. Respective local values, which are indicative of most recent times the storage operations were performed in the given object by the respective software modules, are updated by the software modules. A global value is updated for the given object, by consolidating updates of the local values performed by the software modules.

Abstract: Methods and systems for file locking are described herein. An on-premise file share may store files that are accessible to both a local on-premise client and a remote off-premise client. The off-premise file share may request to check-out one of the files. In response, one of multiple nodes may obtain for the file a file handle with exclusive write access. File locking information may be stored at the file share that indicates the node that holds the file handle and that indicates the file is in a locked state whereby other remote off-premise clients or local on-premise clients are prevented from editing the file.

Abstract: A system can apply file placement rules to dynamically place files and directories within file system views backed by objects in an object storage system. After detection of an update to a first file system view that causes an update of an object in a storage grid, an object manager begins evaluation of file placement rules against metadata of the object. For each file placement rule that is triggered, the object manager determines identifies gateways that export the first file system view. The object manager then instructs the gateways to update their representations of the first file system view. The disclosed embodiments may be able to scale to managing hundreds of billions of files spanning thousands of file system views, especially in the presence of disconnected operation.

Abstract: A device creates virtual storage bucket to abstract the data and the access from another device, and to secure the access using the IAM and the data using encryption and/or Mojette transform in order to generate encrypted/encoded data and transmits the data to another device. The other device saves the encrypted/encoded data for later transmitting the data to the same first device or another for decryption/decoding, securing governance, compliance, and porting of clients together with associated data in metadata driven, policy enabled, multi cloud environments.

Abstract: The present application discloses a resharding method and system for a distributed storage system, and the method comprises: when performing resharding for the bucket, accumulating a statistical value in each of pieces of shard statistical information into a header field; deleting each of pieces of shard statistical information, and creating, according to the number of shards after resharding, several pieces of new shard statistical information, wherein, the number of the pieces of the new shard statistical information is equivalent to the number of shards after resharding, and the several pieces of new shard statistical information have one-to-one correspondence with the shards after resharding; and grouping operation logs in an operation log set according to the number of shards after resharding, such that the number of groups of the operation logs is consistent with the number of shards after resharding.

Abstract: Methods, computer program products, and systems are presented. The methods include, for instance: receiving a request for a lock on a page from a virtual database amongst two or more virtual databases, the virtual database including a number of containers respectively corresponding to the same number of database components of the virtual database. A copy of the page is refreshed with a latest copy of the page in an overall cache prior to granting the lock based on ascertaining that the page is not locked by any other virtual database. The virtual database is granted with the lock and have an exclusive access to the page.

Abstract: Disclosed are systems, apparatus, methods, and computer readable media for suppressing network feed activities using an information feed in an on-demand database service environment. In one embodiment, a message is received, including data indicative of a user action. An entity associated with the user action is identified, where the entity is a type of record stored in a database. A type of the entity is identified. It is determined whether the entity type is a prohibited entity type. When the entity type is not a prohibited entity type, the message data is saved to one or more tables in the database. The tables are configured to store feed items of an information feed capable of being displayed on a device. When the entity type is a prohibited entity type, the saving of the message data, to the one or more tables in the database configured to store the feed items, is prohibited.

Abstract: A baseline run of a workload and a target run of the workload are compared to identify whether there is a performance regression in the target run, wherein the target run implements a feature that is not implemented in the baseline run. In response to identifying the performance regression, the target run is executed to identify whether the performance regression still exists. The performance regression is flagged as a false positive in response to identifying that the performance regression no longer exists when the target run is executed.

Abstract: Aspects of the present disclosure include a system comprising a machine-readable storage medium storing at least one program and computer-implemented methods for efficiently storing graph data. Consistent with some embodiments, the method includes using the graph data to construct a tree topology bitmap that represents a topology of a portion of the nodes in a tree data structure representing the graph data. The method further includes creating an archive bit array for the tree data structure that includes elements populated with a binary indicator of whether a corresponding leaf node includes a known entry. The method further includes creating a leaf values array comprising a known value for each leaf node in the tree data structure with a known entry. The method further includes storing, in a memory storage device, the tree topology, the archive bit array, and the leaf values array in association with an initial timestamp.

Abstract: A centralized database identifier repository may identify databases using a unique identifier, or key tag, for each database. Each identified database may include data relating to one or more specific data elements. The repository may include a variety of data elements. Each data element may be associated with one or more database keys. The repository may be a repository of reference pointers. The repository may facilitate data viewing and data retrieval. A requestor may search for a data element using the centralized repository. The repository may retrieve data relating to a specific data element, from all databases identified by unique identifiers, that include data relating to the data element. The databases' unique identifiers may be encrypted tokens.

Abstract: The subject technology determines whether a table is sufficiently clustered. The subject technology in response to determining the table is not sufficiently clustered, selects one or more micro-partitions of the table to be reclustered. The subject technology constructs a data structure for the table. The subject technology extracts minimum and maximum endpoints for each micro-partition in the data structure. The subject technology sorts each of one or more peaks in the data structure based on height. The subject technology sorts overlapping micro-partitions based on width. The subject technology selects based on which micro-partitions are within the tallest peaks of the one or more peaks and further based on which of the overlapping micro-partitions have the widest widths.

Abstract: A system for false positive detection includes an interface and a processor. The interface is configured to receive a transaction data. The processor is configured to determine whether the transaction data is a statistical outlier; in response to the transaction data being the statistical outlier: query database data to determine whether the transaction data is a false positive; and in response to the transaction data being the false positive, indicate that the transaction data is normal.

Abstract: The subject technology executes a change on an existing micro-partition of a table of a database, the executing of the change comprising generating a new micro-partition that embodies the change. The subject technology receives a request for a delta for the table between a first timestamp and a second timestamp. The subject technology queries at least one change tracking column to determine the delta between the first timestamp and the second timestamp, the delta including information indicating at least one database operation that was performed to at least one row of a set of rows of the table, without including information as to intermediate changes made to at least one row of the set of rows of the table between the first timestamp and the second timestamp, that facilitates a reduction in storage of historical versions of the set of rows of the table.

Abstract: Disclosed herein is a system and method for interoperability of blockchains thereby allowing use of smart contracts across blockchains in real time and in a secured manner. A plurality of blockchains are connected to each other and allow use of smart contracts written on them by other connected blockchains without the need of rewriting and/or downloading the smart contract on other blockchain. The disclosed system and methods use a distributed file system storage for secured processing of information flowing from one blockchain to other connected blockchain. Further, each connected blockchain is associated with distinct private and public key in order to encrypt and decrypt the data flowing across blockchains.

Abstract: A blockchain management apparatus includes a block receiving part that receives a block including a block header that includes a hash value for reference information selected from a predetermined range in a ledger based on a predetermined rule established between blockchain management apparatuses; a block verification part that selects the reference information from the predetermined range in the ledger based on the predetermined rule and determines whether or not the hash value for the reference information included in the block has been generated based on the reference information, to verify that the block has been correctly generated; a consensus formation part that, if the block verification part verifies that the block has been correctly generated, forms a consensus with other blockchain management apparatuses to write the block to the ledger; and a ledger storage part that stores the block for which the consensus has been formed.

Abstract: Embodiments provide methods, and systems for facilitating message format discovery in online transaction processing. A method includes receiving, by a server system associated with a payment network, a message comprising a payment service request via a communication channel from an application in a message format of a plurality of message formats. The server system includes a rule engine and a rule data dictionary. The method includes applying, by the server system, one or more rules fetched by the rule engine from the rule data dictionary until the message format is identified. At least one rule of the one or more rules is applied based on matching one or more characters of the message with a pattern corresponding to the at least one rule. Upon successful identification of the message format, the method includes facilitating, by the server system, processing of the payment service request.

Abstract: The present disclosure discloses a method, a related apparatus and storage medium for distributed transaction processing. The method includes: obtaining, by a distributed transaction processing device, a distributed transaction processing request; writing, by the distributed transaction processing device, a commit log corresponding to the distributed transaction processing request to a second object database set in the target database cluster, the commit log comprising a commit indication result; obtaining, by the distributed transaction processing device after the distributed transaction processing device resumes distributed transaction processing, the commit log from the second object database set; and performing, by the distributed transaction processing device when the commit indication result in the commit log instructs to commit the processing operation on the account data in the N accounts, the processing operation on the account data in the N accounts.

Abstract: A data processing apparatus, a data processing method, and a data processing program process input data to be input into a processing module. The processing module is associated with first metadata indicating a condition of input data. The input data is associated with second metadata indicating an attribute of the input data. The data processing apparatus includes an obtaining unit and a preprocessing unit. The obtaining unit obtains a result of determination for preprocessing of the input data performed based on the first metadata and the second metadata. The preprocessing unit preprocesses the input data based on the determination result.

Abstract: The subject technology obtains, at a database system, an ingest request to ingest one or more files into a table of a database. The subject technology, after obtaining the ingest request and prior to the ingesting of the one or more files, persists the one or more files in a file queue that corresponds to the table. The subject technology assigns the one or more files to one or more execution nodes to be ingested into the table. The subject technology operates an ingest puller to poll the file queue. The subject technology ingests, by the one or more execution nodes, the one or more files into one or more micro-partitions of the table via one or more pipes.

Abstract: The subject technology at a data system, an ingest request to ingest one or more files into a table. The subject technology, after obtaining the ingest request and prior to the ingesting of the one or more files, persists the one or more files in a first file queue that corresponds to the table, the first file queue further corresponding to a client account, and the data system further comprising a second file queue that corresponds to both a second client account and a second table. The subject technology ingests, by one or more execution nodes, the one or more files into one or more micro-partitions of the table, each of the one or more micro-partitions comprising contiguous units of storage of a storage device.

Abstract: A system for engaging in a recommendation-dialog with a user includes a memory having instructions therein. The system also includes at least one processor in communication with the memory. The at least one processor is configured to execute the instructions to access a recommendation domain, use a structure-mapping technique to generate a data structure based on source material from the recommendation domain, use semantic analyses to generate an ontology based on the data structure and the recommendation domain, generate recommendation-dialog queries based on properties of the data structure, generate a dialog tree based on the ontology and the recommendation-dialog queries, receive a recommendation dialog input, navigate the dialog tree to determine a recommendation, and provide the recommendation to the user.

Abstract: Disclosed are systems, methods, and non-transitory computer-readable media for expanding search queries. A search system executes a search query based on a search term and the geographic indicator. In response to determining that a number of the search results is less than a threshold number, the search system determines, based on historical search logs from other users in the first geographic region, a likelihood value indicating a likelihood that the other users in the first geographic region expanded the geographic region of their search queries. The search system compares the likelihood value to a threshold likelihood value, and determines, based on the comparison, that the likelihood value meets or exceeds the threshold likelihood value. The search system then executes an expanded search based on the search term and an expanded geographic indicator that encompasses the first geographic region.

Abstract: In some embodiments, a method detects a cancelation of a query for an application that is running The query is being performed on a database system. The method processes the cancellation to determine one or more threads associated with the query and sends a signal to the one or more threads that are associated with the process to suspend the one or more threads. One or more signal handlers for the one or more threads are called and an exception is thrown by the one or more signal handlers to cancel the query. The exception causes the query to be canceled.

Abstract: In embodiments of the present disclosure, there is provided an assertion-based question answering manner. After a question and the related passage are obtained, an assertion answer to the question is determined based on content of the passage, and the assertion answer has a predetermined structure and represents a complete semantic meaning. Then, the assertion answer to the question may be outputted to the user. In the embodiments of the present disclosure, the question and the relevant passage are used as input, and a semi-structured assertion answer is output. The assertion answer according to embodiments of the present disclosure can provide richer semantic content than the traditional short answer, and provide a more concise expression than the traditional long answer, thereby ensuring accuracy of the answer while improving the user experience.

Abstract: Systems and methods for displaying a view of a virtual file system through a file viewer of a computer operating system are described herein. In an embodiment, an application receives a request to return data to display in a view of a file repository from a service of a computer operating system which is configured to cause displaying of the view of the file repository. The application accesses stored configuration information which identifies one or more particular queries which are mapped to a particular folder of the file repository. The application transmits the one or more particular queries to a database management system and receives structured data that satisfies the one or more particular queries in response.

Abstract: A differentially private security system communicatively coupled to a database storing restricted data receives a database query from a client. The database query includes a relation indicative of data to perform the query upon and at least one privacy parameter indicative of a level of differential privacy with which to perform the query. The differentially private security system determines a noise type for the query. The differentially private security system determines a representation of probabilistic privacy loss for the query based on the determined noise type. The differentially private security system determines a privacy spend for the query using the generated representation of probabilistic privacy loss. The differentially private security system determines whether the determined privacy spend exceeds a privacy budget associated with the client.

Abstract: A unified access layer (UAL) and scalable query engine receive queries from various interfaces and executes the queries with respect to non-heterogeneous data management and analytic computing platforms that are sources of record for data they store. Query performance is monitored and used to generate a query performance model. The query performance model may be used to generate alternatives for queries of users or groups of users or to generate policies for achieving a target performance. Performance may be improved by monitoring queries and retrieving catalog data for databases referenced and generating a recommendation model according to them. Duplicative or overlapping sources may be identified based on the monitoring and transformations to improve accuracy and security may be suggested. A recommendation model may be generated based on analysis of queries received through the UAL. Transformations may be performed according to the recommendation model in order to improve performance.

Abstract: A system and method of performing a cross-datasource query to provide a cross-datasource query result. A composite shape comprises a composite shape query and a plurality of shape identifiers identifying a plurality of shapes. Each of the plurality of shapes comprises a datasource identifier identifying a datasource and a shape query defining a query to be performed on the datasource. The composite shape is used to perform the composite shape query across the datasources identified in the plurality of shapes to provide the cross-datasource query result.

Abstract: A unified access layer (UAL) and scalable query engine receive queries from various interfaces and executes the queries with respect to non-heterogeneous data management and analytic computing platforms that are sources of record for data they store. Query performance is monitored and used to generate a query performance model. The query performance model may be used to generate alternatives for queries of users or groups of users or to generate policies for achieving a target performance. Performance may be improved by monitoring queries and retrieving catalog data for databases referenced and generating a recommendation model according to them. Duplicative or overlapping sources may be identified based on the monitoring and transformations to improve accuracy and security may be suggested. A recommendation model may be generated based on analysis of queries received through the UAL. Transformations may be performed according to the recommendation model in order to improve performance.

Abstract: There is a need for solutions that perform cross-asset data modeling in a multi-asset database. This need can be addressed by, for example, receiving a request for an execution plan for a merger of a first data entity and a second data entity in the database; determining, based at least in part on a traversal graph of the database, possible paths for the execution plan, wherein each possible path is associated with an ordered combination of path relationships in the database; determining a cost for each possible path based at least in part on at least one of a strength measure associated with each path relationship for the possible path, a traversal cost measure for each path relationship for the possible path, and an experiential usage measure for the possible path; and selecting a recommended path based at least in part on each cost for a possible path.

Abstract: A unified access layer (UAL) and scalable query engine receive queries from various interfaces and executes the queries with respect to non-heterogeneous data management and analytic computing platforms that are sources of record for data they store. Query performance is monitored and used to generate a query performance model. The query performance model may be used to generate alternatives for queries of users or groups of users or to generate policies for achieving a target performance. Performance may be improved by monitoring queries and retrieving catalog data for databases referenced and generating a recommendation model according to them. Duplicative or overlapping sources may be identified based on the monitoring and transformations to improve accuracy and security may be suggested. A recommendation model may be generated based on analysis of queries received through the UAL. Transformations may be performed according to the recommendation model in order to improve performance.

Abstract: Candidate data record prioritization for match processing includes identifying candidate records for use in match processing to determine records that match to an incoming record. The candidates are grouped into buckets according to bucket roles, with each bucket correlating to a bucket role, and with each bucket role being defined by a unique record attribute set. The method obtains an effectiveness score for each of the bucket roles. The scores are measures of effectiveness of the bucket roles in identifying candidates that match to incoming data records. The method establishes an order of priority in which to process the candidates by prioritizing the buckets into an order based on the effectiveness scores for the bucket roles. The process then commences match processing to process the candidates in the established order of priority where the match processing processes candidates of a higher priority bucket before processing candidates of lower priority buckets.

Abstract: Systems, methods, and devices relating to the facilitation of interactions between consumer users and supplier users. Consumer users with a need for specialized expertise enter a query on their computing device. This query is communicated to a server which searches its database for supplier users who have specialized expertise which may address the consumer user's query. A list of such supplier users is compiled by the server and this list is sent to the consumer user. The consumer user then selects one or more of these supplier users and the server activates one or more communications modules which allows the consumer user to interact with the selected supplier user. The interaction between the consumer user and the supplier user is timed by the server and the length of the interaction is stored and reported to both users.

Abstract: Method and apparatus for stress management in a searchable data service. The searchable data service may provide a searchable index to a backend data store, and an interface to build and query the searchable index, that enables client applications to search for and retrieve locators for stored entities in the backend data store. Embodiments of the searchable data service may implement a distributed stress management mechanism that may provide functionality including, but not limited to, the automated monitoring of critical resources, analysis of resource usage, and decisions on and performance of actions to keep resource usage within comfort zones. In one embodiment, in response to usage of a particular resource being detected as out of the comfort zone on a node, an action may be performed to transfer at least part of the resource usage for the local resource to another node that provides a similar resource.

Abstract: A search circuit capable of efficiently executing a search process while suppressing an increase in memory chips is provided. The search circuit includes a first memory, a second memory and a processor which executes a binary search with the first and the second memory. The plurality of entry data are divided into a two search stage groups according to a reading order position of a binary search and are stored in the first and the second memory for each groups. The second memory includes a plurality of memory banks provided according to the number of search stages of the corresponding group. The memory banks each stores entry data for each search stages.

Abstract: A unified access layer (UAL) and scalable query engine receive queries from various interfaces and executes the queries with respect to non-heterogeneous data management and analytic computing platforms that are sources of record for data they store. Query performance is monitored and used to generate a query performance model. The query performance model may be used to generate alternatives for queries of users or groups of users or to generate policies for achieving a target performance. Performance may be improved by monitoring queries and retrieving catalog data for databases referenced and generating a recommendation model according to them. Duplicative or overlapping sources may be identified based on the monitoring and transformations to improve accuracy and security may be suggested. A recommendation model may be generated based on analysis of queries received through the UAL. Transformations may be performed according to the recommendation model in order to improve performance.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for obtaining cluster data, determining a portion of the search queries within the given query cluster that trigger a local search feature, assigning to the intent flag a value indicating that the given cluster is high local intent cluster when the portion of the search queries within the given query cluster that trigger the local search feature meets the local intent threshold, assigning to the intent flag a value indicating that the given cluster is a low local intent cluster when the portion of the search queries within the given query cluster that trigger the local search feature fails to meet the local intent threshold, and modifying a content item including adding a local content feature to the content item when the search query is determined to be included in the high local intent cluster.

Abstract: According to an embodiment of the present invention, a system provides data stream transform. The system comprises: an input configured to receive a data stream, the data stream comprising a serialized data structure comprising segments and segment identifiers; a parser configured to identify a segment identifier associated with the data stream and further configured to generate a set of operators based on the data stream, wherein each operator is programmed to perform a predetermined action on the data stream; and a display interface configured to present the set of operators as a set of visual icons responsive to a user's input within the display interface and further configured to present a plurality of distinct node types.

Abstract: Anomalous systems are detected in a set of systems that are monitored by technical equipment to provide a dataset of variables in respect of each system, representing parameters of the system. The datasets are partitioned into at least two partitions by variable. In respect of each partition, a distance is derived in respect of each system in a dimensionally reduced ordination space. Systems are detected as being anomalous on the basis of a joint distance quantity in respect of each system derived from the distances derived in respect of each partition.

Abstract: The present application relates to a search ranking method, a search ranking apparatus, an electronic device and a storage medium. In an embodiment of the method, acquiring search keywords and determining a plurality of initial search results that match with the plurality of keywords; extracting text similarity, update time dimension, and objective importance of contacts according to the initial search results; acquiring a weight of the text similarity, a weight of the update time dimension, and a weight of the objective importance of the contacts; performing a fusion calculation on each of the initial search results to obtain a comprehensive weight of each of the initial search results; and ranking the plurality of initial search results according to the comprehensive weights. The method enables the user to quickly find relevant information, simplifies the operation, and improves the searching efficiency.

Abstract: Technique field: This innovative method is: Using generalized computer system (also including but not limited to, fixed or mobile intelligent computing multi-function device terminals) and its network system as the physical carrier, using computer technology and network technology, according to pre-designed logical rule calculations/operations and the diverse conditions, elements/factors, attributes, to automatically match and couple, to complete the core functions and purpose. To solve the technical problem is that: Current technical methods, are often used for information displaying, manual participation in viewing/browsing and so on, to achieve low efficiency network behavior. The key points of technical solutions for solving problems: Construct at least two or more queues or data pools, use automatic matching and coupling technical methods, and automatically generate matching-coupling results, which are automatically sent to various submitters and parties who may concern.

Abstract: A system determines a name probability based on a first name dataset frequency of a first name value stored by a first name field in a personal record and a last name dataset frequency of a last name value stored by a last name field in a personal record. The system determines at least one other probability based on another dataset frequency of another value stored by another field in the personal record and an additional dataset frequency of an additional value stored by an additional field in the personal record. The system determines a combined probability based on the name probability and the at least one other probability. The system increments a count of identifiable personal records for each personal record that has a corresponding combined probability that satisfies an identifiability threshold. The system outputs a message based on the count of identifiable personal records.

Abstract: In accordance with an embodiment, described herein is a system and method for providing support for extensibility and customization in an analytic applications environment. An extract, transform, load (ETL) or other data pipeline or process provided by the analytic applications environment, can operate in accordance with an analytic applications schema and/or a customer schema associated with a customer (tenant), to receive data from the customer's enterprise software application or data environment, for loading into a data warehouse instance. A semantic layer enables the use of custom semantic extensions to extend a semantic model, and provide custom content at a presentation layer. Extension wizards or development environments can guide users in using the custom semantic extensions to extend or customize the semantic model, through a definition of branches and steps, followed by promotion of the extended or customized semantic model to a production environment.