301 search results - page 6 / 61 » Efficient Sketches for the Set Query Problem |
103
Voted
EDBT
2009
ACM
15 years 2 months ago
2009
ACM
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
86
Voted
COMPGEOM
2001
ACM
15 years 2 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
201
click to vote
ICDE
2009
IEEE
16 years 17 days ago
2009
IEEE
In many applications, we need to analyze a large number of time series. Segments of time series demonstrating dominating advantages over others are often of particular interest. In...
108
Voted
SSDBM
2005
IEEE
15 years 4 months ago
2005
IEEE
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new re...
AAAI
2006
15 years 7 days ago
2006
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...