958 search results - page 67 / 192 » Efficient data structures for range-aggregate queries on tre... |
205
click to vote
SIGMOD
2009
ACM
16 years 24 days 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...
111
Voted
IPSN
2009
Springer
15 years 7 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
84
Voted
WEBDB
2005
Springer
15 years 6 months ago
2005
Springer
We present a system for efficient indexed querying of XML documents, enhanced with sibling operations. R-tree index proposed in [5] has a very high cost for the following-sibling...
108
click to vote
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
124
click to vote
ISMB
1994
15 years 1 months ago
1994
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...