Abstract: A computer identifies a plurality of data retrieval requests that may be serviced using a plurality of unique data chunks. The computer services the data retrieval requests by utilizing at least one of the unique data chunks. At least one of the unique data chunks is utilized for servicing two or more of the data retrieval requests. The computer determines a servicing sequence for the plurality of data retrieval requests such that the two or more of the data retrieval requests that are serviced utilizing the at least one of the unique data chunks are serviced consecutively. The computer services the plurality of data retrieval requests according to the servicing sequence.

Abstract: A processor-implemented method, system, and/or computer program product generates and utilizes a dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects. A non-contextual data object is associated with a context object to define a synthetic context-based object, where the non-contextual data object ambiguously relates to multiple subject-matters, and where the context object provides a context that identifies a specific subject-matter, from the multiple subject-matters, of the non-contextual data object. The synthetic context-based object is associated with at least one specific data store, which includes data that is associated with data contained in the non-contextual data object and the context object. A dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects is constructed for handling requests for data stores.

Abstract: Example systems and methods of extracting and processing data are described. In one implementation, a method accesses genealogy data (which includes a root node) associated with multiple data sources. The genealogy data is expanded from the root node. The method identifies data objects associated with the genealogy data and identifies a simplification rule to apply to the genealogy data. Data objects in the genealogy data that satisfy the simplification rule are identified by the method. A simplified representation of the genealogy data is generated by replacing each identified data object with a link to a predecessor data object.

Abstract: A processor-implemented method, system, and/or computer program product generates and utilizes a synthetic context-based object to locate a user-specific data store. A processor associates a non-contextual data object with a context object to define a synthetic context-based object. The synthetic context-based object is associated with at least one specific data store that contains data that is associated with data in the non-contextual data object and in the context object. The processor determines a subject-matter of interest for a specific user, and associates that determined subject-matter of interest to a specific synthetic context-based object. In response to receiving a request for data from a specific user, the request is directed to the specific synthetic context-based object that describes the subject-matter of interest for that specific user. This specific synthetic context-based object locates the appropriate data store in order to return the requested data to the specific user.

Abstract: A coupling facility is coupled to one or more other coupling facilities via one or more peer links. The coupling of the facilities enables various functions to be supported, including the duplexing of structures of the coupling facilities. Duplexing is performed on a structure basis, and thus, a coupling facility may include duplexed structures, as well as non-duplexed or simplexed structures.

Abstract: A computer-implemented method for data loss prevention may include (1) identifying a network configured with a data loss prevention system, (2) identifying a file subject to a data loss prevention assessment within the network, (3) identifying an origin of the file, (4) determining that the origin of the file is outside the network, and (5) determining that the origin of the second file does not contain sensitive information intended to be protected by the data loss prevention system. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A distributed system of data centers is configured to ensure that all data operations involving specific accounts are performed within a given time frame at only one data center. Once a data center has begun accessing data that is associated with an account, all requests to access or manipulate data for that account are redirected to that data center for a period of time. Thus, the data center becomes not only the “owner” of all data associated with the account for that period of time, but also the servicer of all requests associated with the account. The data center then asynchronously replicates changes to the data associated with the account to the other data centers. Since none of the other data centers are permitted to change the data associated with the account, conflicts in the replicated data are minimized.

Abstract: A map-reduce compatible distributed file system that consists of successive component layers that each provide the basis on which the next layer is built provides transactional read-write-update semantics with file chunk replication and huge file-create rates. Containers provide the fundamental basis for data replication, relocation, and transactional updates. A container location database allows containers to be found among all file servers, as well as defining precedence among replicas of containers to organize transactional updates of container contents. Volumes facilitate control of data placement, creation of snapshots and mirrors, and retention of a variety of control and policy information. Also addressed is the use of distributed transactions in a map-reduce system; the use of local and distributed snapshots; replication, including techniques for reconciling the divergence of replicated data after a crash; and mirroring.

Abstract: There is disclosed a system and method for integrating an image upload object with a message list. In an embodiment, the method comprises: creating an image upload object for each image to be uploaded; and displaying the image upload object in a message list such that the image upload object may be selected and opened as a message. In another embodiment, the method may further comprise associating with the image upload object at least one of a text description, a thumbnail of the image, a date, and a file link to the uploaded image. In another embodiment, an image upload object in the message list may be configured such that the image upload object may be forwarded to another user as a message, and the associated uploaded image may be accessed by the other user via the file link.

Abstract: Methods, program products, and systems implementing adaptive data transmission are disclosed. A universal data collector can act as an intermediary between a log producer and a log processor. The universal data collector can be connected to the log producer through a first, reliable network. The universal data collector can be connected to the log processor through a second, less reliable network. The universal data collector can perform a multi-phase commit of data to ensure that the log data are saved by the log processor. The universal data collector can smooth the data transmission from the universal data collector to the log processor through a network, including adaptively buffering the log data according to available network bandwidth of the network.

Abstract: A live dynamic real time method for collecting, tracking, storing, and reporting development event efforts embodied as a method for tracking Element Efforts resulting in end products, at least including art, industry, and nature products, and reporting Development Event Efforts by their virtual Points in Phasetime (PiPT) within designated Past, Present, and Future Project Development Phases. Dynamically generated Phasetime Reports display audited Element Project Efforts within a live Phasetime Matrix per their Phase of Development and PiPT. Development Events occur within Project Development Phases, whose number and kind are end product dependent. Development Events include Project Production Elements, Element Efforts, duration of the Efforts, and Efforts' PiPT. Tracked by Phasetime Project Development Event Instances, Element Efforts are reported in edited Storyboard Beats in Phasetime Macro, Micro, and Nano Views depicting the Efforts' effect on the end Product's Storyline.

Abstract: An information management system creates data structures based entirely on the content of source files, then compares these data structures to discover synergies and commonalities. In one embodiment, the system accepts a first collection of source files, and extracts text from each source file. The text is compared to tags in one or more dictionaries, which comprise hierarchical listing of tags. Tags matching the text are associated with each source file. The system then generates a virtual relational network in which each source file having matching tags is a node. Tags associated with two or more source files are links between the nodes. This virtual relational network may be compared with another virtual relational network to discover common nodes or links. Source files later added to a collection are massively linked by associating all tags from all source files with the newly added source file, and vice versa.

Abstract: Methods, apparatus and software for classifying queries. In an aspect, for each of a plurality of queries, determines a first value based on a first number of occurrences for which the query was received for unfiltered search operations, and a determines a second value based on a second number of occurrences for which the query was received for filtered search operations. The method determines a first content type value based on the first value and the second value, and for each of the plurality of queries having a first content type value that meets a first threshold, classifies the query as a first content type seeking query, the classification being indicative of likely user interest in content of the first type.

Abstract: An information providing device includes a search result information transmission means that transmits search result information, which indicates one or more pieces of information of information that has been searched for by an information search device, to a terminal device, a graph display information transmission means that transmits graph display information for displaying a graph showing a relationship between display order in which the information that has been searched for by the information search device as the search result and a value of a predetermined presentation item related to the information is displayed, and a range indication display information transmission means that transmits range indication display information for displaying predetermined range indication information at a position in the graph, the position indicating a display range being a range of the information indicated by the search result information.

Abstract: A processor-implemented method, system, and/or computer program product generate and utilize a dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects. A non-contextual data object is associated with a context object to define a synthetic context-based object, where the non-contextual data object ambiguously relates to multiple subject-matters, and where the context object provides a context that identifies a specific subject-matter, from the multiple subject-matters, of the non-contextual data object. The synthetic context-based object is then associated with at least one specific data store, which includes data that is associated with data contained in the non-contextual data object and the context object. A dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects is then constructed for handling requests for data stores.

Abstract: A structured collection of message elements comprising message elements and oriented child-parent links each connecting a message element to a parent message element is provided. Each message element comprises a message content and metadata including an author identity and a timestamp. The message contents are parsed to generate appreciative phrase marks assigned to the message elements. An appreciative phrase mark is generated in response to detecting that the parsed message content of a later message element comprises a string of characters that matches an entry within a predefined dictionary of regard-expressing phrases. The appreciative phrase mark is assigned to an earlier message element that is connected to the later message element by a sequence of child-parent links. The metadata is parsed to detect the marks and further regard indicators assigned to the message elements. Relevance scores of the message elements are computed as a function of the regard indicators.

Abstract: A computer-implemented method for efficient data storage for content management systems may include (1) identifying a content management system including a relation, wherein the implementation of the relation within the content management system supports attaching files to tuples within the relation, (2) identifying a request to retrieve a file attached to a tuple within the relation, (3) identifying a metadata store of an implementation of the tuple within the content management system, the metadata store including archive identification information identifying an archive of the tuple, (4) retrieving the file from the archive of the tuple, and (5) fulfilling the request with the retrieved file. Various other methods and systems are also disclosed.

Abstract: A method and apparatus for backing up a computer system. A backup is provided of a data stored on a first computer by the first computer generating a dump stream. The dump stream is transmitted to a second computer, the second computer uses the dump stream to maintain a file system copy of the data. One or more snapshots of the file system of the second computer are stored on a backup computer, the snapshots providing a backup of the data stored on the first computer.

Abstract: Methods and systems are described herein for managing an aggregation database. Matching rules that describe filters may be defined to determine how to match a media content record received from an external source to a stored record in the aggregation database. Fuzzy matching may be used to match attribute fields of the received record and stored records. Based on the results of the fuzzy matching, the received primary media content record may be linked to a stored record in the aggregation database.

Abstract: An annotation suggestion platform may comprise a client and a server, where the client captures a media object and sends the captured object to the server, and the server provides a list of suggested annotations for a user to associate with the captured media object. The user may then select which of the suggested metadata is to be associated or stored with the captured media. In this way, a user may more easily associate metadata with a media object, facilitating the media object's search and retrieval. The server may also provide web page links related to the captured media object. A user interface for the annotation suggestion platform is also described herein, as are optimizations including indexing and tag propagation.