Abstract: An interactive tag cloud provides an intuitive interface to large data volumes. Where the data is a large table, an overview afforded by the tag cloud may contain relevant table information ranked by priority and volume, represented in different categories. The tag cloud may be used to filter that big data in an efficient manner. This allows an ordinary (i.e., non-developer) user of the database to quickly assess high level contours of the data volumes, and also to filter that data in order to focus on specific tasks. The interactive tag cloud visualization may indicate data priority according to frequency of incidence of a dimension in database records, or according to other criteria such as importance derived from date information. The tag cloud affords visibility to aggregated big data content and also of filtered data, prior to the user having to immediately drill down in order to access details thereof.

Abstract: A method, user interface, and computer-readable medium to receive a representation of a first query item, the first query item belonging to a data set and having at least one attribute; receive a representation of a second query item, the second query item being defined as relating to at least one particular attribute of another query item; associate the second query item with the first query item; automatically retrieve, in response to the second query item being associated with the first query item, a value for the at least one particular attribute of the second query item from the first query item; and save a record of the retrieved value.

Abstract: Disclosed herein are system, method, and computer program product embodiments for adaptively self-tuning a bucket memory manager. An embodiment operates by receiving requests for memory blocks of varying memory sizes from a client. Determining a workload for the client based on the requests. Analyzing buckets in the bucket memory manager based on the workload. Adjusting parameters associated with the bucket memory manager based on the analyzing to accommodate the requests.

Abstract: Disclosed herein are system, method, and computer program product embodiments for utilizing join cardinality to improve the performance of query processing. An embodiment operates by a database engine receiving a query including a join operation on a first and a second table using a join predicate, and a tag for the join operation indicating a cardinality relationship between the first and the second table when satisfying the join predicate. Then, the database engine generates a query processing plan for performing the query. For the join operation, the database engine selects one of the first or the second tables to remove from the join operation based on a type of the join operation and the tag. Based on the selecting, the database engine may remove may the join operation and the selected table from the query processing plan.

Abstract: Methods and systems are disclosed for managing replication of metadata in a master-slave database environment. While metadata is managed on a master node using database tables with transaction guarantees, metadata copies on the slave node are managed using a lightweight key-value store. In exemplary embodiments, master metadata database tables are mapped to respective key-value structures at one or more slave nodes. The key-value structures have entries pointing to respective metadata objects, which include copies of metadata items stored in the master metadata database tables. The key-value structures can be hierarchically organized under a parent key-value structure. Metadata object versions can be organized as a linked list to facilitate multi-version concurrency control. Methods are disclosed for building the key-value store, for retrieving metadata from the store, for updating the store, for providing multi-version concurrency control, and for pruning obsolete metadata versions. Variants are disclosed.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a notification from a java virtual machine indicating that an amount of free memory associated with the java virtual machine is less than a first threshold amount of memory. In response to the notification, the program further transitions from operating in a non-low-memory stat to operating a low-memory state. The low-memory state includes decreasing an amount of memory used by a set of components in a plurality of components of an application operating on the java virtual machine in order to increase the amount of free memory associated with the java virtual machine. The program also determines that the amount of free memory associated with the java virtual machine is greater than a second threshold amount of memory. In response to the determination, the program further transitions from operating in the low-memory state to operating in the non-low-memory state.

Abstract: String comparison, including comparing strings with a rule, can be time consuming, and strings may not be suitable for analysis using machine learning algorithms. The present disclosure provides positionally-encoded representations of strings, such as binary matrices or arrays, that provide an encoded representation of the string. The encoding, and decoding, can be facilitated by an encoding schema, such as an encoding schema stored in the memory of a computer device. The encoding schema associates particular characters with particular positions in an array. The positionally-encoded string representations can be used for security applications, such as to determine whether an authorization token that includes at least one string complies with an authorization rule. The authorization rule can be specified as a positionally-encoded representation that defines a set of strings that comply with the rule.

Abstract: Embodiments allow identifying unique locations, proximity, and constraints of various individualization resource units in a data center. A plurality of processes may compete for available resources (e.g., CPU, network bandwidth, memory) in a shared environment, which may be virtualized (e.g., comprising host, VM, container, application server instance resource units). A scheduling infrastructure determines individualization unit locations according to an identifier reflecting resource hierarchies. For each process, the data sending infrastructure sends location data as an ID stack to a central monitoring instance for analysis. That central monitoring instance can reference the resource location information to identify process proximity and competition for resources constraining process performance. Resource location information in the form of coordinates provided by the ID stack, offer valuable information regarding resource consumption and other information relevant for process monitoring.

Abstract: Techniques and solutions are described for facilitating the determination of whether a software program may raise a compliance issue, such as whether processes invoked by the software program may involve the sending of protected information. A compliance tool automatically determines a plurality of processes invoked by a program. A plurality of the invoked processes are compared with a process compliance library comprising at least one process. The comparing produces compliance results. The compliance results are output to a user.

Abstract: An application scaffold is generated based on an object model. The object model includes CDS objects and DCL objects. The CDS objects and the DCL objects are evaluated together with corresponding CDS annotations and DCL annotations. Based on the evaluation, a field control hub is generated. The field control hub evaluates the DCL annotations and determines, based on one or more authorization objects from the DCL annotations, field control data for a field from a number of fields of a UI. When a user requests the UI, the field of the UI is displayed in accordance with the determined field control data for a role of the user.

