Sciweavers

2114 search results - page 263 / 423
» Performance Evaluation on a Real-Time Database
Sort
View
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
15 years 9 months 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
VLDB
2004
ACM
173views Database» more  VLDB 2004»
15 years 9 months ago
Enhancing P2P File-Sharing with an Internet-Scale Query Processor
In this paper, we address the problem of designing a scalable, accurate query processor for peerto-peer filesharing and similar distributed keyword search systems. Using a global...
Boon Thau Loo, Joseph M. Hellerstein, Ryan Huebsch...
SSDBM
2003
IEEE
142views Database» more  SSDBM 2003»
15 years 9 months ago
A Strategy Selection Framework for Adaptive Prefetching in Data Visualization
Accessing data stored in persistent memory represents a bottleneck for current visual exploration applications. Semantic caching of frequent queries at the client-side along with ...
Punit R. Doshi, Geraldine E. Rosario, Elke A. Rund...
VLDB
1989
ACM
140views Database» more  VLDB 1989»
15 years 8 months ago
The Effect of Bucket Size Tuning in the Dynamic Hybrid GRACE Hash Join Method
In this paper, we show detailed analysis and performance evaluation of the Dynamic Hybrid GRACE Hash Join Method (DHGH Method) when the tuple distribution in buckets is unbalanced...
Masaru Kitsuregawa, Masaya Nakayama, Mikio Takagi
VLDB
1997
ACM
170views Database» more  VLDB 1997»
15 years 8 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula