Abstract: Technical solutions are described to implement a scalable write ahead log using a distributed file system. A general aspect includes a method for providing consistency among metadata replicas and content in an enterprise content management cluster. The method includes recording a transaction log entry in response to receiving a content modification request, the transaction log entry including a version identifier set to a first version value. The method also includes updating the transaction log entry to a second version value in response to successfully modifying content and one of a plurality of metadata replicas containing metadata corresponding to the request. The method also includes updating the transaction log entry to a third version value in response to successfully modifying each of the metadata replicas. The present document further describes examples of other aspects such as methods, computer products.

Abstract: Technical solutions are described to implement a scalable write ahead log using a distributed file system. A general aspect includes a method for providing consistency among metadata replicas and content in an enterprise content management cluster. The method includes recording a transaction log entry in response to receiving a content modification request, the transaction log entry including a version identifier set to a first version value. The method also includes updating the transaction log entry to a second version value in response to successfully modifying content and one of a plurality of metadata replicas containing metadata corresponding to the request. The method also includes updating the transaction log entry to a third version value in response to successfully modifying each of the metadata replicas. The present document further describes examples of other aspects such as methods, computer products.

Abstract: A mechanism is provided for identifying a usage for data in a data structure. A set of configuration files associated with a set of services are analyzed to identify at least one class associate with the data in the data structure thereby forming a data structure-to-class mapping. Source code associated with the set of services is analyzed to identify a set of services used by at least one class in the data structure-to-class mapping thereby forming a service-to-class mapping. A set of specification files associated with the set of services are analyzed to identify a set of uses associated with at least one service in the service-to-class mapping thereby forming a use-to-service mapping. An identification of usage information of the data structure is generated using the data structure-to-class mapping, the service-to-class mapping, and the use-to-service mapping.

Abstract: Methods, computer systems and computer program products for service packages porting are provided. Aspects include a computer implemented method for a service package porting is provided. One or more processors provision a component of a first layer based on a plurality of component descriptions and build the service package on the first layer. Hence the one or more processors collect first log information that relates to build failures of the service package. According to another embodiment of the present invention, the method further comprises determine whether a build failure is related to the first layer based on the first log information and remove the component of the first layer if it is determined that the build failure is related to the first layer.

Abstract: Embodiments of the present invention provide methods, computer systems and computer program products for service packages porting. In one embodiment of the present invention, a computer implemented method for a service package porting is provided. One or more processors provision a component of a first layer based on a plurality of component descriptions and build the service package on the first layer. Hence the one or more processors collect first log information that relates to build failures of the service package. According to another embodiment of the present invention, the method further comprises determine whether a build failure is related to the first layer based on the first log information and remove the component of the first layer if it is determined that the build failure is related to the first layer.

Abstract: Technical solutions are described to implement a scalable write ahead log using a distributed file system. A general aspect includes a method for providing consistency among metadata replicas and content in an enterprise content management cluster. The method includes recording a transaction log entry in response to receiving a content modification request, the transaction log entry including a version identifier set to a first version value. The method also includes updating the transaction log entry to a second version value in response to successfully modifying content and one of a plurality of metadata replicas containing metadata corresponding to the request. The method also includes updating the transaction log entry to a third version value in response to successfully modifying each of the metadata replicas. The present document further describes examples of other aspects such as methods, computer products.

Abstract: Technical solutions are described to implement a scalable write ahead log using a distributed file system. A general aspect includes a method for providing consistency among metadata replicas and content in an enterprise content management cluster. The method includes recording a transaction log entry in response to receiving a content modification request, the transaction log entry including a version identifier set to a first version value. The method also includes updating the transaction log entry to a second version value in response to successfully modifying content and one of a plurality of metadata replicas containing metadata corresponding to the request. The method also includes updating the transaction log entry to a third version value in response to successfully modifying each of the metadata replicas. The present document further describes examples of other aspects such as methods, computer products.

Abstract: In one embodiment, a computer-implemented method includes receiving a plurality of external records from one or more data sources. A plurality of sets of top k dominant words for the plurality of external records are determined by a computer processor. The plurality of sets of top k dominant words include a set of top k dominant words for each external record of the plurality of external records, and k is an integer. A bucketing algorithm is performed on the plurality of external records while excluding from consideration words within each external record that are not within the set of top k dominant words for the external record.

Abstract: In one embodiment, a computer-implemented method includes receiving a plurality of external records from one or more data sources. A plurality of sets of top k dominant words for the plurality of external records are determined by a computer processor. The plurality of sets of top k dominant words include a set of top k dominant words for each external record of the plurality of external records, and k is an integer. A bucketing algorithm is performed on the plurality of external records while excluding from consideration words within each external record that are not within the set of top k dominant words for the external record.

Abstract: A mechanism is provided for identifying a usage for data in a data structure. A set of configuration files associated with a set of services are analyzed to identify at least one class associate with the data in the data structure thereby forming a data structure-to-class mapping. Source code associated with the set of services is analyzed to identify a set of services used by at least one class in the data structure-to-class mapping thereby forming a service-to-class mapping. A set of specification files associated with the set of services are analyzed to identify a set of uses associated with at least one service in the service-to-class mapping thereby forming a use-to-service mapping. An identification of usage information of the data structure is generated using the data structure-to-class mapping, the service-to-class mapping, and the use-to-service mapping.

Abstract: A method includes receiving a request to print a current web page. A set of records that represent web pages that are similar to the current web page are identified from a print log that includes at least one record, each record including an indication of a web page and indicating one or more objects that had been previously selected for printing from that web page. Based on the objects that are indicated by the identified set of records, one or more objects of the current web page are selected to be printed on a printer.

Abstract: Examples of the present disclosure may include methods, systems, and computer readable media with executable instructions. An example method for determining document structure similarity can include segmenting path sequences (206) of Document Object Model (DOM) trees (120, 462) from a number of web pages (202) into B components (561). Path signals (210) corresponding to the path sequences (206) are determined based on a count of the occurrences of particular paths in the Bthe component (571), and unique path signals (210) are transformed into discrete wavelet signals (214)(572). The discrete wavelet signals (214) are analyzed at multiple DOM tree resolution levels (573).

Abstract: Methods and systems of generation of histograms for strings are described. In one implementation, a prefix tree having nodes representing prefixes of the strings is generated. For the prefix tree, deploy weights are assigned to the nodes based on lengths of the prefixes represented by sub-tree nodes rooted at the nodes and frequencies of the strings whose prefixes are represented by the sub-tree nodes. Each of the deploy weights of one node is indicative of a maximum weight preserved upon filling the buckets with at least one prefix represented by the sub-tree nodes rooted at that one node. A predefined number of Top-prefixes are determined for filling up the predefined number of buckets. The Top-prefixes are determined based on maximizing a total weight preserved by the prefixes in the buckets and over a maximum number of strings. A histogram is generated based on the deploy weights associated with the Top-prefixes.

Abstract: A method for obtaining an approximate answer for a query on a database is provided. A query is converted into a set of sub queries with a canonical form. An approximate answer is generated for each of said sub queries, and approximate answers for the sub queries are combined to obtain an approximate answer for said query.

Abstract: A method, system, and non-transitory computer readable medium for generating a hint for a query are disclosed. A model which represents relevance between attributes in a dataset is constructed based on historical data associated with the dataset. According to said model, statistics about the attributes are computed. And in response to a query input by a user, a hint is generated for the query based on the model and statistics.

Abstract: A method for detecting a valuable section within a web page is disclosed. The method comprises: receiving an input webpage; and detecting a valuable section in the input webpage based on a user log of a reference webpage associated with the input webpage, wherein said user log comprises a path of a section within the reference webpage that was accessed by a user in a DOM-tree that represents said reference webpage.

Abstract: Examples of the present disclosure may include methods, systems, and computer readable media with executable instructions. An example method for determining document structure similarity can include segmenting path sequences (206) of Document Object Model (DOM) trees (120, 462) from a number of web pages (202) into B components (561). Path signals (210) corresponding to the path sequences (206) are determined based on a count of the occurrences of particular paths in the Bth component (571), and unique path signals (210) are transformed into discrete wavelet signals (214)(572). The discrete wavelet signals (214) are analyzed at multiple DOM tree resolution levels (573).

Abstract: Disclosed is a method of automatically extracting data from a target web page, comprising selecting (302) data in a source web page; determining (304) the respective DOM (document object model) trees of the source and target web page, and identifying the one or more nodes comprising the selected data in the source web page DOM tree; determining (306) matching paths in the respective DOM trees; for selected data in a node of an unmatched branch of the source web page DOM tree, identifying (308) the nearest matched path in the source web page; identifying (310) the unmatched branch nearest to the corresponding matched path in the target web page; determining (312) if said identified unmatched branch in the target web page DOM tree comprises a target node matching the selected data node; and if so: extracting (322) data from the target node if the mismatch between the respective unmatched branches does not exceed a predefined threshold.

Abstract: An exemplary embodiment of the present may generate a DOM-tree and generate a signal based on the DOM-tree and a node list. The signal may be analyzed and nodes may be selected within the signal to form a periodic wave. Repeat patterns may be detected using the periodic wave and the nodes.

Abstract: An exemplary embodiment of the present may generate a DOM-tree and generate a signal based on the DOM-tree and a node list. The signal may be analyzed and nodes may be selected within the signal to form a periodic wave. Repeat patterns may be detected using the periodic wave and the nodes.