SlideShare a Scribd company logo
1 of 2
Download to read offline
 
Data storage without container 
 
The  aim  of  this  article  is  to  propose  a  noble  method  to  store  data  without  any  container.  Many 
companies related to data storage and data analysis store their data in containers to get the specific 
data quickly so that they can deliver data quickly to their customers. Word indexing is very useful for 
many  applications  of  artificial  intelligence.  It  is  used  in  search  engine,  data  mining,  natural  language 
processing  and  some  other  applications  as  well.  Basically,  where  ever  we  need  to  store  word  of  a 
language so that we can use those later, we need to index those. 
 
There are many linear and non linear container is available to store data so that it becomes very easy to 
retrieve data very quickly. Every word in any language is a sequence or pattern by itself. We do not need 
to store that in a container. We can find the location of memory where we have information for that 
word from that word itself by examining the word sequence. 
 
For example, let us define some value for each letter in English. For example, 
A=1, b=2, c=3, d=4, e=5, f=6,g=7, h=8, i=9, j=27, k=11, l=12, m=13,n=14, o=15, p=16, q=17, r=18, s=19, 
t=20, u=21, v=22, w=23, x=24, y=25, z=26 
 
Now, we want to know the location where we have information for the word “brain”. We can calculate 
that in three ways. One way is to give 0 after every letter and another way is to give 0 before a single 
digit letter and last one is to give 0 before two digit letters.  So, for the word “brain”, we will have 
20180109014 as location where we will have information for this word using first method and using 
second  method,  we  will  have  0218010914  as  the  location  and  using  third  method,  we  will  have 
201819014 as the location to store information for the word “brain”. In this way, we do not need any 
tree or any other storage container for indexing words. 
 
Using most of the operating systems available in the market, it will be difficult to achieve that. Because, 
when we want to store data in RAM, which is probably the fastest way to get data from computer, 
operating system assigns a specific area of the RAM for that. But, to implement this method, we need to 
access all memory locations as we will not know which location we need until the data request comes. 
We will have to create a separate simple operating system which can do that quickly or an extension in 
the current operating system so that it could be achievable using existing operating system. 
We can use the whole RAM for it or create a new way to reach to any memory location in the easiest 
way. There will be no intermediate steps to reach the memory location after getting the search word. 
We will get the memory location of the word and directly go to the location of memory and the new OS 
will  be  implemented  in  such  a  way  that  it  can  take  us  to  the  memory  location  very  quickly.  Isn’t  it 
beautiful! The word will give us the clue to find the memory location by itself and it will work for any 
word in any language. 
 
 
Author of this article: 
Mutawaqqil Billah 
Independent Research Scientist, 
B.Sc in Computer Science and Mathematics, 
Ramapo College of New Jersey, USA 
Address : 906/2, East Shewrapara, Mirpur, Dhaka, Bangladesh 
Phone: 8801912479175 
Email : mutawaqqil02@yahoo.com 
 
 
 

More Related Content

Similar to data_storing_without_container

Classification of News and Research Articles Using Text Pattern Mining
Classification of News and Research Articles Using Text Pattern MiningClassification of News and Research Articles Using Text Pattern Mining
Classification of News and Research Articles Using Text Pattern MiningIOSR Journals
 
The search engine index
The search engine indexThe search engine index
The search engine indexCJ Jenkins
 
International Journal of Engineering Research and Development
International Journal of Engineering Research and DevelopmentInternational Journal of Engineering Research and Development
International Journal of Engineering Research and DevelopmentIJERD Editor
 
Data Science - Part XI - Text Analytics
Data Science - Part XI - Text AnalyticsData Science - Part XI - Text Analytics
Data Science - Part XI - Text AnalyticsDerek Kane
 
DICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISH
DICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISHDICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISH
DICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISHcscpconf
 
Dictionary based concept mining an application for turkish
Dictionary based concept mining  an application for turkishDictionary based concept mining  an application for turkish
Dictionary based concept mining an application for turkishcsandit
 
Document Classification Using KNN with Fuzzy Bags of Word Representation
Document Classification Using KNN with Fuzzy Bags of Word RepresentationDocument Classification Using KNN with Fuzzy Bags of Word Representation
Document Classification Using KNN with Fuzzy Bags of Word Representationsuthi
 
Python for Everybody - Solution Challenge 2021
Python for Everybody - Solution Challenge 2021Python for Everybody - Solution Challenge 2021
Python for Everybody - Solution Challenge 2021AshwinRaj57
 
Conceptual foundations of text mining and preprocessing steps nfaoui el_habib
Conceptual foundations of text mining and preprocessing steps nfaoui el_habibConceptual foundations of text mining and preprocessing steps nfaoui el_habib
Conceptual foundations of text mining and preprocessing steps nfaoui el_habibEl Habib NFAOUI
 
IRJET - BOT Virtual Guide
IRJET -  	  BOT Virtual GuideIRJET -  	  BOT Virtual Guide
IRJET - BOT Virtual GuideIRJET Journal
 
Object And Oriented Programing ( Oop ) Languages
Object And Oriented Programing ( Oop ) LanguagesObject And Oriented Programing ( Oop ) Languages
Object And Oriented Programing ( Oop ) LanguagesJessica Deakin
 
A NOVEL APPROACH FOR NAMED ENTITY RECOGNITION ON HINDI LANGUAGE USING RESIDUA...
A NOVEL APPROACH FOR NAMED ENTITY RECOGNITION ON HINDI LANGUAGE USING RESIDUA...A NOVEL APPROACH FOR NAMED ENTITY RECOGNITION ON HINDI LANGUAGE USING RESIDUA...
A NOVEL APPROACH FOR NAMED ENTITY RECOGNITION ON HINDI LANGUAGE USING RESIDUA...kevig
 
FINDING OUT NOISY PATTERNS FOR RELATION EXTRACTION OF BANGLA SENTENCES
FINDING OUT NOISY PATTERNS FOR RELATION EXTRACTION OF BANGLA SENTENCESFINDING OUT NOISY PATTERNS FOR RELATION EXTRACTION OF BANGLA SENTENCES
FINDING OUT NOISY PATTERNS FOR RELATION EXTRACTION OF BANGLA SENTENCESijnlc
 
NLP and its applications
NLP and its applicationsNLP and its applications
NLP and its applicationsUtphala P
 
Semantic Search Component
Semantic Search ComponentSemantic Search Component
Semantic Search ComponentMario Flecha
 
Data Science.pdf
Data Science.pdfData Science.pdf
Data Science.pdfUmar khan
 
Built in data structures in python
Built in data structures in pythonBuilt in data structures in python
Built in data structures in pythonMaria786439
 

Similar to data_storing_without_container (20)

Classification of News and Research Articles Using Text Pattern Mining
Classification of News and Research Articles Using Text Pattern MiningClassification of News and Research Articles Using Text Pattern Mining
Classification of News and Research Articles Using Text Pattern Mining
 
The search engine index
The search engine indexThe search engine index
The search engine index
 
International Journal of Engineering Research and Development
International Journal of Engineering Research and DevelopmentInternational Journal of Engineering Research and Development
International Journal of Engineering Research and Development
 
Data Science - Part XI - Text Analytics
Data Science - Part XI - Text AnalyticsData Science - Part XI - Text Analytics
Data Science - Part XI - Text Analytics
 
DICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISH
DICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISHDICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISH
DICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISH
 
Dictionary based concept mining an application for turkish
Dictionary based concept mining  an application for turkishDictionary based concept mining  an application for turkish
Dictionary based concept mining an application for turkish
 
Document Classification Using KNN with Fuzzy Bags of Word Representation
Document Classification Using KNN with Fuzzy Bags of Word RepresentationDocument Classification Using KNN with Fuzzy Bags of Word Representation
Document Classification Using KNN with Fuzzy Bags of Word Representation
 
Python for Everybody - Solution Challenge 2021
Python for Everybody - Solution Challenge 2021Python for Everybody - Solution Challenge 2021
Python for Everybody - Solution Challenge 2021
 
Conceptual foundations of text mining and preprocessing steps nfaoui el_habib
Conceptual foundations of text mining and preprocessing steps nfaoui el_habibConceptual foundations of text mining and preprocessing steps nfaoui el_habib
Conceptual foundations of text mining and preprocessing steps nfaoui el_habib
 
IRJET - BOT Virtual Guide
IRJET -  	  BOT Virtual GuideIRJET -  	  BOT Virtual Guide
IRJET - BOT Virtual Guide
 
Object And Oriented Programing ( Oop ) Languages
Object And Oriented Programing ( Oop ) LanguagesObject And Oriented Programing ( Oop ) Languages
Object And Oriented Programing ( Oop ) Languages
 
A NOVEL APPROACH FOR NAMED ENTITY RECOGNITION ON HINDI LANGUAGE USING RESIDUA...
A NOVEL APPROACH FOR NAMED ENTITY RECOGNITION ON HINDI LANGUAGE USING RESIDUA...A NOVEL APPROACH FOR NAMED ENTITY RECOGNITION ON HINDI LANGUAGE USING RESIDUA...
A NOVEL APPROACH FOR NAMED ENTITY RECOGNITION ON HINDI LANGUAGE USING RESIDUA...
 
FINDING OUT NOISY PATTERNS FOR RELATION EXTRACTION OF BANGLA SENTENCES
FINDING OUT NOISY PATTERNS FOR RELATION EXTRACTION OF BANGLA SENTENCESFINDING OUT NOISY PATTERNS FOR RELATION EXTRACTION OF BANGLA SENTENCES
FINDING OUT NOISY PATTERNS FOR RELATION EXTRACTION OF BANGLA SENTENCES
 
NLP and its applications
NLP and its applicationsNLP and its applications
NLP and its applications
 
NLP todo
NLP todoNLP todo
NLP todo
 
Data mining
Data miningData mining
Data mining
 
Semantic Search Component
Semantic Search ComponentSemantic Search Component
Semantic Search Component
 
