Sciweavers

608 search results - page 19 / 122
» Distributed Searching of Multi-dimensional Data: A Performan...
Sort
View
PPOPP
2012
ACM
12 years 3 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
DASFAA
2010
IEEE
189views Database» more  DASFAA 2010»
14 years 20 days ago
Peer-to-Peer Similarity Search Based on M-Tree Indexing
Similarity search in metric spaces has several important applications both in centralized and distributed environments. In centralized applications, such as similarity-based image ...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
KDD
2009
ACM
248views Data Mining» more  KDD 2009»
14 years 3 days ago
PSkip: estimating relevance ranking quality from web search clickthrough data
1 In this article, we report our efforts in mining the information encoded as clickthrough data in the server logs to evaluate and monitor the relevance ranking quality of a commer...
Kuansan Wang, Toby Walker, Zijian Zheng
GRID
2007
Springer
14 years 1 months ago
Data placement for scientific applications in distributed environments
— Scientific applications often perform complex computational analyses that consume and produce large data sets. We are concerned with data placement policies that distribute dat...
Ann L. Chervenak, Ewa Deelman, Miron Livny, Mei-Hu...
DEBS
2010
ACM
13 years 2 months ago
Distributed structural and value XML filtering
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...
Iris Miliaraki, Manolis Koubarakis