Abstract: Embodiments relate to systems and methods for the distribution of data in a lattice-based database via placeholder nodes. A data store can store data in a lattice-based database or other three-dimensional hierarchical format. Higher-level data, such as yearly profit, may be desired to be spread from parent nodes at different levels or points in the lattice structure to lower nodes or locations, such as quarters. Parent nodes can be associated with a set of programmatic placeholder nodes. A spreading tool can insert child nodes representing quarters, months, or other insertion point(s) represented or encoded by a set of placeholder nodes, dividing, combining, or otherwise distributing quantities appropriately. In aspects, data can be spread from multiple parents and/or multiple target child nodes, at once. In aspects, the spreading tool can access or host sequence logic to ensure data spreading in an order that takes dependencies, formatting, or other factors into account.

Abstract: Apparatus, method and computer products are provided for remote network access and management of mobile terminals. The mobile terminal executes a web server application that allows remote network devices to access the mobile terminal. In addition, the mobile device executes a content engine that provides the ability to access databases, services and devices associated with the mobile terminal. The invention provides greater flexibility in accessing and managing the data stored on the mobile terminal and provides for remote control of the services and devices associated with the mobile terminal.

Abstract: A system and method for configuring a storage network utilizing one or more storage appliances to utilize the multi-block based protocol nature of the storage appliances. By configuring the storage network, data served by the storage appliance may be accessed by a plurality of protocols simultaneously. Illustratively, a virtual disk (vdisk) may be access by clients using the FCP protocol over a FC network while other clients access the vdisk using the iSCSI protocol over a TCP/IP network.

Abstract: In general, the subject matter described in this disclosure can be embodied in methods, systems, and program products. A system includes a first data center, a second data center, and a third data center. The multiple data centers are configured to replicate a logical collection of data that comprises multiple logical partitions of data. The system comprises a first writing subsystem that is designated to write updates to a copy of a first logical partition of data that is stored by the first data center. The system comprises a second writing subsystem that is designated to write updates to a copy of a second logical partition of data that is stored by the second data center. The system comprises a third writing subsystem that is designated to write updates to a copy of a third logical partition of data that is stored by the third data center.

Abstract: A server stores files and manages the synchronization of those files across client devices in accordance with user preferences that may be embodied in change management rules. A first version of a file has been designated to be synchronized across at least a first client and a second client. The first client accesses the first version of the file and creates a first modified version of the file, and the second client accesses the first version of the file and creates a second modified version of the file. When the first and second clients attempt to re-synchronize their respective modified versions of the file, the server determines a preferred version from among the available modified versions of the file according to change management rules. Then, the preferred version is stored by the server and is subsequently served for synchronization across the client devices.

Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for data replication in a database system environment are described. In an aspect, the data replication includes grouping, in-memory, a plurality of transactions to be replicated as a single transaction from a source database system to a target database system. A plurality of net row changes is compiled for the plurality of transactions, and data inconsistency detection and resolution within a command application order are performed. Further included is bulk application of the plurality of net row changes to the target database system.

Abstract: Generally described, the present invention is directed to a network operating system that provides more effective ways of leveraging the connectivity of computer networks. In one embodiment, an XML virtual machine is implemented that accepts high-level application code written in an XML programming language as input. Functionality is provided to interpret or translate the application code written in an XML programming language into code that is suitable for execution across computer platforms. Moreover, the XML virtual machine supports the Model View Controller (MVC) design paradigm that facilitates true data abstraction from applications to a common data model. Multi-instance applications, with each instance potentially supporting multiple views, may be created and executed.

Abstract: In one aspect, a method to generate a point-in-time (PIT) snapshot of deduplication-based volume includes generating a virtual access data structure, generating a preliminary snapshot of the volume and modifying the preliminary snapshot to point to a block according to the virtual access data structure to generate the PIT snapshot of the deduplication-based volume.

