66 search results - page 2 / 14 » Finding Graph Matchings in Data Streams |
TAMC
2009
Springer
14 years 4 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
FQAS
2009
Springer
14 years 4 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
PPOPP
2009
ACM
14 years 10 months ago
2009
ACM
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
SIGMOD
2003
ACM
14 years 10 months ago
2003
ACM
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...