Abstract: A versioned dataset is managed. An updated versioned dataset is created by applying a structured query to a specific version of multiple versions of the versioned dataset stored in the backing dataset. Data of the versions including the specific version remain unchanged. A versioned dataset catalogue is updated to include in association with the updated dataset version, the structured query and lineage indicating that the updated versioned dataset includes a successor of the specific version. An affiliation encoding associated with the updated versioned dataset indicating which data of the updated versioned dataset matches data of the specific version and which data of the updated versioned dataset is deleted relative to data of the specific version, is updated. A database view of the updated versioned dataset is generated by selecting rows and projecting columns of the backing dataset corresponding to the updated versioned dataset according to the affiliation encoding.

Abstract: A system includes a memory and a processor. The memory stores classification models that indicate a data classification to apply to data columns of one or more databases. The processor is configured to periodically access one or more databases and determine that a data table has been newly created or modified. The processor is further configured to determine whether a data column of the data table has an existing data classification, and in response to determining that the data column does not have an existing data classification, determine from the plurality of classification models a particular classification model to use for the data column. The processor is further configured to send instructions to a classification server to apply a particular data classification of the particular classification model to the data column in the classification database.

Abstract: In some implementations, a data cleaning platform may determine a respective entity key for each data record in a cleansed dataset based on a combination of fields, in each data record, that contain information that uniquely identifies an entity associated with a respective data record. The data cleaning platform may generate a delta dataset based on a set of uncleansed data records related to transactions that occurred after a time when the cleansed dataset was first generated. For example, in some implementations, each uncleansed data record in the delta dataset may be associated with a corresponding entity key based on the combination of fields. The data cleaning platform may perform a data join to update the cleansed dataset to include data records related to the transactions that occurred after the time when the cleansed dataset was first generated.

Abstract: Anomalies may be detected using a multiple machine learning model anomaly detection framework. A clustering model is trained using an unsupervised machine learning algorithm on a historical anomaly dataset. A plurality of clusters of records are determined by applying the historical anomaly dataset to the clustering model. Then it is determined whether each cluster of the plurality of clusters is an anomaly-type cluster or a normal-type cluster. The plurality of labels for the plurality of records are updated based on the particular record's cluster classification. Non-pure clusters are determined from among the plurality of clusters based on a purity threshold. A supervised machine learning model is trained for each of the non-pure clusters using the records in the given cluster and the labels for each of those records. Then, predictions of an anomaly are made using the clustering model and the supervised machine learning models.

Abstract: According to examples, an apparatus may include a memory on which is stored machine-readable instructions that may cause a processor to receive a request to upload a file to a directory and determine whether the request is a request to upload a predefined type of file to the directory. In addition, based on a determination that the request is a request to upload the predefined type of file to the directory, the processor may determine, through application of a predictive model, whether the directory is a user content directory and based on a determination that the application of the predictive model indicates that the directory is a user content directory, block the request and/or output a notification regarding the receipt of the request.

Abstract: Optimistic concurrency may be implemented for multiple writers to a database. Writes to a database from different writers may succeed unless a conflict is detected at the data store for the database. For detected conflicts, a request to resolve the conflict between writes may be submitted to a primary writer, which may determine and provide a resolution of the conflict to the conflicting writers. The data store may then be updated to commit the selected write identified by the resolution of the conflict.

Abstract: The present invention discloses a preprocessing and imputing method for structural data, comprising: step 1, querying the missing information of an original data, counting missing values, and obtaining a missing rate for the original data; step 2, based on the missing rate, performing listwise deletion on the original data, and then traversing the rows to generate corresponding dichotomous arrays, converting the arrays to the form of histogram, calculating the maximum rectangular area formed by the corresponding histogram, and then sorting all rectangular areas to obtain the maximum complete information matrix; step 3, using multiple imputation by chained equations, auto-encoders, or generative adversarial imputation networks to impute missing values on the original data.

Abstract: Embodiments for implementing intelligent ranking of sections of clinical practice guidelines by a processor. One or more clinical practice guidelines (CPGs) may be identified and analyzed. A score may be assigned to one or more sections of the CPGs according evidential data identified in one or more data sources. The one or more sections of the CPGs may be ranked according to the scoring.

