Abstract: A method and device for realizing graph processing based on the MapReduce architecture is disclosed in the invention. The method includes the steps of: receiving an input file of a graph processing job; predicting a MapReduce task execution time distribution of the graph processing job using an obtained MapReduce task degree-execution time relationship distribution and a degree distribution of the graph processing job; and dividing the input file of the graph processing job into input data splits of MapReduce tasks according to the predicted MapReduce task execution time distribution of the graph processing job.

Abstract: A method for assisting query comprises acquiring a record that includes a unique identification and at least one piece of dimension information associated with the unique identification, wherein each piece of dimension information includes a sequence of attributes, each attribute being ordered in the sequence in accordance with a hierarchically progressive relation; calculating a hash value for an attribute pair comprising attributes of every two neighboring levels; and storing, in association with the hash value, the unique identification in at least one storage device. A method for querying comprises receiving a query; calculating one or more hash values; in response to the one or more hash values matching stored hash values in at least one storage device; deriving an intersection of unique identifications that are stored in association with the matched stored hash values; and returning at least one unique identification included in the intersection as a query result.

Abstract: Resource management in MapReduce architecture and architectural system. The present invention provides an apparatus for resource management in the MapReduce architecture including a memory, a processor communicatively coupled to the memory, and a module for resource management in the MapReduce architecture configured to carry out the steps of a method. The method includes the steps of: determining a ratio r of an input data amount of a Map task, an output data amount of the Map task, and an average size R of a record in Map output results; determining a memory size Memory_size that can be allocated to the Map task corresponding to a Map slot; determining an input split size appropriate for the Map task according to the determined r, R and Memory_size; and allocating an input split with the input split size in a MapReduce job to be processed to the Map task occupying the Map slot.

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 method and device for realizing graph processing based on the MapReduce architecture is disclosed in the invention. The method includes the steps of: receiving an input file of a graph processing job; predicting a MapReduce task execution time distribution of the graph processing job using an obtained MapReduce task degree-execution time relationship distribution and a degree distribution of the graph processing job; and dividing the input file of the graph processing job into input data splits of MapReduce tasks according to the predicted MapReduce task execution time distribution of the graph processing job.

Abstract: A method for resource management in MapReduce architecture. The method includes: determining a ratio r of an input data amount of a Map task and an output data amount of the Map task and an average size R of a record in Map output results; determining a memory size Memory_size that can be allocated to the Map task corresponding to a Map slot; according to the determined r, R and Memory_size, determining an input split size appropriate for the Map task; and allocating an input split with the input split size in a MapReduce job to be processed to the Map task occupying the Map slot. An apparatus for same is also provided.

Abstract: Methods and a system are provided. A method includes automatically detecting, by an attribute structural variation detector, attribute structural variations in record schemas of a database lacking schema enforcement. The automatically detecting step includes encoding, by an encoder, nodes in the record schemas based on respective updated node labels to obtain a plurality of codes. The automatically detecting step further includes clustering, by a clusterer, the plurality of codes into one of a used category and an unused category. The used category and the unused category respectively consist of any of the plurality of codes used or unused to update a child label. The automatically detecting step also includes, when an intersection set formed from the used and unused categories has at least one member, retrieving, by the attribute structural variation detector, the at least one member as a structural variation between at least two of the record schemas.

Abstract: A method and device for realizing graph processing based on the MapReduce architecture is disclosed in the invention. The method includes the steps of: receiving an input file of a graph processing job; predicting a MapReduce task execution time distribution of the graph processing job using an obtained MapReduce task degree-execution time relationship distribution and a degree distribution of the graph processing job; and dividing the input file of the graph processing job into input data splits of MapReduce tasks according to the predicted MapReduce task execution time distribution of the graph processing job.