Abstract: The punch command may be replicated in a replication environment including a production site and a replication site. The solution includes implementing a punch command to free storage received at a replication site in a replication environment by applying the punch command to storage at the replication site and writing data being freed from the storage at the replication site to an undo stream of a journal at the replication site. If the punch command is not supported, a command to write zeros may be used. Further, an unpunch command is provided for properly undoing a punch command and storing data written to the volume before the punch command freed the storage. Additionally, large punch commands may be split into a plurality to smaller punch commands for efficient journal management. Additionally, volume space may be reclaimed by writing a punch command to the journal instead of zeros.

Abstract: A method for managing uploads of duplicate files. The method includes receiving a request from a user or an uploader client to upload a first file to an online album, and determining whether the first file is a duplicate of a second file included in the online album based on one or more attributes shared between the first file and the second file. Based on upload preferences associated with the user, the first file is caused to be not uploaded to the online album, the first file is caused to be uploaded as a new file to the online album, or the first file is caused to be uploaded as a replacement for the second file.

Abstract: Database systems and methods that implement a data aggregation framework are provided. The framework can be configured to optimize aggregate operations over non-relational distributed databases, including, for example, data access, data retrieval, data writes, indexing, etc. Various embodiments are configured to aggregate multiple operations and/or commands, where the results (e.g., database documents and computations) captured from the distributed database are transformed as they pass through an aggregation operation. The aggregation operation can be defined as a pipeline which enables the results from a first operation to be redirected into the input of a subsequent operation, which output can be redirected into further subsequent operations. Computations may also be executed at each stage of the pipeline, where each result at each stage can be evaluated by the computation to return a result. Execution of the pipeline can be optimized based on data dependencies and re-ordering of the pipeline operations.

Abstract: A repartitioning optimizer identifies alternative repartitioning strategies and selects optimal ones, accounting for network transfer utilization and partition sizes in addition to traditional metrics. If prior partitioning was hash-based, the repartitioning optimizer can determine whether a hash-based repartitioning can result in not every computing device providing data to every other computing device. If prior partitioning was range-based, the repartitioning optimizer can determine whether a range-based repartitioning can generate similarly sized output partitions while aligning input and output partition boundaries, increasing the number of computing devices that do not provide data to every other computing device. Individual computing devices, as they are performing a repartitioning, assign a repartitioning index to each individual data element, which represents the computing device to which such a data element is destined.

Abstract: Techniques for replicating data to a database include determining a change to at least one database value in a database table on a source repository; updating, based on the change to the at least one database value, a snapshot value associated with the change to the at least one database value stored in a log table; incrementing a commit value associated with the snapshot value stored in a commit table, the commit table comprising a plurality of commit values associated with a plurality of corresponding snapshot values; initiating replication of the database from the source repository to a target repository; determining a maximum commit value of the plurality of commit values; and replicating the database value in the database table from the source repository to the target repository based on the commit value associated with the snapshot value being less than or equal to the maximum commit value.

Abstract: The subject matter disclosed herein provides methods and apparatus, including computer program products, for providing software updates. In one aspect there is provided a method. The method may include receiving a command for execution at a database. Moreover, a determination may be made as to whether the received command is one of a set of extended commands. The set of extended commands includes lock read, lock write, migrate, copy, and log changes. The received command is executed at the database. Related systems, apparatus, methods, and/or articles are also described.

Abstract: A distributed, cloud-based storage system provides a reliable, deduplicated, scalable and high performance backup service to heterogeneous clients that connect to it via a communications network. The distributed cloud-based storage system guarantees consistent and reliable data storage while using structured storage that lacks ACID compliance. Consistency and reliability are guaranteed using a system that includes: 1) back references from shared objects to referring objects, 2) safe orders of operation for object deletion and creation, 3) and simultaneous access to shared resources through sub-resources.

Abstract: Systems and methods programmatically determine the status of blocks in a virtual machine image. In certain embodiments, the system can determine which blocks are active, deleted, zero, or a combination of the same. In certain embodiments, the system advantageously determines block status without scanning all the blocks in a virtual machine image. Instead, the system can access metadata in a file system of a virtual machine image to determine the block status. When backing up the virtual machine image, the system can back up active blocks while skipping inactive blocks, including deleted and/or zero blocks. As a result, the system can take less time to back up a virtual machine image, and the resulting backup file or files can consume less storage space.

Abstract: Embodiments of a state tracking technique may enable real-time tracking of jobs in a computer cluster. A state object is provided that allows a job to be implemented as a distributable database. The job may be tracked while the job is processing via the state tracking technique. Using the state tracking technique, the cluster may track the location of the state objects for jobs in a database. However, only location information for the state object, and not the job metadata itself, is stored in the central database. This reduces the amount of data stored in the central database, distributing the metadata across the cluster, thus improving database performance and reducing bandwidth requirements on the network. Information about a job may be acquired via a query to the central database to find the location of the respective state object, and then a query to the state object (or to a proxy).

Abstract: Methods and systems for maintaining the internal consistency of a fact repository are described. Accessed objects are checked for attribute-value pairs that have links to other objects. For any link to an object, the name of the linked-to object is inserted into the attribute-value pair having the link. The accessed objects are filtered to remove attribute-value pairs meeting predefined criteria, possibly resulting in null objects. Links to null objects are identified and removed.

Abstract: A method and apparatus are provided for displaying help content corresponding to the occurrence of an event occurring within a computer. An alert help data file is periodically downloaded at a client computer. When a program alert occurs within a client computer, the alert help data file is searched to identify help content corresponding to the particular occurrence of the alert. An alert identifier may be uniquely assigned to each alert to assist in locating the corresponding help content. Moreover, an assert tag and a function result value may also be utilized to define and locate particular help content. Once located, the help content may be displayed to a user.

Abstract: Methods, systems, and computer-readable storage media for evaluating a validity of a status and action management (SAM) schema. In some implementations, actions include receiving the SAM schema, the SAM schema being stored as a computer-readable document in memory, providing one or more goals, each goal representing an intention of the SAM schema, the one or more goals being provided in a computer-readable document stored in memory and including one or more primary goals and one or more recovery goals that each express an intention of a process underlying the SAM schema, and processing the one or more goals using a computer-executable model checking tool for evaluating the validity of the SAM schema.

Abstract: Methods, systems, and computer-readable storage media for evaluating a validity of an extended status and action management (SAM) schema. In some implementations, actions include receiving the extended SAM schema, the extended SAM schema being stored as a computer-readable document in memory and being an extension of a core SAM schema, providing one or more goals, each goal representing an intention of the core SAM schema, the one or more goals being provided in a computer-readable document stored in memory and comprising one or more primary goals that each express an intention of a process underlying the core SAM schema, and processing the one or more goals using a computer-executable model checking tool for evaluating the validity of the extended SAM schema.

Abstract: A computer-implemented method de-identifies data collected for patients. In at least one embodiment, the method comprises the sequential, non-sequential and/or sequence independent steps of providing information representative of at least one patient, at least one medical characteristic associated with at least one patient thereto, and a geographic area of the at least one patient, and providing at least one organizational structure for organizing medical characteristics. The method also includes associating the at least one organizational structure with at least one geographical area and at least one medical characteristic, and aggregating, in the at least one organizational structure, said information by medical characteristic and the at least one geographic area therein. Various alternative embodiments are additionally disclosed.

Abstract: A global information management system (GIMS) includes a collection of standards and methods that allow information management on a global scale. A GIMS computer network includes a central registration database (CRD) and one or more GIMS computer systems connected over a network. Each GIMS computer system includes a relational database having a set of standardized tables. The CRD may provide a GIMS network-unique system ID to each GIMS computer system. Each GIMS computer system uses the GIMS network-unique system ID as part of a primary key for each record generated by and stored in the set of standardized tables of the GIMS database. The GIMS enables global database normalization through the globally unique identification of database records.

Abstract: Apparatus, methods and media for correcting a defective check processing datum. The apparatus may include, and the methods and media may involve, a receiver that is configured to receive from memory a first transaction record. The transaction record may include Magnetic Ink Character Recognition (MICR) line data. The MICR line data may be electronically read from a check. The transaction record may include non-MICR data. The non-MICR data may be electronically read from the check. The apparatus may include, and the methods and media may involve, a processor that is configured to identify a defective datum among the MICR line data. The processor may identify a portion of the non-MICR data that corresponds to the defective datum. The processor may store in memory a second transaction record. The second transaction record may include corrected data that includes an element that is derived from the identified portion of the non-MICR data.

Abstract: A method utilizes cluster-awareness to effectively support a live partition mobility (LPM) event and provide recovery from node failure within a Virtual Input/Output (I/O) Server (VIOS) cluster. An LPM utility creates a monitoring thread on a first VIOS on initiation of a corresponding LPM event. The monitoring thread tracks a status of an LPM and records status information in the mobility table of a database. The LPM utility creates other monitoring threads on other VIOSes running on the (same) source server. If the first VIOS VIOS sustains one of multiple failures, the LPM utility provides notification to other functioning nodes/VIOSes. The LPM utility enables a functioning monitoring thread to update the LPM status. In particular, a last monitoring thread may perform cleanup/update operations within the database based on an indication that there are nodes on the first server that are in failed state.

Abstract: Methods and apparatuses for efficiently migrating deduplicated data are provided. In one example, a data management system includes a data storage volume, a memory including machine executable instructions, and a computer processor. The data storage volume includes data objects and free storage space. The computer processor executes the instructions to perform deduplication of the data objects and determine migration efficiency metrics for groups of the data objects. Determining the migration efficiency metrics includes determining, for each group, a relationship between the free storage space that will result if the group is migrated from the volume and the resources required to migrate the group from the volume.

Abstract: The present invention extends to methods, systems, and computer program products for exploring and selecting data cleansing service providers. Embodiments of the invention permit a user to explore different data cleansing service providers and compare quality results from the different data cleansing service providers. Sample data is mapped to a specified data domain. A list of service providers, for cleansing data for the selected data domain, is provided to a user. The user selects a subset of service providers. The sample data is submitted to the subset of service providers, which return results including allegedly cleansed data. The results are profiled and a comparison of the subset of service providers is presented to the user. The user selects a service provider to use when cleansing further data.

Abstract: Embodiments of the invention relate to evaluation and storage of data in a computer system configured with a shared pool of resources. A multi-level adaptive compression technique is employed to minimize the cost of data storage based upon the type of data being stored and their access pattern. The costs of data storage include capacity, bandwidth, and compute cycles. Data is transformed local to a client in communication with the shared pool, local to the shared pool, or as a combination with a partial transformation local to the client and a partial transformation local to the shared pool.

Abstract: Some embodiments include a system, method, apparatus and means for identifying and extracting information include generating a list of information sources, each selected as having information potentially relevant to a topic, the list of information sources including sources of at least a first type and sources of a second type, retrieving first information from an information source of the at least first type and determining that the first information is relevant to the topic, monitoring the information source of the at least first type to identify a change in the first information, and retrieving updated information from the information source of the at least first type upon identifying the change.

Abstract: A distributed system and method for replicated storage of structure data records. According to one embodiment, a system may include storage hosts each configured to store and retrieve structured data records, and a data store manager configured to receive a request from a client to store a structured data record within a table. In response to receiving the request, the data store manager may be further configured to map the structured data record to a block according to a partition key value of the structured data record and an identifier of the table and to map the block to a subset comprising at least two of the plurality of storage hosts. Upon successfully storing the structured data record to the block within at least two storage hosts within the subset, the data store manager may be further configured to return to the client an indication that said request is complete.

Abstract: Method and apparatus for recording associations with logs are described. In one embodiment, the method comprises obtaining a first media identifier corresponding to a first media; accessing a log that contains one or more entries that associate two or more media identifiers with each other; and determining that the first media is related to a second media based on the log indicating that a second media identifier is associated with, but different from, the first media identifier.

