Abstract: Method and systems for data retrieval is provided. A query is received to search for metric data corresponding to a component of a datacenter, the component of the datacenter identified by a metric instance. An index is searched for the metric instance, the index comprising the metric instance synchronously stored in a flattened format. Further, a slot identification corresponding to the metric instance is determined, the slot identification identifying a location of the metric data in an inventory. Based on the determined slot identification, metric data is retrieved from the inventory, the inventory comprising the metric data asynchronously stored in an unflattened format. Additionally, a query result comprising the metric data corresponding to the search is communicated.

Abstract: A display control apparatus includes a recognizing unit configured to recognize a position of an operator and a position of a hand or the like of the operator, a calculating unit configured to regard a position of the operator in a screen coordinate system set on a screen as an origin of an operator coordinate system and multiply a position of the hand or the like with respect to the origin of the operator coordinate system by a predetermined function, thereby calculating a position of display information corresponding to the hand or the like in the screen coordinate system, and a control unit configured to cause the display information to be displayed at the position in the screen coordinate system calculated by the calculating unit.

Abstract: Method, apparatus and product for data cloning in a memory-based file systems. A content of each object of the file system is retained in data units and represented using a tree of the nodes comprising tree nodes and leaf nodes. The file system utilizes a volatile resource usage collection and volatile reference counters for each node of the nodes. In response to mounting the file system, a storage retaining a file system metadata is scanned to compile the volatile resource usage collection and the volatile reference counters. In response to a determination to reuse a pointed node of a tree of an object by a pointing node, a volatile reference counter of the pointed node is updated and the pointing node is atomically set, using a single instruction, to point to the pointed node.

Abstract: Disclosed herein are embodiments of a cloud data synchronization system enabling an user operating a mobile client device to download mission-specific data sets from a fixed cloud-based server system to a database of the mobile client device, and then use the downloaded data sets independently on the mobile client device when the mobile client device is disconnected from a network connecting to the fixed cloud-based server system. When connectivity to the fixed cloud-based server system is re-established by the mobile client device in an intermittent and bandwidth-limited communication network environment, the fixed cloud-based server system may provide bi-directional data synchronization between records of the fixed cloud-based server system and the mobile client device to update the data sets on the fixed cloud-based server system and the mobile client device while operating in the intermittent and bandwidth-limited communication network environment.

Abstract: A method and technique for allocation and balancing of storage resources includes monitoring, for each of a plurality of storage controllers, an input/output (I/O) latency value based on an I/O latency associated with each storage volume controlled by a respective storage controller. A network bandwidth utilization value and a network latency value corresponding to each storage controller is also monitored. An I/O latency value threshold, a network bandwidth utilization threshold, and a network latency value threshold is determined. Responsive to at least one of the I/O latency value, the network bandwidth utilization value and the network latency value for at least one storage controller exceeding a respective threshold, storage volume distribution among the storage controllers is rebalanced.

Abstract: Systems and methods for integrating the lifecycle of nonvolatile memory blocks with the transactional guarantees of a database are disclosed. One method includes creating a first fragment of a first database column in a volatile memory system, receiving a first pointer to a first block of a second non-volatile memory (NVM) system, the first block associated with the first fragment of the first database column, and populating the first block of the second non-volatile memory system using the first pointer. The method further includes committing the first block of the second non-volatile memory system and associating a first block identifier of the first block of the second non-volatile memory system with the first fragment of the first database column, while blocking creation of a database savepoint, and then unblocking creation of the database savepoint. A block key associated with a first fragment may comprise various identifiers such as block, column, table and partition identifiers.

Abstract: Systems and methods for providing more efficient handling of I/O requests for clustered file system data subject to data migration or the like. For instance, exemplary systems can more quickly determine if certain files on primary storage represent actual file data or stub data for recalling file data from secondary storage. Certain embodiments utilize a driver cache on each cluster node to maintain a record of recently accessed files that represent regular files (as opposed to stubs). A dual-locking process, using both strict locking and relaxed locking, maintains consistency between driver caches on different nodes and the data of the underlying clustered file system, while providing improved access to the data by the different nodes. Moreover, a signaling process can be used, such as with zero-length files, for alerting drivers on different nodes that data migration is to be performed and/or that the driver caches should be flushed.

