Skip Navigation

The Computer Journal 1991 34(5):415-422; doi:10.1093/comjnl/34.5.415
© 1991 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Dandamudi, S. P.
Right arrow Articles by Sorenson, P. G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Improved Partial-Match Search Algorithms for BD Trees

S. P. Dandamudi1 * and P. G. Sorenson2

1 School of Computer Sciences, Carleton University, Ottawa, Ontario K1S 5B6, Canada, 2 Department of Computational Science, University of Saskatchewan, Saskatoon, Saskatchewan S7N 0W0, Canada

Partial-match search queries form an important class of queries posed to a database system. Several storage structures have been proposed to answer these queries efficiently. The BD tree is an example of such a storage structure. A partial-match search algorithm, called AORIG, is given in Ref. 5. This paper presents three algorithms – ALOCAL, ACOMP and AGLOBAL – that represent three levels of improvement to AORIG. Each one yields successively more benefit at the cost of more complexity. All the improvements centre on avoiding the exploration of unnecessary OUT branches. It is shown that AGLOBAL is the best partial-match search algorithm in the sense that no other algorithm searches fewer internal and external nodes. The worst-case complexity of performing a partial-match search in BD trees using AGLOBAL is shown to be the same as that for the k-d trees.

Received May 1987. revised March 1991.

* To whom correspondence should be addressed. Now at: School of Computer Science, Carleton University, Ottawa, Ontario K1S 5B6, Canada.

§ Department of Computational Science, University of Saskatchewan, Saskatoon, Saskatchewan S7N 0W0, Canada


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.