1038 search results - page 38 / 208 » Space-Bounded Query Approximation |
SSDBM
2010
IEEE
15 years 4 months ago
2010
IEEE
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...
105
click to vote
AAAI
2006
15 years 1 months ago
2006
In this paper, we motivate the need for and challenges involved in supporting imprecise queries over Web databases. Then we briefly explain our solution, AIMQ - a domain independe...
178
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
ICDT
1995
ACM
15 years 3 months ago
1995
ACM
Partial information in databases can arise when information from several databases is combined. Even if each database is complete for some \world", the combined databases wil...
103
click to vote
VLDB
2012
ACM
13 years 7 months ago
2012
ACM
In the last decade, spatio-temporal database research focuses on the design of effective and efficient indexing structures in support of location-based queries such as predictive...