Abstract: Consistent queries to replicated data may be performed according to global clock values. Time values for updates performed at a data set may be identified according to a global clock. The updates may be replicated to a replicated portion of a data set. Queries directed to the replicated portion of the data set may be performed in response to determining that the time values for updates indicate that the replicated portion of the data set is consistent with a time value identified for the query according to the global clock.

Abstract: Methods for page split detection and affinity in query processing pushdowns are performed by systems and devices. Page servers perform pushdown operations based on specific, and specifically formatted or generated, information, instructions, and data provided thereto from a compute node. Page servers also determine that page splits have occurred during reading of data pages maintained by page servers during pushdown operations, and also during fulfillment of compute node data requests. To detect a data page has split, page servers utilize information from a compute node of an expected next data page which is compared to a next data page in the page server page index. A mismatch in the comparison by page servers indicates data page was split. Compute nodes and page servers store and maintain off-row data generated during data operations via page affinity considerations where the off-row data is stored at the same page server as the data.

Abstract: Systems and methods are provided for facilitating contactless payment using cloud-based wallet containing payment credentials (e.g. Visa, Mastercard, American Express) using a near field communication (NFC)-capable device and payment gateway servers. A user can use their existing payment card, herein referred to as a funding card, for contactless payments. A second payment card, herein referred to as a virtual card, is generated. The virtual card is associated with the funding card on a payment gateway server. The virtual card is used on a NFC-enabled mobile device. When a payment is initiated, the virtual card data is sent through the NFC system from a point of sale terminal. This information is sent to the payment gateway server, which retrieves the funding card to make the payment. The funding card, not the virtual card, is used to transfer the money to make payment.

Abstract: A method for lock metadata re-balancing upon an expansion of a storage system, the method may include instructing multiple compute entities, by an expansion manager and during a first phase of the lock metadata re-balancing, to acquire locks by using: (a) a current translation function for linking addresses of current lock metadata units (LMUs) to identifiers of stored entities; wherein the current translation function is based on a size of a current storage space allocated to the lock metadata; and (b) a next translation function for linking addresses of new LMUs to identifiers of stored entities; wherein the new translation function is based on a size of a new storage space allocated to the lock metadata; wherein the current space is expanded during the expansion of the storage system to provide the next storage space.

Abstract: Methods and systems for file locking are described herein. An on-premise file share may store files that are accessible to both a local on-premise client and a remote off-premise client. The off-premise file share may request to check-out one of the files. In response, one of multiple nodes may obtain for the file a file handle with exclusive write access. File locking information may be stored at the file share that indicates the node that holds the file handle and that indicates the file is in a locked state whereby other remote off-premise clients or local on-premise clients are prevented from editing the file.

Abstract: In an approach, a processor, responsive to requesting to perform a plurality of applications including a first application and a second application, determines that the first application and the second application have been performed sequentially during a previous time period. A processor, responsive to determining that the first and second applications have been performed in sequence during the previous time period, obtains, a first set of database operations associated with the first application and a second set of database operations associated with the second application. A processors, responsive to determining that the first set of database operations and the second set of database operations are free of conflict, generates an execution schedule indicating that the first application and the second application are to be performed in parallel. A processors performs the plurality of applications based on the execution schedule.

Abstract: In some implementations, a system may receive, from a first user, data associated with a new database entry to be added to a master database that is associated with multiple sets of users having different access permissions to entries in the master database. The system may write the data to a first repository, write an entry including the data to a master repository, and generate a record of the entry. The system may receive, from a second user, additional data associated with the new database entry. The system may write the additional data to a second repository, modify the entry in the master repository based on the additional data, and generate a record of the modified entry. The system may perform verifications and output a notification based on the verifications. The system may further output, to a public repository, the modified entry with at least one data value removed.

Abstract: In some examples, a database system includes a plurality of processing engines to process data for database operations, and instructions executable on at least one processor to insert first data into first objects stored in a remote data store coupled to the database system over a network, and select, based on a size of the first data, a first partition level from a plurality of different partition levels to associate with the first objects. Different partition levels define different quantities of hash buckets that correspond to different distributions of objects across the plurality of processing engines. The first partition level is associated with the first objects.

Abstract: A computer-implemented method of resizing a data structure includes storing a first hash index comprising x elements, wherein x is a positive integer greater than two, determining that the first hash index needs to expand, allocating a second hash index, wherein the second index contains at least x+1 elements, attempting, by a first thread, to advance a first pointer from the first hash index to the second hash index, attempting, by a second thread, to advance the first pointer from the first hash index to the second hash index, where only one of the first thread or the second thread will advance the first pointer based on an atomic operation.

Abstract: A method, computer program product, and computer system for identifying, by a computing device, an attribute of a lock object associated with data. It may be determined that the lock object is acquired by a first task performing a transaction with the data based upon, at least in part, the attribute of the lock object. The lock object may be acquired by a second task by releasing the lock object from the first task prior to the transaction with the data being completed, wherein the second task is a higher priority task than the first task.

Abstract: A transaction is received. The transaction involves a data in a relational database management system. A page in the relational database management system is determined with the data. Whether the page has a hybrid lock enabled is determined using a hybrid lock hash table. Responsive to determining the page has the hybrid lock enabled, whether the page is above the hot page threshold is determined.

Abstract: This invention presents a method and apparatus for solving a specific problem of web browser's display being blocked after a user submitted a task that will render the web browser becoming useless to a user for a period of time to prevent the user submitting other tasks. The success of solving this problem actually leads to the successful implementation of concurrent web based multitasking that improves the efficiency of utilizing resource for a computing device.

Abstract: Systems and methods for enhancing storage recollection in a shared storage system by enabling the recollection procedure to differentiate between open and abandoned transaction. An example method comprises: detecting, by a processing device, a transaction marker of a storage system, the transaction marker being stored on shared storage and indicating a modification of the shared storage is incomplete; determining, in view of a locking data structure on the shared storage, whether the transaction marker is associated with an abandoned modification; in response to the transaction marker being associated with an abandoned modification, releasing a portion of the shared storage associated with the abandoned modification; and destroying the transaction marker.

Abstract: Embodiments of the present systems and methods may provide a consistent hash function that provides reduced memory use and complexity, reduced computational complexity, and relatively low numbers of keys that must be reshuffled compared to current techniques. For example, in an embodiment, a computer-implemented method for controlling computing resources may comprise storing a set of labels of potential resources comprising a plurality of labels of working resources allocated to actual resources and a plurality of labels of reserved resources available to be allocated, generating an initial assignment to one of the set of labels of potential resources, when the assignment to one of a set of labels of potential resources is to one of the labels of reserved resources, reassigning the request to another label of a resource selected from a subset of the labels of potential resources, and repeating the reassigning until the request is assigned to a label of a working resource.

Abstract: The invention relates to a resource landscape system that allows users to identify issues with elements within the organization and implement changes to the elements utilizing a relational database that utilizes nodes for defining the elements and relationships between the elements. The resource landscape system and applications therein provide a holistic inventory of resources, threat vectors, controls, metrics, policies, rules, and/or the like. The resource landscape system may be implemented through one or more interfaces that allows users to view cross-references of the elements, identify the priority of the elements using the crossed-references, and/or identify element issues in the elements of the organization that could results in threats to the organization. Moreover, the invention allows for receiving changes to one or more of the elements and automatically updating the cross-references of the elements, the priority of the elements, and/or the element issues.

Abstract: A system and method to query, update, and reduce a size of locking data for a dataset including a fixed plurality of dimensions each having a fixed plurality of members comprising index tables for the dimensions and a locks table specifying one of a fixed plurality of lock states for the plurality of members, where the fixed plurality of members each have an associated index.

Abstract: Techniques are described herein for enhancing software application development and software design-for-test (DFT) technology by facilitating dynamic management and control of embedded dynamic test features via an application development and optimization platform. In some embodiments, an application development and optimization platform is described that can track, manage and rollout features of native mobile applications without the need to wait for public app store releases.

Abstract: Systems, methods, and software described herein to provide data to large-scale processing framework (LSPF) nodes in LSPF clusters. In one example, a method to provide data includes receiving an access request from a LSPF node to access data in accordance with a version of a distributed file system. The method further includes, responsive to the access request, accessing the data for the LSPF node in accordance with a different version of the distributed file system, and presenting the data to the LSPF node in accordance with the version of the distributed file system used by the LSPF node.

Abstract: A method for modifying a system-defined user interface control on a computing device is described. The method includes wrapping, on the computing device, a system-defined control within a programmer-defined control at run-time and modifying functionality of the system-defined control at run-time. Modifying functionality includes intercepting an initial message for a system-defined control, preventing the system-defined control from rendering and rendering a programmer-defined control in place of the system-defined control. Modifying functionality also includes intercepting a message for the system-defined control, determining whether the message requires modified functionality and providing modified functionality if the message requires modified functionality. Modifying functionality also includes sending the message to the system-defined control if the message does not require modified functionality and providing regular functionality if the message does not require modified functionality.

Abstract: Methods and systems for online collaboration. A method embodiment facilitates collaborative editing of a cloud-based shared document using a browser-enabled platform native application. A user launches a platform native application and establishes a non-browser connection between the platform native application and a remote cloud-based shared file facility. The non-browser connection operates independently from any browser connections even though the platform native application includes a document editor web app within the embedded browser. A first user retrieves a first user copy of the cloud-based shared document, modifies the document, and shares the modified document so as to be accessible by other collaborating users.

Abstract: Generally described, the present disclosure is directed to an eventually consistent replicated data store that uses, for its underlying storage, a computer software library that provides a high-performance embedded database for data. The replicated data store employs a plurality of hosts interconnected to one another, allowing for writes to any host and full awareness of membership across all hosts. With the data replication framework disclosed herein, various modes are allowed to be built up on top of the core system.

Abstract: A computer-implemented method, computer program product, and computing system is provided for encrypted document co-editing. In an implementation, a method may include receiving, at a first computing device, a first encrypted change set for a co-editable data object from a client, the first encrypted change set being encrypted by a first key. The method may include requesting a second key for re-encrypting the first encrypted change set. The method may include re-encrypting the first encrypted change set to generate a second encrypted change set using the second key.

Abstract: Branch objects are created from master objects, which allow collaborators to edit drafts of those branch objects. Collaborators' draft branch objects are submitted to the master object owner and changesets are generated to identify any changes proposed by collaborators with respect to the current content of the master object. Proposed changes from collaborators are presented to the master object's owner or their delegate for approval.

Abstract: Systems and methods are provided for predicting systematic design rule check (DRC) violations in a placement layout before routing is performed on the placement layout. A systematic DRC violation prediction system includes DRC violation prediction circuitry. The DRC violation prediction circuitry receives placement data associated with a placement layout. The DRC violation prediction circuitry inspects the placement data associated with the placement layout, and the placement data may include data associated with a plurality of regions of the placement layout, which may be inspected on a region-by-region basis. The DRC violation prediction circuitry predicts whether one or more systematic DRC violations would be present in the placement layout due to a subsequent routing of the placement layout.

Abstract: A method of encryption key management in a storage system having a plurality of nodes and more than one key manager, performed by the storage system, is provided. The method includes setting, in a first atomic operation to a distributed store of the plurality of nodes, a version identifier to a new value, and writing shards of a key encryption key, to node-specific memory of the plurality of nodes. The method includes committing the shards of the key encryption key by updating, in a second atomic operation, a set of version identifiers in the distributed store including a current version identifier, responsive to finding no change to the new value of the version identifier.

Abstract: Release and re-acquisition of each of a first shared lock on an outer database ownership table and a second shared lock on an inner database ownership table is alternated by a messaging engine processor that executes a messaging engine to permit database maintenance operations to be performed while maintaining the ownership of the database. At least one period of inactivity of both the outer database ownership table and the inner database ownership table is provided that allows at least one database tool to execute to perform at least one database maintenance task during the execution of the messaging engine.

Abstract: The present disclosure provides a method for information processing. The method is applied in an electronic device and comprises: acquiring, upon detecting that the electronic device has been switched from a first state to a second state, a priority list storing a priority of each application that is initiated by a user among all applications when the electronic device is switched to the first state again; and selecting one or more applications from the priority list for preloading. Also provided is an apparatus for information processing.

Abstract: A processing device receives a command from to execute a read operation. The processing device determines a memory component of media where the read operation will be executed using an address included with the read operation. The processing device determines that there is a read lock on the memory component. The processing device determines that a count of read operations dependent on the read lock has reached a read threshold. Based on this determination, the processing device adds the read operation to a read lock queue. The processing device executes a write operation prior to the read operation as a consequence of adding the read operation to the read lock queue.

Abstract: A computing system can include memory management capabilities. In one embodiment, the system receives a request to update a first size of each of a plurality of portions of memory to a second size. The plurality of portions of memory can be associated with a first memory pool and the first memory pool can be associated with a memory pool instance. The system creates a memory pool subinstance based on the request. The memory pool subinstance can be associated with the memory pool instance. The system associates a second memory pool with the memory pool subinstance. The second memory pool comprises portions of memory of the second size and the second memory pool is associated with the memory pool instance.

Abstract: A method and apparatus are described for assigning mastership of nodes to data blocks. A method involves connecting each session of a plurality of sessions to a particular node of a cluster of nodes based on services associated with the plurality of sessions. Each session of the plurality of sessions is associated with a respective service of a plurality of services. The method also involves collecting service-based access statistics aggregated by service and ranges of data block addresses. Each range corresponds to one or more contiguous subrange of data block addresses. The method further involves assigning mastership of the nodes to the data blocks having addresses within said ranges of data block addresses based on services associated with the nodes and the service-based access statistics.

Abstract: In example implementations, a method include receiving a request for a lock in a Mellor-Crummey Scott (MCS) lock protocol from a guest user that is context free (e.g., a process that does not bring a queue node). The lock determines that it contains a null value. The lock is granted to the guest user. A pi value is received from the guest user to store in the lock. The pi value notifies subsequent users that the guest user has the lock.

Abstract: A method includes caching content items in a cache memory of a communication terminal connected to a communication network. A content item, which is cached in the cache memory, is presented to a user of the communication terminal. An extent of freshness of the cached content item presented to the user is assessed. Presentation of the cached content item is conditionally modified depending on the assessed extent of freshness.

Abstract: A system for updating an index into a tuple table of tuples is provided. An indexing system updates an index into a tuple table using fine-grain locking of the index. The index includes a values table with an entry for each index value of an index field that references a value-tuple table that includes, for each tuple with the index value, a row that identifies a tuple of the tuple table with that indexed value. After a new tuple is added to the tuple table with a value, the index is updated by locking the entry in the values table, updating the value-tuple table for the value, and then unlocking the entry. When the index is accessed for locating tuples with a value, the accessor locks the entry in the values table for the value, uses the value-tuple table to locate the tuples, and unlocks the entry.

Abstract: Modeling methods include providing one or more data stores storing model components and in some cases threats, each threat associated with at least one model components. A relational diagram of a system, application or process is displayed on one or more user interfaces. The diagram includes visual representations of the model components and defines a model. In response to adding a model component to the model, a list of one or more model components associated with the added model component is displayed, along with an indication of whether the model components are required to be added to the model. In some implementations a threat report is displayed on a threat report interface and includes each threat that is associated through the data store(s) with one of the model components in the model. Modeling systems and threat modeling systems include systems configured to carry out the modeling and threat modeling methods.

Abstract: Disclosed is method for operating of an electronic device, including receiving a resource information list of a web content from a first server, receiving, from the first server, at least one resource included in the resource information list of the web content, and requesting at least one resource of the resource information list of the web content from a second server based on the received resource information list and the received at least one resource.

Abstract: Embodiments described herein provide for a multi-process model to support compiling applications for multiple platforms. In one embodiment, applications designed for execution on a mobile platform can be ported to and/or compiled for execution on a desktop/laptop platform without requiring modification of the core program code of the mobile application. The mobile application is executed using a multi-process (e.g., two or more process) model in which the core mobile application program generates content that is displayed by a host process. The host process enables automatic translation of program calls to generate mobile user interface elements into program calls that generate user interface elements of the host platform. The translation can be performed using a multi-process (e.g., two or more process) model in which the core application program generates content that is displayed by a host process.

Abstract: A method for encrypted data synchronization, wherein the method includes providing at least one data entity (100) including data content (110), accompanying metadata (120) including an entity key (140) usable for encrypting the data content (110), and synchronization metadata (130) usable for synchronizing the at least one data entity (100) between at least two first devices (400), wherein at least the entity key (140) of the accompanying metadata (120) and the synchronization metadata (130) are encrypted using a second key.

Abstract: A privacy management system that is configured to process one or more data subject access requests and further configured to: (1) enable a data protection officer to submit an audit request; (2) perform an audit based on one or more parameters provided as part of the request (e.g., one or more parameters such as how long an average request takes to fulfill, one or more parameters related to logging and/or tracking data subject access requests and/or complaints from one or more particular customer advocacy groups, individuals, NGOs, etc.); and (3) provide one or more audit results to the officer (e.g., by displaying the results on a suitable display screen).

Abstract: Systems and methods of the present disclosure are directed to efficiently editing data requests sent from devices, allowing for an improved database information delivery system. In some embodiments of the present disclosure, an administrator device limits an amount of data requested based on a number of factors prior to sending the request to a server. In some embodiments, a server, after receiving a request for refreshed data, reduces the amount of data requested based on a number of factors prior to retrieving the requested data from a source and delivering the requested data to an administrator device.

Abstract: Systems and methods are disclosed for debug session management. For example, methods may include receiving a request from a client device and, in response, identifying a set of instructions to be executed, wherein the set of instructions is associated with at least one breakpoint. The methods may include initiating execution of the set of instructions. The methods may include determining, based on a marker, that pausing execution of the set of instructions using a data structure is permitted, and responsive to this determination: pausing execution of the set of instructions before executing an instruction associated with a breakpoint, and updating the marker to indicate that execution of the set of instructions has paused using the data structure.

Abstract: Systems and method for implementing third party services in digital service platform are provided. More specifically, an application program interface can be provided by a first service provider to a second service provider. The application program interface can be configured to receive one or more access parameters and can be associated with implementing one or more services of the second service provider in one or more services of a second service provider. The one or more access parameters can then be received by the first service provider from the second service provider. Once the one or more access parameters have been received, the first service provider can receive a request from a user for access to the one or more services of the second service provider. The first service provider can then determine whether to grant access to the user based on the access parameters.

Abstract: A system and method for management and processing of resource requests is provided. A content delivery network service provider determines a class associated with a set of client computing devices and monitors resources requests for the determined class. The content delivery network service provider then identifies at least one cache component for providing content to client computing devices as a function of the determined class. In other embodiments, instead of cache components, the content delivery network service provider identifies a second set of client computing devices as a function of the determined class for providing the content information.

Abstract: A system for data storage for distributed access comprises a tool determiner and a tool interface. The tool determiner is for determining a tool for storing tagged data based at least in part on the tagged data. The tool comprises one of the following: an object tool, a file tool, or a database tool. The tool interface is for providing the tagged data, an access list, and one or more sharing locations to the tool. The tool stores the tagged data at each of the sharing locations.