Abstract: An embodiment of the invention may include a method, computer program product and system for processing a transaction. The embodiment may include receiving a transaction request by a first transaction processing monitor from a plurality of transaction processing monitors. The transaction request contains details for updating a global database. The embodiment may include determining whether the global database has begun updating based on the transaction request. Determining whether the global database has begun updating includes checking a transaction state database. The embodiment may include determining that the global database has not begun updating, and updating an entry in the global database based on the details contained in the transaction request.

Abstract: An apparatus in one embodiment comprises at least one processing device having a processor coupled to a memory. The processing device is configured to initiate distributed computations across a plurality of data processing clusters associated with respective data zones, and to combine local processing results of the distributed computations from respective ones of the data processing clusters. Each of the data processing clusters is configured to process data from a data source of the corresponding data zone using a local data structure and an associated computational framework of that data processing cluster. A first one of data processing clusters utilizes a first local data structure configured to support a first computational framework, and at least a second one of the data processing clusters utilizes a second local data structure different than the first local data structure and configured to support a second computational framework different than the first computational framework.

Abstract: An apparatus in one embodiment comprises at least one processing device having a processor coupled to a memory. The processing device is configured to initiate distributed computations across a plurality of data processing clusters associated with respective data zones, and to combine local processing results of the distributed computations from respective ones of the data processing clusters. The data processing clusters are configured to perform respective portions of the distributed computations by processing data local to their respective data zones utilizing at least one local data structure configured to support at least one computational framework. A first one of data processing clusters is implemented in a first cloud of a first type provided by a first cloud service provider. At least a second one of the data processing clusters is implemented in a second cloud of a second type different than the first type, provided by a second cloud service provider.

Abstract: A method for optimizing data access in a data warehouse having a model driven architecture is provided. A data model for storing time series measurement data representing a plurality of dimensions and measurements is received. The data model includes one or more aggregation tables. A query having one or more predicates is received from a user. The one or more predicates are analyzed to determine whether the received query can be optimized using the existing aggregation tables. The received query is optimized using the aggregation tables, in response to determining that such query optimization is possible.

Abstract: A service platform processes telemetry data streams communicated by remote data sources, such as telematics devices located on-board a population of vehicles. The service platform includes two data processing stacks having different performance parameters. A high performance data processing stack includes a first application layer and a first database layer that collectively exhibit lesser latency between write/read persistency for a given task load. A low performance data processing stack includes a second application layer and a second database layer that collectively exhibit greater latency between write/read persistency for the same task load as compared to the high performance data processing stack. For each telemetry data stream received from a data source, depending on an operating state of that data source, messages of the data stream are directed to the high performance data processing stack or to the low performance data processing stack for processing.

Abstract: Systems and methods are provided to log changes to a database on a transaction processing system. A tracking engine identifies an uncompleted transaction to be joined, joins the uncompleted transaction, and collects non-durable attributes of the joined uncompleted transaction. A logging engine makes durable the non-durable attributes by logging the non-durable attributes.

Abstract: An analytics module may be embedded into an application developed, published, or used by an entity in addition to the owner of the data under analysis. An access token may be submitted by the analytics module to a provider of hosted services. The access token may correspond to an n-dimensional cube containing data at a level of granularity permitted to the application. The access token may incorporate additional policies controlling access to the corresponding n-dimensional cube.

Abstract: Embodiments of the invention are directed to a system, method, or computer program product for creating channel accessible single function micro services used for light analytics. The micro services are built as small transferable modules to be a single function high efficiency small module. The micro services are generated for a specific single function, then deployed at an interface lever and stored to an associate device at any communication channel associated with an entity. The micro services require specific programming and are generated for a specific data collection process light analytics function. The micro services translate the extracted data into a readable format and transmit, via secure communication network, the translated data to a custom build database for subsequent light analytics framework implementation.

Abstract: This disclosure in part describes systems, devices, and methods for exchanging and processing data measures and objects to enable collaboration between systems through network interfaces. In one embodiment, multiple systems communicate with one another via a computer network using communication objects, which can reduce disconnection inefficiencies in network communication between the multiple systems. The generation, transmission, and processing of such communication objects enables an ecosystem of networked systems to dynamically be created, supported, and evolve so as to facilitate improved collaboration between organizations utilizing the networked systems. The communication objects additionally enable the communication of data between systems with a limited number of user inputs.

Abstract: Disclosed is a system and method for cross enterprise collaboration for processing a transaction request. The method includes a mechanism for collaboration to resolve context specific tasks in a structured manner requiring inputs from various stakeholders situated in different enterprises. The metadata associated with each of the activities in the workflow is collected to create a workflow. The method further allows the role-based users to extend the workflow by authoring customized activities and share context specific information and artifacts. The method includes memory efficient version of doubly linked list using one address field for every node to process one or more transaction requests at a given point of time.

Abstract: A system for intelligently determining changes to a service provider user's parameters in the service provider system. The system generally includes a service provider's computer system which contains a computer and a user database stored thereon; a user carried service provider tool, such as an ATM card, a cell phone, and the like; and a remote device whose use by the user is monitored by the service provider, such as an ATM machine (e.g., if the service provider is a bank and the service provider tool is an ATM card) or a phone or cell tower (e.g., if the service provider is a telecommunications service provider and the tool is a cell phone). Activity amongst the computer system, user carried service provider tool, and remote device is wirelessly monitored by the service provider (or an agent of the service provider) in an electronic communications network.

Abstract: In distributed state systems, server nodes can receive operation requests from multiple clients. When a server node executes an operation request, the server node can store an indicator of the operation request to a log of operations and send a reply message to the requesting client. The reply message can include a reply log having a list of N executed operation requests. If the server needs rebuilding, any operations not already stored to the server node log may be lost. The server can rebuild lost operations of a file system by receiving the reply logs or indicators of the operations therein from one or more clients.

Abstract: Embodiments of the present invention provide systems, methods, and computer program products for detecting shifts in types of workloads handled by a relational database management system. Embodiments of the present invention can afford relational database administrators with the ability to leverage information pertinent to the current type of workload being handled by the relational database management system. Furthermore, embodiments of the present invention provide relational database administrators with information in regard to system workload states and workload transitions.

Abstract: Embodiments of the present invention provide systems, methods, and computer program products for detecting shifts in types of workloads handled by a relational database management system. Embodiments of the present invention can afford relational database administrators with the ability to leverage information pertinent to the current type of workload being handled by the relational database management system. Furthermore, embodiments of the present invention provide relational database administrators with information in regard to system workload states and workload transitions.

Abstract: This disclosure proposes systems, methods, and apparatus that identify raw SQL queries that are likely to cause a double counting error, and if such a SQL query is identified, then convert the raw SQL query into SQL queries that account for and avoid double counting. In some embodiments, this process uses queries and subqueries that refer back to a common table expression (CTE) in order to reduce code length and increase query execution speed.

Abstract: In accordance with an embodiment, described herein is a system and method for supporting multitenant execution of a tenant-unaware program invoked from a multitenant middleware application. An exemplar method can provide, at one or more computers, including an application server environment executing thereon, a plurality of partitions, and a plurality of tenant-aware programs, wherein each of the plurality of tenant-aware programs is associated with a partition. The method can associate each of the plurality of partitions and the plurality of tenant-aware programs with a tenant of a plurality of tenants. The method can invoke the tenant-unaware process from a calling partition of the plurality of partitions, and collect tenancy information about the calling tenant. Based upon the collected tenancy information, the method can scope execution of the tenant-unware process to the calling tenant by launching the tenant-unware process as a containerized process.

