Abstract: A server is configured to generate a document tag identifying at least one of a first association and a second association for the document, the first association being an association between the document and at least one of a plurality of groups, the second association being an association between the document and one of a plurality of document types, generate a user tag identifying at least one of a third association and a fourth association for a user, the third association being an association between the user and at least one of the plurality of groups, the fourth association being an association between a type of a document requested by the user and at least one of the plurality of document types, and provide access to the requested document based on at least one of the first and second associations and at least one of the third and fourth associations.

Abstract: A distributed database system may implement log-structured distributed storage using a single log sequence number space. A log for a data volume may be maintained in a log-structured distributed storage system. The log may be segmented across multiple protection groups according to a partitioning of user data for the data volume. Updates to the log may be assigned a log sequence number from a log sequence number space for the data volume. A protection group may be determined for an update according to which partition of user data space the update pertains. Metadata to be included with the log record may indicate a previous log sequence number of a log record maintained at the protection group. The log record may be sent to the protection group and identified as committed based on acknowledgments received from storage nodes implementing the protection group.

Abstract: A computer storage device having a host interface, a controller, non-volatile storage media, and firmware. The firmware instructs the controller to: generate mapping data defining mapping, from logical block addresses in namespaces configured on the non-volatile storage media, to logical block addresses in a capacity of the non-volatile storage media; maintain an active copy of the mapping data; generate cached copies of the mapping data from the active copy; generate a shadow copy from the active copy; implement changes in the shadow copy; after the changes are made in the shadow copy, activate the shadow copy and simultaneously deactivate the previously active copy; and update the cached copies according to the newly activated copy, as a response to the change in active copy identification.

Abstract: A list of performed operations is received containing all operations performed in an order of processing. A request from a user is received including at least one of an undo request of a last performed operation or a redo request of a last performed undo request from the list of performed operations and the request includes at least one content type. A content type of each performed operation in the list of performed operations is determined. All performed operations from the list of performed operations that have a content type the same as one content type of the at least one content types is determined. The at least one of an undo request of a last performed operation or redo request of the last performed undo request from the list of performed operations that have one content type of the at least one content types is performed.

Abstract: Policies are applied to specific data rather than to an entire computing device that contains the specific data. Access to the specific data is controlled by the policies utilizing various password or other authentication credential requirements, selective data caching, data transmission, temporary data storage, and/or pre-defined conditions under which the specific data is to be erased or rendered inaccessible. Policies may be defined by an administrator and pushed to a mobile computing device, whereat the policies are enforced.

Abstract: [Problem] The present invention attempts, using a terminal that does not have digital rights management (DRM) as a base, to generate encapsulated files from original files, by adding access rights thereto and encrypting the same, while ensuring not to leave unprocessed original files. [Solution] A file management system has an intranet having data storage means, an encapsulation server, and a user terminal that is capable of accessing the intranet and the encapsulation server. The user terminal has encapsulation request means that transmits an original file and access rights information to the encapsulation server and receives an encapsulated file, for which encapsulation has been completed. The user terminal has encapsulated file saving means that saves the encapsulated file in the data storage means, and automatic original file deletion means that deletes the original file upon saving of the encapsulated file.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for a checkout system executable code monitoring, and user account compromise determination system. The system monitors executable code initiating and executing on checkout systems, including determining hashes of the executable code. The system determines whether the executable code is malicious based on the hash, and associated information of the executable code. Additionally, the system monitors user access to checkout systems, and determines user accounts associated with being compromised. User interfaces are generated describing checkout systems associated with a risk of being compromised, and are configured for user interaction, which cause generation of updated user interfaces and access to electronic data stores to determine information relevant to the user interaction.

Abstract: A lock management method and system, and a method and an apparatus for configuring a lock management system is provided. A corresponding level of a lock management system is set for each service execution node according to the number of service execution nodes included in a distributed system, the number of system instances on all service execution nodes, the number of handling processes on all the service execution nodes, and a delay of access of each service execution node to a central control node of the distributed system. At least one lock manager is allocated to each service execution node separately according to the level, which is corresponding to each service execution node, of the lock management system. A lock level context is configured for each lock manager, where the lock level context is used to determine an adjacent lock manager of each lock manager.

