Sciweavers

287 search results - page 9 / 58
» Optimization Techniques for Queries with Expensive Methods
Sort
View
SIGMOD
2010
ACM
364views Database» more  SIGMOD 2010»
14 years 6 days ago
Optimizing schema-last tuple-store queries in graphd
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...
Scott M. Meyer, Jutta Degener, John Giannandrea, B...
DOLAP
2006
ACM
14 years 1 months ago
A study on workload-aware wavelet synopses for point and range-sum queries
In this paper we perform an extensive theoretical and experimental study on common synopsis construction algorithms, with emphasis on wavelet based techniques, that take under con...
Michael Mathioudakis, Dimitris Sacharidis, Timos K...
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
14 years 4 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
14 years 7 months ago
B-tree indexes for high update rates
ct In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering usi...
Goetz Graefe
ICDE
2008
IEEE
175views Database» more  ICDE 2008»
14 years 8 months ago
Continuous Intersection Joins Over Moving Objects
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
Rui Zhang 0003, Dan Lin, Kotagiri Ramamohanarao, E...