Abstract: A system and method provide for identifying coreference from serialized data coming from different services. The method includes generating a tree structure from serialized data. The serialized data includes responses to queries from the different services. The responses each identify a hierarchical relationship between a respective set of objects. Nodes of the tree structure each have a name corresponding to a respective one of the objects. The tree structure is traversed in a breadth first manner and, for each node in the tree structure, a respective pairwise similarity is computed with each of the other nodes of the tree structure. The computed pairwise similarity is compared with a threshold to identify co-referring nodes that refer to a same entity. The threshold is a function of a depth of the node in the tree structure.

Abstract: A column set server adapts to data use patterns by data consumers by modifying how a table produced by a data producer is partitioned into separate column sets to reduce the waste incurred in accessing the data by multiple consumers of the data. For example, the column set server adjusts a column set distribution when a new consumer process is added, when one is retired, or when relative data set size ratios change.

Abstract: A log record from a host machine node includes terms. Frequency of occurrence of the terms across a stream of log records is determined. Based on the frequency satisfying a threshold, a Bloom filter vector is selected from among a plurality of Bloom filter vectors based on the frequency, the Bloom filter vector is updated based on the terms, and an identifier for the log record is stored with an association to the Bloom filter vector. In contrast, based on the frequency of occurrence not satisfying the defined frequency range, a type identifier is identified based on the terms, a Bloom filter vector is selected from among the plurality of Bloom filter vectors based on the type identifier, the Bloom filter vector is updated based on the terms, and an identifier for the log record is stored with an association to the Bloom filter vector.

Abstract: Parallel logical replication involves multiple apply threads running on a destination database server applying, in parallel, changes made by source transactions, where the changes of a single source transaction may be applied in parallel by multiple apply threads. An apply transaction for a source transaction may be committed by an apply thread independently of the commitment of any other apply transaction of the source transaction, that is, without coordinating the committing of another apply transaction executed by another apply thread for the source transaction. A configuration language is used to configure parallel logical replication. The language facilitates the configuration of various aspects of parallel logical replication, including the number of apply threads, partitioning schemes for the apply threads for partitioning change records between the apply threads, and various other aspects of parallel logical replication.

Abstract: Improved access management techniques for storage networks are described. In one embodiment, for example, an apparatus may comprise a processor circuit and an access control component for execution by the processor circuit to select a set of hosts for which to enable access to a logical storage volume of a network storage cluster, select, from among a plurality of nodes of the network storage cluster, a set of nodes via which to enable access to the logical storage volume by the set of hosts, and generate a storage configuration object comprising a parameter identifying the set of nodes. Other embodiments are described and claimed.

Abstract: Monitoring data can be sent, received, stored, and accessed with zero setup. Customers can send monitoring data to be stored without the customers having to perform any setup ahead-of-time, such as arbitrary lists of key-value pairs. Customers can perform zero setup pivot queries using stored monitoring data. For example, users can perform pivot queries using any available stored information, such as available metric types and dimensions, without any setup needed ahead-of-time.

Abstract: The present disclosure relates to a mobile terminal, and more particularly, to a mobile terminal for updating data files stored in a memory on a database and a control method thereof, and a mobile terminal for updating data files on a database according to the media transfer protocol (MTP) may include a memory configured to store the data files, and a controller configured to divide the data files stored in the memory into a first group composed of files to which the priority order of update is given and a second group composed of files other than those of the first group, and sequentially update the first group and the second group on the database to implement an application using data files contained in the first.

Abstract: The present disclosure describes methods, systems, and computer program products for inheriting metadata concepts from product resources into a semantic model. One computer-implemented method includes defining a plurality of core data foundations, defining a derived data foundation by linking the plurality core data foundations to the derived data foundation, defining a plurality of core business layers, defining a derived business layer by linking the plurality of core business layers to the derived business layer, and compiling, by a computer, the derived business layer with the derived business layer as a universe.

Abstract: A method and system are provided for capturing and applying changes to a data structure made by one or more processing nodes. The method includes providing a data structure including one or more elements (200-205), maintaining a linked record of changes (200a-200c, 201a-201c, 205a-205b) to each element (200-205) made by a processing node. A new value of an element (200-205) is linked to the previous value. A record (250) of the sequence of changes to the elements (200-205) is also maintained. In one embodiment, the linked record of changes (200a-200c, 201a-201c, 205a-205b) is a push down stack. The data structure is defined including indirections (210-215) pointing to most recent values of an element (200-205), which in turn points to the previous value of the element (200-205), forming a linked record to the initial value of the element.

Abstract: A cost-effective, durable and scalable archival data storage system is provided herein that allow customers to store, retrieve and delete archival data objects, among other operations. For data storage, in an embodiment, the system stores data in a transient data store and provides a data object identifier may be used by subsequent requests. For data retrieval, in an embodiment, the system creates a job corresponding to the data retrieval and provides a job identifier associated with the created job. Once the job is executed, data retrieved is provided in a transient data store to enable customer download. In various embodiments, jobs associated with storage, retrieval and deletion are scheduled and executed using various optimization techniques such as load balancing, batch processed and partitioning. Data is redundantly encoded and stored in self-describing storage entities increasing reliability while reducing storage costs. Data integrity is ensured by integrity checks along data paths.

Abstract: A computer implemented method includes the steps of establishing a plurality of storage control sessions, wherein each storage control session associates at least one primary storage controller and at least one secondary storage controller with a predetermined path through a data transport network that interconnects the primary and secondary storage controllers; identifying storage control sessions that have data available to be transferred from primary storage controllers to secondary storage controllers; accumulating available data for each session and determining transfer time through the network for each data element to estimate prospective bandwidth utilization; and determining, for a predetermined time interval, whether transferring the available data would fully occupy available bandwidth of the data transport network for the predetermined time interval.

Abstract: A cost-effective, durable and scalable archival data storage system is provided herein that allow customers to store, retrieve and delete archival data objects, among other operations. For data storage, in an embodiment, the system stores data in a transient data store and provides a data object identifier may be used by subsequent requests. For data retrieval, in an embodiment, the system creates a job corresponding to the data retrieval and provides a job identifier associated with the created job. Once the job is executed, data retrieved is provided in a transient data store to enable customer download. In various embodiments, jobs associated with storage, retrieval and deletion are scheduled and executed using various optimization techniques such as load balancing, batch processed and partitioning. Data is redundantly encoded and stored in self-describing storage entities increasing reliability while reducing storage costs. Data integrity is ensured by integrity checks along data paths.

Abstract: There is provided a technique capable of recommending more useful contents to a recommendation target user who is the current work user. A group of recommendation candidate contents is obtained from a similar work case similar to work by the recommendation target user. A relationship between an arbitrary user and the recommendation candidate contents is detected. Recommendation candidate contents having the detected relationship with the recommendation target user are recommended by priority from among the group of recommendation candidate contents.

Abstract: A method for managing tags in a tag cloud may include receiving a tag for an object and comparing the tag to existing tags for the object. The comparing may include determining if there is a relationship between the tag and any of the existing tags. The method may also include adding the tag to the tag cloud in response to there being no relationship between the tag and any of the existing tags. The method may additionally include selecting one tag of the existing tags in response to the tag and the one tag being related tags. The method may further include presenting the related tags in the tag cloud. Presenting the related tags in the tag cloud may include at least one of modifying the one tag in the tag cloud, indicating the tags are related, and combining the related tags into a single tag.

Abstract: A method for managing tags in a tag cloud may include receiving a tag for an object and comparing the tag to existing tags for the object. The comparing may include determining if there is a relationship between the tag and any of the existing tags. The method may also include adding the tag to the tag cloud in response to there being no relationship between the tag and any of the existing tags. The method may additionally include selecting one tag of the existing tags in response to the tag and the one tag being related tags. The method may further include presenting the related tags in the tag cloud. Presenting the related tags in the tag cloud may include at least one of modifying the one tag in the tag cloud, indicating the tags are related, and combining the related tags into a single tag.

Abstract: A method for automatically updating a filter logic expression representing a Boolean filter comprising a plurality of search conditions is disclosed. The method includes receiving a first indication to remove a first search condition from a condition list comprising search conditions. Each search condition is associated with an identifier and the first search condition is associated with a first identifier, and the search conditions are listed in sequential order according to the associated identifier. In response to receiving the first indication, a second search condition associated with a second identifier that sequentially follows the first identifier is identified, and the second search condition is reassociated with a third identifier that immediately precedes the second identifier. A filter logic expression comprising a plurality of identifiers and operators and representing a Boolean filter is then modified by automatically replacing any reference to the second identifier with the third identifier.

Abstract: A computer system with read/write access to storage devices creates a snapshot of a data volume at a point in time while continuing to accept access requests to the mirrored data volume by copying before making changes to the base data volume. Multiple snapshots may be made of the same data volume at different points in time. Only data that is not stored in a previous snapshot volume or in the base data volume are stored in the most recent snapshot volume.

Abstract: An information processing device includes an access requesting unit, an access type determination unit, a notified party information acquisition unit, and a notifying unit. The information processing device is able to access a notified party information storage unit that stores information of a notified party in association with location information of particular data stored in a database server. The access type determination unit determines whether or not an access request issued by the access requesting unit is an access request relating to updating. If the issued access request is an access request relating to updating, the notified party information acquisition unit acquires information of a notified party corresponding to location information of data to be updated by the access request, from the notified party information storage unit. The notifying unit gives notice to a notified party specified in the acquired information of the notified party.

Abstract: A searching system for searching contents that were broadcast, the searching system having an inputting unit, a searching unit, and a terminal unit is disclosed, wherein the inputting unit comprises a first storing means for storing information representing at least time at which contents were broadcast corresponding to a predetermined operation, and a first communicating means for transmitting the information representing time stored in the storing means to an external unit, wherein the searching unit comprises a second storing means for correlatively storing information representing contents and broadcast time thereof, and a searching means for searching information representing the contents stored in the second storing means corresponding to the information representing time, and wherein the terminal unit comprises a second communicating means for receiving the information representing time transmitted from the inputting unit through the first communicating means, a third communicating means for transmitti

Abstract: A method of operating a database node of a distributed database is provided. The distributed database includes a plurality of database nodes each storing a set of data. A latency that occurs when the database node contacts a further database node in order to respond to one or more data requests that relate to a subset of data that is one of stored and intended to stored at the further database node is measured. An average latency value for communicating with each of the database nodes in the distributed database is calculated. Notifications reporting the average latency values to data distribution optimization functions in the distributed database are sent. A latency measure is reported to a further node of the distributed database.