Sciweavers

92 search results - page 8 / 19
» Conjunctive Query Evaluation by Search Tree Revisited
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 9 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
SIGIR
2005
ACM
14 years 29 days ago
Information retrieval system evaluation: effort, sensitivity, and reliability
The effectiveness of information retrieval systems is measured by comparing performance on a common set of queries and documents. Significance tests are often used to evaluate the...
Mark Sanderson, Justin Zobel
WIDM
2005
ACM
14 years 29 days ago
Exploiting native XML indexing techniques for XML retrieval in relational database systems
In XML retrieval, two distinct approaches have been established and pursued without much cross-fertilization taking place so far. On the one hand, native XML databases tailored to...
Felix Weigel, Klaus U. Schulz, Holger Meuss
IPPS
2007
IEEE
14 years 1 months ago
A Landmark-based Index Architecture for General Similarity Search in Peer-to-Peer Networks
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
Xiaoyu Yang, Yiming Hu
VLDB
2002
ACM
113views Database» more  VLDB 2002»
14 years 7 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro