Abstract: A nested database query can be optimized by effectively representing a filtering function or operation (e.g., SQL filtering operation) of its outer sub-query by a qualification or qualify operation (e.g., SQL qualification operation) associated with at least one windowing function of at least one of its inner sub-queries. It will be appreciated that this representation can yield a modified query that would be equivalent (e.g., semantically equivalent) to the original nested query as its execution can produce the same results when optimization rules are applied.

Abstract: Techniques for resolving single source shortest path for database processing are provided. Graph data for nodes having weights for edges of a database network are iterated producing a new message table and results table in each iteration. The results table stores the minimum path weight. For each iteration the graph data and message table are joined to produce a state of a node and outgoing edge messages. The message table and results table are co-grouped to generate a new message for a next node to process. When done the single source shortest path for the network is produced.

Abstract: A source data set is processed to produce a symbol table and a distribution without using a tree construct or any tree-related processing. The symbol table and the distribution outputted for encoding the data set and decoding encoded versions of the data set.

Abstract: Data can be stored in a memory for an in-memory processing system such the data is available for processing as soon as it is needed to be processed. A first portion and a second portion of the data can be stored in the memory of the in-memory processing system for processing by the in-memory processing system, such that the second portion of the data is stored in the memory before the in-memory processing system completes the processing of the first portion of the data, thereby allowing the in-memory processing system to process the second portion of the data when the processing system is able to process the second portion of the data.

Abstract: Embodiments of the present invention provide hardware-friendly indexing of databases. In particular, forward and reverse indexing are utilized to allow for easy traversal of primary key to foreign key relationships. A novel structure known as a hit list also allows for easy scanning of various indexes in hardware. Group indexing is provided for flexible support of complex group key definition, such as for date range indexing and text indexing. A Replicated Reordered Column (RRC) may also be added to the group index to convert random I/O pattern into sequential I/O of only needed column elements.

Abstract: The claimed invention provides a method for managing response time in a database system. The method includes monitoring a plurality of events that impact on the operation of the database system, identifying at least one event that impacts on at least one of the performance and availability of the database, and initiating an action in response to the identified event.

Abstract: Techniques are presented for process tracking and monitoring. A tracking service monitors a good or service through a processing plan and takes selective measurements. A dashboard service presents the processing plan, locations for the good or service, and other metadata. The dashboard service also identifies cause and effect relationships derived from the metadata. A case management tool permits exceptions to the processing to be handled in a user-defined manner.

Abstract: Techniques for managing data relationships are presented. A database element from a first database table is linked with a database element of a second database table via a Graphical User Interface as directed by a user. The link establishes a data relationship having attributes and properties. The relationship along with the attributes and properties are graphically presented to the user for inspection and analysis.

Abstract: A method, system, apparatus, and article of manufacture is configured to expose a database asset as a web service. A relational database management system (RDBMS) that stores information is executed in a computer system. As part of a process and framework, a series of business rules and process workflows are maintained that manage data that resides in RDBMS tables. A rule is created that contains an application programming interface definition with predefined input and output for exposing the database asset as the web service. The rule is exposed as the web service. The web service is used to invoke a database operation based on the database asset, and to output a result.

Abstract: A system, method, and computer-readable medium that facilitate efficient use of cache memory in a massively parallel processing system are provided. A residency time of a data block to be stored in cache memory or a disk drive is estimated. A metric is calculated for the data block as a function of the residency time. The metric may further be calculated as a function of the data block size. One or more data blocks stored in cache memory are evaluated by comparing a respective metric of the one or more data blocks with the metric of the data block to be stored. A determination is then made to either store the data block on the disk drive or flush the one or more data blocks from the cache memory and store the data block in the cache memory. In this manner, the cache memory may be more efficiently utilized by storing smaller data blocks with lesser residency times by flushing larger data blocks with significant residency times from the cache memory.

Abstract: Techniques that facilitate management of skewed data during a parallel multiple join operation are provided. Portions of tables involved in the join operation can be distributed among a plurality of processing modules, and each of the processing modules can be provided with a list of skewed values of a join column of a larger table involved in the join operation. Each of the processing modules can scan the rows of first and second tables distributed to the processing modules and compare values of the join columns of both tables with the list of skewed values. One or more of the processing modules can then redistribute the skewed values.

