1042 search results - page 133 / 209 » Constraint Databases, Data Structures and Efficient Query Ev... |
KDD
2001
ACM
14 years 10 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
SIGMOD
2003
ACM
14 years 10 months ago
2003
ACM
In this paper, we study whether the need for efficient XML publishing brings any new requirements for relational query engines, or if sorting query results in the relational engin...
DOLAP
2005
ACM
14 years 6 days ago
2005
ACM
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
ALGORITHMICA
2002
13 years 10 months ago
2002
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
VLDB
2002
ACM
14 years 10 months ago
2002
ACM
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...