53 search results - page 3 / 11 » PrefIndex: An Efficient Supergraph Containment Search Techni... |
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
Incomplete databases, that is, databases that are missing data, are present in many research domains. It is important to derive techniques to access these databases efficiently. We...
AAAI
2000
13 years 8 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
SIGIR
2010
ACM
13 years 2 months ago
2010
ACM
The size of the Web as well as user bases of search systems continue to grow exponentially. Consequently, providing subsecond query response times and high query throughput become...
ICWS
2008
IEEE
13 years 8 months ago
2008
IEEE
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...