2843 search results - page 104 / 569 » On Efficient Spatial Matching |
139
click to vote
SAC
2006
ACM
15 years 3 months ago
2006
ACM
The paper presents an ontology-based approach to service discovery, apt to support flexible and efficient matchmaking between service descriptions. We propose a hybrid approach th...
135
Voted
GIS
2002
ACM
15 years 3 months ago
2002
ACM
Enterprises in the public and private sectors have been making their large spatial data archives available over the Internet. However, interactive work with such large volumes of ...
225
Voted
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
238
click to vote
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...
218
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...