Sciweavers

529 search results - page 36 / 106
» Query Processing for Distance Metrics
Sort
View
CAISE
2005
Springer
14 years 3 months ago
Estimating Recall and Precision for Vague Queries in Databases
In vague queries, a user enters a value that represents some real world object and expects as the result the set of database values that represent this real world object even with ...
Raquel Kolitski Stasiu, Carlos A. Heuser, Roberto ...
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
12 years 9 days 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
ISCI
2006
145views more  ISCI 2006»
13 years 9 months ago
Processing count queries over event streams at multiple time granularities
Management and analysis of streaming data has become crucial with its applications in web, sensor data, network traffic data, and stock market. Data streams consist of mostly nume...
Aykut Ünal, Yücel Saygin, Özgü...
ADC
1999
Springer
68views Database» more  ADC 1999»
14 years 2 months ago
A Query-sensitive Cost Model for Similarity Queries with M-tree
We introduce a cost model for the M-tree access method [Ciaccia et al., 1997] which provides estimates of CPU (distance computations) and I/O costs for the execution of similarity ...
Paolo Ciaccia, A. Nanni, Marco Patella
CN
2006
56views more  CN 2006»
13 years 10 months ago
Maximizing remote work in flooding-based peer-to-peer systems
In peer-to-peer (P2P) systems where individual peers must cooperate to process each other's requests, a useful metric for evaluating the system is how many remote requests ar...
Qixiang Sun, Neil Daswani, Hector Garcia-Molina