Abstract: In accordance with an embodiment, described herein is a system and method for supporting multitenant execution of a tenant-unaware program invoked from a multitenant middleware application. An exemplary method can provide a plurality of partitions, and a plurality of tenant-aware programs, wherein each of the plurality of tenant-aware programs is associated with a partition. The method can associate each of the plurality of partitions and the plurality of tenant-aware programs with a tenant of a plurality of tenants. The method can invoke the tenant-unaware process from a calling partition of the plurality of partitions, the calling partition being associated with a calling tenant of the plurality of tenants. The method can collect tenancy information about the calling tenant. And, based upon the collected tenancy information, the method can scope execution of the tenant-unaware process to the calling tenant by setting up a process execution environment and resources.

Abstract: Object store management operations within compute-centric object stores are provided herein. An exemplary method may include transforming an object storage dump into an object store table by a table generator container, wherein the object storage dump includes at least objects within an object store that are marked for deletion, transmitting records for objects from the object store table to reducer containers, such that each reducer container receives object records for at least one object, the object records comprising all object records for the at least one object, generating a set of cleanup tasks by the reducer containers, and executing the cleanup tasks by a cleanup agents.

Abstract: A data storage system has one or more processing nodes, each processing node comprising memory coupled to processing circuitry, the one or more processing nodes running a set of virtualized filesystem managers (VFMs) having a shared namespace. The set of VFMs includes (a) a master VFM for managing a configuration filesystem stored on the persistent storage, the configuration filesystem storing configuration information for the set of VFMs and (b) a slave VFM for remotely mounting the configuration filesystem from the master VFM, the slave VFM obtaining details of its configuration from the remotely-mounted configuration filesystem, the slave VFM sharing the shared namespace with the set of VFMs, the shared namespace including a set of filesystems, each filesystem of the shared namespace being managed by a single VFM, and each filesystem of the shared namespace being accessible by the remote host through any of the VFMs of the set of VFMs.

Abstract: A method for generating cube metadata based on an enhanced star schema may be provided. In some embodiments, the method may include extracting dimension references from a factless fact table in an enhanced star schema. The enhanced star schema may include a fact table, a plurality of dimension tables of the fact table and the factless fact table. In some embodiments, a hierarchy reference may be constructed based on the dimension references. In some embodiments, cube metadata may be generated by combining the hierarchy reference with measures obtained from the fact table and a hierarchy obtained from the dimension tables in the enhanced star schema.

Abstract: Systems and methods for visualizing and manipulating graph databases in accordance embodiments of the invention are disclosed. In one embodiment of the invention, a graph database manipulation device includes a processor and a memory configured to store a graph database manipulation application, wherein the graph database manipulation application configures the processor to obtain a graph database including a set of nodes and a set of edges, determine a source node within the set of nodes, locate a set of related nodes based on the source node and the set of edges, recursively locate a set of sub-related nodes based on the set of related nodes and the set of edges, generate a representation of the set of related nodes from the perspective of the source node, and recursively update the generated representation of the set of sub-related nodes from the perspective of the source node and the related nodes.

Abstract: A transaction request is received at a log-based transaction manager, indicating a conflict check delimiter and a read set descriptor indicative of one or more locations from which data is read during the requested transaction. Using the conflict check delimiter, a subset of transaction records stored in a particular persistent log to be examined for conflicts prior to committing the requested transaction is identified. In response to determining that none of the read locations of the requested transaction correspond to a write location indicated in the subset of transaction records, a new transaction record is stored in the particular persistent log indicating that the requested transaction has been committed.

Abstract: At a logging service, a representation of a transaction requested by a client is received. The transaction includes at least a first write operation directed to a data object at a first data store. Based at least in part on the contents of the representation and contents of a persistent log of the logging service, a determination is made that the requested transaction is to be committed. A log record corresponding to the first write operation is inserted into the persistent log. The first write is propagated to the first data store after the record has been inserted in the persistent log.

