329 search results - page 11 / 66 » Efficient Parallel Query Processing by Graph Ranking |
SIGMOD
2010
ACM
13 years 7 months ago
2010
ACM
Automated extraction of structured data from Web sources often leads to large heterogeneous knowledge bases (KB), with data and schema items numbering in the hundreds of thousands...
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...
COLING
2008
13 years 8 months ago
2008
Query-oriented update summarization is an emerging summarization task very recently. It brings new challenges to the sentence ranking algorithms that require not only to locate th...
EDBT
2010
ACM
13 years 10 months ago
2010
ACM
A key advantage of scientific workflow systems over traditional scripting approaches is their ability to automatically record data and process dependencies introduced during workf...
RP
2010
Springer
13 years 5 months ago
2010
Springer
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...