Sciweavers

332 search results - page 15 / 67
» Space Complexity vs. Query Complexity
Sort
View
VLDB
2002
ACM
113views Database» more  VLDB 2002»
14 years 10 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
AMAST
2008
Springer
13 years 12 months ago
Generating Specialized Rules and Programs for Demand-Driven Analysis
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...
K. Tuncay Tekle, Katia Hristova, Yanhong A. Liu
SSD
2007
Springer
146views Database» more  SSD 2007»
14 years 4 months ago
Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy
In this paper we propose a fundamental approach to perform the class of Nearest Neighbor (NN) queries, the core class of queries used in many of the location-based services, withou...
Ali Khoshgozaran, Cyrus Shahabi
VLDB
2005
ACM
129views Database» more  VLDB 2005»
14 years 3 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
INFOSCALE
2006
ACM
14 years 3 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