A Case Study on the Distributed Databases Using a Hybrid Rough Sets Method

2010 ◽  
Vol 439-440 ◽  
pp. 1063-1068
Author(s):  
Sheng Hui Dai ◽  
Hua Qing Zhou ◽  
Shuang Na
Keyword(s):  
Rough Set Theory ◽  
Distributed Databases ◽  
Distributed Database ◽  
New Information ◽  
Fuzzy Query ◽  
Database Technology ◽  
New Type ◽  
Distributed Database System ◽  
Research Achievement

With the developing of Distributed Database technology, fuzzy query of Distributed Database has been playing an important role in the information query. Raising query speed and precision ratio is always the main topic of information query. In this paper, a new type of information query system--Distributed Database system is designed with rough set theory and fuzzy set knowledge. A new information query method is advanced and the architecture of the system and its key algorithms are given. Main characteristic of the research achievement is that query algorithm’s time complexity decreases with the increase of amount of information and relates to the only amount of index words. Results show that it is an effective method with which a system for fuzzy query is implemented.

Fuzzy Miner

2011 ◽  
pp. 299-321 ◽  
Author(s):  
Nikos Pelekis ◽  
Babis Theodoulidis ◽  
Ioannis Kopanakis ◽  
Yannis Theodoridis
Keyword(s):  
Data Mining ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Attribute Selection ◽  
Internet Routing ◽  
Data Mining Approach ◽  
New Information

QOSP Quality of Service Open Shortest Path First based on QoS routing has been recognized as a missing piece in the evolution of QoS-based services in the Internet. Data mining has emerged as a tool for data analysis, discovery of new information, and autonomous decision-making. This paper focuses on routing algorithms and their appli-cations for computing QoS routes in OSPF protocol. The proposed approach is based on a data mining approach using rough set theory, for which the attribute-value system about links of networks is created from network topology. Rough set theory offers a knowledge discovery approach to extracting routing-decisions from attribute set. The extracted rules can then be used to select significant routing-attributes and make routing-selections in routers. A case study is conducted to demonstrate that rough set theory is effective in finding the most significant attribute set. It is shown that the algorithm based on data mining and rough set offers a promising approach to the attribute-selection prob-lem in internet routing.

MULTI-KEY INDEX FOR DISTRIBUTED DATABASE SYSTEM

2005 ◽  
Vol 15 (02) ◽  
pp. 433-438
Author(s):  
MD. SHAZZAD HOSAIN ◽  
MUHAMMAD ABDUL HAKIM NEWTON
Keyword(s):  
Distributed Databases ◽  
Database Systems ◽  
Distributed Database ◽  
Index Model ◽  
Network Bandwidth ◽  
Distributed Database Systems ◽  
Efficient Access ◽  
Distributed Database System ◽  
Bit Vector ◽  
Centralized Database

In this paper we present a multi-key index model that enables us to search a record with more than one attribute values in distributed database systems. Indices provide fast and efficient access of data and so become a major aspect in centralized database systems. Most of the centralized database systems use B + tree or other types of index structures such as bit vector, graph structure, grid file etc. But in distributed database systems no index model is found in the literature. Therefore efficient access is a major problem in distributed databases. Our proposed index model avoids the query-flooding problem of existing system and thus optimizes network bandwidth.

Distributed database system of the New Atlas of Amphibians and Reptiles in Europe: the NA2RE project

2014 ◽  
Vol 35 (1) ◽  
pp. 33-39 ◽  
Author(s):  
Neftalí Sillero ◽  
Marco Amaro Oliveira ◽  
Pedro Sousa ◽  
Fátima Sousa ◽  
Luís Gonçalves-Seco
Keyword(s):  
Spatial Data ◽  
Distributed Databases ◽  
Species Conservation ◽  
Distributed Database ◽  
Database System ◽  
Data Systems ◽  
Web Interface ◽  
Data Infrastructure ◽  
Societas Europaea ◽  
Distributed Database System

