371 search results - page 18 / 75 » On Two-Dimensional Indexability and Optimal Range Search Ind... |
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
101
Voted
SIGIR
2011
ACM
14 years 13 days 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...
64
Voted
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
We examine issues in the design of fully dynamic information retrieval systems with support for instantaneous document insertions and deletions. We present one such system and dis...
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
In dynamic environments with frequent content updates, we require online full-text search that scales to large data collections and achieves low search latency. Several recent met...