Earticle

In this paper, we present a new algorithm for mining generalized association rules. We develop the algorithm which scans database one time only and use Tidset to compute the support of generalized itemset faster. A tree structure called GIT-tree, an extension of IT-tree, is developed to store database for mining frequent itemsets from hierarchical database. Our algorithm is often faster than MMS_Cumulate, an algorithm mining frequent itemsets in hierarchical database with multiple minimum supports, in experimental databases.

In recent years, many researchers focused on the research topic of XML database systems. The extraction of data from XML documents is an important issue for XML research and development. However, viewing XML documents determines the query methods. Firstly, this paper describes a natural way to extract data from XML documents using XQuery. This paper illustrates implementing Fuzzy Logic techniques to extract data from XML documents. This paper also describes a Fuzzy Logic based flexible XQuery language for XML. The proposed fuzzy XQuery processing techniques allow the users to use linguistic terms based user-defined functions in the XQueries. This paper demonstrates that how the flexible Fuzzy XQuery provides better output than normal XQuery language using eXist Native XML database. The proposed fuzzy query processing techniques can deal with the users’ fuzzy XQueries in a more flexible and more intelligent manner.

In this paper, we propose unconstrained handwritten Kannada character recognition based on Fisher Linear Discriminant Analysis (FLD). The proposed system extracts features from well known FLD, Two dimensional FLD (2D-FLD) and Diagonal FLD. In order to classify the characters, we explore different distance measure techniques and compare their results. The proposed system is tested on unconstrained handwritten Kannada characters with pertaining to large number of character classes. The system showed effectiveness and feasibility of the proposed method.

Database applications play an important role in nearly every organization, yet little has been done on testing of database applications. They are becoming increasingly complex and are subject to constant change. They are often designed to be executed concurrently by many clients. Testing of database application hence is of utmost importance to avoid any future errors encountered in the application, since a single fault in database application can result in unrecoverable data loss. Many tools and frameworks for performing testing of database applications has been proposed to populate the test database and generate test cases which checks the correctness of application. They check database applications for consistency constraints and transactions concurrency. In this paper we present a DBGEN- database (test) GENerator, an automated framework for database application testing. In this framework Test Strategies for testing of embedded SQL queries within imperative language are presented. Finally we present strategies for performing efficient regression tests by reducing the resets that may occur while testing database applications. We have also computed the coverage of various test cases to predict the quality of testing. By this, we reduce the testing time and cost by approximately by 30% , thereby easing the tester to manage his testing activities easily.