1888 search results - page 288 / 378 » Algorithms for Querying by Spatial Structure |
VLDB
2004
ACM
14 years 2 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...
CICLING
2004
Springer
14 years 27 days 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...
ESA
2006
Springer
14 years 25 days 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...
SODA
2004
ACM
13 years 10 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...
COLING
1996
13 years 10 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...