112 search results - page 10 / 23 » Succinct Data Structures for Retrieval and Approximate Membe... |
EDBT
2009
ACM
15 years 6 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
116
click to vote
SIGIR
2011
ACM
14 years 2 months ago
2011
ACM
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
Structured P2P overlays supporting standard database functionalities are a popular choice for building large-scale distributed data management systems. In such systems, estimating...
130
click to vote
MMM
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
171
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
In this demonstration, we present a prototype content-based dissemination broker, called Sonnet, which is built upon structured overlay network. It combines approximate filtering ...