Location of Repository

Compiled hierarchical retrieval

By Robert Levinson and Gerard Ellis

Abstract

As large databases of conceptual graphs are developed for complex domains, efficient retrieval techniques must be developed to manage the complexity of graph-matching while maintaining reasonable space requirements. This paper describes a novel method "the multi-level hierarchical retrieval method" that exploits redundancy to improve both space and execution time efficiency. The method involves search in multiple partially ordered (by "more-general-than") hierarchies such that search in a simpler hierarchy reduces the search time in the hierarchy of next complexity. The specific hierarchies used are: the traditional partial order over conceptual graphs; a partial order over node descriptors; a partial order over "descriptor units"; and finally, the simplest partial order is the traditional type hierarchy

Topics: chemistry [16, chess[9, 11, VLSI CAD designs, structural designs, etc. In these domains, since many
Publisher: University of California at Santa Cruz
Year: 1992
OAI identifier: oai:CiteSeerX.psu:10.1.1.29.8821
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • ftp://ftp.cse.ucsc.edu/pub/tr/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.