Normalised LCS-based method for indexing multidimensional data cube
by Mayank Sharma; Navin Rajpal; B.V. Ramana Reddy; Ravindra Kumar Purwar
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 7, No. 2, 2013

Abstract: Query processors fail to retrieve information of interest in the presence of misspelled keywords given by users. The above problem persists because most of currently used indexing system does not have fault-tolerance ability to map the misspelled keywords to the correct records stored at physical level of databases. Therefore, the information retrieval systems need additional support of spell check mechanism with limitations for correction of misspelled keywords before submitting them to query processors. In this paper, a data indexing system is introduced for indexing multidimensional data cube, which maps the keywords to the records stored at physical level in multidimensional data structure and also has normalised longest common subsequence-based string approximation method to find correct keywords against misspelled keywords which comes directly to indexing processes through user queries. It provides more than 90% accurate results in mapping misspelled keywords to the physically stored records. These results are consistent even for large datasets.

Online publication date: Fri, 26-Apr-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email