Abstract: A method and apparatus are provided for facilitating performance monitoring of a large database system. The apparatus comprises a processor and a storage device communicatively coupled with the processor. The processor is programmed to (i) retrieve resource usage data points, (ii) calculate an outlier threshold value based upon values of data points, and (iii) determine if the value of each data point is outside of the threshold value. The processor is further programmed to (iv) plot the value of the data point in histogram with a first color when the data point value is determined to be outside of the threshold value, (v) plot the data point value in histogram with a second color when the data point value is determined to be not outside of the threshold value, and (vi) display the histogram containing plotted data point values of the first color and plotted data point values of the second color to enable a user to quickly and easily identify a potential skew condition.

Abstract: A sentiment-scoring system may include a storage device configured to store a plurality of keywords, keyword groups, and a keyword group hierarchy. Each keyword may be associated with at least one of the keyword groups. The keyword hierarchy may include a hierarchy associated with each keyword group. The system may further include a processor in communication with the storage device. The processor may be configured to locate a plurality of sentiment expressions and identify a plurality of keywords present in the plurality of sentiment expressions. The processor may be further configured to determine at least one respective keyword group associated with each identified keyword and determine a sentiment score for each sentiment expression with respect to the associated keyword group within the keyword hierarchy. The processor may be further configured to provide at least one sentiment score to a display. A method and computer-readable medium may also be implemented.

Abstract: Several methods and a system of a replicated service for write ahead logs are disclosed. In one embodiment, a method includes persisting a state of a distributed system through a write ahead log (WAL) interface. The method also includes maintaining a set of replicas of a WAL through a consensus protocol. In addition, the method includes providing a set of mechanisms for at least one of detection and a recovery from a hardware failure. The method further includes recovering a persistent state of a set of applications. In addition, the method includes maintaining the persistent state across a set of nodes through the hardware failover. In one embodiment, the system may include a WAL interface to persist a state of a distributed system. The system may also include a WAL replication servlet to maintain and/or recover a set of replicas of a WAL.

Abstract: A system, a method, and a computer program product for accessing stored partially structured data using a structure-based query language. A partially-structured data is stored in a data management system using at least one key-value pair. Using the data management system, a query of data is processed. The query is generated using a structured language.

Abstract: Router threads read real-time stream data as that data is received at processing nodes along a processing path for the data. The data is initially parsed into workloads. Each router thread maintains real-time analytics for the workloads and reports deviations in the analytics to a workload coordinator. The workload coordinator dynamically and in real time provides updated data distribution maps based on the reported deviations, and the router threads use the data distribution maps to determine a next processing unit to forward the workloads, where the next processing unit includes an instance of a next processing node in the processing path for the workload. The next processing node performs additional processing on the workloads along the processing path.

Abstract: A database system may include a memory device configured to store a database dictionary and a processor in communication with the storage device. The processor may be configured to receive a temporal user-defined function (UDF) and to store, in the database dictionary, the temporal UDF and a period of time over which to apply the temporal UDF. A method may include receiving a temporal UDF and include determining a period of time over which to apply the temporal UDF. The method may further include storing the temporal UDF and the period of time over which to apply the temporal UDF. A computer-readable medium may include instructions to receive a temporal UDF and instructions to store the temporal UDF. The computer-readable medium may further include instructions to determine a period of applicability of the temporal UDF and instructions to store the period of applicability in a storage device.

Abstract: Techniques for query statistics inheritance are provided. Statistics for a database are used to determine selectivity estimates for sparse joins and tables being joined together within a given query. These statistics are inherited up to the given query along with the selectivity estimates and provided to a database optimizer to use when developing query plans and selecting an optimal query plan for the given query.

Abstract: A method, database system and computer program are disclosed for optimizing a SQL query, in which the SQL query seeks to aggregate temporal database information. The method includes determining whether two rows of information have a common grouping value, and if so, determining both temporal overlap and temporal non-overlap components of the two rows, aggregating each of the temporal overlap components of the two rows, and separating the temporal non-overlap components of the two rows.

Abstract: Embodiments of the present invention provide a run-time scheduler that schedules tasks for database queries on one or more execution resources in a dataflow fashion. In some embodiments, the run-time scheduler may comprise a task manager, a memory manager, and hardware resource manager. When a query is received by a host database management system, a query plan is created for that query. The query plan splits a query into various fragments. These fragments are further compiled into a directed acyclic graph of tasks. Unlike conventional scheduling, the dependency arc in the directed acyclic graph is based on page resources. Tasks may comprise machine code that may be executed by hardware to perform portions of the query. These tasks may also be performed in software or relate to I/O.