184 search results - page 16 / 37 » Cache-oblivious data structures for orthogonal range searchi... |
ISCA
2008
IEEE
14 years 11 months ago
2008
IEEE
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
101
click to vote
FOCS
1992
IEEE
15 years 3 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
203
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
207
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
ICDE
2010
IEEE
15 years 11 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 ...