Madhavan, CE Veni (1984) Secondary attribute retrieval using tree data structures. In: Theoretical Computer Science, 33 (1). pp. 107-116.
3fulltext.pdf - Published Version
Restricted to Registered users only
Download (1026Kb) | Request a copy
Several techniques are known for searching an ordered collection of data. The techniques and analyses of retrieval methods based on primary attributes are straightforward. Retrieval using secondary attributes depends on several factors. For secondary attribute retrieval, the linear structures—inverted lists, multilists, doubly linked lists—and the recently proposed nonlinear tree structures—multiple attribute tree (MAT), K-d tree (kdT)—have their individual merits. It is shown in this paper that, of the two tree structures, MAT possesses several features of a systematic data structure for external file organisation which make it superior to kdT. Analytic estimates for the complexity of node searchers, in MAT and kdT for several types of queries, are developed and compared.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Elsevier Science B.V.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||08 Feb 2010 11:50|
|Last Modified:||19 Sep 2010 05:31|
Actions (login required)