55 search results - page 11 / 11 » Processing Distance Join Queries with Constraints |
ICASSP
2010
IEEE
13 years 6 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
GIS
2008
ACM
14 years 6 months ago
2008
ACM
Trip planning search (TPS) represents an important class of queries in Geographic Information Systems (GIS). In many real-world applications, TPS requests are issued with a number...
VLDB
2004
ACM
13 years 11 months ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
SSD
2005
Springer
13 years 11 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
PODS
2007
ACM
14 years 5 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...