Abstract: Transient duplicate key violations of unique key constraints are handled during row updates. Row changes are buffered until a point is reached that those changes are safe to execute. Row changes are effectively reordered to avoid constraint violations during execution of updates. In response to receiving a constraint key violation from a server after an attempted update, a client locally stores a record containing information regarding the failed update. Later, in response to the lack of receipt of an error in response to another update to the same column of the same table, the client uses the information in this record to instruct the server to attempt to repeat a failed update that previously attempted to change the value of a row to a value that was present in a uniqueness-constrained column at the time of the failure, but is no longer present due to the successful update.

Abstract: Read-only nodes of a distributed database system may implement index structure navigation using page versions. A read request may be received at a read only node of a distributed database for select data. Data pages linked together to form an index structure for data stored for the distributed database may be navigated according to versions maintained for the data pages in order to identify one or more locations to access for the select data. One or more prior versions of data pages may be selected as part navigating the index structure according to a consistent view of the distributed database associated with the read request. Change notifications may also be received at the read-only node modifying the data pages of the index structure. The index structure modifications may be applied without blocking the index structure navigation for servicing the read request.

Abstract: A method and information handling system configured to executing instructions of an SSD dynamic optimization buffer switching system and configured to detecting SSD storage capacity utilization via an SSD controller. The method and information handling system further configured to reallocate buffer capacity from write acceleration buffer capacity to garbage collection buffer capacity to increase buffer availability for garbage collection when SSD storage capacity utilization exceeds a threshold level.

Abstract: Computer-implemented systems and methods are disclosed for indexing and aggregating proxy server data. In accordance with some embodiments, the systems comprise a memory device configured to store a set of instructions, and one or more processors configured to execute the set of instructions to receive a plurality of log lines of proxy server data comprising a plurality of data components and index one or more of the plurality of data components for the plurality of log lines. The processors also generate a plurality of log data records, each including the one or more indexed data components, and generate a summarized data record by aggregating one or more log data records having at least one matching indexed data component.

Abstract: A robot control device which can exchange data with a plurality of robot control devices and with a storage medium which stores setting data of the robot control device, which robot control device can compare setting data which is set a specific robot control device and setting data which is set at another robot control device and setting data which is stored in the storage medium, at least two, for each item, display items with differences between the compared setting data, and reflect that selected setting data.

Abstract: A method is disclosed for providing an updated management object to an agent. The method includes the agent specifying the updated management object, and a device management client providing the updated management object.

Abstract: Examples disclosed herein provide systems, methods, and software to provide individualized applications to remote desktop sessions. In one example, a method of operating a remote desktop server to provide individualized applications to remote desktop users includes identifying a request from a user for a remote desktop session. The method further includes, in response to the request, identifying one or more applications associated with the user that are stored in at least one hidden volume, and virtually overlaying application objects associated with the one or more applications in at least one non-hidden volume. The method also provides initiating the remote desktop session with the at least one non-hidden volume accessible to the user.

Abstract: A system and method are disclosed for incrementally updating an existing digital map of a client device in a digital map update system. The digital map update system comprises, for each of one or more baseline digital maps, at least one digital map update repository comprising data which may be communicated to one or more remote client devices for use by the or each remote client device in incrementally updating an existing digital map of the device. Each repository includes one or more digital map forward update journals in respect of a respective given version of the baseline map to which the digital map update repository relates. The forward update journal comprises data indicative of a set of one or more incremental updates that may be used to update the given version of the baseline map to a later version.

Abstract: To provide efficient table partitioning, a database is described for distributively locating a plurality of sub-tables resulting from partitioning of a table in a database. This includes an acquiring section that monitors access occurrences to each of the sub-tables to acquire a history of access occurrences. Also a deciding section decides a table storage area in which a sub-table is to be located, based on the history of access occurrences to each of the sub-tables.

Abstract: Impact analysis for business applications can include receiving an event for a business application system, wherein the event specifies a change to an artifact of the business application system, and determining a node of a directed graph to which the event applies as a source node. The directed graph represents the business application system. The directed graph is formed by a plurality of nodes joined by links, wherein each node represents an artifact of the business application system and each link specifies semantic data indicating a dependency between the nodes joined by the link. Impact analysis further includes determining, using a processor, artifact assessment data for a first node connected to the source node through a first link, wherein the artifact assessment data includes a type of an effect of the event upon the first node and a context for the effect.

Abstract: The disclosed computer-implemented method for detecting suspicious applications based on how entry-point functions are triggered may include (1) identifying an application that is capable of accessing a data-access Application Programming Interface (API) programmed to provide access to sensitive information located on a computing system and/or a data-transfer API programmed to send information outside of the computing system, (2) identifying an entry-point function of the application whose execution results in a call to the data-access API and/or the data-transfer API, (3) determining how the entry-point function is triggered, (4) determining whether the application is suspicious based on how the entry-point function is triggered, and (5) performing a security action based on whether the application is suspicious. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A method for indexing objects in a computerized system having an index, comprising identifying in the computerized system an at least one indexed object that meets an at least one criterion related to contents of the at least one indexed object, detecting an at least one non-indexed object having a property similar to an at least one property of the at least one indexed object that was identified, and indexing the at least one non-indexed object in the index, wherein the method is performed by the computerized system, and an apparatus for performing the same.

Abstract: A technique is introduced that enables one or more mechanisms to collect storage and transfer utilization metrics for an account in a distributed data storage system that are more scalable and robust than conventional ways. The technique includes a method comprising, for each of the nodes, of collecting storage utilization data for a one account. The method further includes, for each proxy server, collecting transfer utilization data for the one account. The method further includes, at the controller, generating a cluster account interval (CAI) data based on a raw storage data file and an aggregated transfer data file. The CAI data include storage and transfer utilization data over a predetermined time span.

Abstract: An electronic apparatus and a method for temporarily storing data thereof, adapted to temporarily store the data downloaded from a remote apparatus, are provided. In the method, an access instruction to the remote apparatus is captured, and accordingly a file requested by the access instruction or metadata of all files and subfolders under a folder requested by the access instruction is downloaded and temporarily stored in a storage unit, in which a usage time of the temporarily stored file is recorded. When a specific condition is met, the usage time of all the temporarily stored files is checked and at least one file that is not accessed for the longest time is deleted accordingly. The folder having the deleted file is checked whether not to include data of any file, and accordingly the metadata of all the files and subfolders under the folder is deleted.

Abstract: A method and an apparatus for processing data and a computer system are provided. The method includes copying a shared virtual memory page to which a first process requests access into off-chip memory of a computing node, and using the shared virtual memory page copied into the off-chip memory as a working page of the first process; and before the first process performs a write operation on the working page, creating, in on-chip memory of the computing node, a backup page of the working page, so as to back up original data of the working page. Before a write operation is performed on a working page, page data is backed up in the on-chip memory, so as to ensure data consistency when multiple processes perform an operation on a shared virtual memory page while accessing off-chip memory as less as possible and improving a speed of a program.

Abstract: A program execution device capable of protecting a program against unauthorized analysis and alteration is provided. The program execution device includes an execution unit, a first protection unit, and a second protection unit. The execution unit executes a first program and a second program, and is connected with an external device that is capable of controlling the execution. The first protection unit disconnects the execution unit from the external device while the execution unit is executing the first program. The second protection unit protects the first program while the execution unit is executing the second program.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating signatures for source code elements. One of the methods includes generating a respective signature for each source code element of the plurality of source code elements, including obtaining a name of the source code element, obtaining one or more of a location of a compilation unit containing the source code element and contents of the compilation unit containing the source code element, and generating the signature including combining a first representation of the name of the source code element and one or more of a second representation of the location of the compilation unit and a third representation of the contents of the compilation unit containing the source code element, wherein at least two of the plurality of source code elements have a same name and different respective signatures.

Abstract: According to some embodiments, it may be determined that a plurality of hybrid database version upgrade migrations are to be performed. Each upgrade migration may include, for example, a schema change portion and a data change portion. A first database migration tool instance may be automatically run to perform the upgrade migration schema change portions. Similarly, a second database migration tool instance may be automatically run to perform the upgrade migration data change portions, wherein the second instance is not run until the first instance is complete.

Abstract: A method is provided to verify the computational results of a transaction processing system utilizing cloud resources. A transaction is allowed to modify an application's state only if the validity of the result of the processing of the transaction is verified across the majority of the participating child nodes in the cloud. Otherwise, the transaction is aborted.

Abstract: A method, computer program product, and system maintain virtual product data (VPD) in a computer system. The method includes a processor obtaining a first indicator, which may indicate a repair has commenced in a computer system or an initial program load has commenced in the computer system, accessing VPD related to the computer system, and duplicating the VPD to create a copy of the VPD. The processor stores the copy of the VPD in at least one computing element internal to the processor or accessible to the processor via a communications network. The processor obtains a second indicator that indicates that the initial program load is complete or that the repair process is complete, compares the VPD to the copy of the VPD, and determines whether to replace at least a portion of the VPD with at least a portion of the copy of the VPD.

Abstract: Techniques are disclosed for managing a file stored in an enterprise content management (ECM) repository. In response to a check-out request from a client machine for a file stored in the ECM repository, a management application for an ECM system identifies ECM-related metadata associated with the file. The management application stores the ECM-related metadata into the file (or an associated file) prior to sending the file to the client. At check-in for the file, the management application identifies the location of the corresponding file in the ECM repository using the metadata previously stored in the file sent to the client.

Abstract: According to one aspect, provided is a horizontally scaled database architecture. Partition a database enables efficient distribution of data across a number of systems reducing processing costs associated with multiple machines. According to some aspects, the partitioned database can be manages as a single source interface to handle client requests. Further, it is realized that by identifying and testing key properties, horizontal scaling architectures can be implemented and operated with minimal overhead. In one embodiment, databases can be partitioned in an order preserving manner such that the overhead associated with moving the data for a given partition can be minimized during management of the data and/or database. In one embodiment, splits and migrations operations prioritize zero cost partitions, thereby, reducing computational burden associated with managing a partitioned database.

Abstract: This disclosure relates to database systems and, more particularly, to database systems with version controlled data. A version controlled database program resides on a computer readable medium, having a plurality of instructions stored thereon, which, when executed by a processor, cause the processor to perform operations. The operations include defining a version object software layer. The version object software layer may be configured to read and write data of a version controlled database to a physical storage medium, maintain one or more versions of at least one element of the data, and provide access to the data. The operations may also include defining a database management software layer. The database management software layer may be configured to read and write data to the version object software layer and provide a database access interface for accessing the data.

Abstract: Techniques for cloning, writing to, and reading from file system metadata. Cloning involves identifying a first set of pointers included in a first root node in a file system metadata tree structure that stores file system metadata in leaf nodes of the tree structure, creating a first copy of the first root node that includes the first set of pointers, creating a second copy of the first root node that includes the first set of pointers, associating the first copy with a first view, and associating the second copy with a second view. Reading generally involves traversing the tree structure towards a target leaf node that contains data to be read. Writing generally involves traversing the tree structure in the same manner, but also creating copies of any nodes to be modified if those nodes are deemed to have a different treeID than a particular root node.

Abstract: A system and method for automatically optimized statistical analysis by computer is disclosed. Given a programmatic definition of the data model, the system generates, manages, and interfaces optimized computer code for use by higher level client applications. The method by which the computer generated code is transparently compiled and linked for remote access by clients provides near peak numerical efficiency without any human optimization in the client space. The configuration of model subsystems is designed to allow flexible general purpose analytics as well as specialized machine learning through optimizing feedback mechanisms.

Abstract: A system for determining a time that a file was created and associating an ID with the file based on the file creation time is disclosed. The system adjusts the creation time by a time zone offset. In the case of image files, the file creation time may be based on information associated with the image: (1) by the camera that took the picture (exchangeable image file data); (2) when the photo was last modified in memory (file modification time data); (3) based on the raw date and time the photo file was created (file date-time data); and (4) when the photo was imported onto a client device. The system may rename the file with this adjusted creation time to create a standardized name. As a result, the standardized name provides a filename nomenclature that is based on the actual or estimated time of when the file was created.

