Novel Algorithm for Faster Multi-Keyword Search in Structured Databases

  • Unique Paper ID: 145218
  • Volume: 4
  • Issue: 8
  • PageNo: 20-25
  • Abstract:
  • Searching the major part of the database operation. For accessing any of the information from the database it is always required to perform the search. If the search process is efficient then the time taken the get the required information will also be less. In the scenario which we have taken contain the information organized in the structured data for the big organization like any automobile industry maintaining information regarding its department. Now if we perform the keyword based query, then on based of the keyword the queries will be formed. So, in order to reduce the time involved in the formation of the queries from the table we have suggested the use of the associative mapping table in the search mechanism which will reduce the time involved in the process.

Copyright & License

Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

BibTeX

@article{145218,
        author = {Abhishek Kumar Dinkar and Sayar Singh Shekhawat},
        title = {Novel Algorithm for Faster Multi-Keyword Search in Structured Databases},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {4},
        number = {8},
        pages = {20-25},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=145218},
        abstract = {Searching the major part of the database operation. For accessing any of the information from the database it is always required to perform the search. If the search process is efficient then the time taken the get the required information will also be less. In the scenario which we have taken contain the information organized in the structured data for the big organization like any automobile industry maintaining information regarding its department. Now if we perform the keyword based query, then on based of the keyword the queries will be formed. 
So, in order to reduce the time involved in the formation of the queries from the table we have suggested the use of the associative mapping table in the search mechanism which will reduce the time involved in the process.},
        keywords = {Database, Keyword Search, Structured Organization of Data. },
        month = {},
        }

Cite This Article

  • ISSN: 2349-6002
  • Volume: 4
  • Issue: 8
  • PageNo: 20-25

Novel Algorithm for Faster Multi-Keyword Search in Structured Databases

Related Articles