The TV-tree -- an Index Structure for High-Dimensional Data

Simple item page
dc.contributor.authorLin, King-Ip D.en_US
dc.contributor.authorJagadish, H.V.en_US
dc.contributor.authorFaloutsos, Christosen_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:56:50Z
dc.date.available2007-05-23T09:56:50Z
dc.date.issued1994en_US
dc.description.abstractWe propose a file structure to index high-dimensionality data, typically, points in some feature space. The idea is to use only a few of the features, utilizing additional features whenever the additional discriminatory power is absolutely necessary. We present in detail the design of our tree structure and the associated algorithms that handle such 'varying length' feature vectors. Finally we report simulation results, comparing the proposed structure with the R*-tree, which is one of the most successful methods for low-dimensionality spaces. The results illustrate the superiority of our method, with up to 80% savings in disk accesses.en_US
dc.format.extent1167729 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/5526
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1994-52en_US
dc.subjectsignal processingen_US
dc.subjectdatabasesen_US
dc.subjectdata structuresen_US
dc.subjecttelemedicineen_US
dc.subjectSystems Integrationen_US
dc.titleThe TV-tree -- an Index Structure for High-Dimensional Dataen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_94-52.pdf
Size:
1.11 MB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports