Sciweavers

PODS
2009
ACM
134views Database» more  PODS 2009»
16 years 7 months ago
An efficient rigorous approach for identifying statistically significant frequent itemsets
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
Adam Kirsch, Michael Mitzenmacher, Andrea Pietraca...
PODS
2009
ACM
100views Database» more  PODS 2009»
16 years 7 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
PODS
2009
ACM
171views Database» more  PODS 2009»
16 years 7 months ago
XML schema mappings
Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amo...
Shun'ichi Amano, Leonid Libkin, Filip Murlak
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 7 months ago
The finite model theory toolbox of a database theoretician
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...
Leonid Libkin
PODS
2009
ACM
86views Database» more  PODS 2009»
16 years 7 months ago
Reverse data exchange: coping with nulls
An inverse of a schema mapping M is intended to "undo" what M does, thus providing a way to perform "reverse" data exchange. In recent years, three different f...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
PODS
2009
ACM
110views Database» more  PODS 2009»
16 years 7 months ago
Optimal tracking of distributed heavy hitters and quantiles
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
Ke Yi, Qin Zhang
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 7 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
KDD
2009
ACM
183views Data Mining» more  KDD 2009»
16 years 7 months ago
OLAP on search logs: an infrastructure supporting data-driven applications in search engines
Search logs, which contain rich and up-to-date information about users' needs and preferences, have become a critical data source for search engines. Recently, more and more ...
Bin Zhou 0002, Daxin Jiang, Jian Pei, Hang Li
KDD
2009
ACM
132views Data Mining» more  KDD 2009»
16 years 7 months ago
Learning patterns in the dynamics of biological networks
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
Chang Hun You, Lawrence B. Holder, Diane J. Cook