Sciweavers

3225 search results - page 275 / 645
» Query Optimization by Stored Queries
Sort
View
SSD
2007
Springer
243views Database» more  SSD 2007»
16 years 24 days ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
VLDB
2001
ACM
82views Database» more  VLDB 2001»
15 years 11 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
ICDE
1999
IEEE
151views Database» more  ICDE 1999»
16 years 8 months ago
Data Integration by Describing Sources with Constraint Databases
We develop a data integration approach for the efficient evaluation of queries over autonomous source databases. The approach is based on some novel applications and extensions of...
Xun Cheng, Guozhu Dong, Tzekwan Lau, Jianwen Su
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
16 years 1 days ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
IDEAS
2003
IEEE
106views Database» more  IDEAS 2003»
15 years 12 months ago
Frequent Itemsets Mining for Database Auto-Administration
With the wide development of databases in general and data warehouses in particular, it is important to reduce the tasks that a database administrator must perform manually. The a...
Kamel Aouiche, Jérôme Darmont, Le Gru...