Abstract: A distributed database server receives an operation request including a flag to cause recursive lock-and-propagate operation, acquires a local lock, tests the operation locally and propagates the recursive request to a peer database server. Specific implementations within a Lightweight Directory Access Protocol (“LDAP”) server are described.

Abstract: A user who is browsing the web may use a web site verification service to ascertain whether a web site that appears to be associated with a trusted entity is actually associated with that entity. The web site verification service retains the URL of an unauthenticated web site. The user types a text string naming the entity that the user believes should be associated with the web site into a text box. A database such as an internet search engine database or a database containing a list of trusted entities and their URLs may be queried using the user-supplied text string. The retained URL may be compared to the resulting list of URLs. If the retained URL does not match one of the URLs in the query results, the user may be warned that the web site does not appear to be associated with the trusted entity.

Abstract: Disclosed are a method and apparatus for limiting the number of results returned by a data store in response to a query. Upon receiving an initial query, the data store returns a page of results that includes a subset of the data items within the data store satisfying the conditions of the query. The data store also provides a marker indicating the extent of the set of data items. If a subsequent query that requests additional results which satisfy the same query conditions and that includes the marker is received, the data store returns a page of results that includes a subset of data items that are disjoint from the initial subset, and provides an updated marker which indicates the extent of the union of the initial and subsequent subsets. If still further results are desired from the data store, an additional query containing the updated marker may be submitted.

Abstract: A system and method for improving the relevance of search results using data container access patterns. An indexing process tracks data access patterns and updates an access data structure. When executing a search operation, a search process first identifies a set of data containers containing the search terms. The search process then utilizes the access data structure to rank the identified data containers based on the collected data access pattern information.

Abstract: A rule-based system for improving accuracy of geocoding results is provided including a communications device configured to transmit a query including a textually identified location and a geocoding accuracy module configured to receive the query from the communications device and successively remove constraints from the textually identified location until a match is located. Related methods and computer program products are also provided.

Abstract: A method of pushing content, such as eLearning packages, to mobile devices is disclosed. The content push stores the content locally on the user's mobile device so the content can be viewed offline.

Abstract: A method is used in managing logical views of directories. A directory logical view is created from a primary logical view. The primary logical view includes a set of storage objects. The directory logical view includes a subset of the set of storage objects. A root of the directory logical view indicates a file directory. The file directory includes the subset of the set of storage objects in a hierarchy. A mapping object is created for the directory logical view. The mapping object manages access to the subset of the set of storage objects. The mapping object for the directory logical view is a version of a mapping object for the primary logical view. Information is removed from the mapping object for the directory logical view. Information remained in the mapping object after removing the information is associated with the file directory.

Abstract: Mechanisms are provided to permit a first person (e.g., Tom) to be in a communication session (e.g., a chat session) with a second person (e.g., George) and to select a contact's name (e.g., Harry), and immediately set up another communication (e.g., a chat session) with the selected contact (e.g., Harry). Since there may be multiple contacts having the same name as the selected contact, e.g., “Harry”, mechanisms are provided to communicate with a desired person (e.g., “Harry Smith” and not “Harry Jones”). The mechanisms may make such a determination based on “Harry Smith” being the more likely person that Tom, the first person, desires to communicate with (e.g., based on a context of Tom and/or Harry Smith).

Abstract: A system, computer-implemented method, and a computer-readable storage medium for a data graph traversal are provided. The input parameters for traversing the data graph are received. The data graph having a set of vertices and a set of edges are stored in a column based format in a memory cache of a computer device based on the input parameters is traversed. The traversal generates a set of traversed vertices that are the result of the graph traversal.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for storing reports for use by tenants of a multi-tenant on-demand database service. These mechanisms and methods for storing reports for use by tenants of a multi-tenant on-demand database service may allow tenants of the multi-tenant on-demand database service to create, modify, etc. reports programmatically, as desired, and may allow the multi-tenant on-demand database service to make the reports accessible to other tenants of the multi-tenant on-demand database service.

