Article Fingerprint
ReserarchID
5891B
through this study, we propose two algorithms. The first algorithm describes the concept of compression of domains at attribute level and we call it as “Attribute Domain Compression”. This algorithm can be implemented on both row and columnar databases. The idea behind the algorithm is to reduce the size of large databases as to store them optimally. The second algorithm is also applicable for both concepts of databases but will optimally work for columnar databases. The idea behind the algorithm is to generalize the tuple domains by giving it a value say (n) such that all other n-1 tuples or at least maximum can be identified.
Mehul Mahrishi. 1970. \u201caoGlobally Recorded binary encoded Domain Compression algorithm in Column Oriented Databasesa\u201d. Unknown Journal GJCST Volume 11 (GJCST Volume 11 Issue 23).
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 103
Country: India
Subject: Uncategorized
Authors: Mehul Mahrishi ,Anita Shrotriya, Devendra Kr. Sharma (PhD/Dr. count: 0)
View Count (all-time): 146
Total Views (Real + Logic): 20629
Total Downloads (simulated): 10986
Publish Date: 1970 01, Thu
Monthly Totals (Real + Logic):
This study aims to comprehensively analyse the complex interplay between
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.