Welcome to DiSC 2002
SIGMOD 2001
PODS 2001
SIGMOD RECORD 2001
CIKM 2001
CoopIS 2001
DASFAA 2001
DASFAA 2000
DBPL 2001
Data Engineering Bul
DEXA_EC-WEB 2001
DMKD 2001
DPDJ 2001
HYPERTEXT 2001
ICDE 2001
ICDM 2001
ICDT 2001
JCDL 2001
KDD 2001
KDD_EXPLORATIONS 20
KRDB 2001
MDM 2001
MIR 2001
MIS 2001
= MIS'01 Website
<<< = MIS'01 papers>>>
RIDE 2001
SBBD 2001
SIGIR 2001
SIGIR FORUM 2001
SSDBM 2001
SSTD 2001
TODS 2001
TIME 2001
VLDB 2001
VLDBJ 2001

Comparing Semi-Structured Documents via Graph Probing


Daniel P. Lopresti and Gordon T. Wilfong

  View Paper (PDF)  

Return to Papers


Abstract

In this paper, we describe our first steps towards adapting a new approach for graph comparison known as graph probing to allow for the pre-computation of a compact, efficient probe set for databases of graph-structured documents (e.g., Web pages coded in HTML). We consider both the comparison of two graphs in their entirety, as well as determining whether one graph contains a subgraph that closely matches the other. After presenting an overview of work in progress, we provide some preliminary experimental results and suggest directions for future research.


DiSC'02 © 2003 Association for Computing Machinery