Abstract: Systems and methods are disclosed herein for providing fault tolerant processing of events. The system includes multiple consensus computers configured to communicate with one another and multiple event processors configured to process data such as events. Each consensus computer is further configured to receive a request to process a unit of data from an event processor. A consensus computer communicates with at least one other consensus computer to reach consensus as to whether the unit of data has previously been assigned to an event processor for processing. Then, a consensus computer sends a message to the event processor that sent the inquiry including instructions to either process the unit of data or not process the unit of data. Because the consensus computers determine whether a unit of data has previously been assigned to an event processor, the system ensures that an event is not processed more than once.

Abstract: Data entities in a client-server system are accessed. The client-server system comprises a set of clients, a server system, and a repository for storing a plurality of data entities. The server system comprises an inter-transactional cache, the inter-transactional cache being accessible for each client of the set of clients. A first client of the set of clients comprises a first intra-transactional cache. If a copy of a first data entity is in the inter-transactional cache, a version identifier of the original first data entity is read from the repository. If the copy of the first data entity is to be accessed with an exclusive lock, a copy of the copy of the first data entity is added to the first intra-transactional cache. The copy of the copy of the first data entity in the first intra-transactional cache is accessed for further processing of the first data entity by the first client.

Abstract: A distributed spreadsheet application executes at a server and a client in a network. The networked spreadsheet application can generally be used without requiring a user to install any specific spreadsheet software prior to using the application. In one implementation, the spreadsheet application may include a client engine that executes within browser programs of a plurality of client computing devices and server logic. The server logic may be configured to distribute the client engines to the plurality of client computing devices of the spreadsheet application when requested through the browser programs of each of the plurality of client computing devices. The server logic synchronizes a single spreadsheet document that is simultaneously open at the plurality of client computing devices.

Abstract: A cluster file system is provided having a plurality of distributed metadata servers with shared access to one or more shared low latency persistent key-value metadata stores. A metadata server comprises an abstract storage interface comprising a software interface module that communicates with at least one shared persistent key-value metadata store providing a key-value interface for persistent storage of key-value metadata. The software interface module provides the key-value metadata to the at least one shared persistent key-value metadata store in a key-value format. The shared persistent key-value metadata store is accessed by a plurality of metadata servers. A metadata request can be processed by a given metadata server independently of other metadata servers in the cluster file system. A distributed metadata storage environment is also disclosed that comprises a plurality of metadata servers having an abstract storage interface to at least one shared persistent key-value metadata store.

Abstract: A method of and system for managing a data set of a storage facility is disclosed. The data set may be a sequential-access data set. The method and system may include structuring the sequential-access data set to have a first group-of-records configured for adding a second group-of-records to the sequential-access data set. The method and system add a second group-of-records to the sequential-access data set. The method and system merge the second group-of-records with the first group-of-records in response to a triggering event. The method and system establish, in response to merging the second group-of-records with the first group-of-records, a marker configured to indicate the first and second group-of-records, as merged, is sorted.

Abstract: Systems and methods for parallel computer system recovery are described. The method may include receiving requests for backup data at a storage server from a plurality of computer systems to be recovered. The method may further include determining a next data fragment of the backup data to be transmitted from the storage server to the plurality of computer systems based on an order of priority. The method may also include transmitting the next data fragment from the storage server to the plurality of computer systems via a data fragment multicast stream.

Abstract: Described herein are systems, devices, and methods for content delivery on the Internet. In certain non-limiting embodiments, a caching model is provided that can support caching for indefinite time periods, potentially with infinite or relatively long time-to-live values, yet provide prompt updates when the underlying origin content changes. In one approach, an origin server can annotate its responses to content requests with tokens, e.g., placing them in an appended HTTP header or otherwise. The tokens can drive the process of caching, and can be used as handles for later invalidating the responses within caching proxy servers delivering the content. Tokens may be used to represent a variety of kinds of dependencies expressed in the response, including without limitation data, data ranges, or logic that was a basis for the construction of the response.

Abstract: Provided is a node and a communication method of the node in a content oriented network (CON) in which the communication method of the node included in the CON may include receiving, at a receiver, a content request packet having a content name comprising hierarchical name components and flat name components, extracting the hierarchical name components and the flat name components from the content request packet, and processing the content request packet using the hierarchical name components and the flat name components.

