Sciweavers

Share
FQAS
2009
Springer
127views Database» more  FQAS 2009»
8 years 11 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of ļ¬nding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
books