Sciweavers

1091 search results - page 25 / 219
» Approximation in Databases
Sort
View
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
14 years 3 months ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes
SIGMOD
2002
ACM
118views Database» more  SIGMOD 2002»
14 years 8 months ago
Compressing SQL workloads
Recently several important relational database tasks such as index selection, histogram tuning, approximate query processing, and statistics selection have recognized the importan...
Surajit Chaudhuri, Ashish Kumar Gupta, Vivek R. Na...
DEXA
2008
Springer
154views Database» more  DEXA 2008»
13 years 10 months ago
Approximate Range-Sum Queries over Data Cubes Using Cosine Transform
In this research, we propose to use the discrete cosine transform to approximate the cumulative distributions of data cube cells' values. The cosine transform is known to have...
Wen-Chi Hou, Cheng Luo, Zhewei Jiang, Feng Yan, Qi...
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
ICDE
2004
IEEE
102views Database» more  ICDE 2004»
14 years 9 months ago
Approximate Temporal Aggregation
Temporal aggregate queries retrieve summarized information about records with time-evolving attributes. Existing approaches have at least one of the following shortcomings: (i) th...
Yufei Tao, Dimitris Papadias, Christos Faloutsos