Sciweavers

1937 search results - page 337 / 388
» Conditioning Probabilistic Databases
Sort
View
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
15 years 10 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
PODS
2007
ACM
109views Database» more  PODS 2007»
15 years 10 months ago
What is "next" in event processing?
Event processing systems have wide applications ranging from managing events from RFID readers to monitoring RSS feeds. Consequently, there exists much work on them in the literat...
Walker M. White, Mirek Riedewald, Johannes Gehrke,...
PODS
2008
ACM
178views Database» more  PODS 2008»
15 years 10 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
PODS
2008
ACM
155views Database» more  PODS 2008»
15 years 10 months ago
The recovery of a schema mapping: bringing exchanged data back
A schema mapping is a specification that describes how data from a source schema is to be mapped to a target schema. Once the data has been transferred from the source to the targ...
Marcelo Arenas, Jorge Pérez, Cristian River...
PODS
2008
ACM
152views Database» more  PODS 2008»
15 years 10 months ago
Towards a theory of schema-mapping optimization
A schema mapping is a high-level specification that describes the relationship between two database schemas. As schema mappings constitute the essential building blocks of data ex...
Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Luci...