Abstract: Techniques for enforcing policy on multiple levels, including context-based and/or packet-based, as well as one or more of event-based, activity-based, and behavior-based. Higher-level abstraction of policy enables IP endpoint discovery and classification for which predefined multi-level policy can be applied. Management of policy can abstract lower-level parameters in favor of a higher-level of abstraction, which enables integration with an asset management platform.

Abstract: A system includes first logic to obtain a fixed constituent data object and a variable constituent data object for each data object of a set of objects, second logic to analyze the fixed constituent data objects to allocate each fixed constituent data object to one of a plurality of fixed groups, third logic to analyze the variable constituent data objects to allocate each variable constituent data object to one of a plurality of variable groups, fourth logic to determine a net magnitude for each fixed group and for each variable group, fifth logic to determine a historical component for each variable constituent data object, sixth logic to determine a net historical magnitude for each variable group based on the historical components, and seventh logic to define at least one representative data object to represent the fixed and variable constituent data objects in each pair of fixed and variable groups having a matching common set of properties, the at least one representative data object maintaining the net

Abstract: A method for receiving an additional dataset including a plurality of additional data records; determining a record type using classifiers and an internal domain knowledge corpus; dividing the plurality of additional data records into a plurality of indexing groups; assigning the given additional data record to a match set based on completeness and similarity of natures of attributes of the given additional data record; and assigning the given additional data record to and a comparison group based on completeness and similarity of natures of attributes of the given additional data record.

Abstract: Methods and systems are provided for enhanced data loss prevention. The enhanced data loss prevention may be applied to data that is structured and/or semi-structured data, with the data comprising a plurality of records and a plurality of categories, with each record comprising a plurality of fields, each of which being associated with a different one of the plurality of categories. The enhanced data loss prevention may comprise selecting a subset of records of the data, with the selected subset comprising at least two records having between then one or more records not included in the subset. The fields of the selected subset may be scanned for sensitive information, and a likelihood to contain the sensitive information may be computed for each category based on the scanning. A subset of categories may be selected based on the computed likelihoods, and the sensitive information in the selected subset may be searched.

Abstract: A collaboration tool includes a content consistency service that monitors a content database of the collaboration tool for substantially similar and/or duplicate data items that reference substantially static information, such as telephone numbers, addresses, and the like. In response to such a determination, the content consistency service replaces all occurrences of duplicate/similar data items with references to a single main reference database.

Abstract: Performing quantum file copying is disclosed herein. In one example, upon receiving a request to copy a source quantum file comprising a plurality of source qubits, a quantum file manager accesses a quantum file registry record identifying the plurality of source qubits and a location of each of the plurality of source qubits. The quantum file manager next allocates a plurality of target qubits equal in number to the plurality of source qubits, and copies data stored by each of the source qubits into a corresponding target qubit. The quantum file manager then generates a target quantum file registry record that identifies the plurality of target qubits and their locations. In some examples, a quantum file move operation may be performed by deleting the source quantum file after the copy operation, and updating the target quantum file registry record with the same quantum file identifier as the source quantum file.

Abstract: A computing device can intercept a request to launch a requested application. The request can be intercepted by a calling process executed by the computing device. The request can include information identifying the requested application. The computing device can determine that a user interaction is required before launching the requested application by consulting a set of application policies based on the information identifying the requested application. The computing device can establish that the calling process is associated with a controlling terminal provided by an operating system in response to determining that the user interaction is required. A process session group containing processes launched within a user session can be selectively associated with the controlling terminal by the operating system. The computing device can perform the user interaction using the controlling terminal in response to establishing that the calling process is associated with the controlling terminal.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, identify and classify the various video pathways in an interactive video based on the content of these video pathways. A video comprising multiple video segments is obtained from a video library. Each video segment is directly linked to at least one other video segment and the multiple video segments comprise a beginning segment, intermediate segments (including interactive segments), and final segments. Multiple video pathways in the video are identified. For each identified video pathway, classification data is generated and each such video pathway is then stored in the video library. When the video is selected from a particular category of the video library, the video segments of a video pathway that has a classification which is the same as the classification associated with the particular category, is then displayed.

Abstract: A device may receive source code and identify, based on the source code, an abstract syntax tree representing an abstract syntactic structure of the source code. Based on the abstract syntax tree, the device may identify a closure, the closure implementing a function based on at least a portion of the abstract syntax tree. In addition, the device may perform an action based on the closure.

