1042 search results - page 19 / 209 » Constraint Databases, Data Structures and Efficient Query Ev... |
WAIM
2004
Springer
14 years 1 months ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
We study the problem of continuous relational query processing in Internet-scale overlay networks realized by distributed hash tables. We concentrate on the case of continuous two...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
ICDT
2007
ACM
14 years 1 months ago
2007
ACM
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...