Abstract: Disclosed are methods and apparatus for providing version control for a model. A database (102) is divided into three logical areas corresponding to working model area (120), full model area (122), and permanent model area (124). Data, which may be CIM formatted data, imported into the model is validated against data previously stored in the full model area (122) and version controlled based in part on timestamp data. The version controlled data may then be exported for use by network applications. Imported data may come from a power system utility while the exported data may be used for control of such a utility.

Abstract: Embodiments are described for a method of distributing n-tuples over a cluster of triple-store machines, by storing each n-tuple as text in a distributed file system using a key value store; providing each machine of the cluster with a resident semantic data lake component accessing one or more persistent RDF triplestores for the n-tuple data stored on each machine; and defining one part of each n-tuple as a partition variable to ensure locality of data within each respective n-tuple. A method includes inserting graphs into a key/value store to determine how the key/value store distributes the data across a plurality of servers, by generating textual triple data, and storing the triple data in key-value stores wherein a fourth element of the triple comprises the key, and a value associated with the key comprises all the triples about a subject; indexing the data in the key-value store in an RDF triplestore using a partition based on the fourth element.

Abstract: A database system may maintain a plurality of log records at a distributed storage system. Each of the plurality of log records may be associated with a respective change to a data page. Upon detection of a coalesce event for a particular data page, log records linked to the particular data page may be applied to generate the particular data page in its current state. Detecting the coalesce event may be a determination that the number of log records linked to the particular data page exceeds a threshold.

Abstract: A storage manager may be used to perform a decoding operation using a transmission time refinement technique on a data object stored in a storage system, such as an object-redundant storage system. The decoding operation may include requesting groups of corresponding blocks from storage devices of the storage system. The storage manager may maintain connections to a connection group of the storage devices and may iteratively request corresponding blocks of the data object from one or more various request groups of the storage devices of the connection group. The storage manager may evaluate performance of the request groups in sending the corresponding blocks of the data object and may modify the membership of the request groups for requests for subsequent blocks of the data object based at least in part on the performance of the request groups.

Abstract: Methods for determining the representation of time-dependent attributes stored in a database and extracting data according to the representation of the time-dependent attributes are described. In some cases, a time-dependent attribute may comprise a time scale varying attribute (TSV) in which a sum may be computed for any date range. In some embodiments, a time-dependent attribute may be represented as a Character Large Object (CLOB) that encodes information about the time-dependent attribute in a text string and may be accessed by table functions. Alternatively, some time-dependent attributes may also be represented as Binary Large Objects (BLOBs) that are used to populate timeslicing tables. Upon receiving a query for data pertaining to a stored time-dependent attribute, a system identifies whether the stored time-dependent attribute is represented as a CLOB or a BLOB, and generates the queried data in a manner dependent on the representation of the time-dependent attribute.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for facilitating spin mode-based dynamic updating of application servers in an on-demand services environment. In one embodiment and by way of example, a method includes upgrading a first set of application servers of a plurality of application servers at one or more computing devices, holding a first set of requests received at the first set of application servers from being processed while the first set of application servers is being upgraded, and upgrading a second set of application servers of the plurality of application servers upon completion of the first set of application servers. The method may further include holding a second set of requests received at the second set of application servers from being processed while the second set of application servers is being upgraded, and resuming processing of the first set of requests at the upgraded first set of application servers.

Abstract: A method and an arrangement for providing keys for protecting communication between a terminal (300) and service points in a communication network. A basic key (Ik) is first established with a service control node (304) when the terminal has entered the network. An initial modified key (Ik1) is then created in both the service control node and the terminal, by applying a predetermined first function (f) to at least the basic key and an initial value of a key version parameter (v). The initial modified key is sent to a first service point (302), such that it can be used to protect communication between the terminal and the first service point. When the terminal switches to a second service point (306), the first service point and the terminal both create a second modified key (Ik2) by applying a predetermined second function (g) to the initial modified key, and the first service point sends the second modified key to the second service point.

Abstract: Methods, systems and apparatuses for selecting graphics data of a server system for transmission are disclosed. One method includes reading data from memory of the server system, checking if the data is being read for the first time, checking if the data was written by a processor of the server system during processing, comprising checking if the data is available on a client system or present in a transmit buffer, placing the data in the transmit buffer if the data is being read for the first time and was not written by the processor during the processing as determined by the checking if the data was written by the processor of the server system during processing, wherein if the data is being read for the first time and was written by the processor of the server system during processing the data is not placed in the transmit buffer.

Abstract: A communications platform (Centerpost) is disclosed containing a message processing platform along with an XML message format (SmartMessage) which provides for the reception, organization, summarization, filing, storage, synthesis, routing, formatting, and intelligent processing of XML-based electronic messages and SMTP electronic mail from corporations and other senders to fully integrate individuals' existing e-mail boxes, cellular telephones, paging equipment, facsimile machines, wireless and wired telephones, and other devices. The Centerpost platform utilizes a nickname-based routing to enable device specific sending without knowledge of the specific device address. The Centerpost platform provides sender-defined information folios, which enable synthesized filing, viewing and storage of all received SmartMessages, and the platform allows semi-private access control for the user, which allows access by others.

Abstract: Example methods and apparatus are provided for configuring a process control device. An example method includes implementing a first configuration at the process control device based on a first configuration request. The example method includes setting a configuration flag. The configuration flag indicates the first configuration is being implemented. The example method includes denying a second configuration request while the configuration flag is set.

Abstract: A method for using an undo stack to explore past actions and apply new actions to previous states in a data view. The method includes detecting a change in an application data view. The application then displays an undo stack and stores the data change in the application data view to the undo stack. Upon detecting a selection of the undo stack entry for undo, the application returns the application data view to the state represented by the undo stack entry. The method further includes providing a user interface allowing a user to perform operations on undo stack entries. Responsive to the user utilizing the user interface and making selections, the application then adjusts the application data view state based on the performed actions.

Abstract: Methods and systems to build and utilize a search infrastructure are described. The system generates index information components in real-time based on a database that is time-stamped. The system updates index information at a plurality of query node servers based on the index information components. A query engine receives a search query from a client machine and identifies search results based on the query and the index information. The system communicates the search results, over the network, to the client machine.

Abstract: A method for editing a computer-aided design model for developing electronic control units in a design environment, whereby the design model comprises at least one model object with first data. The method begins with the reading of all model objects of the design model and the reading of an allocation list, which assigns a particular globally unique key to each model object. If the first data are available, the reading of the first data from a first memory location follows. Then, assignment of the first data to the model object based on the globally unique key occurs, so that the first data are available during editing of the design model. If the first data are not available, assignment of the globally unique key to the model object occurs, so that the globally unique key is available during tediting of the design model.

Abstract: A distributed database system may perform a single phase commit for transactions involving updates to multiple databases of the distributed database system. A client request may be received that involves updates to multiple database of the distributed database system. The updates may be performed at a front-end database and a back-end database. Log records indicating the updates to the front-end database may be sent to the back-end database. The log records and the updates performed at the back-end database may be committed together as a single phase commit at the back-end database. In the event of a system failure of the front-end database, log records may be requested and received from the back-end database. A restoration of the front-end database may be performed based, at least in part, on the received log records.

Abstract: The disclosed embodiments relate to a system that facilitates developing applications in a component-based software development environment. This system provides an execution environment comprising instances of application components and a registry that maps names to instances of application components. Within the registry, each entry is associated with a list of notification dependencies that specifies component instances to be notified when the registry entry changes. Upon receiving a command to display notification dependencies for the registry, the system generates and displays a dependency graph containing nodes representing component instances and arrows between the nodes representing notification dependencies between the component instances. Upon receiving a command to display a timeline for with the registry, the system generates and displays a timeline representing events associated with the registry in chronological order.

Abstract: For each of a plurality of different tenants configured to concurrently execute in a virtual environment, a respective class loader graph can be constructed. For each respective class loader graph, unique types of edges between nodes that affect class loading can be identified. The edges can be traversed. Based on traversing the edges of the class loader graph, a respective unique dependency identifier (UDI) can be assigned to each class loader request. Class loader requests that are assigned the same UDI can be identified in at least two of the tenants. Responsive to identifying the class loader requests that are assigned the same UDI, a shared class loader can be assigned to each of the class loader requests. Each respective class loader request that is assigned the same UDI can be configured to call the shared class loader to load at least one class required by the respective tenant.

