Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/8869
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Wood, D. | en_US |
dc.contributor.author | Woodford, Brenda | en_US |
dc.date.accessioned | 2014-06-18T16:44:14Z | - |
dc.date.available | 2014-06-18T16:44:14Z | - |
dc.date.created | 2011-03-30 | en_US |
dc.date.issued | 1977-08 | en_US |
dc.identifier.other | opendissertations/4039 | en_US |
dc.identifier.other | 5056 | en_US |
dc.identifier.other | 1911189 | en_US |
dc.identifier.uri | http://hdl.handle.net/11375/8869 | - |
dc.description.abstract | <p>A study of the tree structures developed by Finkel and Bentley (3 & 4) was done and the results are documented in this report. These tree structures, i.e. the quad tree and the k-d tree, were especially developed for associative retrieval. A comparison of the above tree structures and the well known binary search tree is presented for exact match queries.</p> <p>An implementation of the insertion algorithms for each tree structure and a generalization of Aldon Walker's (9) display algorithm are given.</p> | en_US |
dc.subject | Library and Information Science | en_US |
dc.subject | Library and Information Science | en_US |
dc.title | An Investigation of Some New Tree Structures | en_US |
dc.type | thesis | en_US |
dc.contributor.department | Library Science | en_US |
dc.description.degree | Doctor of Philosophy (PhD) | en_US |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Size | Format | |
---|---|---|---|
fulltext.pdf | 2.98 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.