1888 search results - page 288 / 378 » Algorithms for Querying by Spatial Structure |
116
Voted
VLDB
2004
ACM
15 years 8 months ago
2004
ACM
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
112
Voted
CICLING
2004
Springer
15 years 7 months ago
2004
Springer
Abstract: In this paper we describe a flexible, portable and languageindependent infrastructure for setting up large monolingual language corpora. The approach is based on collecti...
122
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
110
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
107
Voted
COLING
1996
15 years 4 months ago
1996
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...