Abstract: Systems and methods of maintaining a horizontally scaled database based on data ownership for a cloud-based platform (e.g., cloud-based collaboration and/or storage platform/service) are disclosed. The system database comprises multiple shard databases, and all files and folders owned by a user are stored on a single shard database. When a user transfers ownership of a file and/or a folder to a second user, the transferred file and/or folder is stored on the shard database that stores all of the data for the second user.

Abstract: The exemplary embodiments describe systems and methods for utilizing a semaphore with timeout and lock-free path for message passing architectures. One embodiment is related to a method comprising receiving a request from a client to access an object, the object including a plurality of resources, placing the request in a lock-free pend queue of a semaphore, manipulating a count of the semaphore based on an availability of at least one of the plurality of resources, and determining whether the client can use a fast path to the object.

Abstract: Architecture that facilitates offline/online interaction with online collaboration documents or pages such as for wikis and/or notebooks. More specifically, for every proto link employed in a page, a unique object ID is provided. The client, whether online or offline, uses the object ID as the page's object ID when a target page is created at the time of resolving the associated proto link (e.g., when a user clicks on a proto link to navigate to the proto page). When an offline client connects to an online state, changes are synchronized (synced). All the pages created offline from the same proto link will have the same object ID and the content of the pages are then synced correctly under the same page ID and name.

Abstract: In one embodiment, a computer-implemented method executable by a server system to validate metadata of an application is provided. The method includes: receiving a custom metametadata object having a definition that specifies a format of metadata of an object, and having validation rules that specify a use of the custom metametadata object; generating a metadata record using the custom metametadata object; building an application using the metadata record; and validating the metadata record based on the validation rules of the metametadata object.

Abstract: Methods for encoding file system metadata are described herein. According to one embodiment, a file system cache is maintained including information representing relationships between inodes and disk blocks of a disk having disk sections. Each disk section includes a data segment and a header encoding metadata for describing the data section of each disk section. The metadata is encoded using a set partitioning algorithm and each set represents a set of disk blocks. In response to a file system request for reading a disk section, metadata associated with the disk section is retrieved and decoded to extract information representing a relationship between inodes and disk blocks associated with the requested disk section. The file system request is then serviced using the decoded metadata and the associated data segment and one or more entries of the file system cache are updated using the decoded metadata.

Abstract: A managed container may be configured to manage enterprise applications, manage enterprise information stored on a device, manage a protected storage area used by the managed container to store and reference the enterprise applications during execution, and manage a database storing enterprise rules related to management of the enterprise applications and the enterprise information. The managed container may communicate with an application gateway server to control download and update of the enterprise applications, the enterprise information, and the enterprise rules. The application gateway server may be coupled to a backend enterprise application. At least one of the enterprise applications may be configured to execute in conjunction with the backend enterprise application according to at least one of the enterprise rules, and is configured to, according to another one of the enterprise rules, manage the enterprise information associated with the backend enterprise application.

Abstract: A method and system for distributing tasks from an external application among concurrent database application server instances in a database system for optimum load balancing, based on consensus among the instances. Each application instance identifies a task partition ownership by those in a membership group based on a time window and generates a new membership group and partition ownership based on the current partition ownership. The instance makes the new membership group and partition ownership known to other members by recoding them in the membership table and partition map. Each participation by an instance in the membership group is identified by a random number. The new membership group and partition ownership are generated and adjusted based on an average partition allocation to achieve consensus among the instances.

Abstract: A computing resource service provider may store user data in a distributed data storage system. The distributed data storage system may contain one or more storage nodes configured to store hierarchical data in one or more data stores such as a column data store. Data in the data stores may be compressed or otherwise encoded, by a storage optimizer, in order to reduce that redundancy in the hierarchical data stored in the one or more data stores. Responses to user queries may be fulfilled based at least in part on data stored in the one or more data stores. A query processor may scan multiple different data stores across various storage nodes in order to obtain items responsive to the user query.

Abstract: A computer system to control access to computer resources of a computer data center. The computer system includes processors and program instructions stored on one or more computer-readable storage devices of the computer system. The stored program instructions include: (i) program instructions to determine that a request to access one of the computer resources is in response to a service request pertaining to the one computer resource targeted by the service request; and (ii) program instructions, responsive to the determination, to map the service request to one or more standard operating procedures to enable information embedded in the one or more standard operating procedures to be used to process the service request, assign a user to execute the service request, and grant the user the requested access of the one computer resource to enable the user to execute the service request.

Abstract: The invention provides a system and method for file synchronization. One embodiment of the system of this invention includes a software program stored on a computer readable medium. The software program can be executed by a computer processor to receive a file from a server; store the file as a cached file in a cache; determine if the cached file has been modified; and if the cached file has been modified, communicate the cached file directly to the database.

Abstract: Methods and apparatus for distributed locking interfaces are disclosed. A state manager implements programmatic interfaces for distributed locking operations. In response to a queue-for-lock request for a registry element received via an interface, the state manager provides to the requester, a reference to a first asynchronous computation. The first asynchronous computation comprises an insertion of a lock request into a queue of waiters for a lock on the element. In response to a request for a result of the computation, the state manager transmits, after the lock request has been inserted into the queue of waiters, a notification of the insertion of the request. The notification in turn includes a reference to a second asynchronous computation. The second asynchronous computation comprises a grant of the lock on the particular element to the requester.

Abstract: A system, method, and medium supports analyzing intellectual property documents by linking and annotating patents, copyrights, trademarks, license agreements, and other intellectual property documents. It can be used by intellectual property professionals in memorializing thought processes, work products, and reasoning, in preliminary or final form, and can support development and use of a rich linked set representing complex relationships in an intellectual property portfolio. Optionally, marked up, linked documents are divided into data streams; one contains the original document for mark-up, and one contains annotation data. The marked-up document may be further revised and/or annotated even by multiple users. The same document such as a patent may be centrally stored but independently marked-up by different users (or groups of users).

Abstract: A system, method, and medium supports analyzing intellectual property documents by linking and annotating patents, copyrights, trademarks, license agreements, and other intellectual property documents. It can be used by intellectual property professionals in memorializing thought processes, work products, and reasoning, in preliminary or final form, and can support development and use of a rich linked set representing complex relationships in an intellectual property portfolio. Optionally, marked up, linked documents are divided into data streams; one contains the original document for mark-up, and one contains annotation data. The marked-up document may be further revised and/or annotated even by multiple users. The same document such as a patent may be centrally stored but independently marked-up by different users (or groups of users).

Abstract: A method and apparatus for distribution of applications amongst a number of servers, ensuring that changes to application data on a master for that application are asynchronously replicated to a number of slaves for that application. Servers may be located in geographically diverse locations; the invention permits data replication over high-latency and lossy network connections and failure-tolerance under hardware and network failure conditions. Access to applications is mediated by a distributed protocol handler which allows any request for any application to be addressed to any server, and which, when working in tandem with the replication system, pauses connections momentarily to allow seamless, consistent live-migration of applications and their state between servers.

Abstract: Various systems and methods for restoring data in distributed storage systems. For example, one method involves receiving a first selection, where the first selection identifies data abstraction. The data abstraction represents a data source that can be restored. The method also involves receiving a second selection, where the second selection identifies a restore operation, and where the restore operation is associated with the data abstraction. The method also involves determining data to be restored, where this determination is based on the data source(s) (as can be determined from the data abstraction) and on the second selection. Data can then be restored based on the determined data.

Abstract: Methods and apparatus for computer systems having first and second memory tier having regions, physical memory having page caches that are shareable with multiple ones of the regions in the first memory tier and the regions in the second memory tier, and virtual memory having mmaps of ones of the regions in the first memory tier and ones of the regions in the second memory tier, wherein the mmaps are associated with multiple ones of the pages caches.

Abstract: Restoration data is enabled to be written into a nonvolatile memory according to a simple process without using large capacity of a volatile memory. An SRAM writing section sets an updating request flag in a non-delay updating request flag region corresponding to a non-delay region where the restoration data is written. When the updating request flag is set in the non-delay updating request flag region, an EEPROM writing section writes the restoration data stored in the non-delay region corresponding to the non-delay updating request flag region into an EEPROM.

