Application of Parallelism SQL in Fuzzy Relational Databases
29 Aug 2008-pp 553-557
TL;DR: Basic parallelism in fuzzy relational databases and its queries is introduced and fuzzy logic with Boolean one is compared in connection with fuzzy relational Database Modeling Extensions.
Abstract: Recently, new applications have emerged that require database management systems with uncertainty capabilities. Many of the existing approaches to modeling uncertainty in database management systems are based on the theory of fuzzy sets. This paper introduces basic parallelism in fuzzy relational databases and its queries. Article describes basic characteristics of fuzzy relational databases and their properties, compares fuzzy logic with Boolean one in connection with fuzzy relational databases. Deal with data classification and form of storage fuzzy data in database systems. Paper describes fuzzy queries and parallelism in queries from view of today's systems and their connection to SQL language and its extension fuzzy SQL. Discuss about pipeline parallelism of query operators and its benefits.
Citations
More filters
23 Mar 2011
TL;DR: The proposed technique is mainly focused on the introduction of fuzzy mobile database and its characteristic of mobile data and is called Fuzzy databases.
Abstract: At present, as a new trend of telecommunication industry the mobile applications requires to refine the technique of database continually. Therefore mobile database has come into being. The proposed technique is mainly focused on the introduction of fuzzy mobile database and its characteristic of mobile data. In this paper we have especially analyzed the structure and functionality of the mobile databases. The proposed technique is called Fuzzy databases.
1 citations
Cites background from "Application of Parallelism SQL in F..."
...Hence, different kind of fuzzy database schemas are presented below....
[...]
TL;DR: A fuzzy database organization and clustering of records which provides efficient and accurate fuzzy retrieval is proposed.
Abstract: In order to handle imprecise and ambiguous information, the application of fuzzy set theory for the design of database, information storage and retrieval systems has been gaining popularity recently. This paper gives emphasis on the basic characteristics of fuzzy relational databases, their properties, along with the data clustering in database systems. Indian premier league dataset has been considered for the detection of clusters. Several clustering parameters like centroid, radius and Manhattan distance measure have been applied. The definition of clusters as well as the membership function has been implemented using PL/SQL. The results obtained from Indian premier league batting statistics dataset detect two clusters, namely Cluster 1 and Cluster 2. Finally, this article proposed a fuzzy database organization and clustering of records which provides efficient and accurate fuzzy retrieval.
1 citations
Cites background from "Application of Parallelism SQL in F..."
...There are a number of very good surveys of fuzzy relational database approach [12], [13], [14]; we will not go into details here but just point to some of its essential contributions....
[...]
Journal Article•
TL;DR: This article proposed a fuzzy clustering technique which provides efficient and accurate data analysis for classifying the batting statistics of Indian Premier League (IPL) T-20 version-3 cricket tournament into 2 clusters.
Abstract: Fuzzy clustering techniques are widely used to improve information systems for decision making by handling imprecise and ambiguous information. This paper gives emphasis on the basic characteristics of fuzzy relational databases, their properties, along with the data clustering in database systems for classifying the batting statistics of Indian Premier League (IPL) T-20 version-3 cricket tournament into 2 clusters. Several clustering parameters like centroid, radius and Manhattan distance measure have been applied. The definition of clusters as well as the membership function has been implemented using PL/SQL. Finally, this article proposed a fuzzy clustering technique which provides efficient and accurate data analysis.
1 citations
TL;DR: This paper proposes the architecture for fuzzy querying along with an experimental implementation of the same using LEX and YACC that facilitate the lexical analysis of fuzzy terms and parsing the fuzzy query respectively.
Abstract: querying language presumes precision and certainty in user queries. But in factual situations the queries may be imprecise and may be desired to result in uncertain outcome. Introducing fuzziness in querying permits the realistic querying on the crisp data. In this paper, we propose the architecture for fuzzy querying along with an experimental implementation of the same. The implementation is using LEX and YACC that facilitate the lexical analysis of fuzzy terms and parsing the fuzzy query respectively. Fuzzy query is interpreted by the parser and the consequent semantic actions are carried out on MySQL database.
Cites background from "Application of Parallelism SQL in F..."
...The rest of the attributes Alpha, Beta, Gamma, Delta provides required information to calculate the membership of the specified column and level [4]....
[...]
References
More filters
TL;DR: This paper deals with imprecise querying of regular relational databases by extending an existing query language, namely SQL, which concerns the integration in the extended language of many propositions that have been made elsewhere.
Abstract: An important issue in extending database management systems functionalities is to allow the expression of imprecise queries to enable these systems to satisfy the user needs more closely. This paper deals with imprecise querying of regular relational databases. The basic idea is to extend an existing query language, namely SQL. In this context, two important points must be considered: one concerns the integration in the extended language of many propositions that have been made elsewhere, in particular those concerning fuzzy aggregation operators; and the second point is to know whether the equivalences which are valid in SQL still hold in the extended language. Both these topics are investigated in this paper. >
518 citations
01 Dec 1991
TL;DR: In this paper, a new hash-join algorithm called pipelining hash join (PHJ) was introduced that has fewer synchronization constraints than the known hash-Join algorithms and showed that PHJ yields a better performance for multi-join queries.
Abstract: The performance and characteristics of the execution of various join-trees on a parallel DBMS are studied. The results are a step in the direction of the design of a query optimization strategy that is fit for parallel execution of complex queries. Among others, synchronization issues are identified to limit the performance gain from parallelism. A new hash-join algorithm, called pipelining hash-join is introduced that has fewer synchronization constraints than the known hash-join algorithms. Also, the behavior of individual join operations in a join-tree is studied in a simulation experiment. The results show that the pipelining hash-join algorithm yields a better performance for multi-join queries. Also, the format of the optimal join-tree appears to depend on the size of the operands of the join. The results from the simulation study are confirmed with an analytic model for dataflow query execution. >
289 citations
26 Feb 1995
TL;DR: The last five years have been witness to a revolution in the database research community, and the consensus on what constitutes worthwhile research is in flux, so now is an opportune time to take stock of the past and establish a framework.
Abstract: The last five years have been witness to a revolution in the database research community. The dominant data models have changed and the consensus on what constitutes worthwhile research is in flux. Also, at this time, it is possible to gain a perspective on what has been accomplished in the area of fuzzy databases. Therefore, now is an opportune time to take stock of the past and establish a framework. A framework should assist in evaluating future research through a better understanding of the different aspects of imprecision that a database can model. Additionally, a framework can indicate which past efforts a specific instance of present research can be related.
33 citations
06 Apr 1994
TL;DR: It is shown that fuzzy sets and possibility theory notions provide an homogeneous framework for both the representation of imprecise/uncertain information and vague queries.
Abstract: In this paper, the interest of fuzzy sets and possibility theory in the context of databases is presented. It is shown that these " notions provide an homogeneous framework for both the representation of imprecise/uncertain information and vague queries. A special emphasis is put on flexible queries addressed to regular databases. When comparing various attempts made in this contexL the fuzzy set approach turns out to generalize the other solutions. Finally, the principal features of a fuzzy querying language extending SQL are outlined.
28 citations
Proceedings Article•
17 Jan 1993
TL;DR: The model is developed in general terms and after that it is elaborated for selection, unique, and join operations, and it is shown how the model is used to understand the behavior of multi-operation queries.
Abstract: This paper develops an analytical model for pipelined execution of complex queries. The goal of this research is gaining insight in potential performance gain from the concurrent execution of pipelined relational operations. First, the model is developed in general terms, and after that it is elaborated for selection, unique, and join operations. Finally, it is shown how the model is used to understand the behavior of multi-operation queries. It is shown, how the individual characteristics of operations innuence their cooperation in a pipeline. The model increases the understanding of dataaow query execution and can form a basis to generate query optimization heuristics for a parallel DBMS.
11 citations