Efficient Multidimensional Database Indexing Techniques

dc.contributor.guideNavin Rajpal and B.V.R. Reddy
dc.coverage.spatial
dc.creator.researcherMayank Sharma
dc.date.accessioned2016-11-15T06:38:05Z
dc.date.available2016-11-15T06:38:05Z
dc.date.awarded26/03/2015
dc.date.completed08/2014
dc.date.registered2004
dc.description.abstractConventional multidimensional database indexing systems are efficient in storing the newlinedata at physical level and provide fast accessibility to the stored records as and when newlineuser raises a query seeking information to given keywords as input to the information newlinesystem. A novice user has a tendency to do typographical errors as a result of newlinemisstyped keywords and cognitive errors due to misunderstanding of correct spelling newlineleading to failure in accessing information. This problem arises because traditional newlineindexing systems lack fault-tolerance ability in mapping misspelled keywords to the newlinecorrect records. newline newlineAnother entropy based multidimensional clustering is proposed for generating the newlinemultidimensional cluster tables. This method is based on the statistical structure of newlinelanguage, as successive symbols are not chosen independently but their probabilities newlinedepend on the preceding letters. Dimensional keywords are stored as cluster keys newlinealong with the tagged value generated using the arithmetic coding technique. At the newlinetime of accessing the data value, the new tagged value is computed for the input keyword newline.The tagged interval of input keyword is computed, while this new tagged interval newlinewill either contain required interval of stored cluster key or lie within the tagged newlineinterval of stored cluster key. This process provides fault tolerance ability to multidimensional newlineclustering of table in accessing data when misspelled keys are directly newlinegiven as input to the query process. newline newlineIt has been observed that the results of all the proposed methods were found to newlinemeet the proposed objectives of the thesis. All proposed methods have shown excellent newlinefault-tolerance ability in mapping the misspelled keywords to the records at newlinephysical level. It has been found that qualitatively all the proposed methods are at newlinethe winning position against the conventional indexing method because conventional newlineindexing method does not have fault tolerance ability. Exciting results were found during newlineexperiments performed on multidimensional databases to v
dc.description.note
dc.format.accompanyingmaterialCD
dc.format.dimensions
dc.format.extent
dc.identifier.urihttp://hdl.handle.net/10603/120833
dc.languageEnglish
dc.publisher.institutionUniversity School of Information and Communication Technology
dc.publisher.placeDelhi
dc.publisher.universityGuru Gobind Singh Indraprastha University
dc.relation
dc.rightsuniversity
dc.source.universityUniversity
dc.titleEfficient Multidimensional Database Indexing Techniques
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 13
Loading...
Thumbnail Image
Name:
01_cover page.pdf
Size:
104.5 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
02_certificate.pdf
Size:
54.1 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
03_acknowledgement.pdf
Size:
59.1 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
04_abstract.pdf
Size:
20.84 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
05_toc.pdf
Size:
24.68 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: