154 search results - page 4 / 31 » Space efficient dynamic stabbing with fast queries |
145
Voted
COCOON
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
213
click to vote
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
117
Voted
ISBI
2004
IEEE
16 years 2 months ago
2004
IEEE
A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the number of region concavities. The result is a significant...
127
Voted
BTW
2007
Springer
15 years 5 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
132
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...