NDLI: Efficient search of a sequence of words in a large text file

Content Provider	IEEE Xplore Digital Library
Author	Kabir, M.N. Alginahi, Y.M. Tayan, O.
Copyright Year	2014
Description	Author affiliation: IT Res. Center for the Holy Quran & its Sci. (NOOR), Taibah Univ., Madinah, Saudi Arabia (Kabir, M.N.; Alginahi, Y.M.; Tayan, O.)
Abstract	Searching a specific word or sequence of words, or quotations in a large text document is generally performed by string matching algorithms. Specific word can be more efficiently searched by using suitable hash functions on a hash table where the words of the large text file are organized in order. In this paper, we present a new technique of efficient search of a sequence of words in a large text file using the concept of hashing and linked list. For building the hash table, the words are organized in order. The number of occurrences and positions of each word and positions of its next words are added to the record of each word in the hash table. Any word can be searched using a simple hash function and the subsequent word can be located using the position of next word since this information is available with the record of current word making the hash table as a linked list of words. Since the text file is large, there would be redundancy of hash functional values. Therefore, hash function is used only to locate the upper and lower bounds of the first word. Then an algorithm like binary-search method is used to find the word in the table. We provide our methodology of building the hash table and search techniques. Plausible tests are carried out with simple examples to demonstrate how the algorithms work. Time and space complexities are also computed to show the efficiency of the method.
Starting Page	1
Ending Page	6
File Size	1080419
Page Count	6
File Format	PDF
ISBN	9781479928057
e-ISBN	9781479928064
DOI	10.1109/WSCAR.2014.6916784
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-01-18
Publisher Place	Tunisia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Large document Text recognition Memory management String matching Linked lists Indexes Hash table Text searching
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient peer-to-peer keyword searching.

A Multi-dimensional Progressive Perfect Hashing for High-Speed String Matching

Efficient Wu Manber String Matching Algorithm for Large Number of Patterns

Pacific Symposium on Biocomputing 8:303-314(2003) MAP: SEARCHING LARGE GENOME DATABASES �

Efficient fuzzy search enabled hash map

MAP: Searching large genome databases (2003)

Piers: An efficient model for similarity search in dna sequence databases

XML Prefiltering as a String Matching Problem

Decoding of the (47, 24, 11) Quadratic Residue Code with Hash Table

Efficient search of a sequence of words in a large text file

Similar Documents

Efficient peer-to-peer keyword searching.

A Multi-dimensional Progressive Perfect Hashing for High-Speed String Matching

Efficient Wu Manber String Matching Algorithm for Large Number of Patterns

Pacific Symposium on Biocomputing 8:303-314(2003) MAP: SEARCHING LARGE GENOME DATABASES �

Efficient fuzzy search enabled hash map

MAP: Searching large genome databases (2003)

Piers: An efficient model for similarity search in dna sequence databases

XML Prefiltering as a String Matching Problem

Decoding of the (47, 24, 11) Quadratic Residue Code with Hash Table

Efficient search of a sequence of words in a large text file