Sciweavers

329 search results - page 9 / 66
» Efficient Parallel Query Processing by Graph Ranking
Sort
View
WSDM
2009
ACM
125views Data Mining» more  WSDM 2009»
14 years 2 months ago
Less is more: sampling the neighborhood graph makes SALSA better and faster
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
Marc Najork, Sreenivas Gollapudi, Rina Panigrahy
WEBDB
2010
Springer
208views Database» more  WEBDB 2010»
13 years 5 months ago
XML-Based RDF Data Management for Efficient Query Processing
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
Mo Zhou, Yuqing Wu
HPTS
1993
146views Database» more  HPTS 1993»
13 years 11 months ago
Parallel Query Processing in Shared Disk Database Systems
System developments and research on parallel query processing have concentrated either on "Shared Everything" or "Shared Nothing" architectures so far. While t...
Erhard Rahm
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
14 years 7 months ago
Ranking queries on uncertain data: a probabilistic threshold approach
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
14 years 7 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...