329 search results - page 16 / 66 » Efficient Parallel Query Processing by Graph Ranking |
AAAI
1990
13 years 9 months ago
1990
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...
WWW
2002
ACM
14 years 9 months ago
2002
ACM
In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the rel...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
IPPS
2002
IEEE
14 years 1 months ago
2002
IEEE
Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimi...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...