Abstract: Provided are a computer program product, system, and method for performing conflict analysis of replicated changes among nodes in a network A first node and a second node include a first instance and second instance of a data set, respectively. The second node receives a first transaction replicated from the first node, applied to the first instance of the data set. The second node determines a conflict that would occur between the replicated first transaction and a second transaction applied to the second instance of the data set. A conflict policy is applied at the second node to perform a first action in response to determining the conflict. The conflict policy is applied to the first node to perform a second action at the first node to handle the conflict when the first node receives a replication of the second transaction to the second instance of the data set.

Abstract: Embodiments of the present systems and methods may provide a consistent hash function that provides reduced memory use and complexity, reduced computational complexity, and relatively low numbers of keys that must be reshuffled compared to current techniques. For example, in an embodiment, a computer-implemented method for controlling computing resources may comprise storing a set of labels of potential resources comprising a plurality of labels of working resources allocated to actual resources and a plurality of labels of reserved resources available to be allocated, generating an initial assignment to one of the set of labels of potential resources, when the assignment to one of a set of labels of potential resources is to one of the labels of reserved resources, reassigning the request to another label of a resource selected from a subset of the labels of potential resources, and repeating the reassigning until the request is assigned to a label of a working resource.

Abstract: In various embodiments, methods and systems for providing access to file systems are provided. An SFA-based operation having an operation modifier for a file in a file system is received. The SFA-based operation is defined based on a file-representational state transfer (REST) interface. The SFA-REST interface comprises integrated functionality of an SFA protocol and REST protocol. The SFA-based operation is executed using the operation modifier. A REST-based operation for the file in the distributed file storage is received. The REST-based operation is defined based on the SFA-REST interface. The operation modifier is referenced in order to execute the REST-based operation. The REST-based operation based on the SFA-REST interface. A schema can be implemented for accessing the file system. The schema includes tables to store files, the table comprises fields corresponding to elements of a SFA-REST interface. A snapshot component can be implemented to backup file shares in the file system.

Abstract: The present disclosure provides systems and techniques for efficient locking of datasets in a database when updates to a dataset may be delayed. A method may include accumulating a plurality of updates to a first set of one or more values associated with one or more features. The first set of one or more values may be stored within a first database column. Next, it may be determined that a first database column update aggregation rule is satisfied. A lock assigned to at least a portion of at least a first database column may be acquired. Accordingly, one or more values in the first set within the first database column may be updated based on the plurality of updates. In an implementation, the first set of one or more values may be associated with the first lock.

Abstract: A system according to certain aspects improves the process of managing jobs and allocating resources to those jobs. The system can include a job manager that processes and generates resource allocation requests for a plurality of jobs and a resource allocator that allocates computing resources for the plurality of jobs based on the resource allocation requests. The process of allocating resources may involve locking one or more resource objects before allocating the computing resources for the plurality of jobs and unlocking the locked resource objects after the computing resources have been allocated for the plurality of jobs.

Abstract: Disclosed herein are system, method, and computer program product embodiments for the detection and resolution of conflicts in data synchronization. An embodiment operates by receiving an upload from a user device of one or more changes to a local copy of a master document. A conflict is identified between the one or more uploaded changes and one or more previous changes to the master document. A super user is notified of the conflict. A resolution of the conflict is received. The resolution to resolve the conflict is applied.

Abstract: A method performed by a computing system includes receiving instructions from a user to divide content of a message into a plurality of parts, associating a part identifier with each of the plurality of parts, encrypting each of the plurality of parts with a different key, receiving, from the user, a list of recipients of the message and access privileges associated with each recipient in the list, the access privileges indicating which of the plurality of parts each recipient is authorized to access, transmitting the message to each of the recipients, and transmitting the access privilege data, the encryption keys for each of the parts, and the part identifiers for each of the parts to a security authority.