Abstract: Examples of systems and methods are provided for server-side computing from a remote client device. A system may allow rendering at a local client side a composite view including a local graphical user interface and a remote application view associated with a remote application running at a remote server. The system may comprise a local view module configured to generate a local graphical user interface (GUI) for controlling the remote application remotely from the local client side, configured to receive one or more user inputs to the local GUI, configured to determine a function corresponding to the one or more user inputs, configured to generate a command message based on the determined function, and configured to direct the command message to the remote server. A composite view comprising the local GUI and the remote application view may be provided to a local display at the client device.

Abstract: A method for operating a commissioned e-commerce service provider provides services to businesses on a computerized network such as the Internet in exchange for a small commission on the commercial transactions generated using those services. Unlike most ISPs that provide services to individuals and businesses, the commissioned e-commerce service provider preferably provides Internet services for businesses operating web sites or other application that generate e-commerce transactions for the business. Instead of paying a monthly fee for the Internet services required to host a web site or operate and e-commerce site, the business contracts with the commissioned e-commerce service provider to provide these services based on receiving a percentage commission of the commercial transactions generated using these services.

Abstract: Aspects distribute database data to table space containers as a function of active and inactive node designations. Different groups of active and inactive logical nodes are created in response to integrating a relational database on one or more physical servers. Database node groups are created by marking the active nodes as available for use in data storage and distribution, and the inactive nodes as unavailable. Table space is created for the relational database by defining containers for each of the active and inactive nodes.

Abstract: A memory sharing method and system in a distributed computing environment. The method includes placing a first operator and a second operator within a processing element. The first operator is associated with a first host and the second operator associated with a second and differing host of a distributed computing system. Requests for usage of global data with respect to multiple processes are received from the first operator and the second operator. The global data is stored within a specified segment of a shared memory module that includes shared memory space being shared by the first operator and the second operator. The multiple processes are executed and results are generated by the first operator and the second operator with respect to the global data.

Abstract: A control method for a control device which connects, via a connecting device, each of a plurality of processors that each executes processing to at least one of a plurality of memory devices that each stores data, the control method comprises controlling the connecting device so that a second memory device, which is one of the plurality of memory devices, is connected to the first processor in response to a connect request issued by a first processor, which is one of the plurality of processors, since a predetermined amount of data has been written into a first memory device, which is one of the plurality of memory devices, the control device; and controlling the connecting device so that the first memory device is disconnected from the first processor in response to a disconnect request issued by the first processor after starting to write data into the second memory device.

Abstract: A network computer system is protected from malicious attacks by its own system administrators by a large number of addressable and assignable smart-agents that are individually allocated to independently follow and represent those system administrators, the jobs those system administrated are assigned to work on, and the system resource tasks that such system administrators can employ in furtherance of the completion of a particular job.

Abstract: A system and method of managing cache units includes providing, by a first cache unit, caching services to a first plurality of clients, collecting information associated with a usage of the first cache unit by the first plurality of clients, determining a similarity in cache usage between every pair of clients selected from the first plurality of clients based on information associated with the collected information, selecting a second plurality of clients from the first plurality of clients based on information associated with the determined similarity in cache usage, replicating the first cache unit to create a second and a third cache unit, providing, by the second cache unit, caching services to the second plurality of clients, and providing, by the third cache unit, caching services to one or more third clients selected from the first plurality of clients, each of the third clients not being in the second plurality of clients.

Abstract: A “Concurrent Sharing Model” provides a programming model based on revisions and isolation types for concurrent revisions of states, data, or variables shared between two or more concurrent tasks or programs. This model enables revisions of shared states, data, or variables to maintain determinacy despite nondeterministic scheduling between concurrent tasks or programs. More specifically, the Concurrent Sharing Model provides various techniques wherein shared states, data, or variables are conceptually replicated on forks, and only copied or written if necessary, then deterministically merged on joins such that concurrent tasks or programs can work with independent local copies of the shared states, data, or variables while ensuring automated conflict resolution.

Abstract: A database rollback processor allows rollback, or rewind, of the data and metadata to a point at which a failover or other metadata change occurred, therefore “rewinding” the metadata to a previous consistent point. The rollback processor identifies transaction entries in a redo log resulting in changes to the metadata. The changes are identified backward to a target recovery time. Transactions affecting the metadata are stored in a stack. The transactions are then backed out of the metadata according to the stack to restore the metadata to the state at the target recovery time. Data changes from the redo log may then be applied to the corresponding metadata as it existed at the target recovery time. Since the target recovery time is not bound by the timing of the snapshots, but rather may be at an arbitrary point chosen as the target recovery time, a failover, replication or recovery operation need not rely on the snapshot time.

Abstract: The invention provides, in one aspect, an improved system for data access comprising a file server that is coupled to a client device or application executing thereon via one or more networks. The server comprises static storage that is organized in one or more directories, each containing, zero, one or more files. The server also comprises a file system operable, in cooperation with a file system on the client device, to provide authorized applications executing on the client device access to those directories and/or files. Fast file server (FFS) software or other functionality executing on or in connection with the server responds to requests received from the client by transferring requested data to the client device over multiple network pathways. That data can comprise, for example, directory trees, files (or portions thereof), and so forth.

Abstract: Systems, methods, and computer program products for enabling assessment of the quality of a search index. In one embodiment, objects are processed to produce corresponding text that is stored and indexed. The objects are also processed to identify and store corresponding metadata values for indexing. Error conditions that are detected during the processing of objects to generate corresponding text are tracked and compared to determine the most severe of the error conditions. An indication of the most severe error condition is stored in a first consolidated error field. Errors that are encountered in the identification and storage of metadata values are counted and this count is stored in a second consolidated error field. Both of the consolidated error fields are indexed in the same manner as the text and metadata for the objects, so that the stored error information can be used in queries of the search index.

Abstract: A method for correcting service manual textual inconsistencies. Extracting textual procedures from service documents stored in a memory of a service document storage device. Each term of an extracted textual procedure terminology is compared to a correlating target name terminology for identifying any matching terms by a processor. An overlap similarity is computed as a function of the identified matching terms from the extracted textual procedure terminology and the correlating target name terminology. A determination is made whether the overlap similarity is greater than a predetermined similarity threshold. The service documents are modified to change the extracted textual procedure terminology to the correlating target name terminology in response to the overlap similarity being greater than the predetermined similarity threshold and the extracted textual procedure terminology not exactly matching the correlating target name terminology.

Abstract: PourOver is the process of replicating databases across clusters, in order to achieve real and/or near real-time database consistency between clusters (e.g., continually provide the ability to construct a consistent database on the alternate cluster that is up to date within a few minutes worth of transactions).

Abstract: Embodiments of the present disclosure provide for a method and system for storing content based on one or more attributes associated with the content. Specifically, the present disclosure provides for determining storage capabilities of one or more storage devices associated with a computing device and also determining a retention policy associated with the content. In certain embodiments, the retention policy is identified by the one or more attributes. When the retention policy and the capabilities of the one or more storage devices have been determined, the content is written to the one or more storage devices based on the retention policy.

Abstract: A backup system having duplicated file system data and composed of a plurality of storage systems having different performances is provided, wherein a processing time required for backup of a small-sized file or an on-demand restoration of a file is reduced. A distributed backup system composed of a storage system and a plurality of backup units is equipped with a function for selecting a backup unit based on a plurality of performance indexes, and a requested data transfer size for performing backup or restoration is considered when performing the selection.

Abstract: Concepts and technologies are described herein for managing a search index. In accordance with the concepts and technologies disclosed herein, a search index can be hosted by a number of search nodes. The search engine can be configured to determine if a search node is unavailable, and if so, if data stored at the unavailable search node is to be replaced. If data stored at the unavailable search node is to be replaced, the search engine can identify sources for data to be used to replace the data at the unavailable search node. The search engine can issue instructions to the sources and/or the unavailable search node to copy the data from the sources to the unavailable node and/or to replace the data at the unavailable node with the data from the sources. Portions of the data can be copied from each of the sources to the unavailable node.

Abstract: Techniq ues for recovering a virtual machine are disclosed. In one particular embodiment, the techniques may be realized as a method for recovering a virtual machine comprising the steps of selecting a first backup copy of a virtual machine in a first data store, selecting a second data store; enabling use of the virtual machine by reading from the first data store and writing to the second data store, selecting a second backup copy of the virtual machine, and migrating the virtual machine from the second backup copy to the second data store.