Sciweavers

PODS
2005
ACM
211views Database» more  PODS 2005»
14 years 11 months ago
Join-distinct aggregate estimation over update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, R...
PODS
2005
ACM
147views Database» more  PODS 2005»
14 years 11 months ago
Peer data exchange
Abstract. We present a semantics and answer set programs for relational peer data exchange systems. When a peer answers a query, it exchanges data with other peers in order to supp...
Ariel Fuxman, Phokion G. Kolaitis, Renée J....
PODS
2005
ACM
86views Database» more  PODS 2005»
14 years 11 months ago
Multi-structural databases
We introduce the Multi-Structural Database, a new data framework to support efficient analysis of large, complex data sets. An instance of the model consists of a set of data obje...
Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasm...
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 11 months ago
Histograms revisited: when are histograms the best approximation method for aggregates over joins?
The traditional statistical assumption for interpreting histograms and justifying approximate query processing methods based on them is that all elements in a bucket have the same...
Alin Dobra
PODS
2005
ACM
104views Database» more  PODS 2005»
14 years 11 months ago
Determining source contribution in integration systems
Owners of sources registered in an information integration system, which provides answers to a (potentially evolving) set of client queries, need to know their contribution to the...
Alin Deutsch, Yannis Katsis, Yannis Papakonstantin...
PODS
2005
ACM
131views Database» more  PODS 2005»
14 years 11 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 11 months ago
A divide-and-merge methodology for clustering
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...
PODS
2005
ACM
109views Database» more  PODS 2005»
14 years 11 months ago
XPath satisfiability in the presence of DTDs
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
Michael Benedikt, Wenfei Fan, Floris Geerts
PODS
2005
ACM
151views Database» more  PODS 2005»
14 years 11 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...