Abstract: A system and a method are disclosed that provides atomicity for large data writes to persistent memory of an object storage system. A segment of persistent memory is allocated to an application. The persistent memory includes non-volatile memory that is accessible in a random access, byte-addressable manner. The segment of persistent memory is associated with first and second bits of a bitmap. The first bit is set indicating that the segment of persistent memory has been allocated. Data is received from the application for storage in the segment of persistent memory, and the second bit is set indicating that data in the segment of persistent memory has been finalized and is ready for storage in a storage medium that is different from persistent memory. The atomicity of the data in persistent memory may be determined based on the first bit and the second bit being set.

Abstract: A database service that receives and manages time series data into a set of generational data tables. The database service generates a set of generational data tables configured to receive a subset of time series data. Each generational data table is created with an initial set of access parameters that facilitates the receipt of incoming time series data. Thereafter, the database service creates additional generational data tables to receive the continuous received time series data and then modifies the access parameters of the previously created data table, such as for read only rights.

Abstract: A processing device of a memory sub-system can monitor a plurality of received commands to identify a forced unit access command. The processing device can identify a metadata area of the memory device based on the forced unit access command. The processing device can also perform an action responsive to identifying a subsequent forced unit access command to the metadata area.

Abstract: Correction management techniques are provided. In one embodiment, the techniques involve determining, via a first machine learning model, a first and second data based on a respective first and second raw data obtained from a plurality of sensors, determining, based on a deviation between the first data and the second data, an inaccuracy of the first data, identifying an ambient situation corresponding to the first raw data and the second raw data, selecting, from historical raw data of the plurality of sensors, a group of raw data corresponding to the ambient situation, and correcting, via a second machine learning model, the first data based on the selected group of raw data.

Abstract: A serverless data processing architecture may be a high-velocity, cost-efficient and massively scalable log ingest application and event parser that may act as the intermediary between data collection and data analysis and may handle the receipt and parsing of incoming event data generated by collector and sensor applications. The log analytics data science portion of an ingest process may determine if arbitrarily structured log data is anomalous and/or security relevant via single event or multievent algorithms. There are numerous applications for both the single and multi-event log analytics platforms. Any application involving reliably finding anomalous pieces of semi-structured or unstructured text data may provide potential use cases. These processes may be particularly widely applicable because these processes are agnostic to and require no prior knowledge of the structure of the data.

Abstract: A network device includes memory with permanent storage. A request for information is received from a user device. In response to determining that an erasure encoded version of the requested information is not stored in the memory of the network device, the requested information is requested to be transmitted from a storage external to the network device and partially received. In response to determining that an amount of the partially received requested information does not satisfy an erasure encoding threshold, it is determined whether the erasure encoding threshold can be satisfied within a time duration. If so, the partially received requested information is erasure encoded, stored in the permanent storage, and transmitted. If not, the requested information is requested to be retransmitted from the storage external to the network device.

Abstract: One or more non-transitory computer readable media contain program instructions that, when executed, cause one or more processors to: receive first raw data including one or more first data points generated by a first object of a plurality of objects associated with one or more buildings; generate first input timeseries according to the one or more data points; access a database of interconnected smart entities, the smart entities including object entities representing each of the plurality of objects and data entities representing stored data, the smart entities being interconnected by relational objects indicating relationships between the smart entities; identify a first object entity representing the first object from a first identifier in the first input timeseries; identify a first data entity from a first relational object indicating a relationship between the first object entity and the first data entity; and store the first input timeseries in the first data entity.

Abstract: A database management system includes a cluster of nodes over which a columnar database has been sharded into shards to which the nodes are subscribed. Source nodes of the cluster store up-to-date metadata objects for the shards, and target nodes of the cluster storing out-of-date metadata objects for the shards. A coordinator node initiates a parallel batch metadata transfer update process in which the out-of-date metadata objects at the target nodes are updated in parallel from the up-to-date metadata objects at the source nodes. The coordinator node can determine pairs of source nodes and target nodes; the source node and the target node of each pair respectively store an up-to-date metadata object and an out-of-date metadata object for a same shard.

