An approximate search engine for structural databases

  • Authors:

  • Jason T. L. Wang;Xiong Wang;Dennis Shasha;Bruce A. Shapiro;Kaizhong Zhang;Qicheng Ma;Zasha Weinberg

  • Affiliations:

  • Dept. of CIS, NJIT, NJ;-;Courant Institute of Mathematical Sciences, New York, University, New York, NY;Experimental and Computational Biology Lab, National, Cancer Institute, Frederick, MD;Dept. of Computer Science, University of Western Ontario, London, Ontario, N6A 5B7, Canada;Dept. of CIS, NJIT, NJ;Dept. of Computer Science & Engineering, University of, Washington, Seattle, WA

  • Venue:
  • SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

When a person interested in a topic enters a keyword into a Web search engine, the response is nearly instantaneous (and sometimes overwhelming). The impressive speed is due to clever inverted index structures, caching, and a domain-independent knowledge of strings. Our project seeks to construct algorithms, data structures, and software that approach the speed of keyword-based search engines for queries on structural databases.A structural database is one whose data objects include trees, graphs, or a set of interrelated labeled points in two, three, or higher dimensional space. Examples include databases holding (i) protein secondary and tertiary structure, (ii) phylogenetic trees, (iii) neuroanatomical networks, (iv) parse trees, (v) molecular diagrams, and (vi) XML documents. Comparison queries on such databases require solving variants of the graph isomorphism or subisomorphism problems (for which all known algorithms are exponential), so we have explored a large heuristic space.