Sciweavers

709 search results - page 60 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
182
Voted
IJAHUC
2008
118views more  IJAHUC 2008»
15 years 5 months ago
Analysis models for unguided search in unstructured P2P networks
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
Bin Wu, Ajay D. Kshemkalyani
INFOSCALE
2006
ACM
15 years 11 months ago
A picture of search
We survey many of the measures used to describe and evaluate the efficiency and effectiveness of large-scale search services. These measures, herein visualized versus verbalized, ...
Greg Pass, Abdur Chowdhury, Cayley Torgeson
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
16 years 6 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...
CCS
2005
ACM
15 years 11 months ago
CPOL: high-performance policy evaluation
Policy enforcement is an integral part of many applications. Policies are often used to control access to sensitive information. Current policy specification languages give users ...
Kevin Borders, Xin Zhao, Atul Prakash
179
Voted
WIDM
2004
ACM
15 years 11 months ago
Ctree: a compact tree for indexing XML data
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
Qinghua Zou, Shaorong Liu, Wesley W. Chu