Abstract: Techniques are disclosed for backup and restore in a distributed database utilizing consistent database snapshots. In particular, a distributed database system configured in accordance with an embodiment of the present disclosure includes a plurality of interconnected database nodes that collectively define a database having no single point of failure and that can be “viewed” by a SQL client as a single, logical database. In the course of executing such transactions, the distributed database system enables clients to declare snapshots that, when the transaction is committed, cause the distributed database system to logically freeze a consistent and complete copy of the state of the database at the point in time the transaction completed. Such snapshots enable clients to execute so-called “point-in-time” queries against those past states to return a result set that is essentially a reconstructed version of the database “as of” a particular point in time.

Abstract: A method and an apparatus for repairing a file system directory tree are provided. Parent directory path information is added to metadata of each directory. When metadata of a directory tree is corrupted, the metadata is traversed, and N subdirectory trees are constructed according to subdirectory path information in the metadata of each directory. A corrupted directory is determined according to parent directory path information of a sub-root directory of a subdirectory tree. Metadata of a higher-level directory of a level R that is adjacent to the sub-root directory is reconstructed according to the parent directory path information of the sub-root directory of the subdirectory tree. The N subdirectory trees are constructed into one directory tree according to the reconstructed metadata of the higher-level directory of the level R that is adjacent to the sub-root directory.

Abstract: A method includes, for a write operation regarding a set of encoded data slices, determining, by a computing device, whether the write operation is a first instance of writing the set. The method further includes, when the write operation is a first instance, sending, by the computing device, a set of write requests to the storage units, wherein the write requests includes the set of encoded data slices, slice names, and an indication of the first instance. The method further includes, in response to a write request of the set of write requests, determining, by a storage unit, whether a previous version of an encoded data slice is currently stored. The method further includes, when the previous version is currently stored sending, by the storage unit, a conflict message to the computing device. The method further includes updating, by the computing device, the write requests based on the conflict message.

Abstract: In particular embodiments, a Personal Data Deletion System is configured to: (1) at least partially automatically identify and delete personal data that an entity is required to erase under one or more of the conditions discussed above; and (2) perform one or more data tests after the deletion to confirm that the system has, in fact, deleted any personal data associated with the data subject. The system may, for example, be configured to test to ensure the data has been deleted by: (1) submitting a unique token of data through a form to a system; (2) in response to passage of an expected data retention time, test the system by calling into the system after the passage of the data retention time to search for the unique token.

Abstract: Systems and methods for storing encoded data slices in a dispersed storage network (DSN) involve generating a set of write slice requests relating to the encoded data slices, outputting the set of write slice requests to dispersed storage units of the DSN, receiving write slice responses and determining whether to retry storing the set of encoded data slices based on one or more of the write slice responses. Determining whether to retry storing the set of encoded data slices may involve determining whether less than a write threshold number of favorable responses were received, for example in a time period, and/or whether an unfavorable response was received. Determining whether to retry may also be based on receiving a slow or non-response. For purposes of retrying, the systems and methods may also determine whether to modify the write slice requests, for example by modifying a revision number.

Abstract: A method includes a first computing device sending a first set of write requests regarding a set of encoded data slices to storage units. The method further includes a second computing device sending a second set of write requests regarding the set of encoded data slices to the storage units. The method further includes the first computing device receiving a first set of write response ballots from the storage units. The method further includes the second computing device receiving a second set of write response ballots from the storage units. When the first set of write response ballots is favorable, the method further includes the first computing device issuing a first set of finalize commands to the storage units. When the second set of write response ballots is favorable, the method further includes the second computing device issuing a second set of finalize commands to the storage units.

Abstract: Apparatuses, systems and methods are disclosed herein that generally relate to distributed network storage and filesystems, such as Ceph, Hadoop®, or other big data storage environments utilizing resources and/or storage that may be remotely located across a communication link such as a network. More particularly, disclosed are techniques for one or more machines or devices to scrub data on remote resources and/or storage without requiring all or substantially all of the remote data to be read across the communication link in order to scrub it. Some disclosed embodiments discuss having validation be relatively local to storage(s) being scrubbed, and some embodiments discuss only providing to the one or more machines scrubbing data selected results of the relatively local scrubbing over the communication link.

Abstract: Some embodiments provide a non-transitory machine-readable medium stores a program. The program receives a query for data that includes a join operation. The program further generates a plurality of candidate query execution plans based on the query, each candidate query execution plan comprising a set of reduction operations. The program also determines a plurality of execution costs associated with the plurality of sets of reduction operations in the plurality of candidate query execution plans. The program further selects a query execution plan from the plurality of candidate query execution plans based on the plurality of execution costs. The program also executes the query execution plan to generate a set of query results for the query.

