1888 search results - page 133 / 378 » Algorithms for Querying by Spatial Structure |
165
click to vote
SIGMOD
1995
ACM
15 years 8 months ago
1995
ACM
Text is a pervasive information type, and many applications require querying over text sources in addition to structured data. This paper studies the problem of query processing i...
204
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...
172
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
120
click to vote
LICS
2000
IEEE
15 years 9 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
150
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...