Sciweavers

5221 search results - page 182 / 1045
» An On-line Problem Database
Sort
View
ICDE
2010
IEEE
183views Database» more  ICDE 2010»
16 years 1 months ago
Estimating the compression fraction of an index using sampling
—Data compression techniques such as null suppression and dictionary compression are commonly used in today’s database systems. In order to effectively leverage compression, it...
Stratos Idreos, Raghav Kaushik, Vivek R. Narasayya...
172
Voted
KDD
2002
ACM
214views Data Mining» more  KDD 2002»
16 years 6 months ago
Privacy preserving association rule mining in vertically partitioned data
Privacy considerations often constrain data mining projects. This paper addresses the problem of association rule mining where transactions are distributed across sources. Each si...
Jaideep Vaidya, Chris Clifton
IDEAS
2009
IEEE
129views Database» more  IDEAS 2009»
15 years 3 months ago
Speeding-up data-driven applications with program summaries
We consider the class of database programs and address the problem of minimizing the cost of their exchanges with the database server. This cost partly consists of query execution...
Sonia Guehis, Virginie Goasdoué-Thion, Phil...
196
Voted
EDBT
2012
ACM
216views Database» more  EDBT 2012»
13 years 8 months ago
Effectively indexing the multi-dimensional uncertain objects for range searching
The range searching problem is fundamental in a wide spectrum of applications such as radio frequency identification (RFID) networks, location based services (LBS), and global po...
Ying Zhang, Wenjie Zhang, Qianlu Lin, Xuemin Lin
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
16 years 6 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...