- Full text PDF available (1)
Following the adoption of basic temporal features in the SQL:2011 standard, there has been a tremendous interest within the database industry in supporting bi-temporal features, as a significant number of real-life workloads would greatly benefit from efficient temporal operations. However, current implementations of bi-temporal storage systems and… (More)
This paper analysis how RUP (Rational Unified Process) supports the goals defined by each KPA according to CMM (Capability Maturity Model) levels 2 and 3, and then it gives a modification of RUP in order to comply with CMM levels 2 and 3.
We address the problem of maintaining data structures used by memory-resident data warehouses that store sliding windows. We propose a framework that eagerly expires data from the sliding window to save space and/or satisfy data retention policies, but lazily maintains the associated data structures to reduce maintenance overhead. Using a dictionary as an… (More)
In this paper, we show how we use Nvidia GPUs and host CPU cores for faster query processing in a DB2 database using BLU Acceleration (DB2's column store technology). Moreover, we show the benefits and problems of using hardware accelerators (more specifically GPUs) in a real commercial Relational Database Management System(RDBMS).We investigate the effect… (More)
Online Analytical Processing (OLAP) was widely used to visualize complex data for efficient, interactive and meaningful analysis. Its power comes in visualizing huge operational data for interactive analysis. Data mining techniques (DM) are strong at detecting pattern sand mining knowledge from historical data. OLAP and DM are believed to be able to… (More)
this paper introduces the Rational Unified Process and the eXtreme Programming, comparing and analyzing their advantages and disadvantages. Then it customizes these two process models and works out a preliminary integration framework plan.
This paper firstly analyzes current Chinese word segmentation methods, and then bases on word dictionary segmentation and binary search tree (BST) proposing a way to organize the dictionary which focuses on reducing comparison times in order to increase the segmentation speed. After that, a practical demo is used to illustrate the feasibility and… (More)
Bi-temporal databases support system (transaction) and application time, enabling users to query the history as recorded today and as it was known in the past. In this paper, we study windows over both system and application time, i.e., <i>bi-temporal windows.</i> We propose a two-dimensional index that supports one-time and continuous queries over fixed… (More)