4541 search results - page 813 / 909 » Cache-Oblivious Algorithms and Data Structures |
176
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
147
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
We address the problem of generating a mediated schema from a set of relational data source schemas and conjunctive queries that specify where those schemas overlap. Unlike past a...
169
click to vote
ICDE
2010
IEEE
16 years 6 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 ...
158
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
In this paper we introduce a novel Riemannian framework for shape analysis of parameterized surfaces. We derive a distance function between any two surfaces that is invariant to r...
186
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— Existing stream processing systems are optimized for a specific metric, which may limit their applicability to diverse applications and environments. This paper presents XFlow...