Abstract: Methods and systems are disclosed for modeling costed entities and performing a value chain analysis. In one implementation, methods and systems may implement a costing platform. The costing platform may be adapted for modeling any set of costed entities and processing value chains. Value chains may be modeled by a user via the costing platform, so that networks comprised of objects and edges, and costed entities located at the objects can be modeled and functions can be added to determine key figures.

Abstract: Described herein are methods and systems for promoting item listings that satisfy a query based on the item listings being assigned to certain categories that have, based on historical click data, exhibited high demand characteristics for the query. Consistent with some embodiments, a certain number of leaf-level categories are identified based on demand data for those categories, and the item listings assigned to those categories are promoted through a normalized weighting factor derived in part based on the click probability score associated with the category, clicks per impression rate, and weighted clicks per impression by ranking rate.

Abstract: Mechanisms are provided for retrieving and presenting related content using text stream data feeds. Text stream data feeds such as caption information associated with media content or conversations associated with social networking applications are aggregated and used to retrieve related media content, text documents, and advertisements. Text stream data feeds that a user is exposed to may indicate that the user is interested or at least primed for particular types of related content. In particular examples, an inverse vector space search engine is used to determine particular pieces of related content and categories of interest. Post filtering may also be applied to the results.

Abstract: User queries are received, with each query requesting a service from a server. Overlapping experiments are performed on at least a portion of the queries, with each experiment modifying one or more parameters associated with the queries or parameters associated with processing of the queries, and with the experiments organized into layers. Two or more experiments in different layers are allowed to be performed on the same query, and for any given layer, at most one experiment is allowed to be performed on the same query.

Abstract: A method, computer program product, and system for providing advanced downloading of Uniform Resource Locators (URLs) for a WEB browser running on a computer. The system is capable of providing a WEB browser with Uniform Resource Locators (URLs). The system comprises a client computer and a server. The client computer includes the WEB browser for use by a user and includes a URL component. The server provides WEB data to the client computer. The server includes a URL downloader, which is responsive to the URL component for downloading the URLs to the client computer.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for optimizing query performance in a relational database management system. A query is received at the relational database management system. It is determined whether the query is expected to be a long-running query. In response to determining that the query is expected to be a long-running query, a full table scan is started in order to fetch records needed to satisfy the query from the relational database management system. In parallel with conducting the full table scan, a performance object is built, which is capable of satisfying the query in the relational database management system. In response to completing the construction of the performance object prior to completing the full table scan, the full table scan is stopped and the newly built performance object is used instead to satisfy the query.

Abstract: Methods for optimizing query performance in a relational database management system. A query is received at the relational database management system. It is determined whether the query is expected to be a long-running query. In response to determining that the query is expected to be a long-running query, a full table scan is started in order to fetch records needed to satisfy the query from the relational database management system. In parallel with conducting the full table scan, a performance object is built, which is capable of satisfying the query in the relational database management system. In response to completing the construction of the performance object prior to completing the full table scan, the full table scan is stopped and the newly built performance object is used instead to satisfy the query.

Abstract: A method and system for fuzzy full text search is disclosed. The system includes an inverted index where tokens are organized in a Next Valid Character (NVC) tree. Each path through the tree defines a token. The document sets for the tokens are stored at leaf nodes. After receiving search tokens, the system traverses the NVC tree in a lazy manner by exploring paths through nodes associated with the smallest edit distance. The system provides a result set per edit distance. For example, the system provides a result set of document identifiers associated with documents having the least amount of error first, followed by result sets of document identifiers associated with documents that have progressively more error.

Abstract: In an embodiment, Partition Change Tracking (PCT) refresh is performed by using join dependencies on partitioning columns to derive and fill in identifiers of rows and/or partitions containing the rows in the refresh expressions. In an embodiment, the join dependencies that form the Materialized View's (MV's) query definition and the partitioning predicate of the table are used to automatically generate a statement which is run in order to derive and fill in identifiers of the rows and/or partitions that are being changed. The identifiers are then plugged into the refresh expression, and the refresh expression is run. Running the refresh expression causes the rows identified to be refreshed.