An Approximate Search Engine for Structural Databases

Summary: Proposes an approximate search engine for structural databases, trading exact isomorphism for fast, approximate matching. Applies to trees, graphs, and labelled point sets (proteins, phylogenies, XML) via compact heuristics for near-instant comparisons. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 3234
Venue: SIGMOD
Year: 2000
Pagerank: 0.00012629219
Overall Rank: 1,316 | 90.85%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
54	DISCOVER: Keyword Search in Relational Databases	2002	VLDB	0.00066047203

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
4,958	Efficient Subgraph Search over Large Uncertain Graphs	2011	VLDB	5.8031038e-05
2,183	Keyword Search on External Memory Data Graphs	2008	VLDB	9.3439219e-05
988	Efficient Keyword Search for Smallest LCAs in XML Databases	2005	SIGMOD	0.00014819156
8,029	Understanding Queries in a Search Database System	2010	PODS	4.6028544e-05
6,370	Efficient Implementation of Large-Scale Multi-Structural Databases	2005	VLDB	5.0935585e-05
12,648	Searching on the Secondary Structure of Protein Sequences	2002	VLDB	4.1945683e-05
7,226	Efficient Search in Very Large Databases	1988	VLDB	4.7953551e-05
3,862	A Partition-Based Approach to Structure Similarity Search	2014	VLDB	6.687769e-05
572	Substructure Similarity Search in Graph Databases	2005	SIGMOD	0.00019887011
171	Algorithmics and Applications of Tree and Graph Searching	2002	PODS	0.00038830709