Abstract: Resource management in MapReduce architecture and architectural system. The present invention provides an apparatus for resource management in the MapReduce architecture including a memory, a processor communicatively coupled to the memory, and a module for resource management in the MapReduce architecture configured to carry out the steps of a method. The method includes the steps of: determining a ratio r of an input data amount of a Map task, an output data amount of the Map task, and an average size R of a record in Map output results; determining a memory size Memory_size that can be allocated to the Map task corresponding to a Map slot; determining an input split size appropriate for the Map task according to the determined r, R and Memory_size; and allocating an input split with the input split size in a MapReduce job to be processed to the Map task occupying the Map slot.

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 and an apparatus for determining a location of a mobile device. The location of a mobile device is determined accurately according to information which includes call data records of the mobile device. By employing a partial ellipse integral model, two physical world factors are taken into consideration in reducing the location uncertainty in call data records. The factors include: spatiotemporal constraints of the device's movement in the physical world and the telecommunication cell area's geometry information, which increase the accuracy of determining the location of a mobile device.

Abstract: An apparatus for scheduling includes a receiving unit, configured to receive a task of a job; a configuration unit, configured to configure resource amounts for the task in at least two resource dimensions respectively, wherein each of the resource dimensions represents a resource available for configuring; and an interface unit, configured to distribute the task along with information about the resource amounts configured for the task in the resource dimensions.

Abstract: An apparatus for scheduling includes a receiving unit, configured to receive a task of a job; a configuration unit, configured to configure resource amounts for the task in at least two resource dimensions respectively, wherein each of the resource dimensions represents a resource available for configuring; and an interface unit, configured to distribute the task along with information about the resource amounts configured for the task in the resource dimensions.

Abstract: A computer program product configured to implement a method for processing database data in a distributed database system, wherein the distributed database system comprises a plurality of computing nodes communicatively coupled via computer networks, the method comprising: creating a plurality of different data replicas wherein each of the data replicas is created in the following way: sorting the database data according to at least one data attribute; generating a row key based on the at least one data attribute; and using the sorted database data with the row key as the data replica, storing different data replicas in different computing nodes; and creating an index for each of the data replicas according to its row key.

Abstract: A data assignment method for a physical machine having multiple virtual machines (VMs) running thereon includes receiving data to be processed from a scheduler for assigning job data; storing the received data to be processed into a single queue; and in response to an idle VM being among the multiple VMs, assigning data in the queue to the idle VM to be processed by the idle VM.

Abstract: A method and apparatus for processing database data in a distributed database system, wherein the distributed database system comprises a plurality of computing nodes communicatively coupled via computer networks, the method comprising: creating a plurality of different data replicas wherein each of the data replicas is created in the following way: sorting the database data according to at least one data attribute; generating a row key based on the at least one data attribute; and using the sorted database data with the row key as the data replica, storing different data replicas in different computing nodes; and creating an index for each of the data replicas according to its row key.

Abstract: A method of determining location of a user of a mobile device based on Call Detail Records (CDRs) includes determining data in CDRs related to the user; determining base stations associated with communication locations of the user and corresponding statistical data about communication frequency according to the determined data in the CDRs; and determining location of the user based on at least three determined base stations and the corresponding statistical data about communication frequency as well as physical coordinates of the three base stations.

Abstract: The present invention provides a method and apparatus of controlling subscription requests, which can be used in a publish/subscribe engine. The method includes parsing a received subscription request into a predicate expression; determining an occurrence probability of the subscription request based on occurrence probabilities of predicates in the predicate expression; estimating a message increment to be caused by the subscription request based on a message publishing rate associated with the subscription request and on the occurrence probability of the subscription request; and controlling a quality of service of messages based on the estimated message increment.

Abstract: A method of determining location of a user of a mobile device based on Call Detail Records (CDRs) includes determining data in CDRs related to the user; determining base stations associated with communication locations of the user and corresponding statistical data about communication frequency according to the determined data in the CDRs; and determining location of the user based on at least three determined base stations and the corresponding statistical data about communication frequency as well as physical coordinates of the three base stations.