Abstract: A method and system for transforming a serial schedule of transactions into a parallel schedule of transaction is disclosed. In one example, a computer system stores a list of data transactions in a transaction log. The computer system then reads a respective data transaction from the transaction log. The computer system determines whether the respective data transaction is dependent on any other currently pending data transaction. In accordance with a determination that the respective data transaction is not dependent on any other currently pending data transaction, the computer system applies the data changes to a reconstructed data set. In accordance with a determination that the respective data transaction is dependent on a currently pending second data transaction, the computer system delays commitment of the respective data transaction until the second data transaction has been applied to the reconstructed data set.

Abstract: An execution framework allows developers to write sequential computational logic, constrained for the runtime system to efficiently parallelize execution of custom business logic. The framework can be leveraged to overcome limitations in executing low level procedural code, by empowering the system runtime environment to parallelize this code. Embodiments employ algorithmic skeletons in the realm of optimizing/executing data flow graphs of database management systems. By providing an extensible set of algorithmic skeletons the developer of custom logic can select the skeleton appropriate for new custom logic, and then fill in the corresponding computation logic according to the structural template of the skeleton.

Abstract: Streaming database replication is provided by merging a stream of user transactions with a stream of copy transactions comprising copy data into a combined stream on a source. A target receives a single stream that includes copy transaction and concurrent user transactions in an order that enables conflicts between data being copied and user transactions to be handled correctly. Furthermore, locks applied to data subject to a copy transaction or user transaction can be released once the copy transaction or user transaction is added to the combined stream.