The Societas Europaea Herpetologica (SEH) decided in 2006 through its Mapping Committee to implement the New Atlas of Amphibians and Reptiles of Europe (NA2RE: http://na2re.ismai.pt) as a chorological database system. Initially designed to be a system of distributed databases, NA2RE quickly evolved to a Spatial Data Infrastructure, a system of geographically distributed systems. Each individual system has a national focus and is implemented in an online network, accessible through standard interfaces, thus allowing for interoperable communication and sharing of spatial-temporal data amongst one another. A Web interface facilitates the access of the user to all participating data systems as if it were one single virtual integrated data-source. Upon user request, the Web interface searches all distributed data-sources for the requested data, integrating the answers in an always updated and interactive map. This infrastructure implements methods for fast actualisation of national observation records, as well as for the use of a common taxonomy and systematics. Using this approach, data duplication is avoided, national systems are maintained in their own countries, and national organisations are responsible for their own data curation and management. The database could be built with different representation levels and resolution levels of data, and filtered according to species conservation matters. We present the first prototype of NA2RE, composed of the last data compilation performed by the SEH (Sillero et al., 2014). This system is implemented using only open source software: PostgreSQL database with PostGIS extension, Geoserver, and OpenLayers.

An application of fragmentation transparency in a distributed database system: A case study

1996 ◽  
Vol 35 (3) ◽  
pp. 185-197
Author(s):  
Suzanne Wagner Dietrich ◽  
Changguan Fan ◽  
Enrique Cortes-Rello
Keyword(s):  
Distributed Database ◽  
Database System ◽  
System A ◽  
Distributed Database System

scholarly journals Implementasi Sistem Interkoneksi Basis Data Terdistribusi Menggunakan Socket API

2017 ◽  
Vol 1 (1) ◽  
pp. 1-4
Author(s):  
Ary Yulianto
Keyword(s):  
Information System ◽  
Big Data ◽  
Human Resources ◽  
Distributed Databases ◽  
Distributed Database ◽  
Database System ◽  
Master Data ◽  
Distributed Database System ◽  
The Moment ◽  
Asset Data

  Majelis Pendidikan Dasar dan Menengah Pimpinan Daerah Kabupaten Magelang needs information about the development of the school. The necessary data include data on human resources, asset data and data of their students. At the moment the data is obtained manually by looking to the schools. With the development of information technology is now expected to have a school information system that can provide information quickly and accurately. Data on each school if put into one large server or big data can be used to analyze the data. The purpose of this research is to implement the interconnection of distributed database system using the socket API. It is used to provide master data of all schools under Persyarikatan Muhammadiyah. To support the analysis of the data interconnection of distributed databases, socket API technology is used. With a system like this then the communications database can be connected so that the school's data will be sent directly through the socket API and the data will automatically be processed by the webservice in the server middleware and will be utilized in the next process.

scholarly journals Null Values Treatment in Distributed Databases

2002 ◽  
Vol 40 (1) ◽  
pp. 55-64
Author(s):  
Saran Akram Abd Al-Majeed
Keyword(s):  
Programming Languages ◽  
Relational Databases ◽  
Distributed Databases ◽  
Distributed Database ◽  
Database Management System ◽  
Data Sources ◽  
Relational Model ◽  
A Value ◽  
Null Values ◽  
Distributed Database System

There has been a great deal of discussion about null values in relational databases. The relational model was defined in 1969, and Nulls Was died in 1979. Unfortunately, there is not a generally agreeable solution for rull values problem. Null is a special marker which stands for a value undefined or unknown, which means thut ne entry has been made, a missing valuc mark is not a value and not of a date type and cannot be treated as a value by Database Management System (DBMS). As we know, distributed database users are more than a single database and data will be distributed among several data sources or sites, it must be precise data, the replication is allowed there, so complex problems will appear, then there will be need for perfect practical general approaches for treatment of Nulls. A distributed database system is designed, that is "Hotel reservation control system, based on different data sources at four site, each site is represented as a Hotel, for more heterogeneity different application programming languages there are five practical approaches, designed with their rules and algorithms for Null values treatment through the distributed database sites. (1), (2), (3). 14). 15), (9).

scholarly journals Nonreplicated Static Data Allocation in Distributed Databases Using Biogeography-Based Optimization

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Arjan Singh ◽  
Karanjeet Singh Kahlon ◽  
Rajinder Singh Virk
Keyword(s):  
Data Transfer ◽  
Distributed Databases ◽  
Distributed Database ◽  
Database System ◽  
Data Allocation ◽  
Transmission Cost ◽  
Static Data ◽  
Total Data ◽  
Transfer Cost ◽  
Distributed Database System

Allocation of data is one of the key design issues of distributed database. A major cost of query execution in a distributed database system is the data transfer cost from one site to another site. The allocation of fragments among the different sites over the network plays an important role in performance of the distributed database system. The main objective of a data allocation in distributed database is to place the data fragments at different sites in such a way, so that the total data transfer cost can be minimized while executing a set of queries. In this paper, a new biogeography-based optimization (BBO) algorithm has been used to allocate the fragments during the design of distributed database system. The goal of this paper is to design a fragments allocation algorithm, so that the total data transmission cost can be minimized. To show the performance of proposed algorithm, results of biogeography-based optimization algorithm for data allocation are compared with genetic algorithm.

scholarly journals Query Computation Time and Its Performance over Distributed Database Frameworks

2019 ◽  
Vol 8 (12) ◽  
pp. 5153-5160
Keyword(s):  
Data Privacy ◽  
Privacy Preservation ◽  
Clustering Algorithms ◽  
Distributed Databases ◽  
Computation Time ◽  
Distributed Database ◽  
Vital Role ◽  
Data Set ◽  
Security Issues ◽  
Distributed Database System

It is essential to maintain a relevant methodology for data fragmentation to employ resources, and thus, it needs to choose an accurate and efficient fragmentation methodology to improve authority of distributed database system. This leads the challenges on data reliability, stable storage space and costs, Communication costs, and security issues. In Distributed database framework, query computation and data privacy plays a vital role over portioned distributed databases such as vertical, horizontal and hybrid models, Privacy of any information is regarded as the essential issue in nowadays hence we show an approach by that we can use privacy preservation over the two parties which are actually distributing their data horizontally or vertically. In this chapter, I present an approach by which the concept of hierarchal clustering applied over the horizontally partitioned data set. We also explain the desired algorithm like hierarchal clustering, algorithms for finding the minimum closest cluster. Furthermore, it explores the performance of Query Computation over portioned databases with the analysis of Efficiency and Privacy.

Routing Attribute Data Mining Based on Rough Set Theory

2008 ◽  
pp. 3033-3048 ◽  
Author(s):  
Yanbing Liu ◽  
Shixin Sun ◽  
Menghao Wang ◽  
Hong Tang
Keyword(s):  
Data Mining ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Attribute Selection ◽  
Attribute Data ◽  
Data Mining Approach ◽  
New Information

QOSPF(Quality of Service Open Shortest Path First)based on QoS routing has been recognized as a missing piece in the evolution of QoS-based services in the Internet. Data mining has emerged as a tool for data analysis, discovery of new information, and autonomous decision-making. This paper focuses on routing algorithms and their applications for computing QoS routes in OSPF protocol. The proposed approach is based on a data mining approach using rough set theory, for which the attribute-value system about links of networks is created from network topology. Rough set theory of-fers a knowledge discovery approach to extracting routing-decisions from attribute set. The extracted rules can then be used to select significant routing-attributes and make routing-selections in routers. A case study is conducted to demonstrate that rough set theory is effective in finding the most significant attribute set. It is shown that the algo-rithm based on data mining and rough set offers a promising approach to the attribute-selection problem in internet routing.

Routing Attribute Data Mining Based on Rough Set Theory

2011 ◽  
pp. 322-337
Author(s):  
Yanbing Liu ◽  
Menghao Wang ◽  
Jong Tang
Keyword(s):  
Data Mining ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Attribute Selection ◽  
Attribute Data ◽  
Data Mining Approach ◽  
New Information

QOSPF (Quality of Service Open Shortest Path First) based on QoS routing has been recognized as a missing piece in the evolution of QoS-based services on the Internet. Data mining has emerged as a tool for data analysis, discovery of new information, and autonomous decision making. This article focuses on routing algorithms and their applications for computing QoS routes in OSPF protocol. The proposed approach is based on a data mining approach using rough set theory, for which the attribute-value system about links of networks is created from network topology. Rough set theory offers a knowledge discovery approach toextracting routing decisions from attribute set. The extracted rules then can be used to select significant routing attributes and to make routing selections in routers. A case study is conducted in order to demonstrate that rough set theory is effective in finding the most significant attribute set. It is shown that the algorithm based on data mining and rough set offers a promising approach to the attribute selection problem in Internet routing.

Sign in / Sign up

Export Citation Format

Share Document