Sciweavers

513 search results - page 81 / 103
» Cache Conscious Algorithms for Relational Query Processing
Sort
View
CVPR
2008
IEEE
14 years 10 months ago
A quasi-random sampling approach to image retrieval
In this paper, we present a novel approach to contentsbased image retrieval. The method hinges in the use of quasi-random sampling to retrieve those images in a database which are...
Jun Zhou, Antonio Robles-Kelly
DBA
2004
111views Database» more  DBA 2004»
13 years 10 months ago
Effective Decompositioning of Complex Spatial Objects into Intervals
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
AAAI
1996
13 years 9 months ago
A Connectionist Framework for Reasoning: Reasoning with Examples
We present a connectionist architecture that supports almost instantaneous deductive and abductive reasoning. The deduction algorithm responds in few steps for single rule queries...
Dan Roth
SIGMOD
2011
ACM
222views Database» more  SIGMOD 2011»
12 years 11 months ago
Data generation using declarative constraints
We study the problem of generating synthetic databases having declaratively specified characteristics. This problem is motivated by database system and application testing, data ...
Arvind Arasu, Raghav Kaushik, Jian Li
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 8 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis