Sciweavers

491 search results - page 4 / 99
» Optimizing Large OODB Queries
Sort
View
CVDB
2005
ACM
13 years 9 months ago
Optimizing progressive query-by-example over pre-clustered large image databases
The typical mode for querying in an image content-based information system is query-by-example, which allows the user to provide an image as a query and to search for similar imag...
Anicet Kouomou Choupo, Laure Berti-Equille, Annie ...
ESWS
2011
Springer
12 years 11 months ago
Optimizing Query Shortcuts in RDF Databases
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
13 years 11 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
ICDE
2012
IEEE
224views Database» more  ICDE 2012»
11 years 10 months ago
Exploiting Common Subexpressions for Cloud Query Processing
—Many companies now routinely run massive data analysis jobs – expressed in some scripting language – on large clusters of low-end servers. Many analysis scripts are complex ...
Yasin N. Silva, Paul-Ake Larson, Jingren Zhou
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 2 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar