958 search results - page 144 / 192 » Efficient data structures for range-aggregate queries on tre... |
161
click to vote
CCS
2008
ACM
15 years 6 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
167
click to vote
CCGRID
2009
IEEE
15 years 8 months ago
2009
IEEE
From personal software to advanced systems, caching mechanisms have steadfastly been a ubiquitous means for reducing workloads. It is no surprise, then, that under the grid and clu...
153
click to vote
HPDC
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper we present the Brown Dwarf, a distributed system designed to efficiently store, query and update multidimensional data over an unstructured Peer-to-Peer overlay, wit...
238
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
357
click to vote
ICDE
2000
IEEE
16 years 5 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...