Abstract: Computing systems may use queries to retrieve information from databases. Described herein are systems and methods for searching for one or more queries from a database storing a large amount of queries. In some implementations, the system enables a user to enter search terms, and the system retrieves one or more queries based on a comparison of the search terms and metadata associated with the queries. The system may rank the retrieved queries based on an analysis of ranking factors such as a number of times the query has been selected for processing by other users.

Abstract: Mechanisms and methods for sharing database content between tenants in a multi-tenant database system are provided. The ability to temporarily store metadata related to the shared data for subsequent use optimizes the data transfer process for multiple data transfers. In an embodiment, the metadata is stored for a pre-determined period of time and fetched again after the period elapses if required. The metadata may be erased from temporary storage if an administrator updates the shared data.

Abstract: The present invention relates to a method for displaying a graphical interface having display areas including a reference area, wherein each file of a file set is displayed in the form of an icon in one of the display areas, and each file of the file set contains a unique identifier identifying the file, and processing a command for inserting into the file set a selected pre-existing file which does not belong to the file set, the processing of the insertion command including the steps of: generating a new file in the file set, from the content of the selected pre-existing file, generating a unique identifier identifying the new file, and inserting into the new file the generated unique identifier and a reference link generated from a file identifier corresponding to each icon located in the reference area.

Abstract: A computing device includes an interface configured to interface and communicate with a dispersed storage network (DSN), a memory that stores operational instructions, and a processing module operably coupled to the interface and memory such that the processing module, when operable within the computing device based on the operational instructions, is configured to perform various operations. A computing device receives a data access request for an encoded data slice (EDS) associated with a data object. The computing device compares a slice name of the data access request with slice names stored within RAM. When the data access request slice name compares unfavorably with those stored slice names, the computing device transmits an empty data access response that includes no EDS to the other computing device without needing to access a hard disk drive (HDD) that stores EDSs. Alternatively, the computing device transmits a data access response that includes the EDS.

Abstract: Aspects of the subject technology relate to mixing an aggregated content data structure into a content stream. A first plurality of aggregated content data structures is be received, each comprising a group of content items for display in a content stream of a user and being associated with a respective score. A first aggregated content data structure may be selected from among the first plurality of aggregated content data structures based on the scores and predetermined type target percentages associated with the user. The first aggregated content data structure may be mixed into a content stream associated with a user, and the content stream provided for display.

Abstract: A social networking system allows its users to provide metadata for association with objects maintained by the social networking system. Some of the metadata may be presented to other users along with the object. To prevent association of inaccurate metadata with an object, the social networking system determines a confidence value associated with a user who provided metadata for association with an object. The confidence value indicates of the accuracy of metadata provided by the user relative to information associated with the object. If the user has previously provided less than a threshold amount of metadata to associate with objects, the confidence score is determined using characteristics associated with the user by the social networking system. The metadata provided by the user is stored but not associated with the object if the user's confidence value is less than a threshold value.

Abstract: A wireless communication device executes first and second virtual transmission nodes in a wireless communication network. The wireless communication device includes a database for storing identification information of the first and second virtual transmission nodes, and a centralized service unit for accessing the database. When a handover from the first virtual transmission node to the second virtual transmission node occurs, the first virtual transmission node requests the centralized service unit to check whether the second virtual transmission node is co-located in the wireless communication device, and forwards buffered data packets to the second virtual transmission node internally without IPsec processing.

Abstract: A virtual library of content is provided that makes it appear that the content is all of a supported file type for a particular client accessing the virtual library. When the virtual library is displayed at a client device, the content appears as if it is available in the appropriate format for the client device irrespective of the content's actual format. Content selected from a content library interface for the virtual library is provided in the appropriate format for the client device through the automatic invoking of a content access service. The content access service can determine the appropriate consumption format for the client device and convert to a supported file format any content that is in a non-supported format before providing the content to the client device.

Abstract: A method begins by a processing module of a dispersed storage network (DSN) sending a set of low retention priority write requests to storage units of the DSN, where each low retention priority write request includes a low retention priority query. For each storage unit of the storage units that receives a low retention priority write request of the set of low retention priority write requests, the method continues with the processing module determining a low retention priority response regarding availability for storing low retention priority data based on current storage of low priority data objects and available memory for storing the low retention priority data. The method continues with the processing module sending the low retention priority response. When a threshold number of favorable low retention priority responses have been received, the method continues at the processing module facilitating storage of a low retention priority data object.

