329 search results - page 13 / 66 » Efficient Parallel Query Processing by Graph Ranking |
ICDE
2010
IEEE
14 years 7 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...
PVLDB
2008
13 years 6 months ago
2008
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
EDBTW
2006
Springer
13 years 11 months ago
2006
Springer
The data volume of XML repositories and the response time of query processing have become critical issues for many applications, especially for those in the Web. An interesting alt...
TREC
2008
13 years 8 months ago
2008
PageRank is a way to rank Web pages taking into account hyper-link structure of the Web. PageRank provides efficient and simple method to find out ranking of Web pages exploiting ...