53 search results - page 1 / 11 » PrefIndex: An Efficient Supergraph Containment Search Techni... |
SSDBM
2010
IEEE
13 years 2 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
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...
IFIP12
2007
13 years 6 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
ICIP
1998
IEEE
14 years 6 months ago
1998
IEEE
Motion estimation represents the most computationally intensive task for all efficient motion compensated compression standards. This fact, despite the several eflorts aiming at r...
ICDE
2003
IEEE
14 years 6 months ago
2003
IEEE
Semantic caches, originally proposed for client-server database systems, are being recently deployed to accelerate the serving of dynamic web content by transparently caching data...