Abstract: Techniques for determining whether an XML query may be written are provided. In one scenario, an XML query includes an expandable path, which is a path expression that includes a wildcard character (*) or a descendant axis (//). An XML schema is used to generate multiple expanded paths (each of which is a simple path expression) from the expandable path. The XML schema is used to compare each expanded path to another expanded path and to determine whether the nodes identified by the respective expanded paths are guaranteed to occur in a particular order in XML documents that conform to the XML schema. In another scenario, an XML query includes an order operator that takes two paths as input. Similarly, an XML schema is used to compare the two paths and to determine whether the nodes identified by the two paths are guaranteed to occur in a particular order in XML documents that conform to the XML schema.

Abstract: There is disclosed a method and system for processing transactions requested by an application in a distributed computer system. The computer system includes at least one resource comprising a plurality of storage areas each with an associated resource manager, or a plurality of resources each comprising at least one storage area with an associated resource manager, the storage areas holding the same tables as each other. There is also provided a transaction manager that is linked, by way of either a network or a local application programming interface (API), to each of the resource managers, the transaction manager being configured to coordinate transaction prepare and commit cycles.

Abstract: Methods and systems for storing web-site visitor data in a specific bucket among a plurality of buckets based on a unique visitor identifier. The methods and systems may dynamically change the number of buckets based on certain conditions, such as when one of the buckets reaches a predetermined size. Several processors may be used in parallel to process the visitor data from two or more of the buckets simultaneously, for example to generate or obtain report data. The systems and methods may aggregate the report data into a result table.

Abstract: Techniques for multimedia metadata security are disclosed. In one particular embodiment, the techniques may be realized as a method for multimedia metadata security comprising receiving an indication that multimedia metadata has been created for a multimedia file, and encrypting, using at least one computer processor, the multimedia metadata stored in a body of the multimedia file.

Abstract: A method and apparatus for generating a user interface comprising generating an interface information packet comprising user interface information readable by a script-based application, sending the interface information packet to a client device, and generating a user interface of the client device via a display engine in accordance with the interface information packet.

Abstract: System and methods of data auditing of transaction data of an application software are described. In one implementation, the method includes data auditing of transaction data by an independent audit module where metadata of the application software is received, and an audit table based on at least one of the audit parameters, indicating the extent of audit data of one or more processes is created in an audit database of the audit module. Further, triggers for capturing data changes from the application software are generated based on at least one audit parameters. Captured changes data is optimized to reduce the storage requirements of audit data. In another implementation, the result of the analysis is displayed in form of a report in user desired format.

Abstract: A system and method accepts source code including one or more variables or constants, and, for those variables or constants flagged as those that are to be automatically provided to a gateway, generates or provides communication code and a description that allows the values to be sent to a gateway for retrieval using a variety of formats. More specifically, certain containers within the source code are marked to indicate that the certain containers are remotely retrievable. These marked containers are linked to an entry in the profile. Then responsive to the source code indicating that at least one of the devices is a wireless portable device, a new profile is generated and is used along with the source code to generate a set of code for at least one of the one or more devices that can repeatedly providing, to a gateway, a value named in the source code.

Abstract: A system is provided for centrally managing core enterprise reference data associated with an enterprise. A centralized master repository contains the core enterprise reference data. The internal services framework also provides internal services for managing the core enterprise reference data within the centralized master repository, one or more of the internal services having direct access to the core enterprise reference data stored in the centralized master repository for management purposes. An infrastructure services layer coupled to the centralized master repository provides for bulk data transfers of core enterprise reference data between the centralized master repository and one or more external operational systems according to one or more enterprise-level business workflows, the external operational systems permitted indirect access to the core enterprise reference data stored in the centralized master repository for operational purposes.

Abstract: A data transformation system receives data from one or more external source systems and stores and transforms the data for providing to reporting systems. The data transformation system maintains multiple versions of data received from an external source system. The data transformation system can combine data from different versions of data and provide to the reporting system. As a result, external source systems that do not maintain data in a format appropriate for reporting systems and/or do not maintain sufficient historical data to generate different types of reports are able to generate these reports. The data transformation system can also enhance older versions of data stored in the system or exclude portions of data from reports. The data transformation system can purge older versions of data so that older data that is less frequently requested is maintained at a lower frequency than recent data.

Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.

Abstract: Storing and/or accessing data in a transactional database, with use of the following technique: (i) selecting a set of base tables in a transactional database; and (ii) creating a factless materialized query table, having maximum sparsity, for the set of base tables. The set of base tables includes at least two base tables. The set of base tables includes a set of keys including at least two distinct primary keys. The factless materialized query table includes one record associated with each record in the set of base tables. Each record in the materialized query table includes a value for every primary key in the set of base tables.

Abstract: An approach is provided for metrics data collection for business transactions. An online activity (e.g., Application Programming Interface (API) call) associated with a business flow is identified. It is determined whether the online activity is a part of a transaction, wherein the transaction is defined according to a business rule. Status of the transaction is updated if the online activity is a part of the transaction.

Abstract: An enterprise management software system that provides a methodology for transient data storage, user action handling and dependent object creation process. When a dependent object is required to be added, the software system may remember the action without creating the dependent object. When a command is received to cancel the dependent object creation, the software system may work only on the transient data at a frontend and will not interact with backend. The dependent object may be instantiated when receiving a user command to save any entered data. Responsive to the user command, the software system may collect user input and trigger dependent object instantiation process at the backend.

Abstract: An example method of pattern mining includes identifying, via a logic circuit, a plurality of patterns present in a plurality of transactions, the transactions including sets of items, and selecting, via the logic circuit, one of the identified patterns based on an occupancy of the identified pattern in the transactions.

Abstract: Embodiments are provided to provide a distributed transaction manager supporting repeatable read isolation level in Massively Parallel Processing (MPP) database systems without a centralized component. Before starting a transaction, a first node identifies a second node involved in the transaction, and requests from the second node a snapshot of current transactions at the second node. After receiving the snapshot from the second node, the first node combines into a reconciled snapshot the snapshot of transactions from the second node with current transactions at the first node. The first node then transmits the reconciled snapshot to the second node and starts the transaction using the reconciled snapshot. A branch transaction is then started at the second node in accordance with the reconciled snapshot. Upon ending the transaction and the branch transaction, the first node and the second node perform a two phase commit (2PC) protocol.

Abstract: Systems and methods are provided for Online Analytical Processing of data included within data warehouses. According to one example, a method for adding a dimension to a hyper-lattice structure is provided and includes adding a new base cuboid to a hyper-lattice that describes functionality of the data warehouses. According to another example, a method for determining an optimal path through an existing hyper-lattice by which to generate a destination cuboid from a source cuboid is also provided.

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