157 search results - page 1 / 32 » On indexing error-tolerant set containment |
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
SIGMOD
2010
ACM
13 years 2 months ago
2010
ACM
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
VLDB
2007
ACM
14 years 4 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
CIKM
2006
Springer
13 years 8 months ago
2006
Springer
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...