Abstract: For each of a plurality of different tenants configured to concurrently execute in a virtual environment, a respective class loader graph can be constructed. For each respective class loader graph, unique types of edges between nodes that affect class loading can be identified. The edges can be traversed. Based on traversing the edges of the class loader graph, a respective unique dependency identifier (UDI) can be assigned to each class loader request. Class loader requests that are assigned the same UDI can be identified in at least two of the tenants. Responsive to identifying the class loader requests that are assigned the same UDI, a shared class loader can be assigned to each of the class loader requests. Each respective class loader request that is assigned the same UDI can be configured to call the shared class loader to load at least one class required by the respective tenant.

Abstract: A web browser sends to a web-application server a request to access a web application. The web server transmits to the web browser a parent document with an inline frame (iframe) containing a Uniform Resource Locator (URL) to an authentication location. In response, a child document is transferred to the web browser. The child document occludes the parent document and presents a user interface for user authentication. Rather than wait until authentication is complete to begin transferring prerequisite files, the web-application server at least partially transfers to the web browser prerequisite files for the web application during the authentication process. This reduces the post-authentication delay involved in transferring prerequisite files, improving the user experience.

Abstract: A content replication system can cache nameless Content Object across multiple replica servers in a Content Centric Network (CCN). During operation, a CCN client can obtain a nameless Content Object from one or more content-hosting services by disseminating an Interest for a data collection, and receives a Content Object that includes a manifest for the data collection. The manifest can include Content Object hash (COH) values for a set of other Content Objects of the data collection. The client then determines a name prefix for a content-hosting service that hosts the data collection, and generates another Interest for a Content Object of the data collection. This Interest's name includes the name prefix for the content-hosting service, and also includes a COH value for the respective Content Object. The client disseminates the new Interest over CCN to obtain the respective Content Object of the data collection.

Abstract: Resolving conflicting changes to structured data files. A method includes for a structured data file which has both a generic structure and dialects built on top of the generic structure, for which conflicting changes have been made, and where an original version of the structured data, a first version of the structured data and a second version of the structured data exist, determining a dialect of the structured data. The method further includes, based on the determined dialect performing at least one of merge or diff operations on the original version of the structured data, the first version of the structured data and the second version of the structured data.

Abstract: Techniques are provided for managing caches in a system with multiple caches that may contain different copies of the same data item. Specifically, techniques are provided for coordinating the write-to-disk operations performed on such data items to ensure that older versions of the data item are not written over newer versions, and to reduce the amount of processing required to recover after a failure. Various approaches are provided in which a master is used to coordinate with the multiple caches to cause a data item to be written to persistent storage. Techniques are also provided for transferring data items and locks associated with the data items from one node to another.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to merging artifacts in a version control system and provide a novel and non-obvious method, system and computer program product for compositing deltas when merging artifacts in a version control system. In one embodiment, a method for compositing deltas for artifacts can be provided. The method can include generating deltas for a contributor artifact of an ancestor artifact, identifying interrelated ones of the deltas and grouping the interrelated ones of the deltas into a composited set of deltas. The method further can include rendering the composited set of deltas in a hierarchical view of a compare view for a version control data processing system in a development platform.

Abstract: The disclosed embodiments provide a system that facilitates the development and compilation of a software program. During operation, the system obtains a set of compilation units to be used in the software program and a version order associated with a programming language of the compilation units. Next, for each compilation unit from the set of compilation units, the system uses the version order to select a version of the programming language that is compatible with the compilation unit. The system then uses the version to compile the compilation unit.

Abstract: Arrangements described herein relate to versioning configurations of reusable artifacts. An artifact baseline corresponding to the present version of a first artifact can be created. Responsive to creating that artifact baseline, the present version of the first artifact, and present versions of children artifacts of the present version of the first artifact, are made immutable. Responsive to identifying a change to the present version of the first artifact, a new version of the first artifact can be automatically created, wherein the new version of the first artifact is mutable.