Abstract: A method begins by a dispersed storage (DS) processing module receiving access requests, processing data set requests and issuing access responses. The method continues by monitoring slice access requests to generate access records by either storing time stamped access records indicating identities of slices requested by a timestamp or by commonality of slice names. The method continues with determining a correlation of two or more slice access based on the access records when a correlation is greater than a correlation threshold and identifying two or more slices for co-location. The method continues when the two or more slices are not co-located by selecting one or more of the two or more slices for migration to a common memory device.

Abstract: A system and methodology provide for annotating videos with entities and associated probabilities of existence of the entities within video frames. A computer-implemented method selects an entity from a plurality of entities identifying characteristics of a video item, where the video item has associated metadata. The computer-implemented method receives probabilities of existence of the entity in video frames of the video item, and selects a video frame determined to comprise the entity responsive to determining the video frame having a probability of existence of the entity greater than zero. The computer-implemented method determines a scaling factor for the probability of existence of the entity using the metadata of the video item, and determines an adjusted probability of existence of the entity by using the scaling factor to adjust the probability of existence of the entity. The computer-implemented method labels the video frame with the adjusted probability of existence.

Abstract: Techniques for optimizing disk access are disclosed. In one particular exemplary embodiment, the techniques may be realized as a system for optimizing disk access comprising a module for reading files in a filesystem, the files comprising one or more file fragments, a module for determining a relative location of the one or more file fragments on a disk, a module for sorting an index of the one or more file fragments on the disk in one or more fragment tables according to the relative location of the one or more file fragments on the disk, a module for reading the one or more file fragments from the disk, a module for assembling one or more of the files from the one or more file fragments.

Abstract: A method for maintaining consistency among metadata elements (MDEs) of a logical object, includes: configuring a child MDE to include a correlation value uniquely indicative of a parent MDE. The parent MDE includes a reference to the child MDE; determining an order of performing at least two write operations included in a transaction related to the logical object: at least one write operation with respect to the parent MDE and at least one write operation with respect to the child MDE; the determined order assures that the child MDE is indicated as existing and includes the first correlation value, as long as the parent MDE exists; upon a first access to the parent MDE, subsequent to the transaction, verifying consistency between the parent MDE and the child MDE, using the first correlation value; and deleting the parent MDE if the verifying of consistency is unsuccessful.

Abstract: A computer identifies and ranks URL hyperlinks to possible pirated media content by searching a web page from a first website for one or more indicator keywords, wherein a strength of an indicator keyword is related to a likelihood of pirated media content. Responsive to locating a plurality of instances of the one or more indicator keywords, identifying a plurality of hyperlinks respectively associated with one or more of the plurality of instances. Weighting, the identified plurality of hyperlinks based on at least one of: a strength of associated indicator keywords, number of associated indicator keywords, number of times each hyperlink was identified, and date of posting. Ranking the plurality of hyperlinks according to weight indicating a relative likelihood that respective hyperlinks point to pirated media content in a ranked list.

Abstract: A method, a system and a computer program product for resolving conflicts between data for database integration. Data is integrated from first and second data sources to produce integrated data, and the presence of a conflict is determined between data from the first data source and data from the second data source, where one or more sets of prioritized policies for resolving conflicts is associated with data of the first and second data sources. A policy is selected from the set of prioritized policies associated with the conflicted data, where the selected policy is appropriate to resolve the conflict and includes the greatest priority. The selected policy is applied to resolve the conflict and to produce a resulting data value for the integrated data.

Abstract: A system and method verifies and restores the consistency of inode to pathname mappings. In a first embodiment, an off-line verification procedure is modified to verify and correct the primary name inode to pathname mapping information within inodes of a file system. In a second embodiment, an on-line file system verification process is modified to verify inode to pathname mapping information upon the loading of each inode within the file system.

Abstract: Repairing a link based on an issue includes associating at least one metadata segment with a link, identifying, in a resource repository, at least one resource that matches the at least one metadata segment, determining if there is an issue between the link and the at least one resource, and repairing the link based on the issue between the link and at least one resource.