1888 search results - page 94 / 378 » Algorithms for Querying by Spatial Structure |
268
click to vote
ICDE
2006
IEEE
16 years 6 months ago
2006
IEEE
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
251
Voted
ICDE
2005
IEEE
16 years 6 months ago
2005
IEEE
Moving objects databases managing spatial objects with continuously changing position and extent over time have recently found large interest in the database community. Queries ab...
160
Voted
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
258
Voted
GIS
2006
ACM
16 years 5 months ago
2006
ACM
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
251
Voted
GIS
2009
ACM
16 years 5 months ago
2009
ACM
The k-anonymity technique is widely used to provide location privacy protection for accessing location-based services (LBS), i.e., the exact location of a query initiator is cloak...