Raj Kumar Manala

Dr. Visva Suresh (Victor) Govinda Swamy

Database Design and Development
01/26/2024

CRT #2
Topic #1: Relational Database Management System
Citation: S. Bhat, R. Bhirud and V. Bhokare, "Small-Scale Relational Database Management
System," 2022 IEEE Pune Section International Conference (PuneCon), Pune, India, 2022, pp. 1-
7, doi: 10.1109/PuneCon55413.2022.10014828. keywords: {Structured Query
Language;Java;IEEE Sections;Symbols;Relational
databases;Writing;Generators;Constraint;Referential Integrity;Relational Database Management
System;Schema;Structured Query Language},
Summary: The proposed system introduces a small-scale relational database management
system (DBMS), defining a database as a collection of tables and their schemas. Developed in
Java, it utilizes serializable files for data storage and JavaCC as the parser generator. Each table
comprises tuples/records and attributes/fields.
Unlike commercial systems, it's user-friendly, making it accessible for beginners without the
need for an internet connection. Supporting SQL commands like CREATE, SELECT, INSERT INTO,
DELETE FROM, UPDATE, it ensures data preservation and referential integrity.

Topic #2: Storage Structure in database management system.

Citation: Meng Qi, JinPeng Zhang, XueBin Cong and Hui Kang, "A novel implementation of multi-
tenant database system based on tree-structured storage," World Automation Congress 2012,
Puerto Vallarta, Mexico, 2012, pp. 1-4. keywords: {Database systems;Educational
institutions;Dictionaries;Relational databases;Cloud computing;Data structures;Hybrid-
database;Multi-tenant;Tree-structured storage;Relational database},
Summary: An innovative multi-tenant database system that blends the relational model with
tree-structured storage, akin to hierarchical databases, to enhance efficiency and reduce
storage expenses.
A translation layer acts as middleware, connecting high-level logical views with low-level
physical views of the DBMS. Retaining multi-tenant system features, it emerges as a potent tool
in cloud-storage-dominated environments.
Topic #3: Search Techniques for efficient query processing.
Citation: P. K. Sadineni, "Comparative Study on Query Processing and Indexing Techniques in Big
Data," 2020 3rd International Conference on Intelligent Sustainable Systems (ICISS),
Thoothukudi, India, 2020, pp. 933-939, doi: 10.1109/ICISS49785.2020.9315935. keywords:
{Indexing;Big Data;Query processing;Artificial intelligence;Spatial databases;Social networking
(online);Conferences;Big Data;Query Processing;Indexing techniques;Machine
Learning;Information retrieval},
Summary: The pervasive influence of data in the past decade has led to the emergence of Big
Data, characterized by diverse sources like social networks, mobile devices, e-commerce, and
banking transactions, presenting challenges in storage, processing, and management. Query
processing becomes crucial for efficiently extracting data from databases, employing various
indexing techniques.
This paper explores Big Data's indexing requirements and query processing, presenting a
comparative analysis of Artificial Intelligence (AI) Indexing, Non-Artificial Intelligence (NAI)
Indexing, and Collaborative Artificial Indexing (CAI) Indexing to aid researchers in selecting
appropriate techniques based on their needs.

Topic #4: Integrity constraints in database management systems.

Citation: F. Miranda Reina, A. Huf, D. Presser and F. Siqueira, "Extending the Integrity Constraint
Support in a Graph Database," in IEEE Latin America Transactions, vol. 19, no. 4, pp. 604-611,
April 2021, doi: 10.1109/TLA.2021.9448543.
keywords: {IEEE transactions;Nanoelectromechanical systems;Monitoring;Memory;Indexes;Data
integrity;Big Data;data management;graph database;integrity constraints;data
integrity;OrientDB.},
Summary: The surge in data volume has spurred the development of new storage technologies,
notably graph databases, which have gained significant traction. However, commercially
available graph database management systems often lack mechanisms to ensure data
consistency.
This work proposes extending a graph database management system to incorporate support for
four new integrity constraints, enabling conditions on node attributes, required edges, types of
in/out nodes for an edge, and edge cardinality. These constraints were integrated into a
modified version of OrientDB, yielding performance improvements for applications with
integrity constraints, as demonstrated by experimental results.