481 search results - page 83 / 97 » Approximate XML Query Answers |
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
While work in recent years has demonstrated that wavelets can be efficiently used to compress large quantities of data and provide fast and fairly accurate answers to queries, lit...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffici...
WSDM
2009
ACM
14 years 2 months ago
2009
ACM
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...