Data Science.pdf
Data Science.pdfData Science.pdf
Data Science.pdf
 
Built in data structures in python
Built in data structures in pythonBuilt in data structures in python
Built in data structures in python
 
10.1.1.118.1099
10.1.1.118.109910.1.1.118.1099
10.1.1.118.1099
 

More from Mutawaqqil Billah

More from Mutawaqqil Billah (14)

sine_wave_theory_of_pixel_sample_graphs
sine_wave_theory_of_pixel_sample_graphssine_wave_theory_of_pixel_sample_graphs
sine_wave_theory_of_pixel_sample_graphs
 
sine_wave_theory_of_pixel_sample_graphs
sine_wave_theory_of_pixel_sample_graphssine_wave_theory_of_pixel_sample_graphs
sine_wave_theory_of_pixel_sample_graphs
 
speech_tree
speech_treespeech_tree
speech_tree
 
speech_recognition
speech_recognitionspeech_recognition
speech_recognition
 
MB_data_network
MB_data_networkMB_data_network
MB_data_network
 
k_nearest_neighbor
k_nearest_neighbork_nearest_neighbor
k_nearest_neighbor
 
colony_data_network
colony_data_networkcolony_data_network
colony_data_network
 
classifier
classifierclassifier
classifier
 
predefined_k_nearest_neighbor
predefined_k_nearest_neighborpredefined_k_nearest_neighbor
predefined_k_nearest_neighbor
 
Alternative_of_Pixel_from_linkedin_post
Alternative_of_Pixel_from_linkedin_postAlternative_of_Pixel_from_linkedin_post
Alternative_of_Pixel_from_linkedin_post
 
sine_wave_theory_of_pixel_comments
sine_wave_theory_of_pixel_commentssine_wave_theory_of_pixel_comments
sine_wave_theory_of_pixel_comments
 
alternative_of_pixel
alternative_of_pixelalternative_of_pixel
alternative_of_pixel
 
sine_wave_theory_of_pixel_proposal
sine_wave_theory_of_pixel_proposalsine_wave_theory_of_pixel_proposal
sine_wave_theory_of_pixel_proposal
 
sine_wave_theory_of_pixel_proposal
sine_wave_theory_of_pixel_proposalsine_wave_theory_of_pixel_proposal
sine_wave_theory_of_pixel_proposal
 

data_storing_without_container

  • 1.   Data storage without container    The  aim  of  this  article  is  to  propose  a  noble  method  to  store  data  without  any  container.  Many  companies related to data storage and data analysis store their data in containers to get the specific  data quickly so that they can deliver data quickly to their customers. Word indexing is very useful for  many  applications  of  artificial  intelligence.  It  is  used  in  search  engine,  data  mining,  natural  language  processing  and  some  other  applications  as  well.  Basically,  where  ever  we  need  to  store  word  of  a  language so that we can use those later, we need to index those.    There are many linear and non linear container is available to store data so that it becomes very easy to  retrieve data very quickly. Every word in any language is a sequence or pattern by itself. We do not need  to store that in a container. We can find the location of memory where we have information for that  word from that word itself by examining the word sequence.    For example, let us define some value for each letter in English. For example,  A=1, b=2, c=3, d=4, e=5, f=6,g=7, h=8, i=9, j=27, k=11, l=12, m=13,n=14, o=15, p=16, q=17, r=18, s=19,  t=20, u=21, v=22, w=23, x=24, y=25, z=26    Now, we want to know the location where we have information for the word “brain”. We can calculate  that in three ways. One way is to give 0 after every letter and another way is to give 0 before a single  digit letter and last one is to give 0 before two digit letters.  So, for the word “brain”, we will have  20180109014 as location where we will have information for this word using first method and using  second  method,  we  will  have  0218010914  as  the  location  and  using  third  method,  we  will  have  201819014 as the location to store information for the word “brain”. In this way, we do not need any  tree or any other storage container for indexing words.    Using most of the operating systems available in the market, it will be difficult to achieve that. Because,  when we want to store data in RAM, which is probably the fastest way to get data from computer,  operating system assigns a specific area of the RAM for that. But, to implement this method, we need to  access all memory locations as we will not know which location we need until the data request comes.  We will have to create a separate simple operating system which can do that quickly or an extension in  the current operating system so that it could be achievable using existing operating system. 
  • 2. We can use the whole RAM for it or create a new way to reach to any memory location in the easiest  way. There will be no intermediate steps to reach the memory location after getting the search word.  We will get the memory location of the word and directly go to the location of memory and the new OS  will  be  implemented  in  such  a  way  that  it  can  take  us  to  the  memory  location  very  quickly.  Isn’t  it  beautiful! The word will give us the clue to find the memory location by itself and it will work for any  word in any language.      Author of this article:  Mutawaqqil Billah  Independent Research Scientist,  B.Sc in Computer Science and Mathematics,  Ramapo College of New Jersey, USA  Address : 906/2, East Shewrapara, Mirpur, Dhaka, Bangladesh  Phone: 8801912479175  Email : mutawaqqil02@yahoo.com