Sciweavers

329 search results - page 36 / 66
» Efficient Parallel Query Processing by Graph Ranking
Sort
View
CCGRID
2004
IEEE
13 years 11 months ago
Serving queries to multi-resolution datasets on disk-based storage clusters
This paper is concerned with efficient querying of very large multi-resolution datasets on storage and compute clusters. We present a suite of services that support storage, index...
Xi Zhang, Tony Pan, Ümit V. Çataly&uum...
HPDC
2010
IEEE
13 years 8 months ago
New caching techniques for web search engines
This paper proposes a cache hierarchy that enables Web search engines to efficiently process user queries. The different caches in the hierarchy are used to store pieces of data w...
Mauricio Marín, Veronica Gil Costa, Carlos ...
WWW
2008
ACM
14 years 8 months ago
SPARQL basic graph pattern optimization using selectivity estimation
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
14 years 8 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
CVPR
2005
IEEE
14 years 9 months ago
Spectral Segmentation with Multiscale Graph Decomposition
We present a multiscale spectral image segmentation algorithm. In contrast to most multiscale image processing, this algorithm works on multiple scales of the image in parallel, w...
Florence Bénézit, Jianbo Shi, Timoth...