Blockchain and Blackboard Technology for Database Systems

Table of contents

1.

lockchain made valid chain of transactions using decryption codes. It made transaction between two nodes by introducing intermediate node or Steiner node.

Steiner tree is optimal tree by introducing intermediate node or Steiner node.

The Blockchain technology may be studied using strainer trees. Here OTP is FOT number

The logical design Blockchain technology does not change logical independence. The transaction shall be made with or without Blockchain technology but Blockchain technology is minimize the series of transactions. For instance, logical query is given by Q1: Update loan return amount paid by borrower.

2. IV. MAPREDUCE ALGORITHM FOR CONCURRENCY USING BLACKBOARD SYSTEM

Usually in database systems, the entire data has to taken into main memory for operation. There is no need to take entire data in main memory in Blackboard Architecture, Blackboard Architecture used to store and retrieve knowledge sources [3]. Data mining is a knowledge discovery process. Blackboard Architecture may used to store and retrieve data sources. Parallel, distributed and concurrent retrieval of data items shall be achieved through the Blackboard architecture.

The blackboard systems may construct with the creation of data item sources in Oracle. Here is algorithm is given to create blackboard architecture, store and retrieve for data item sources.

For instance, each account is a table for banking information systems. --------------------------------------------------8347102 Rama 10000 SQL> select * from ab8347103 where acno=8347103; ------------------------------------------------- The transaction may be defined using SQL as UPDATE ab8347107 SET balance = balance + 1000 WHERE account no = ; ab8347107. These data items are stored in blackboard structure. h(x) is create, store and retrieval of data sources. When transaction being possessing, there is no need to take entire database into main memory. Just it is sufficient to retrieval of particular data item of particular transaction from the blackboard system.

3. Algorithm: Begin

4. ACNO ACNAME ACBAL

The advantage of blackboard architecture is directly operated on data sources.

The Blockchain technology is also operates on data sources or data items to direct transactions.

Figure 1. Figure 1 :
1Figure 1: Blockchain Where A is peer node and T is transaction II. MAPREDUCE ALGORITHMS The Relational Data set is representation with domains and tuples [14]. Map is reading data sets and Reduce is writing datasets Definition: A relational database or data set is defined as collection of attributes A 1 . A 2 ... A m and is represented as
Figure 2.
III. MAPREDUCE ALGORITHMS FOR LOGICAL DESIGN USING BLOCKCHAIN TECHNOLOGY Steiner tree is tree by b introducing intermediate node to made minimum Steiner tree. Blockchain and Blackboard Technology for Database Systems Global Journal of Computer Science and Technology Volume XXII Issue III Version I
Figure 3. Figure 7 :
7Figure 7: Tree
Figure 4. Figure 8 :
8Figure 8: Steiner Node
Figure 5. Figure 9 :
9Figure 9: Steiner Tree Blockchain is direct transactions from source to destination; For instance, the amount for account to another account shall be transferred with 'OTP number (Steiner nod).
Figure 6. Figure 10 :
10Figure 10: Bank Loan
Figure 7.
Figure 11: Blockchain
Inserted accounts into blackboard structure.
SQL> insert into ab8347102 values (8347102, 'Rama',
10000);
SQL> insert into ab8347103 values (8347103, 'Sita',
16000);
SQL> insert into ab8347104 values (8347104, 'John',
20000);
SQL> insert into 8347105 values (8347105, 'Khan',
15000);
SQL> insert into ab8347106 values (8347106, 'Marry',
18000);
SQL> insert into ab8347107 values (8347107, 'Krishna',
25000);
Select each account number from blackboard structure.
SQL> select * from ab8347102 where acno=8347102;
ACNO ACNAME ACBAL
Insert data item into account number table
Retrieve data item from account number table
End
Each data item is data source which is created by h(x)
account number table.
The blackboard structure is created with each account.
SQL> create table ab8347102 (acno int, acname
varchar (10), acbal real);
Figure 8.
WHERE condition;
Here is an example
CREATE VIEW account AS
SELECT *
FROM ab8347101, ab8347102,?, ab834710.
Year 2022
( ) C
-
8347103 Sita 16000
© 2022 Global Journals

Appendix A

  1. Blackboard Systems, Addison-Wesley.
  2. Effective inference control for range SUM queries. F Y Chin . Theoretical Computer Science 1974. 32 p. . (Blackboard System)
  3. Introduction to Data Mining, P N Tan , V Steinbach , V Kumar . 2006. Addison-Wesley.
  4. Generalized Fuzzy Data Mining for Decision Management. Poli Venkata , Subba Reddy . International Conference on Fuzzy Theory and Its Applications, (Kenting, Taiwan
    ) 2017. 2017. Nov.12-15, 2017.
  5. Fuzzy MapReduce Data Mining Algorithms. Polivenkta Subba Reddy . International Conference ACM, 2018. 15 p. .
  6. Fuzzy MapReduce Data Mining Algorithms. Polivenkta Subba Reddy . International Conference on Fuzzy Theory and Its Applications (iFUZZY2018), 2018. November 14-17. 2018.
  7. , Robert Englemore , Tony Morgan . 1988.
  8. Data sets Management Systems, R Ramakrishnan , J Gehrike . 2003. 2003. McGraw-Hill.
  9. Data sets Management Systems, R Ramakrishnan , J Gehrike . 2003. 2003. McGraw-Hill.
  10. File Organization: the Consecutive Retrieval Property, Communications of, S P Ghosh . 1972.
  11. On Existence of C-R Property. Venkata Subba Reddy Poli . Proceedings of Mathematical Society, B.H.U, 5, (Mathematical Society, B.H.U, 5) 1989. p. .
  12. Fuzzy MapReduce Data Mining Algorithms. Venkta Subba Reddy Poli . International Conference on Fuzzy Theory and Its Applications (iFUZZY2018), (Kenting, Taiwan
    ) 2108. 2018. November 4-17.
  13. Fuzzy MapReduce Data Mining Algorithms. Venkta Subba Reddy Poli . International Conference on Fuzzy Theory and Its Applications (iFUZZY2018), (Kenting, Taiwan
    ) 2108. 2018. November 4-17.
Date: 2022 1970-01-01