Abstract: Embodiments automate tracking of exploit information related to initially-identified security vulnerabilities, through the data mining of social networks. Certain social network communities (e.g., those frequented by hackers) share information about computer security breaches (zero-day events). Embodiments recognize that further relevant security information may be revealed, in conjunction with and/or subsequent to such initial zero-day vulnerability disclosures. That additional information can include valuable details regarding known (or unknown) vulnerabilities, exploit codes and methodologies, patches, etc. Tracking that additional information can benefit security researchers/experts/law enforcement personnel. Embodiments monitoring social media traffic based upon initial security vulnerability information, perform analysis to detect patterns and create relevant keywords therefrom.

Abstract: As part of a database system comprising a combination of on-disk storage and in-memory storage, a plurality of records that comprise a table are stored in a plurality of fragments that include at least a delta fragment and a main fragment retained in the on-disk storage. Each fragment has visibility data structures to enable multi-version concurrency control. Each fragment can be compressed using dictionary compression and n-bits compression. The fragments are loaded into main system memory in the in-memory storage from the on-disk storage if they are accessed for read operations or write operations and are not already in memory. A plurality of lockless read and write operations are concurrently performed, while providing snapshot isolation, on the at least one of the plurality of fragments while the at least one of the plurality of fragments is in the main system memory.

Abstract: Impact analysis of an object is performed by selecting an object and determining impacted objects corresponding to the object. A type of the object is determined. A query is formulated and executed to retrieve relationship objects from a relationship table matching the type of the selected object. Nested properties associated with the relationship objects for the individual relationship objects are determined iteratively. A parent property associated with the nested properties is identified. A query is formulated and executed to fetch dependent values corresponding to the dependent values. The dependent values are added to a list. A query is formulated and executed to determine impacted objects corresponding to the dependent values. The impacted objects are displayed in a graphical chart.

Abstract: The embodiments described in this disclosure may be adapted to detect and mitigate tainted content in network communications across client-server boundaries using a pair of complementary taint engines at both ends of the network. Methods, systems and computer readable storage media are adapted to receive request from a web application of a client system and generate standard responses. The header of the request can include a request taint value that can be evaluated to determine whether the request is a standard network transfer protocol request (e.g., HTTP request) or a multipart network transfer protocol request (e.g., a CTTP request). If the request is a multipart network transfer protocol request, a multipart network transfer protocol response can be constructing based on the generated standard network transfer protocol response, and client systems can be configured to detect tainted content based on the multipart network transfer protocol response.

Abstract: Disclosed herein are system, method, and computer program product embodiments for database aggregation optimization. An embodiment operates by receiving data from a main memory. Within a cache, a first hash table comprising an aggregate hash of a first portion of the data is generated. A second portion of data is partitioned into one or more of partitions. Within the cache, one or more intermediate hash tables are generated. A first hash table is aggregated based on the one or more intermediate hash tables. At least a portion of the data of the final hash table is provided responsive to a query.

Abstract: Devices, methods and systems for processing database queries formatted differently than the database storage model being queried are disclosed. Processing database queries independent of the storage model of the queried database may be performed by receiving a query for one or more data items stored in a database, determining whether to use at least one query operator that uses data having a format different from the storage model format of at least one of one or more data items stored in the database and converting the format of the data used by the at least one query operator to a format that matches the storage model format of at least one of one or more data items stored in the database. Related systems, methods, and articles of manufacture are also described.

Abstract: An application may support the use of a plug-in. A plug-in may have an associated cache. The application may allow the plug-in to intercept network requests. The plug-in can determine if a network request is for an already-cached resource and provide the resource as a response to the intercepted network request. Additionally or alternatively, the application may allow the plug-in to make network requests. The plug-in can make a network request for data in order to add the data to the plug-in's cache. The plug-in may be able to determine when the application, the system, the network, or any suitable combination thereof are idle and cause cache requests to be made during idle periods.

Abstract: Technologies are described providing adaptive query routing in a replicated database environment. The technologies can be used with a variety of replication protocols. Prepared statements, such as for queries, from a database client can be routed to a source node, or a source node and available replica nodes, when a replica node becomes unavailable. When a replica node becomes available again, a prepared statement can be updated to indicate that the updated prepared statement can be executed at nodes including the replica node that is available again. Prepared statement routing can also be used when a portion of replicated data becomes unavailable at a replica node, but a portion of replicated data remains available.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program transmits via a multicast communication protocol a message specifying a set of services offered by the device to a plurality of computing devices. The program further establishes a connection with a computing device in the plurality of computing devices. The program also receives, through the connection, a set of data for the set of services. The program further applies the set of services to the set of data.

Abstract: Technologies are described for facilitating transaction processing within a database environment. A commit protocol provides for the atomic commit or rollback of a transaction that includes an operation that modifies a metadata entity of the database system and one or more other operations that modify metadata entities or data records of the database system. Innovations are provided for detecting and resolving deadlocks that may arise during transaction processing. Innovations are also provided for providing versioning of metadata entities, including invalidating metadata entities cached at a slave node during the commit at a master node of a transaction that creates a new version of the metadata entity.