3020 search results - page 181 / 604 » Similarity Queries on Structured Data in Structured Overlays |
164
click to vote
IJCGA
2007
15 years 6 months ago
2007
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...
152
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
166
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
180
click to vote
IPTPS
2005
Springer
16 years 4 days ago
2005
Springer
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
234
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
In this paper, we explore the problem of processing a novel type of location based queries, named the location based top-k query, which involves both of spatial and non-spatial sp...