Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
An access structure for similarity-based fuzzy databases
Date
1999-04-01
Author
Yazıcı, Adnan
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
250
views
0
downloads
Cite This
A significant effort has been made in representing imprecise information in database models by using fuzzy set theory. However, the research directed toward access structures to handle fuzzy querying effectively is still at an immature stage. Fuzzy querying involves more complex processing than the ordinary querying does. Additionally, a larger number of tuples are possibly selected by fuzzy conditions in comparison to the crisp ones. It is obvious that the need for fast response time becomes very important when the database system deals with imprecise (fuzzy) data. The current crisp index structures are inappropriate for representing and efficiently accessing fuzzy data. At the same time, in many complex applications such as Expert Database Systems, Multimedia Database Systems, Decision Support Systems, etc., fuzzy queries are usually intermingled with crisp queries. For the effectiveness of fuzzy databases, it is necessary to allow both the non-fuzzy and fuzzy attributes to be indexed together; therefore, a multi-dimensional access structure is required. Beside a suitable access structure, an effective partitioning, representation, and storage of fuzzy data art: also necessary for efficient retrieval. In this study we utilise a multi-dimensional data structure, namely Multi Level Grid File (MLGF), for efficiently accessing both crisp and fuzzy data from fuzzy databases. Therefore, we focus on the issue of partitioning, representation and organisation of fuzzy and crisp data at physical database level, i.e., record and file structures, in addition to the design of the access structure. The implementation of the access structure is also described and its comparison with a previously proposed fuzzy access method is given along with the experimental results. (C) 1999 Elsevier Science Inc. All rights reserved.
Subject Keywords
Control and Systems Engineering
,
Theoretical Computer Science
,
Software
,
Information Systems and Management
,
Artificial Intelligence
,
Computer Science Applications
URI
https://hdl.handle.net/11511/62450
Journal
INFORMATION SCIENCES
DOI
https://doi.org/10.1016/s0020-0255(98)10079-8
Collections
Department of Computer Engineering, Article
Suggestions
OpenMETU
Core
A dynamic programming algorithm for tree-like weighted set packing problem
Gulek, Mehmet; Toroslu, İsmail Hakkı (Elsevier BV, 2010-10-15)
In hierarchical organizations, hierarchical structures naturally correspond to nested sets. That is, we have a collection of sets such that for any two sets, either one of them is a subset of the other, or they are disjoint. In other words, a nested set system forms a hierarchy in the form of a tree structure. The task assignment problem on such hierarchical organizations is a real life problem. In this paper, we introduce the tree-like weighted set packing problem, which is a weighted set packing problem r...
A finite field framework for modeling, analysis and control of finite state automata
Reger, Johann; Schmidt, Klaus Verner (Informa UK Limited, 2004-09-01)
In this paper, we address the modeling, analysis and control of finite state automata, which represent a standard class of discrete event systems. As opposed to graph theoretical methods, we consider an algebraic framework that resides on the finite field F-2 which is defined on a set of two elements with the operations addition and multiplication, both carried out modulo 2. The key characteristic of the model is its functional completeness in the sense that it is capable of describing most of the finite st...
Verification and transformation of complex and uncertain conceptual schemas
Yazıcı, Adnan (World Scientific Pub Co Pte Lt, 1997-12-01)
In database environment it is necessary to represent complex and uncertain information at conceptual level and then transform the conceptual schema into the logical one for ultimate implementation. It is also important to verify the conceptual schema with respect to the constraints imposed on the schema definition. In this paper we primarily focus on the verification and transformation of the conceptual schema For the purpose of verification of the conceptual schema represented by the ExIFO data model (the ...
Formalizing the specification and execution of workflows using the event calculus
Çiçekli, Fehime Nihan (Elsevier BV, 2006-08-03)
The event calculus is a logic programming formalism for representing events and their effects especially in database applications. This paper proposes the event calculus as a logic-based methodology for the specification and execution of workflows. It is shown that the control flow graph of a workflow specification can be expressed as a set of logical formulas and the event calculus can be used to specify the role of a workflow manager through a set of rules for the execution dependencies of activities. The...
The enhancement of the cell-based GIS analyses with fuzzy processing capabilities
Yanar, TA; Akyürek, Sevda Zuhal (Elsevier BV, 2006-04-22)
In order to store and process natural phenomena in Geographic Information Systems (GIS) it is necessary to model the real world to form computational representation. Since classical set theory is used in conventional GIS softwares to model uncertain real world, the natural variability in the environmental phenomena cannot be modeled appropriately. Because, pervasive imprecision of the real world is unavoidably reduced to artificially precise spatial entities when the conventional crisp logic is used for mod...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Yazıcı, “An access structure for similarity-based fuzzy databases,”
INFORMATION SCIENCES
, pp. 137–163, 1999, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/62450.